set f1 = and2 ;
set f2 = and2 ;
set f3 = and2 ;
set f0 = xor2 ;
let f, g be nonpair-yielding FinSequence; :: thesis:
deffunc H₁( Nat) -> non empty non void strict unsplit gate`1=arity gate`2isBoolean ManySortedSign = $1 -BitGFA0Str f,g;
deffunc H₂( set , Nat) -> ManySortedSign = BitGFA0Str (f . ($2 + 1)),(g . ($2 + 1)),$1;
deffunc H₃( Nat) -> Element of InnerVertices ($1 -BitGFA0Str f,g) = $1 -BitGFA0CarryOutput f,g;
consider h being ManySortedSet of such that
A1: for n being Element of NAT holds h . n = H₃(n) from PBOOLE:sch 5();
deffunc H₄( Nat) -> set = h . $1;
deffunc H₅( set , Nat) -> Element of InnerVertices (GFA0CarryStr (f . ($2 + 1)),(g . ($2 + 1)),$1) = GFA0CarryOutput (f . ($2 + 1)),(g . ($2 + 1)),$1;
set k = (0 -tuples_on BOOLEAN ) --> FALSE ;
A2: H₁( 0 ) = 1GateCircStr <*> ,((0 -tuples_on BOOLEAN ) --> FALSE ) by Th2;
then A3: InnerVertices H₁( 0 ) is Relation by FACIRC_1:38;
A4: not InputVertices H₁( 0 ) is with_pair by A2, FACIRC_1:39;
H₄( 0 ) = H₃( 0 ) by A1;
then A5: h . 0 in InnerVertices H₁( 0 ) ;
A6: for n being Nat
for x being set holds InnerVertices H₂(x,n) is Relation by GFACIRC1:40;

A7: now

let n be Nat; :: thesis:
let x be set ; :: thesis:
assume A8: x = H₄(n) ; :: thesis:
n in NAT by ORDINAL1:def 13;
then H₄(n) = H₃(n) by A1;
then ( f . (n + 1) <> [<*(g . (n + 1)),x*>,and2 ] & g . (n + 1) <> [<*x,(f . (n + 1))*>,and2 ] & x <> [<*(f . (n + 1)),(g . (n + 1))*>,and2 ] & x <> [<*(f . (n + 1)),(g . (n + 1))*>,xor2 ] ) by A8, Lm2;
hence InputVertices H₂(x,n) = {(f . (n + 1)),(g . (n + 1)),x} by GFACIRC1:41; :: thesis:

end;

A9: for n being Nat
for x being set st x = h . n holds
not (InputVertices H₂(x,n)) \ {x} is with_pair

let n be Nat; :: thesis:
let x be set ; :: thesis:
assume A10: x = H₄(n) ; :: thesis:
A11: InputVertices H₂(x,n) = {(f . (n + 1)),(g . (n + 1)),x} by A7, A10;
thus not (InputVertices H₂(x,n)) \ {x} is with_pair :: thesis:

let a be pair set ; :: according to FACIRC_1:def 2 :: thesis:
assume a in (InputVertices H₂(x,n)) \ {x} ; :: thesis:
then ( a in InputVertices H₂(x,n) & not a in {x} ) by XBOOLE_0:def 5;
then ( ( a = f . (n + 1) or a = g . (n + 1) or a = x ) & not a in {x} ) by A11, ENUMSET1:def 1;
hence contradiction by TARSKI:def 1; :: thesis:

end;

A12: now

let n be Nat; :: thesis:
let S be non empty ManySortedSign ; :: thesis:
let x be set ; :: thesis:
assume A13: ( S = H₁(n) & x = h . n ) ; :: thesis:
n in NAT by ORDINAL1:def 13;
then A14: ( x = n -BitGFA0CarryOutput f,g & H₄(n + 1) = (n + 1) -BitGFA0CarryOutput f,g ) by A1, A13;
hence H₁(n + 1) = S +* H₂(x,n) by A13, Th7; :: thesis:
thus h . (n + 1) = H₅(x,n) by A14, Th7; :: thesis:
InputVertices H₂(x,n) = {(f . (n + 1)),(g . (n + 1)),x} by A7, A13;
hence x in InputVertices H₂(x,n) by ENUMSET1:def 1; :: thesis:
A15: InnerVertices H₂(x,n) = (({[<*(f . (n + 1)),(g . (n + 1))*>,xor2 ]} \/ {(GFA0AdderOutput (f . (n + 1)),(g . (n + 1)),x)}) \/ {[<*(f . (n + 1)),(g . (n + 1))*>,and2 ],[<*(g . (n + 1)),x*>,and2 ],[<*x,(f . (n + 1))*>,and2 ]}) \/ {(GFA0CarryOutput (f . (n + 1)),(g . (n + 1)),x)} by GFACIRC1:39;
H₅(x,n) in {H₅(x,n)} by TARSKI:def 1;
hence H₅(x,n) in InnerVertices H₂(x,n) by A15, XBOOLE_0:def 3; :: thesis:

end;

A16: for n being Nat holds
( InputVertices H₁(n + 1) = (InputVertices H₁(n)) \/ ((InputVertices H₂(h . n,n)) \ {(h . n)}) & InnerVertices H₁(n) is Relation & not InputVertices H₁(n) is with_pair ) from CIRCCMB2:sch 11(A3, A4, A5, A6, A9, A12);
let n be Nat; :: thesis:
n in NAT by ORDINAL1:def 13;
then h . n = n -BitGFA0CarryOutput f,g by A1;
hence ( InputVertices ((n + 1) -BitGFA0Str f,g) = (InputVertices (n -BitGFA0Str f,g)) \/ ((InputVertices (BitGFA0Str (f . (n + 1)),(g . (n + 1)),(n -BitGFA0CarryOutput f,g))) \ {(n -BitGFA0CarryOutput f,g)}) & InnerVertices (n -BitGFA0Str f,g) is Relation & not InputVertices (n -BitGFA0Str f,g) is with_pair ) by A16; :: thesis: