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 st t '==' u is D -provable holds
( ( t is D -provable implies u is D -provable ) & ( u is D -provable implies t is D -provable ) & (t '&' v) '==' (u '&' v) is D -provable & (t '&' v) '->' (u '&' v) is D -provable & ( t '&' v is D -provable implies u '&' v is D -provable ) & (v '&' t) '==' (v '&' u) is D -provable & (v '&' t) '->' (v '&' u) is D -provable & ( v '&' t is D -provable implies v '&' u is D -provable ) & (t 'or' v) '==' (u 'or' v) is D -provable & (t 'or' v) '->' (u 'or' v) is D -provable & ( t 'or' v is D -provable implies u 'or' v is D -provable ) & (v 'or' t) '==' (v 'or' u) is D -provable & (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies 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 st t '==' u is D -provable holds
( ( t is D -provable implies u is D -provable ) & ( u is D -provable implies t is D -provable ) & (t '&' v) '==' (u '&' v) is D -provable & (t '&' v) '->' (u '&' v) is D -provable & ( t '&' v is D -provable implies u '&' v is D -provable ) & (v '&' t) '==' (v '&' u) is D -provable & (v '&' t) '->' (v '&' u) is D -provable & ( v '&' t is D -provable implies v '&' u is D -provable ) & (t 'or' v) '==' (u 'or' v) is D -provable & (t 'or' v) '->' (u 'or' v) is D -provable & ( t 'or' v is D -provable implies u 'or' v is D -provable ) & (v 'or' t) '==' (v 'or' u) is D -provable & (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
let D be SCI-axioms L -extending Subset of L; for t, u, v being Formula of L st t '==' u is D -provable holds
( ( t is D -provable implies u is D -provable ) & ( u is D -provable implies t is D -provable ) & (t '&' v) '==' (u '&' v) is D -provable & (t '&' v) '->' (u '&' v) is D -provable & ( t '&' v is D -provable implies u '&' v is D -provable ) & (v '&' t) '==' (v '&' u) is D -provable & (v '&' t) '->' (v '&' u) is D -provable & ( v '&' t is D -provable implies v '&' u is D -provable ) & (t 'or' v) '==' (u 'or' v) is D -provable & (t 'or' v) '->' (u 'or' v) is D -provable & ( t 'or' v is D -provable implies u 'or' v is D -provable ) & (v 'or' t) '==' (v 'or' u) is D -provable & (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
let t, u, v be Formula of L; ( t '==' u is D -provable implies ( ( t is D -provable implies u is D -provable ) & ( u is D -provable implies t is D -provable ) & (t '&' v) '==' (u '&' v) is D -provable & (t '&' v) '->' (u '&' v) is D -provable & ( t '&' v is D -provable implies u '&' v is D -provable ) & (v '&' t) '==' (v '&' u) is D -provable & (v '&' t) '->' (v '&' u) is D -provable & ( v '&' t is D -provable implies v '&' u is D -provable ) & (t 'or' v) '==' (u 'or' v) is D -provable & (t 'or' v) '->' (u 'or' v) is D -provable & ( t 'or' v is D -provable implies u 'or' v is D -provable ) & (v 'or' t) '==' (v 'or' u) is D -provable & (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) ) )
set U = t '==' u;
assume A1:
t '==' u is D -provable
; ( ( t is D -provable implies u is D -provable ) & ( u is D -provable implies t is D -provable ) & (t '&' v) '==' (u '&' v) is D -provable & (t '&' v) '->' (u '&' v) is D -provable & ( t '&' v is D -provable implies u '&' v is D -provable ) & (v '&' t) '==' (v '&' u) is D -provable & (v '&' t) '->' (v '&' u) is D -provable & ( v '&' t is D -provable implies v '&' u is D -provable ) & (t 'or' v) '==' (u 'or' v) is D -provable & (t 'or' v) '->' (u 'or' v) is D -provable & ( t 'or' v is D -provable implies u 'or' v is D -provable ) & (v 'or' t) '==' (v 'or' u) is D -provable & (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
then
( t '==' u is D -provable & u '==' t is D -provable )
by Th63;
then
( t '->' u is D -provable & u '->' t is D -provable )
by Th60;
hence
( t is D -provable iff u is D -provable )
by Th20; ( (t '&' v) '==' (u '&' v) is D -provable & (t '&' v) '->' (u '&' v) is D -provable & ( t '&' v is D -provable implies u '&' v is D -provable ) & (v '&' t) '==' (v '&' u) is D -provable & (v '&' t) '->' (v '&' u) is D -provable & ( v '&' t is D -provable implies v '&' u is D -provable ) & (t 'or' v) '==' (u 'or' v) is D -provable & (t 'or' v) '->' (u 'or' v) is D -provable & ( t 'or' v is D -provable implies u 'or' v is D -provable ) & (v 'or' t) '==' (v 'or' u) is D -provable & (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
(t '==' u) '->' ((t '&' v) '==' (u '&' v)) is D -provable
by Th67;
hence
(t '&' v) '==' (u '&' v) is D -provable
by A1, Th20; ( (t '&' v) '->' (u '&' v) is D -provable & ( t '&' v is D -provable implies u '&' v is D -provable ) & (v '&' t) '==' (v '&' u) is D -provable & (v '&' t) '->' (v '&' u) is D -provable & ( v '&' t is D -provable implies v '&' u is D -provable ) & (t 'or' v) '==' (u 'or' v) is D -provable & (t 'or' v) '->' (u 'or' v) is D -provable & ( t 'or' v is D -provable implies u 'or' v is D -provable ) & (v 'or' t) '==' (v 'or' u) is D -provable & (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
(t '&' v) '->' (u '&' v) is D -provable
by Th60; ( ( t '&' v is D -provable implies u '&' v is D -provable ) & (v '&' t) '==' (v '&' u) is D -provable & (v '&' t) '->' (v '&' u) is D -provable & ( v '&' t is D -provable implies v '&' u is D -provable ) & (t 'or' v) '==' (u 'or' v) is D -provable & (t 'or' v) '->' (u 'or' v) is D -provable & ( t 'or' v is D -provable implies u 'or' v is D -provable ) & (v 'or' t) '==' (v 'or' u) is D -provable & (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
( t '&' v is D -provable implies u '&' v is D -provable )
by Th20; ( (v '&' t) '==' (v '&' u) is D -provable & (v '&' t) '->' (v '&' u) is D -provable & ( v '&' t is D -provable implies v '&' u is D -provable ) & (t 'or' v) '==' (u 'or' v) is D -provable & (t 'or' v) '->' (u 'or' v) is D -provable & ( t 'or' v is D -provable implies u 'or' v is D -provable ) & (v 'or' t) '==' (v 'or' u) is D -provable & (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
(t '==' u) '->' ((v '&' t) '==' (v '&' u)) is D -provable
by Th67;
hence
(v '&' t) '==' (v '&' u) is D -provable
by A1, Th20; ( (v '&' t) '->' (v '&' u) is D -provable & ( v '&' t is D -provable implies v '&' u is D -provable ) & (t 'or' v) '==' (u 'or' v) is D -provable & (t 'or' v) '->' (u 'or' v) is D -provable & ( t 'or' v is D -provable implies u 'or' v is D -provable ) & (v 'or' t) '==' (v 'or' u) is D -provable & (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
(v '&' t) '->' (v '&' u) is D -provable
by Th60; ( ( v '&' t is D -provable implies v '&' u is D -provable ) & (t 'or' v) '==' (u 'or' v) is D -provable & (t 'or' v) '->' (u 'or' v) is D -provable & ( t 'or' v is D -provable implies u 'or' v is D -provable ) & (v 'or' t) '==' (v 'or' u) is D -provable & (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
( v '&' t is D -provable implies v '&' u is D -provable )
by Th20; ( (t 'or' v) '==' (u 'or' v) is D -provable & (t 'or' v) '->' (u 'or' v) is D -provable & ( t 'or' v is D -provable implies u 'or' v is D -provable ) & (v 'or' t) '==' (v 'or' u) is D -provable & (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
(t '==' u) '->' ((t 'or' v) '==' (u 'or' v)) is D -provable
by Th67;
hence
(t 'or' v) '==' (u 'or' v) is D -provable
by A1, Th20; ( (t 'or' v) '->' (u 'or' v) is D -provable & ( t 'or' v is D -provable implies u 'or' v is D -provable ) & (v 'or' t) '==' (v 'or' u) is D -provable & (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
(t 'or' v) '->' (u 'or' v) is D -provable
by Th60; ( ( t 'or' v is D -provable implies u 'or' v is D -provable ) & (v 'or' t) '==' (v 'or' u) is D -provable & (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
( t 'or' v is D -provable implies u 'or' v is D -provable )
by Th20; ( (v 'or' t) '==' (v 'or' u) is D -provable & (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
(t '==' u) '->' ((v 'or' t) '==' (v 'or' u)) is D -provable
by Th67;
hence
(v 'or' t) '==' (v 'or' u) is D -provable
by A1, Th20; ( (v 'or' t) '->' (v 'or' u) is D -provable & ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
(v 'or' t) '->' (v 'or' u) is D -provable
by Th60; ( ( v 'or' t is D -provable implies v 'or' u is D -provable ) & (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
( v 'or' t is D -provable implies v 'or' u is D -provable )
by Th20; ( (t '->' v) '==' (u '->' v) is D -provable & (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
(t '==' u) '->' ((t '->' v) '==' (u '->' v)) is D -provable
by Th67;
hence
(t '->' v) '==' (u '->' v) is D -provable
by A1, Th20; ( (t '->' v) '->' (u '->' v) is D -provable & ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
(t '->' v) '->' (u '->' v) is D -provable
by Th60; ( ( t '->' v is D -provable implies u '->' v is D -provable ) & (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
( t '->' v is D -provable implies u '->' v is D -provable )
by Th20; ( (v '->' t) '==' (v '->' u) is D -provable & (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
(t '==' u) '->' ((v '->' t) '==' (v '->' u)) is D -provable
by Th67;
hence
(v '->' t) '==' (v '->' u) is D -provable
by A1, Th20; ( (v '->' t) '->' (v '->' u) is D -provable & ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
(v '->' t) '->' (v '->' u) is D -provable
by Th60; ( ( v '->' t is D -provable implies v '->' u is D -provable ) & (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
( v '->' t is D -provable implies v '->' u is D -provable )
by Th20; ( (t '<->' v) '==' (u '<->' v) is D -provable & (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
(t '==' u) '->' ((t '<->' v) '==' (u '<->' v)) is D -provable
by Th67;
hence
(t '<->' v) '==' (u '<->' v) is D -provable
by A1, Th20; ( (t '<->' v) '->' (u '<->' v) is D -provable & ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
(t '<->' v) '->' (u '<->' v) is D -provable
by Th60; ( ( t '<->' v is D -provable implies u '<->' v is D -provable ) & (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
( t '<->' v is D -provable implies u '<->' v is D -provable )
by Th20; ( (v '<->' t) '==' (v '<->' u) is D -provable & (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
(t '==' u) '->' ((v '<->' t) '==' (v '<->' u)) is D -provable
by Th67;
hence
(v '<->' t) '==' (v '<->' u) is D -provable
by A1, Th20; ( (v '<->' t) '->' (v '<->' u) is D -provable & ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
(v '<->' t) '->' (v '<->' u) is D -provable
by Th60; ( ( v '<->' t is D -provable implies v '<->' u is D -provable ) & (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
( v '<->' t is D -provable implies v '<->' u is D -provable )
by Th20; ( (t '==' v) '==' (u '==' v) is D -provable & (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
(t '==' u) '->' ((t '==' v) '==' (u '==' v)) is D -provable
by Th67;
hence
(t '==' v) '==' (u '==' v) is D -provable
by A1, Th20; ( (t '==' v) '->' (u '==' v) is D -provable & ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
(t '==' v) '->' (u '==' v) is D -provable
by Th60; ( ( t '==' v is D -provable implies u '==' v is D -provable ) & (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
( t '==' v is D -provable implies u '==' v is D -provable )
by Th20; ( (v '==' t) '==' (v '==' u) is D -provable & (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
(t '==' u) '->' ((v '==' t) '==' (v '==' u)) is D -provable
by Th67;
hence
(v '==' t) '==' (v '==' u) is D -provable
by A1, Th20; ( (v '==' t) '->' (v '==' u) is D -provable & ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
(v '==' t) '->' (v '==' u) is D -provable
by Th60; ( ( v '==' t is D -provable implies v '==' u is D -provable ) & (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
( v '==' t is D -provable implies v '==' u is D -provable )
by Th20; ( (t => v) '==' (u => v) is D -provable & (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
(t '==' u) '->' ((t => v) '==' (u => v)) is D -provable
by Th67;
hence
(t => v) '==' (u => v) is D -provable
by A1, Th20; ( (t => v) '->' (u => v) is D -provable & ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
(t => v) '->' (u => v) is D -provable
by Th60; ( ( t => v is D -provable implies u => v is D -provable ) & (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
hence
( t => v is D -provable implies u => v is D -provable )
by Th20; ( (v => t) '==' (v => u) is D -provable & (v => t) '->' (v => u) is D -provable & ( v => t is D -provable implies v => u is D -provable ) )
(t '==' u) '->' ((v => t) '==' (v => u)) is D -provable
by Th67;
hence
(v => t) '==' (v => u) is D -provable
by A1, Th20; ( v => u is D -provable iff v => t is D -provable )
hence
(v => t) '->' (v => u) is D -provable
by Th60; ( v => t is D -provable implies v => u is D -provable )
hence
( v => t is D -provable implies v => u is D -provable )
by Th20; verum