set S0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE));
A1: ( 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) is unsplit & 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) is gate`1=arity & 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) is gate`2isBoolean & not 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) is void & not 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) is empty & 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) is strict ) ;
deffunc H1( set , Nat) -> ManySortedSign = BitGFA1Str ((ap . ($2 + 1)),(bm . ($2 + 1)),(cp . ($2 + 1)));
deffunc H2( set , Nat) -> set = {} ;
consider SX being non empty non void strict unsplit gate`1=arity gate`2isBoolean ManySortedSign , f, h being ManySortedSet of NAT such that
B1: ( SX = f . n & f . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & h . 0 = {} & ( for m being Nat
for S being non empty ManySortedSign
for x being set st S = f . m & x = h . m holds
( f . (m + 1) = S +* H1(x,m) & h . (m + 1) = H2(x,m) ) ) ) from CIRCCMB2:sch 8(A1);
take SX ; :: thesis: ex f being ManySortedSet of NAT st
( SX = f . n & f . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & ( for k being Nat
for S being non empty ManySortedSign st S = f . k holds
f . (k + 1) = S +* (BitGFA1Str ((ap . (k + 1)),(bm . (k + 1)),(cp . (k + 1)))) ) )

take f ; :: thesis: ( SX = f . n & f . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & ( for k being Nat
for S being non empty ManySortedSign st S = f . k holds
f . (k + 1) = S +* (BitGFA1Str ((ap . (k + 1)),(bm . (k + 1)),(cp . (k + 1)))) ) )

thus SX = f . n by B1; :: thesis: ( f . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & ( for k being Nat
for S being non empty ManySortedSign st S = f . k holds
f . (k + 1) = S +* (BitGFA1Str ((ap . (k + 1)),(bm . (k + 1)),(cp . (k + 1)))) ) )

thus f . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) by B1; :: thesis: for k being Nat
for S being non empty ManySortedSign st S = f . k holds
f . (k + 1) = S +* (BitGFA1Str ((ap . (k + 1)),(bm . (k + 1)),(cp . (k + 1))))

let k be Nat; :: thesis: for S being non empty ManySortedSign st S = f . k holds
f . (k + 1) = S +* (BitGFA1Str ((ap . (k + 1)),(bm . (k + 1)),(cp . (k + 1))))

let S be non empty ManySortedSign ; :: thesis: ( S = f . k implies f . (k + 1) = S +* (BitGFA1Str ((ap . (k + 1)),(bm . (k + 1)),(cp . (k + 1)))) )
assume B2: S = f . k ; :: thesis: f . (k + 1) = S +* (BitGFA1Str ((ap . (k + 1)),(bm . (k + 1)),(cp . (k + 1))))
h . k = h . k ;
hence f . (k + 1) = S +* (BitGFA1Str ((ap . (k + 1)),(bm . (k + 1)),(cp . (k + 1)))) by B1, B2; :: thesis: verum