let s1, s2 be State of SCM+FSA ; :: thesis: for J being parahalting Program of SCM+FSA st J +* (Start-At (insloc 0 )) c= s1 holds
for n being Element of NAT st ProgramPart (Relocated J,n) c= s2 & IC s2 = insloc n & DataPart s1 = DataPart s2 holds
for i being Element of NAT holds
( (IC (Computation s1,i)) + n = IC (Computation s2,i) & IncAddr (CurInstr (Computation s1,i)),n = CurInstr (Computation s2,i) & DataPart (Computation s1,i) = DataPart (Computation s2,i) )

let J be parahalting Program of SCM+FSA ; :: thesis: ( J +* (Start-At (insloc 0 )) c= s1 implies for n being Element of NAT st ProgramPart (Relocated J,n) c= s2 & IC s2 = insloc n & DataPart s1 = DataPart s2 holds
for i being Element of NAT holds
( (IC (Computation s1,i)) + n = IC (Computation s2,i) & IncAddr (CurInstr (Computation s1,i)),n = CurInstr (Computation s2,i) & DataPart (Computation s1,i) = DataPart (Computation s2,i) ) )

assume A1: J +* (Start-At (insloc 0 )) c= s1 ; :: thesis: for n being Element of NAT st ProgramPart (Relocated J,n) c= s2 & IC s2 = insloc n & DataPart s1 = DataPart s2 holds
for i being Element of NAT holds
( (IC (Computation s1,i)) + n = IC (Computation s2,i) & IncAddr (CurInstr (Computation s1,i)),n = CurInstr (Computation s2,i) & DataPart (Computation s1,i) = DataPart (Computation s2,i) )

set JAt = J +* (Start-At (insloc 0 ));
let n be Element of NAT ; :: thesis: ( ProgramPart (Relocated J,n) c= s2 & IC s2 = insloc n & DataPart s1 = DataPart s2 implies for i being Element of NAT holds
( (IC (Computation s1,i)) + n = IC (Computation s2,i) & IncAddr (CurInstr (Computation s1,i)),n = CurInstr (Computation s2,i) & DataPart (Computation s1,i) = DataPart (Computation s2,i) ) )

assume that
A2: ProgramPart (Relocated J,n) c= s2 and
A3: IC s2 = insloc n and
A4: DataPart s1 = DataPart s2 ; :: thesis: for i being Element of NAT holds
( (IC (Computation s1,i)) + n = IC (Computation s2,i) & IncAddr (CurInstr (Computation s1,i)),n = CurInstr (Computation s2,i) & DataPart (Computation s1,i) = DataPart (Computation s2,i) )

