set S0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE));
set A0 = 1GateCircuit (<*>,((0 -tuples_on BOOLEAN) --> FALSE));
set Sn = n -BitFTA1Layer2Str (ap,bm,cp,dm);
set o0 = [<*>,((0 -tuples_on BOOLEAN) --> FALSE)];
deffunc H1( non empty ManySortedSign , set , Nat) -> ManySortedSign = $1 +* (BitGFA2Str ((GFA1AdderOutput ((ap . ($3 + 1)),(bm . ($3 + 1)),(cp . ($3 + 1)))),$2,(dm . ($3 + 1))));
deffunc H2( non empty ManySortedSign , non-empty MSAlgebra over $1, set , Nat) -> MSAlgebra over $1 +* (BitGFA2Str ((GFA1AdderOutput ((ap . ($4 + 1)),(bm . ($4 + 1)),(cp . ($4 + 1)))),$3,(dm . ($4 + 1)))) = $2 +* (BitGFA2Circ ((GFA1AdderOutput ((ap . ($4 + 1)),(bm . ($4 + 1)),(cp . ($4 + 1)))),$3,(dm . ($4 + 1))));
deffunc H3( set , Nat) -> Element of InnerVertices (GFA1CarryStr ((ap . ($2 + 1)),(bm . ($2 + 1)),(cp . ($2 + 1)))) = GFA1CarryOutput ((ap . ($2 + 1)),(bm . ($2 + 1)),(cp . ($2 + 1)));
A2: for S being non empty non void strict unsplit gate`1=arity gate`2isBoolean ManySortedSign
for x being set
for n being Nat holds
( H1(S,x,n) is unsplit & H1(S,x,n) is gate`1=arity & H1(S,x,n) is gate`2isBoolean & not H1(S,x,n) is void & H1(S,x,n) is strict ) ;
A3: ex f, h being ManySortedSet of NAT st
( n -BitFTA1Layer2Str (ap,bm,cp,dm) = f . n & f . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & h . 0 = [<*>,((0 -tuples_on BOOLEAN) --> FALSE)] & ( for n being Nat
for S being non empty ManySortedSign
for x being set st S = f . n & x = h . n holds
( f . (n + 1) = H1(S,x,n) & h . (n + 1) = H3(x,n) ) ) ) by Def13;
A4: for S being non empty ManySortedSign
for A being non-empty MSAlgebra over S
for x being set
for n being Nat holds H2(S,A,x,n) is non-empty MSAlgebra over H1(S,x,n) ;
A5: for S, S1 being non empty non void strict unsplit gate`1=arity gate`2isBoolean ManySortedSign
for A being strict gate`2=den Boolean Circuit of S
for x being set
for n being Nat st S1 = H1(S,x,n) holds
H2(S,A,x,n) is strict gate`2=den Boolean Circuit of S1 ;
ex A being strict gate`2=den Boolean Circuit of n -BitFTA1Layer2Str (ap,bm,cp,dm) ex f, g, h being ManySortedSet of NAT st
( n -BitFTA1Layer2Str (ap,bm,cp,dm) = f . n & A = g . n & f . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & g . 0 = 1GateCircuit (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & h . 0 = [<*>,((0 -tuples_on BOOLEAN) --> FALSE)] & ( for n being Nat
for S being non empty ManySortedSign
for A being non-empty MSAlgebra over S
for x being set st S = f . n & A = g . n & x = h . n holds
( f . (n + 1) = H1(S,x,n) & g . (n + 1) = H2(S,A,x,n) & h . (n + 1) = H3(x,n) ) ) ) from CIRCCMB2:sch 19(A2, A3, A4, A5);
hence ex b1 being strict gate`2=den Boolean Circuit of n -BitFTA1Layer2Str (ap,bm,cp,dm) ex f, g, h being ManySortedSet of NAT st
( n -BitFTA1Layer2Str (ap,bm,cp,dm) = f . n & b1 = g . n & f . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & g . 0 = 1GateCircuit (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & h . 0 = [<*>,((0 -tuples_on BOOLEAN) --> FALSE)] & ( for k being Nat
for S being non empty ManySortedSign
for A being non-empty MSAlgebra over S
for z being set st S = f . k & A = g . k & z = h . k holds
( f . (k + 1) = S +* (BitGFA2Str ((GFA1AdderOutput ((ap . (k + 1)),(bm . (k + 1)),(cp . (k + 1)))),z,(dm . (k + 1)))) & g . (k + 1) = A +* (BitGFA2Circ ((GFA1AdderOutput ((ap . (k + 1)),(bm . (k + 1)),(cp . (k + 1)))),z,(dm . (k + 1)))) & h . (k + 1) = GFA1CarryOutput ((ap . (k + 1)),(bm . (k + 1)),(cp . (k + 1))) ) ) ) ; :: thesis: verum