let X be Extension of SCI-arity ; :: thesis: for L being Polish-ext-set of X
for D being SCI-axioms b1 -extending Subset of L
for t, u, v, w being Formula of L st t '==' u is D -provable & v '==' w is D -provable holds
( (t '&' v) '==' (u '&' w) is D -provable & (t '&' v) '->' (u '&' w) is D -provable & ( t '&' v is D -provable implies u '&' w is D -provable ) & (t 'or' v) '==' (u 'or' w) is D -provable & (t 'or' v) '->' (u 'or' w) is D -provable & ( t 'or' v is D -provable implies u 'or' w is D -provable ) & (t '->' v) '==' (u '->' w) is D -provable & (t '->' v) '->' (u '->' w) is D -provable & ( t '->' v is D -provable implies u '->' w is D -provable ) & (t '<->' v) '==' (u '<->' w) is D -provable & (t '<->' v) '->' (u '<->' w) is D -provable & ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )

let L be Polish-ext-set of X; :: thesis: for D being SCI-axioms L -extending Subset of L
for t, u, v, w being Formula of L st t '==' u is D -provable & v '==' w is D -provable holds
( (t '&' v) '==' (u '&' w) is D -provable & (t '&' v) '->' (u '&' w) is D -provable & ( t '&' v is D -provable implies u '&' w is D -provable ) & (t 'or' v) '==' (u 'or' w) is D -provable & (t 'or' v) '->' (u 'or' w) is D -provable & ( t 'or' v is D -provable implies u 'or' w is D -provable ) & (t '->' v) '==' (u '->' w) is D -provable & (t '->' v) '->' (u '->' w) is D -provable & ( t '->' v is D -provable implies u '->' w is D -provable ) & (t '<->' v) '==' (u '<->' w) is D -provable & (t '<->' v) '->' (u '<->' w) is D -provable & ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )

let D be SCI-axioms L -extending Subset of L; :: thesis: for t, u, v, w being Formula of L st t '==' u is D -provable & v '==' w is D -provable holds
( (t '&' v) '==' (u '&' w) is D -provable & (t '&' v) '->' (u '&' w) is D -provable & ( t '&' v is D -provable implies u '&' w is D -provable ) & (t 'or' v) '==' (u 'or' w) is D -provable & (t 'or' v) '->' (u 'or' w) is D -provable & ( t 'or' v is D -provable implies u 'or' w is D -provable ) & (t '->' v) '==' (u '->' w) is D -provable & (t '->' v) '->' (u '->' w) is D -provable & ( t '->' v is D -provable implies u '->' w is D -provable ) & (t '<->' v) '==' (u '<->' w) is D -provable & (t '<->' v) '->' (u '<->' w) is D -provable & ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )

