set S0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE));
set h = EmptyMS NAT;
deffunc H1( non empty ManySortedSign , set , Nat) -> ManySortedSign = $1 +* (BitGFA1Str ((ap . ($3 + 1)),(bm . ($3 + 1)),(cp . ($3 + 1))));
deffunc H2( set , Nat) -> set = {} ;
let S1, S2 be non empty non void strict unsplit gate`1=arity gate`2isBoolean ManySortedSign ; ( ex f being ManySortedSet of NAT st
( S1 = 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)))) ) ) & ex f being ManySortedSet of NAT st
( S2 = 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)))) ) ) implies S1 = S2 )
given f1 being ManySortedSet of NAT such that E1:
S1 = f1 . n
and
E2:
f1 . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE))
and
E3:
for k being Nat
for S being non empty ManySortedSign st S = f1 . k holds
f1 . (k + 1) = S +* (BitGFA1Str ((ap . (k + 1)),(bm . (k + 1)),(cp . (k + 1))))
; ( for f being ManySortedSet of NAT holds
( not S2 = f . n or not f . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) or ex k being Nat ex S being non empty ManySortedSign st
( S = f . k & not f . (k + 1) = S +* (BitGFA1Str ((ap . (k + 1)),(bm . (k + 1)),(cp . (k + 1)))) ) ) or S1 = S2 )
given f2 being ManySortedSet of NAT such that E4:
S2 = f2 . n
and
E5:
f2 . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE))
and
E6:
for k being Nat
for S being non empty ManySortedSign st S = f2 . k holds
f2 . (k + 1) = S +* (BitGFA1Str ((ap . (k + 1)),(bm . (k + 1)),(cp . (k + 1))))
; S1 = S2
P1:
ex f, hh being ManySortedSet of NAT st
( S1 = f . n & f . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & hh . 0 = {} & ( for m being Nat
for S being non empty ManySortedSign
for x being set st S = f . m & x = hh . m holds
( f . (m + 1) = H1(S,x,m) & hh . (m + 1) = H2(x,m) ) ) )
proof
take
f1
;
ex hh being ManySortedSet of NAT st
( S1 = f1 . n & f1 . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & hh . 0 = {} & ( for m being Nat
for S being non empty ManySortedSign
for x being set st S = f1 . m & x = hh . m holds
( f1 . (m + 1) = H1(S,x,m) & hh . (m + 1) = H2(x,m) ) ) )
take
EmptyMS NAT
;
( S1 = f1 . n & f1 . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & (EmptyMS NAT) . 0 = {} & ( for m being Nat
for S being non empty ManySortedSign
for x being set st S = f1 . m & x = (EmptyMS NAT) . m holds
( f1 . (m + 1) = H1(S,x,m) & (EmptyMS NAT) . (m + 1) = H2(x,m) ) ) )
thus
(
S1 = f1 . n &
f1 . 0 = 1GateCircStr (
<*>,
((0 -tuples_on BOOLEAN) --> FALSE)) &
(EmptyMS NAT) . 0 = {} )
by E1, E2, PBOOLE:5;
for m being Nat
for S being non empty ManySortedSign
for x being set st S = f1 . m & x = (EmptyMS NAT) . m holds
( f1 . (m + 1) = H1(S,x,m) & (EmptyMS NAT) . (m + 1) = H2(x,m) )
let m be
Nat;
for S being non empty ManySortedSign
for x being set st S = f1 . m & x = (EmptyMS NAT) . m holds
( f1 . (m + 1) = H1(S,x,m) & (EmptyMS NAT) . (m + 1) = H2(x,m) )let S be non
empty ManySortedSign ;
for x being set st S = f1 . m & x = (EmptyMS NAT) . m holds
( f1 . (m + 1) = H1(S,x,m) & (EmptyMS NAT) . (m + 1) = H2(x,m) )let x be
set ;
( S = f1 . m & x = (EmptyMS NAT) . m implies ( f1 . (m + 1) = H1(S,x,m) & (EmptyMS NAT) . (m + 1) = H2(x,m) ) )
assume that H1:
S = f1 . m
and
x = (EmptyMS NAT) . m
;
( f1 . (m + 1) = H1(S,x,m) & (EmptyMS NAT) . (m + 1) = H2(x,m) )
thus
f1 . (m + 1) = H1(
S,
x,
m)
by E3, H1;
(EmptyMS NAT) . (m + 1) = H2(x,m)
thus
(EmptyMS NAT) . (m + 1) = H2(
x,
m)
by PBOOLE:5;
verum
end;
P2:
ex f, hh being ManySortedSet of NAT st
( S2 = f . n & f . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & hh . 0 = {} & ( for m being Nat
for S being non empty ManySortedSign
for x being set st S = f . m & x = hh . m holds
( f . (m + 1) = H1(S,x,m) & hh . (m + 1) = H2(x,m) ) ) )
proof
take
f2
;
ex hh being ManySortedSet of NAT st
( S2 = f2 . n & f2 . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & hh . 0 = {} & ( for m being Nat
for S being non empty ManySortedSign
for x being set st S = f2 . m & x = hh . m holds
( f2 . (m + 1) = H1(S,x,m) & hh . (m + 1) = H2(x,m) ) ) )
take
EmptyMS NAT
;
( S2 = f2 . n & f2 . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & (EmptyMS NAT) . 0 = {} & ( for m being Nat
for S being non empty ManySortedSign
for x being set st S = f2 . m & x = (EmptyMS NAT) . m holds
( f2 . (m + 1) = H1(S,x,m) & (EmptyMS NAT) . (m + 1) = H2(x,m) ) ) )
thus
(
S2 = f2 . n &
f2 . 0 = 1GateCircStr (
<*>,
((0 -tuples_on BOOLEAN) --> FALSE)) &
(EmptyMS NAT) . 0 = {} )
by E4, E5, PBOOLE:5;
for m being Nat
for S being non empty ManySortedSign
for x being set st S = f2 . m & x = (EmptyMS NAT) . m holds
( f2 . (m + 1) = H1(S,x,m) & (EmptyMS NAT) . (m + 1) = H2(x,m) )
let m be
Nat;
for S being non empty ManySortedSign
for x being set st S = f2 . m & x = (EmptyMS NAT) . m holds
( f2 . (m + 1) = H1(S,x,m) & (EmptyMS NAT) . (m + 1) = H2(x,m) )let S be non
empty ManySortedSign ;
for x being set st S = f2 . m & x = (EmptyMS NAT) . m holds
( f2 . (m + 1) = H1(S,x,m) & (EmptyMS NAT) . (m + 1) = H2(x,m) )let x be
set ;
( S = f2 . m & x = (EmptyMS NAT) . m implies ( f2 . (m + 1) = H1(S,x,m) & (EmptyMS NAT) . (m + 1) = H2(x,m) ) )
assume that H2:
S = f2 . m
and
x = (EmptyMS NAT) . m
;
( f2 . (m + 1) = H1(S,x,m) & (EmptyMS NAT) . (m + 1) = H2(x,m) )
thus
f2 . (m + 1) = H1(
S,
x,
m)
by E6, H2;
(EmptyMS NAT) . (m + 1) = H2(x,m)
thus
(EmptyMS NAT) . (m + 1) = H2(
x,
m)
by PBOOLE:5;
verum
end;
for T1, T2 being non empty non void strict unsplit gate`1=arity gate`2isBoolean ManySortedSign st ex f, hh being ManySortedSet of NAT st
( T1 = f . n & f . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & hh . 0 = {} & ( for m being Nat
for S being non empty ManySortedSign
for x being set st S = f . m & x = hh . m holds
( f . (m + 1) = H1(S,x,m) & hh . (m + 1) = H2(x,m) ) ) ) & ex f, hh being ManySortedSet of NAT st
( T2 = f . n & f . 0 = 1GateCircStr (<*>,((0 -tuples_on BOOLEAN) --> FALSE)) & hh . 0 = {} & ( for m being Nat
for S being non empty ManySortedSign
for x being set st S = f . m & x = hh . m holds
( f . (m + 1) = H1(S,x,m) & hh . (m + 1) = H2(x,m) ) ) ) holds
T1 = T2
from CIRCCMB2:sch 9();
hence
S1 = S2
by P1, P2; verum