let S1, S2, S be non empty non void Circuit-like ManySortedSign ; :: thesis: ( InputVertices S1 misses InnerVertices S2 & S = S1 +* S2 implies for A1 being non-empty Circuit of S1
for A2 being non-empty Circuit of S2
for A being non-empty Circuit of S st A1 tolerates A2 & A = A1 +* A2 holds
for s1 being State of A1
for s2 being State of A2
for s being State of A st s1 = s | the carrier of S1 & s2 = s | the carrier of S2 & s1 is stable holds
for n being Nat holds (Following s,n) | the carrier of S2 = Following s2,n )
assume A1: ( InputVertices S1 misses InnerVertices S2 & S = S1 +* S2 ) ; :: thesis: for A1 being non-empty Circuit of S1
for A2 being non-empty Circuit of S2
for A being non-empty Circuit of S st A1 tolerates A2 & A = A1 +* A2 holds
for s1 being State of A1
for s2 being State of A2
for s being State of A st s1 = s | the carrier of S1 & s2 = s | the carrier of S2 & s1 is stable holds
for n being Nat holds (Following s,n) | the carrier of S2 = Following s2,n
let A1 be non-empty Circuit of S1; :: thesis: for A2 being non-empty Circuit of S2
for A being non-empty Circuit of S st A1 tolerates A2 & A = A1 +* A2 holds
for s1 being State of A1
for s2 being State of A2
for s being State of A st s1 = s | the carrier of S1 & s2 = s | the carrier of S2 & s1 is stable holds
for n being Nat holds (Following s,n) | the carrier of S2 = Following s2,n
let A2 be non-empty Circuit of S2; :: thesis: for A being non-empty Circuit of S st A1 tolerates A2 & A = A1 +* A2 holds
for s1 being State of A1
for s2 being State of A2
for s being State of A st s1 = s | the carrier of S1 & s2 = s | the carrier of S2 & s1 is stable holds
for n being Nat holds (Following s,n) | the carrier of S2 = Following s2,n
let A be non-empty Circuit of S; :: thesis: ( A1 tolerates A2 & A = A1 +* A2 implies for s1 being State of A1
for s2 being State of A2
for s being State of A st s1 = s | the carrier of S1 & s2 = s | the carrier of S2 & s1 is stable holds
for n being Nat holds (Following s,n) | the carrier of S2 = Following s2,n )
assume A2: ( A1 tolerates A2 & A = A1 +* A2 ) ; :: thesis: for s1 being State of A1
for s2 being State of A2
for s being State of A st s1 = s | the carrier of S1 & s2 = s | the carrier of S2 & s1 is stable holds
for n being Nat holds (Following s,n) | the carrier of S2 = Following s2,n
let s1 be State of A1; :: thesis: for s2 being State of A2
for s being State of A st s1 = s | the carrier of S1 & s2 = s | the carrier of S2 & s1 is stable holds
for n being Nat holds (Following s,n) | the carrier of S2 = Following s2,n
let s2 be State of A2; :: thesis: for s being State of A st s1 = s | the carrier of S1 & s2 = s | the carrier of S2 & s1 is stable holds
for n being Nat holds (Following s,n) | the carrier of S2 = Following s2,n
let s be State of A; :: thesis: ( s1 = s | the carrier of S1 & s2 = s | the carrier of S2 & s1 is stable implies for n being Nat holds (Following s,n) | the carrier of S2 = Following s2,n )
assume that
A3: ( s1 = s | the carrier of S1 & s2 = s | the carrier of S2 ) and
A4: s1 is stable ; :: thesis: for n being Nat holds (Following s,n) | the carrier of S2 = Following s2,n
defpred S₃[ Nat] means (Following s,$1) | the carrier of S2 = Following s2,$1;
(Following s,0 ) | the carrier of S2 = s2 by A3, FACIRC_1:11
.= Following s2,0 by FACIRC_1:11 ;
then A5: S₃[ 0 ] ;

A6: now

let n be Nat; :: thesis: ( S₃[n] implies S₃[n + 1] )
assume A7: S₃[n] ; :: thesis: S₃[n + 1]
the Sorts of A1 tolerates the Sorts of A2 by A2, CIRCCOMB:def 3;
then reconsider Fs1 = (Following s,n) | the carrier of S1 as State of A1 by A2, CIRCCOMB:33;
A8: ( Following s,(n + 1) = Following (Following s,n) & Following (Following s1,n) = Following s1,(n + 1) & Following (Following s2,n) = Following s2,(n + 1) ) by FACIRC_1:12;
Following s1,n = Fs1 by A1, A2, A3, Th14;
then Fs1 is stable by A4, Th3;
hence S₃[n + 1] by A1, A2, A7, A8, Th16; :: thesis: verum

end;

thus for n being Nat holds S₃[n] from NAT_1:sch 2(A5, A6); :: thesis: verum