let i be Element of NAT ; :: thesis: ( (IC (Computation s1,i)) + n = IC (Computation s2,i) & IncAddr (CurInstr (Computation s1,i)),n = CurInstr (Computation s2,i) & DataPart (Computation s1,i) = DataPart (Computation s2,i) )
defpred S1[ Element of NAT ] means ( (IC (Computation s1,$1)) + n = IC (Computation s2,$1) & IncAddr (CurInstr (Computation s1,$1)),n = CurInstr (Computation s2,$1) & DataPart (Computation s1,$1) = DataPart (Computation s2,$1) );
A5: S1[ 0 ]
proof
A6: IC SCM+FSA in dom (J +* (Start-At (insloc 0 ))) by SF_MASTR:65;
insloc 0 in dom J by Th26;
then (insloc 0 ) + n in dom (Relocated J,n) by SCMFSA_5:4;
then A7: insloc (0 + n) in dom (ProgramPart (Relocated J,n)) by AMI_1:106;
IC (Computation s1,0 ) = s1 . (IC SCM+FSA ) by AMI_1:13
.= (J +* (Start-At (insloc 0 ))) . (IC SCM+FSA ) by A1, A6, GRFUNC_1:8
.= insloc 0 by SF_MASTR:66 ;
hence (IC (Computation s1,0 )) + n = IC (Computation s2,0 ) by A3, AMI_1:13; :: thesis: ( IncAddr (CurInstr (Computation s1,0 )),n = CurInstr (Computation s2,0 ) & DataPart (Computation s1,0 ) = DataPart (Computation s2,0 ) )
dom J misses dom (Start-At (insloc 0 )) by SF_MASTR:64;
then A8: J c= J +* (Start-At (insloc 0 )) by FUNCT_4:33;
then A9: dom J c= dom (J +* (Start-At (insloc 0 ))) by GRFUNC_1:8;
A10: insloc 0 in dom J by Th26;
A11: s1 . (IC s1) = s1 . ((J +* (Start-At (insloc 0 ))) . (IC SCM+FSA )) by A1, A6, GRFUNC_1:8
.= s1 . (insloc 0 ) by SF_MASTR:66
.= (J +* (Start-At (insloc 0 ))) . (insloc 0 ) by A1, A9, A10, GRFUNC_1:8
.= J . (insloc 0 ) by A8, A10, GRFUNC_1:8 ;
ProgramPart J = J by AMI_1:105;
then A12: insloc 0 in dom (ProgramPart J) by Th26;
thus IncAddr (CurInstr (Computation s1,0 )),n = IncAddr (CurInstr s1),n by AMI_1:13
.= (Relocated J,n) . ((insloc 0 ) + n) by A11, A12, SCMFSA_5:7
.= (ProgramPart (Relocated J,n)) . (insloc n) by FUNCT_1:72
.= CurInstr s2 by A2, A3, A7, GRFUNC_1:8
.= CurInstr (Computation s2,0 ) by AMI_1:13 ; :: thesis: DataPart (Computation s1,0 ) = DataPart (Computation s2,0 )
thus DataPart (Computation s1,0 ) = DataPart s2 by A4, AMI_1:13
.= DataPart (Computation s2,0 ) by AMI_1:13 ; :: thesis: verum
end;
A13: for k being Element of NAT st S1[k] holds
S1[k + 1]
proof
let k be Element of NAT ; :: thesis: ( S1[k] implies S1[k + 1] )
assume A14: S1[k] ; :: thesis: S1[k + 1]
A15: Computation s1,(k + 1) = Following (Computation s1,k) by AMI_1:14
.= Exec (CurInstr (Computation s1,k)),(Computation s1,k) ;
A16: Computation s2,(k + 1) = Following (Computation s2,k) by AMI_1:14
.= Exec (CurInstr (Computation s2,k)),(Computation s2,k) ;
hence A17: (IC (Computation s1,(k + 1))) + n = IC (Computation s2,(k + 1)) by A14, A15, SCMFSA6A:41; :: thesis: ( IncAddr (CurInstr (Computation s1,(k + 1))),n = CurInstr (Computation s2,(k + 1)) & DataPart (Computation s1,(k + 1)) = DataPart (Computation s2,(k + 1)) )
reconsider j = CurInstr (Computation s1,(k + 1)) as Instruction of SCM+FSA ;
reconsider l = IC (Computation s1,(k + 1)) as Element of NAT by ORDINAL1:def 13;
dom J misses dom (Start-At (insloc 0 )) by SF_MASTR:64;
then A18: J c= J +* (Start-At (insloc 0 )) by FUNCT_4:33;
then A19: dom J c= dom (J +* (Start-At (insloc 0 ))) by GRFUNC_1:8;
A21: IC (Computation s1,(k + 1)) in dom J by A1, Def2;
dom (ProgramPart J) = (dom J) /\ NAT by RELAT_1:90;
then A22: l in dom (ProgramPart J) by A21, XBOOLE_0:def 4;
A23: j = s1 . (IC (Computation s1,(k + 1))) by AMI_1:54
.= (J +* (Start-At (insloc 0 ))) . (IC (Computation s1,(k + 1))) by A1, A19, A21, GRFUNC_1:8
.= J . l by A18, A21, GRFUNC_1:8 ;
A24: IC (Computation s2,(k + 1)) in NAT by AMI_1:def 4;
IC (Computation s2,(k + 1)) in dom (Relocated J,n) by A17, A21, SCMFSA_5:4;
then IC (Computation s2,(k + 1)) in (dom (Relocated J,n)) /\ NAT by A24, XBOOLE_0:def 4;
then A25: IC (Computation s2,(k + 1)) in dom (ProgramPart (Relocated J,n)) by RELAT_1:90;
thus IncAddr (CurInstr (Computation s1,(k + 1))),n = (Relocated J,n) . (l + n) by A22, A23, SCMFSA_5:7
.= (ProgramPart (Relocated J,n)) . (IC (Computation s2,(k + 1))) by A17, FUNCT_1:72
.= s2 . (IC (Computation s2,(k + 1))) by A2, A25, GRFUNC_1:8
.= CurInstr (Computation s2,(k + 1)) by AMI_1:54 ; :: thesis: DataPart (Computation s1,(k + 1)) = DataPart (Computation s2,(k + 1))
thus DataPart (Computation s1,(k + 1)) = DataPart (Computation s2,(k + 1)) by A14, A15, A16, SCMFSA6A:41; :: thesis: verum
end;
for k being Element of NAT holds S1[k] from NAT_1:sch 1(A5, A13);
hence ( (IC (Computation s1,i)) + n = IC (Computation s2,i) & IncAddr (CurInstr (Computation s1,i)),n = CurInstr (Computation s2,i) & DataPart (Computation s1,i) = DataPart (Computation s2,i) ) ; :: thesis: verum