let s be State of SCM+FSA; :: thesis: for P being the Instructions of SCM+FSA -valued ManySortedSet of NAT
for I being keeping_0 Program of SCM+FSA st not P +* I halts_on s +* (Initialize I) holds
for J being Program of SCM+FSA
for k being Element of NAT holds Comput ((P +* I),(s +* (Initialize I)),k), Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),k) equal_outside NAT
let P be the Instructions of SCM+FSA -valued ManySortedSet of NAT ; :: thesis: for I being keeping_0 Program of SCM+FSA st not P +* I halts_on s +* (Initialize I) holds
for J being Program of SCM+FSA
for k being Element of NAT holds Comput ((P +* I),(s +* (Initialize I)),k), Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),k) equal_outside NAT
let I be keeping_0 Program of SCM+FSA; :: thesis: ( not P +* I halts_on s +* (Initialize I) implies for J being Program of SCM+FSA
for k being Element of NAT holds Comput ((P +* I),(s +* (Initialize I)),k), Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),k) equal_outside NAT )
assume A1: not P +* I halts_on s +* (Initialize I) ; :: thesis: for J being Program of SCM+FSA
for k being Element of NAT holds Comput ((P +* I),(s +* (Initialize I)),k), Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),k) equal_outside NAT
set s1 = s +* (Initialize I);
let J be Program of SCM+FSA; :: thesis: for k being Element of NAT holds Comput ((P +* I),(s +* (Initialize I)),k), Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),k) equal_outside NAT
A2: Initialize I c= s +* (Initialize I) by FUNCT_4:26;
set s2 = s +* (Initialize (I ';' J));
defpred S₁[ Nat] means Comput ((P +* I),(s +* (Initialize I)),$1), Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),$1) equal_outside NAT ;
A3: for m being Element of NAT st S₁[m] holds
S₁[m + 1]

proof

dom (I ';' J) = (dom (Directed I)) \/ (dom (Reloc (J,(card I)))) by FUNCT_4:def 1
.= (dom I) \/ (dom (Reloc (J,(card I)))) by FUNCT_4:105 ;
then A4: dom I c= dom (I ';' J) by XBOOLE_1:7;
let m be Element of NAT ; :: thesis: ( S₁[m] implies S₁[m + 1] )
A5: Comput ((P +* I),(s +* (Initialize I)),(m + 1)) = Following ((P +* I),(Comput ((P +* I),(s +* (Initialize I)),m))) by EXTPRO_1:4
.= Exec ((CurInstr ((P +* I),(Comput ((P +* I),(s +* (Initialize I)),m)))),(Comput ((P +* I),(s +* (Initialize I)),m))) ;
A6: Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),(m + 1)) = Following ((P +* (I ';' J)),(Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),m))) by EXTPRO_1:4
.= Exec ((CurInstr ((P +* (I ';' J)),(Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),m)))),(Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),m))) ;
A7: I c= P +* I by FUNCT_4:26;
then A8: IC (Comput ((P +* I),(s +* (Initialize I)),m)) in dom I by Def2, A2;
assume A9: Comput ((P +* I),(s +* (Initialize I)),m), Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),m) equal_outside NAT ; :: thesis: S₁[m + 1]
then A10: IC (Comput ((P +* I),(s +* (Initialize I)),m)) = IC (Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),m)) by COMPOS_1:24;
dom (P +* I) = NAT by PARTFUN1:def 4;
then A11: (P +* I) /. (IC (Comput ((P +* I),(s +* (Initialize I)),m))) = (P +* I) . (IC (Comput ((P +* I),(s +* (Initialize I)),m))) by PARTFUN1:def 8;
dom (P +* (I ';' J)) = NAT by PARTFUN1:def 4;
then A12: (P +* (I ';' J)) /. (IC (Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),m))) = (P +* (I ';' J)) . (IC (Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),m))) by PARTFUN1:def 8;
A13: I ';' J c= P +* (I ';' J) by FUNCT_4:26;
A14: CurInstr ((P +* I),(Comput ((P +* I),(s +* (Initialize I)),m))) = I . (IC (Comput ((P +* I),(s +* (Initialize I)),m))) by A8, A11, GRFUNC_1:8, A7;
then I . (IC (Comput ((P +* I),(s +* (Initialize I)),m))) <> halt SCM+FSA by A1, EXTPRO_1:30;
then CurInstr ((P +* I),(Comput ((P +* I),(s +* (Initialize I)),m))) = (I ';' J) . (IC (Comput ((P +* I),(s +* (Initialize I)),m))) by A8, A14, SCMFSA6A:54
.= CurInstr ((P +* (I ';' J)),(Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),m))) by A10, A8, A4, A12, GRFUNC_1:8, A13 ;
hence S₁[m + 1] by A9, A5, A6, AMISTD_2:def 20; :: thesis: verum

end;

A15: ( Comput ((P +* I),(s +* (Initialize I)),0) = s +* (Initialize I) & Comput ((P +* (I ';' J)),(s +* (Initialize (I ';' J))),0) = s +* (Initialize (I ';' J)) ) by EXTPRO_1:3;
A16: ( (Initialize s) +* I, Initialize s equal_outside NAT & Initialize s,(Initialize s) +* (I ';' J) equal_outside NAT ) by FUNCT_7:28, FUNCT_7:132;
A17: s +* (Initialize (I ';' J)) = Initialize (s +* (I ';' J)) by FUNCT_4:15
.= (Initialize s) +* (I ';' J) by COMPOS_1:83 ;
s +* (Initialize I) = Initialize (s +* I) by FUNCT_4:15
.= (Initialize s) +* I by COMPOS_1:83 ;
then A18: S₁[ 0 ] by A17, A16, A15, FUNCT_7:29;
thus for k being Element of NAT holds S₁[k] from NAT_1:sch 1(A18, A3); :: thesis: verum