set S0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE));
set A0 = 1GateCircuit (<*>,((0 -tuples_on BOOLEAN) --> FALSE));
set Sn = n -BitFTA0Layer2Str (ap,bp,cp,dp);
set o0 = [<*>,((0 -tuples_on BOOLEAN) --> FALSE)];
deffunc H1( non empty ManySortedSign , set , Nat) -> ManySortedSign = $1 +* (BitGFA0Str ((GFA0AdderOutput ((ap . ($3 + 1)),(bp . ($3 + 1)),(cp . ($3 + 1)))),$2,(dp . ($3 + 1))));
deffunc H2( non empty ManySortedSign , non-empty MSAlgebra over $1, set , Nat) -> MSAlgebra over $1 +* (BitGFA0Str ((GFA0AdderOutput ((ap . ($4 + 1)),(bp . ($4 + 1)),(cp . ($4 + 1)))),$3,(dp . ($4 + 1)))) = $2 +* (BitGFA0Circ ((GFA0AdderOutput ((ap . ($4 + 1)),(bp . ($4 + 1)),(cp . ($4 + 1)))),$3,(dp . ($4 + 1))));
deffunc H3( set , Nat) -> Element of InnerVertices (GFA0CarryStr ((ap . ($2 + 1)),(bp . ($2 + 1)),(cp . ($2 + 1)))) = GFA0CarryOutput ((ap . ($2 + 1)),(bp . ($2 + 1)),(cp . ($2 + 1)));
A1:
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)
;
for A1, A2 being strict gate`2=den Boolean Circuit of n -BitFTA0Layer2Str (ap,bp,cp,dp) st ex f, g, h being ManySortedSet of NAT st
( n -BitFTA0Layer2Str (ap,bp,cp,dp) = f . n & A1 = 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) ) ) ) & ex f, g, h being ManySortedSet of NAT st
( n -BitFTA0Layer2Str (ap,bp,cp,dp) = f . n & A2 = 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) ) ) ) holds
A1 = A2
from CIRCCMB2:sch 21(A1);
hence
for b1, b2 being strict gate`2=den Boolean Circuit of n -BitFTA0Layer2Str (ap,bp,cp,dp) st ex f, g, h being ManySortedSet of NAT st
( n -BitFTA0Layer2Str (ap,bp,cp,dp) = 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 +* (BitGFA0Str ((GFA0AdderOutput ((ap . (k + 1)),(bp . (k + 1)),(cp . (k + 1)))),z,(dp . (k + 1)))) & g . (k + 1) = A +* (BitGFA0Circ ((GFA0AdderOutput ((ap . (k + 1)),(bp . (k + 1)),(cp . (k + 1)))),z,(dp . (k + 1)))) & h . (k + 1) = GFA0CarryOutput ((ap . (k + 1)),(bp . (k + 1)),(cp . (k + 1))) ) ) ) & ex f, g, h being ManySortedSet of NAT st
( n -BitFTA0Layer2Str (ap,bp,cp,dp) = f . n & b2 = 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 +* (BitGFA0Str ((GFA0AdderOutput ((ap . (k + 1)),(bp . (k + 1)),(cp . (k + 1)))),z,(dp . (k + 1)))) & g . (k + 1) = A +* (BitGFA0Circ ((GFA0AdderOutput ((ap . (k + 1)),(bp . (k + 1)),(cp . (k + 1)))),z,(dp . (k + 1)))) & h . (k + 1) = GFA0CarryOutput ((ap . (k + 1)),(bp . (k + 1)),(cp . (k + 1))) ) ) ) holds
b1 = b2
; verum