let X be Extension of SCI-arity ; for L being Polish-ext-set of X
for D being SCI-axioms b1 -extending Subset of L
for t, u, v being Formula of L holds
( (t '==' u) '->' ((t '&' v) '==' (u '&' v)) is D -provable & (t '==' u) '->' ((v '&' t) '==' (v '&' u)) is D -provable & (t '==' u) '->' ((t 'or' v) '==' (u 'or' v)) is D -provable & (t '==' u) '->' ((v 'or' t) '==' (v 'or' u)) is D -provable & (t '==' u) '->' ((t '->' v) '==' (u '->' v)) is D -provable & (t '==' u) '->' ((v '->' t) '==' (v '->' u)) is D -provable & (t '==' u) '->' ((t '<->' v) '==' (u '<->' v)) is D -provable & (t '==' u) '->' ((v '<->' t) '==' (v '<->' u)) is D -provable & (t '==' u) '->' ((t '==' v) '==' (u '==' v)) is D -provable & (t '==' u) '->' ((v '==' t) '==' (v '==' u)) is D -provable & (t '==' u) '->' ((t => v) '==' (u => v)) is D -provable & (t '==' u) '->' ((v => t) '==' (v => u)) is D -provable )
let L be Polish-ext-set of X; for D being SCI-axioms L -extending Subset of L
for t, u, v being Formula of L holds
( (t '==' u) '->' ((t '&' v) '==' (u '&' v)) is D -provable & (t '==' u) '->' ((v '&' t) '==' (v '&' u)) is D -provable & (t '==' u) '->' ((t 'or' v) '==' (u 'or' v)) is D -provable & (t '==' u) '->' ((v 'or' t) '==' (v 'or' u)) is D -provable & (t '==' u) '->' ((t '->' v) '==' (u '->' v)) is D -provable & (t '==' u) '->' ((v '->' t) '==' (v '->' u)) is D -provable & (t '==' u) '->' ((t '<->' v) '==' (u '<->' v)) is D -provable & (t '==' u) '->' ((v '<->' t) '==' (v '<->' u)) is D -provable & (t '==' u) '->' ((t '==' v) '==' (u '==' v)) is D -provable & (t '==' u) '->' ((v '==' t) '==' (v '==' u)) is D -provable & (t '==' u) '->' ((t => v) '==' (u => v)) is D -provable & (t '==' u) '->' ((v => t) '==' (v => u)) is D -provable )
let D be SCI-axioms L -extending Subset of L; for t, u, v being Formula of L holds
( (t '==' u) '->' ((t '&' v) '==' (u '&' v)) is D -provable & (t '==' u) '->' ((v '&' t) '==' (v '&' u)) is D -provable & (t '==' u) '->' ((t 'or' v) '==' (u 'or' v)) is D -provable & (t '==' u) '->' ((v 'or' t) '==' (v 'or' u)) is D -provable & (t '==' u) '->' ((t '->' v) '==' (u '->' v)) is D -provable & (t '==' u) '->' ((v '->' t) '==' (v '->' u)) is D -provable & (t '==' u) '->' ((t '<->' v) '==' (u '<->' v)) is D -provable & (t '==' u) '->' ((v '<->' t) '==' (v '<->' u)) is D -provable & (t '==' u) '->' ((t '==' v) '==' (u '==' v)) is D -provable & (t '==' u) '->' ((v '==' t) '==' (v '==' u)) is D -provable & (t '==' u) '->' ((t => v) '==' (u => v)) is D -provable & (t '==' u) '->' ((v => t) '==' (v => u)) is D -provable )
let t, u, v be Formula of L; ( (t '==' u) '->' ((t '&' v) '==' (u '&' v)) is D -provable & (t '==' u) '->' ((v '&' t) '==' (v '&' u)) is D -provable & (t '==' u) '->' ((t 'or' v) '==' (u 'or' v)) is D -provable & (t '==' u) '->' ((v 'or' t) '==' (v 'or' u)) is D -provable & (t '==' u) '->' ((t '->' v) '==' (u '->' v)) is D -provable & (t '==' u) '->' ((v '->' t) '==' (v '->' u)) is D -provable & (t '==' u) '->' ((t '<->' v) '==' (u '<->' v)) is D -provable & (t '==' u) '->' ((v '<->' t) '==' (v '<->' u)) is D -provable & (t '==' u) '->' ((t '==' v) '==' (u '==' v)) is D -provable & (t '==' u) '->' ((v '==' t) '==' (v '==' u)) is D -provable & (t '==' u) '->' ((t => v) '==' (u => v)) is D -provable & (t '==' u) '->' ((v => t) '==' (v => u)) is D -provable )
set U = t '==' u;
set V = v '==' v;
v '==' v is D -provable
;
then A1:
( (t '==' u) '->' ((t '==' u) '&' (v '==' v)) is D -provable & (t '==' u) '->' ((v '==' v) '&' (t '==' u)) is D -provable )
;
((t '==' u) '&' (v '==' v)) '->' ((t '&' v) '==' (u '&' v)) in SCI-id-axioms L
by Def10i;
then
((t '==' u) '&' (v '==' v)) '->' ((t '&' v) '==' (u '&' v)) is D -provable
;
hence A2:
(t '==' u) '->' ((t '&' v) '==' (u '&' v)) is D -provable
by A1, Th21; ( (t '==' u) '->' ((v '&' t) '==' (v '&' u)) is D -provable & (t '==' u) '->' ((t 'or' v) '==' (u 'or' v)) is D -provable & (t '==' u) '->' ((v 'or' t) '==' (v 'or' u)) is D -provable & (t '==' u) '->' ((t '->' v) '==' (u '->' v)) is D -provable & (t '==' u) '->' ((v '->' t) '==' (v '->' u)) is D -provable & (t '==' u) '->' ((t '<->' v) '==' (u '<->' v)) is D -provable & (t '==' u) '->' ((v '<->' t) '==' (v '<->' u)) is D -provable & (t '==' u) '->' ((t '==' v) '==' (u '==' v)) is D -provable & (t '==' u) '->' ((v '==' t) '==' (v '==' u)) is D -provable & (t '==' u) '->' ((t => v) '==' (u => v)) is D -provable & (t '==' u) '->' ((v => t) '==' (v => u)) is D -provable )
((v '==' v) '&' (t '==' u)) '->' ((v '&' t) '==' (v '&' u)) in SCI-id-axioms L
by Def10i;
then
((v '==' v) '&' (t '==' u)) '->' ((v '&' t) '==' (v '&' u)) is D -provable
;
hence A3:
(t '==' u) '->' ((v '&' t) '==' (v '&' u)) is D -provable
by A1, Th21; ( (t '==' u) '->' ((t 'or' v) '==' (u 'or' v)) is D -provable & (t '==' u) '->' ((v 'or' t) '==' (v 'or' u)) is D -provable & (t '==' u) '->' ((t '->' v) '==' (u '->' v)) is D -provable & (t '==' u) '->' ((v '->' t) '==' (v '->' u)) is D -provable & (t '==' u) '->' ((t '<->' v) '==' (u '<->' v)) is D -provable & (t '==' u) '->' ((v '<->' t) '==' (v '<->' u)) is D -provable & (t '==' u) '->' ((t '==' v) '==' (u '==' v)) is D -provable & (t '==' u) '->' ((v '==' t) '==' (v '==' u)) is D -provable & (t '==' u) '->' ((t => v) '==' (u => v)) is D -provable & (t '==' u) '->' ((v => t) '==' (v => u)) is D -provable )
((t '==' u) '&' (v '==' v)) '->' ((t 'or' v) '==' (u 'or' v)) in SCI-id-axioms L
by Def10i;
then
((t '==' u) '&' (v '==' v)) '->' ((t 'or' v) '==' (u 'or' v)) is D -provable
;
hence
(t '==' u) '->' ((t 'or' v) '==' (u 'or' v)) is D -provable
by A1, Th21; ( (t '==' u) '->' ((v 'or' t) '==' (v 'or' u)) is D -provable & (t '==' u) '->' ((t '->' v) '==' (u '->' v)) is D -provable & (t '==' u) '->' ((v '->' t) '==' (v '->' u)) is D -provable & (t '==' u) '->' ((t '<->' v) '==' (u '<->' v)) is D -provable & (t '==' u) '->' ((v '<->' t) '==' (v '<->' u)) is D -provable & (t '==' u) '->' ((t '==' v) '==' (u '==' v)) is D -provable & (t '==' u) '->' ((v '==' t) '==' (v '==' u)) is D -provable & (t '==' u) '->' ((t => v) '==' (u => v)) is D -provable & (t '==' u) '->' ((v => t) '==' (v => u)) is D -provable )
((v '==' v) '&' (t '==' u)) '->' ((v 'or' t) '==' (v 'or' u)) in SCI-id-axioms L
by Def10i;
then
((v '==' v) '&' (t '==' u)) '->' ((v 'or' t) '==' (v 'or' u)) is D -provable
;
hence
(t '==' u) '->' ((v 'or' t) '==' (v 'or' u)) is D -provable
by A1, Th21; ( (t '==' u) '->' ((t '->' v) '==' (u '->' v)) is D -provable & (t '==' u) '->' ((v '->' t) '==' (v '->' u)) is D -provable & (t '==' u) '->' ((t '<->' v) '==' (u '<->' v)) is D -provable & (t '==' u) '->' ((v '<->' t) '==' (v '<->' u)) is D -provable & (t '==' u) '->' ((t '==' v) '==' (u '==' v)) is D -provable & (t '==' u) '->' ((v '==' t) '==' (v '==' u)) is D -provable & (t '==' u) '->' ((t => v) '==' (u => v)) is D -provable & (t '==' u) '->' ((v => t) '==' (v => u)) is D -provable )
((t '==' u) '&' (v '==' v)) '->' ((t '->' v) '==' (u '->' v)) in SCI-id-axioms L
by Def10i;
then
((t '==' u) '&' (v '==' v)) '->' ((t '->' v) '==' (u '->' v)) is D -provable
;
hence
(t '==' u) '->' ((t '->' v) '==' (u '->' v)) is D -provable
by A1, Th21; ( (t '==' u) '->' ((v '->' t) '==' (v '->' u)) is D -provable & (t '==' u) '->' ((t '<->' v) '==' (u '<->' v)) is D -provable & (t '==' u) '->' ((v '<->' t) '==' (v '<->' u)) is D -provable & (t '==' u) '->' ((t '==' v) '==' (u '==' v)) is D -provable & (t '==' u) '->' ((v '==' t) '==' (v '==' u)) is D -provable & (t '==' u) '->' ((t => v) '==' (u => v)) is D -provable & (t '==' u) '->' ((v => t) '==' (v => u)) is D -provable )
((v '==' v) '&' (t '==' u)) '->' ((v '->' t) '==' (v '->' u)) in SCI-id-axioms L
by Def10i;
then
((v '==' v) '&' (t '==' u)) '->' ((v '->' t) '==' (v '->' u)) is D -provable
;
hence
(t '==' u) '->' ((v '->' t) '==' (v '->' u)) is D -provable
by A1, Th21; ( (t '==' u) '->' ((t '<->' v) '==' (u '<->' v)) is D -provable & (t '==' u) '->' ((v '<->' t) '==' (v '<->' u)) is D -provable & (t '==' u) '->' ((t '==' v) '==' (u '==' v)) is D -provable & (t '==' u) '->' ((v '==' t) '==' (v '==' u)) is D -provable & (t '==' u) '->' ((t => v) '==' (u => v)) is D -provable & (t '==' u) '->' ((v => t) '==' (v => u)) is D -provable )
((t '==' u) '&' (v '==' v)) '->' ((t '<->' v) '==' (u '<->' v)) in SCI-id-axioms L
by Def10i;
then
((t '==' u) '&' (v '==' v)) '->' ((t '<->' v) '==' (u '<->' v)) is D -provable
;
hence
(t '==' u) '->' ((t '<->' v) '==' (u '<->' v)) is D -provable
by A1, Th21; ( (t '==' u) '->' ((v '<->' t) '==' (v '<->' u)) is D -provable & (t '==' u) '->' ((t '==' v) '==' (u '==' v)) is D -provable & (t '==' u) '->' ((v '==' t) '==' (v '==' u)) is D -provable & (t '==' u) '->' ((t => v) '==' (u => v)) is D -provable & (t '==' u) '->' ((v => t) '==' (v => u)) is D -provable )
((v '==' v) '&' (t '==' u)) '->' ((v '<->' t) '==' (v '<->' u)) in SCI-id-axioms L
by Def10i;
then
((v '==' v) '&' (t '==' u)) '->' ((v '<->' t) '==' (v '<->' u)) is D -provable
;
hence
(t '==' u) '->' ((v '<->' t) '==' (v '<->' u)) is D -provable
by A1, Th21; ( (t '==' u) '->' ((t '==' v) '==' (u '==' v)) is D -provable & (t '==' u) '->' ((v '==' t) '==' (v '==' u)) is D -provable & (t '==' u) '->' ((t => v) '==' (u => v)) is D -provable & (t '==' u) '->' ((v => t) '==' (v => u)) is D -provable )
((t '==' u) '&' (v '==' v)) '->' ((t '==' v) '==' (u '==' v)) in SCI-id-axioms L
by Def10i;
then
((t '==' u) '&' (v '==' v)) '->' ((t '==' v) '==' (u '==' v)) is D -provable
;
hence
(t '==' u) '->' ((t '==' v) '==' (u '==' v)) is D -provable
by A1, Th21; ( (t '==' u) '->' ((v '==' t) '==' (v '==' u)) is D -provable & (t '==' u) '->' ((t => v) '==' (u => v)) is D -provable & (t '==' u) '->' ((v => t) '==' (v => u)) is D -provable )
((v '==' v) '&' (t '==' u)) '->' ((v '==' t) '==' (v '==' u)) in SCI-id-axioms L
by Def10i;
then
((v '==' v) '&' (t '==' u)) '->' ((v '==' t) '==' (v '==' u)) is D -provable
;
hence
(t '==' u) '->' ((v '==' t) '==' (v '==' u)) is D -provable
by A1, Th21; ( (t '==' u) '->' ((t => v) '==' (u => v)) is D -provable & (t '==' u) '->' ((v => t) '==' (v => u)) is D -provable )
set F = (t '&' v) '==' (u '&' v);
(t '==' u) '->' (t '==' u) is D -provable
;
then A11:
(t '==' u) '->' ((t '==' u) '&' ((t '&' v) '==' (u '&' v))) is D -provable
by A2, Th44;
((t '==' u) '&' ((t '&' v) '==' (u '&' v))) '->' ((t => v) '==' (u => v)) in SCI-id-axioms L
by Def10i;
then
((t '==' u) '&' ((t '&' v) '==' (u '&' v))) '->' ((t => v) '==' (u => v)) is D -provable
;
hence
(t '==' u) '->' ((t => v) '==' (u => v)) is D -provable
by A11, Th21; (t '==' u) '->' ((v => t) '==' (v => u)) is D -provable
set G = (v '&' t) '==' (v '&' u);
(t '==' u) '->' (v '==' v) is D -provable
;
then A12:
(t '==' u) '->' ((v '==' v) '&' ((v '&' t) '==' (v '&' u))) is D -provable
by A3, Th44;
((v '==' v) '&' ((v '&' t) '==' (v '&' u))) '->' ((v => t) '==' (v => u)) in SCI-id-axioms L
by Def10i;
then
((v '==' v) '&' ((v '&' t) '==' (v '&' u))) '->' ((v => t) '==' (v => u)) is D -provable
;
hence
(t '==' u) '->' ((v => t) '==' (v => u)) is D -provable
by A12, Th21; verum