let t, u, v, w be Formula of L; :: thesis: ( t '==' u is D -provable & v '==' w is D -provable implies ( (t '&' v) '==' (u '&' w) is D -provable & (t '&' v) '->' (u '&' w) is D -provable & ( t '&' v is D -provable implies u '&' w is D -provable ) & (t 'or' v) '==' (u 'or' w) is D -provable & (t 'or' v) '->' (u 'or' w) is D -provable & ( t 'or' v is D -provable implies u 'or' w is D -provable ) & (t '->' v) '==' (u '->' w) is D -provable & (t '->' v) '->' (u '->' w) is D -provable & ( t '->' v is D -provable implies u '->' w is D -provable ) & (t '<->' v) '==' (u '<->' w) is D -provable & (t '<->' v) '->' (u '<->' w) is D -provable & ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) ) )
set F = (t '==' u) '&' (v '==' w);
assume A1: ( t '==' u is D -provable & v '==' w is D -provable ) ; :: thesis: ( (t '&' v) '==' (u '&' w) is D -provable & (t '&' v) '->' (u '&' w) is D -provable & ( t '&' v is D -provable implies u '&' w is D -provable ) & (t 'or' v) '==' (u 'or' w) is D -provable & (t 'or' v) '->' (u 'or' w) is D -provable & ( t 'or' v is D -provable implies u 'or' w is D -provable ) & (t '->' v) '==' (u '->' w) is D -provable & (t '->' v) '->' (u '->' w) is D -provable & ( t '->' v is D -provable implies u '->' w is D -provable ) & (t '<->' v) '==' (u '<->' w) is D -provable & (t '<->' v) '->' (u '<->' w) is D -provable & ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
((t '==' u) '&' (v '==' w)) '->' ((t '&' v) '==' (u '&' w)) in SCI-id-axioms L by Def10i;
then ((t '==' u) '&' (v '==' w)) '->' ((t '&' v) '==' (u '&' w)) is D -provable ;
hence A2: (t '&' v) '==' (u '&' w) is D -provable by A1, Th20; :: thesis: ( (t '&' v) '->' (u '&' w) is D -provable & ( t '&' v is D -provable implies u '&' w is D -provable ) & (t 'or' v) '==' (u 'or' w) is D -provable & (t 'or' v) '->' (u 'or' w) is D -provable & ( t 'or' v is D -provable implies u 'or' w is D -provable ) & (t '->' v) '==' (u '->' w) is D -provable & (t '->' v) '->' (u '->' w) is D -provable & ( t '->' v is D -provable implies u '->' w is D -provable ) & (t '<->' v) '==' (u '<->' w) is D -provable & (t '<->' v) '->' (u '<->' w) is D -provable & ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
hence (t '&' v) '->' (u '&' w) is D -provable by Th60; :: thesis: ( ( t '&' v is D -provable implies u '&' w is D -provable ) & (t 'or' v) '==' (u 'or' w) is D -provable & (t 'or' v) '->' (u 'or' w) is D -provable & ( t 'or' v is D -provable implies u 'or' w is D -provable ) & (t '->' v) '==' (u '->' w) is D -provable & (t '->' v) '->' (u '->' w) is D -provable & ( t '->' v is D -provable implies u '->' w is D -provable ) & (t '<->' v) '==' (u '<->' w) is D -provable & (t '<->' v) '->' (u '<->' w) is D -provable & ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
hence ( t '&' v is D -provable implies u '&' w is D -provable ) by Th20; :: thesis: ( (t 'or' v) '==' (u 'or' w) is D -provable & (t 'or' v) '->' (u 'or' w) is D -provable & ( t 'or' v is D -provable implies u 'or' w is D -provable ) & (t '->' v) '==' (u '->' w) is D -provable & (t '->' v) '->' (u '->' w) is D -provable & ( t '->' v is D -provable implies u '->' w is D -provable ) & (t '<->' v) '==' (u '<->' w) is D -provable & (t '<->' v) '->' (u '<->' w) is D -provable & ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
((t '==' u) '&' (v '==' w)) '->' ((t 'or' v) '==' (u 'or' w)) in SCI-id-axioms L by Def10i;
then ((t '==' u) '&' (v '==' w)) '->' ((t 'or' v) '==' (u 'or' w)) is D -provable ;
hence (t 'or' v) '==' (u 'or' w) is D -provable by A1, Th20; :: thesis: ( (t 'or' v) '->' (u 'or' w) is D -provable & ( t 'or' v is D -provable implies u 'or' w is D -provable ) & (t '->' v) '==' (u '->' w) is D -provable & (t '->' v) '->' (u '->' w) is D -provable & ( t '->' v is D -provable implies u '->' w is D -provable ) & (t '<->' v) '==' (u '<->' w) is D -provable & (t '<->' v) '->' (u '<->' w) is D -provable & ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
hence (t 'or' v) '->' (u 'or' w) is D -provable by Th60; :: thesis: ( ( t 'or' v is D -provable implies u 'or' w is D -provable ) & (t '->' v) '==' (u '->' w) is D -provable & (t '->' v) '->' (u '->' w) is D -provable & ( t '->' v is D -provable implies u '->' w is D -provable ) & (t '<->' v) '==' (u '<->' w) is D -provable & (t '<->' v) '->' (u '<->' w) is D -provable & ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
hence ( t 'or' v is D -provable implies u 'or' w is D -provable ) by Th20; :: thesis: ( (t '->' v) '==' (u '->' w) is D -provable & (t '->' v) '->' (u '->' w) is D -provable & ( t '->' v is D -provable implies u '->' w is D -provable ) & (t '<->' v) '==' (u '<->' w) is D -provable & (t '<->' v) '->' (u '<->' w) is D -provable & ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
((t '==' u) '&' (v '==' w)) '->' ((t '->' v) '==' (u '->' w)) in SCI-id-axioms L by Def10i;
then ((t '==' u) '&' (v '==' w)) '->' ((t '->' v) '==' (u '->' w)) is D -provable ;
hence (t '->' v) '==' (u '->' w) is D -provable by A1, Th20; :: thesis: ( (t '->' v) '->' (u '->' w) is D -provable & ( t '->' v is D -provable implies u '->' w is D -provable ) & (t '<->' v) '==' (u '<->' w) is D -provable & (t '<->' v) '->' (u '<->' w) is D -provable & ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
hence (t '->' v) '->' (u '->' w) is D -provable by Th60; :: thesis: ( ( t '->' v is D -provable implies u '->' w is D -provable ) & (t '<->' v) '==' (u '<->' w) is D -provable & (t '<->' v) '->' (u '<->' w) is D -provable & ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
hence ( t '->' v is D -provable implies u '->' w is D -provable ) by Th20; :: thesis: ( (t '<->' v) '==' (u '<->' w) is D -provable & (t '<->' v) '->' (u '<->' w) is D -provable & ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
((t '==' u) '&' (v '==' w)) '->' ((t '<->' v) '==' (u '<->' w)) in SCI-id-axioms L by Def10i;
then ((t '==' u) '&' (v '==' w)) '->' ((t '<->' v) '==' (u '<->' w)) is D -provable ;
hence (t '<->' v) '==' (u '<->' w) is D -provable by A1, Th20; :: thesis: ( (t '<->' v) '->' (u '<->' w) is D -provable & ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
hence (t '<->' v) '->' (u '<->' w) is D -provable by Th60; :: thesis: ( ( t '<->' v is D -provable implies u '<->' w is D -provable ) & (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
hence ( t '<->' v is D -provable implies u '<->' w is D -provable ) by Th20; :: thesis: ( (t '==' v) '==' (u '==' w) is D -provable & (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
((t '==' u) '&' (v '==' w)) '->' ((t '==' v) '==' (u '==' w)) in SCI-id-axioms L by Def10i;
then ((t '==' u) '&' (v '==' w)) '->' ((t '==' v) '==' (u '==' w)) is D -provable ;
hence (t '==' v) '==' (u '==' w) is D -provable by A1, Th20; :: thesis: ( (t '==' v) '->' (u '==' w) is D -provable & ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
hence (t '==' v) '->' (u '==' w) is D -provable by Th60; :: thesis: ( ( t '==' v is D -provable implies u '==' w is D -provable ) & (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
hence ( t '==' v is D -provable implies u '==' w is D -provable ) by Th20; :: thesis: ( (t => v) '==' (u => w) is D -provable & (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
set G = (t '==' u) '&' ((t '&' v) '==' (u '&' w));
((t '==' u) '&' ((t '&' v) '==' (u '&' w))) '->' ((t => v) '==' (u => w)) in SCI-id-axioms L by Def10i;
then ((t '==' u) '&' ((t '&' v) '==' (u '&' w))) '->' ((t => v) '==' (u => w)) is D -provable ;
hence (t => v) '==' (u => w) is D -provable by A1, A2, Th20; :: thesis: ( (t => v) '->' (u => w) is D -provable & ( t => v is D -provable implies u => w is D -provable ) )
hence (t => v) '->' (u => w) is D -provable by Th60; :: thesis: ( t => v is D -provable implies u => w is D -provable )
hence ( t => v is D -provable implies u => w is D -provable ) by Th20; :: thesis: verum