let s be State of SCMPDS ; :: thesis: for I being parahalting Program of SCMPDS
for J being Program of SCMPDS
for k being Element of NAT st k <= LifeSpan (s +* (Initialized (stop I))) holds
Computation (s +* (Initialized (stop I))),k, Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),k equal_outside NAT
let I be parahalting Program of SCMPDS ; :: thesis: for J being Program of SCMPDS
for k being Element of NAT st k <= LifeSpan (s +* (Initialized (stop I))) holds
Computation (s +* (Initialized (stop I))),k, Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),k equal_outside NAT
let J be Program of SCMPDS ; :: thesis: for k being Element of NAT st k <= LifeSpan (s +* (Initialized (stop I))) holds
Computation (s +* (Initialized (stop I))),k, Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),k equal_outside NAT
let k be Element of NAT ; :: thesis: ( k <= LifeSpan (s +* (Initialized (stop I))) implies Computation (s +* (Initialized (stop I))),k, Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),k equal_outside NAT )
set SA0 = Start-At (inspos 0 );
set spI = stop I;
set IsI = Initialized (stop I);
set s1 = s +* (Initialized (stop I));
set s2 = s +* ((I ';' J) +* (Start-At (inspos 0 )));
set n = LifeSpan (s +* (Initialized (stop I)));
assume A1:
k <= LifeSpan (s +* (Initialized (stop I)))
; :: thesis: Computation (s +* (Initialized (stop I))),k, Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),k equal_outside NAT
A2:
Initialized (stop I) c= s +* (Initialized (stop I))
by FUNCT_4:26;
A3: s +* (Initialized (stop I)) =
(s +* (stop I)) +* (Start-At (inspos 0 ))
by FUNCT_4:15
.=
(s +* (Start-At (inspos 0 ))) +* (stop I)
by SCMPDS_4:62
;
A4: s +* ((I ';' J) +* (Start-At (inspos 0 ))) =
(s +* (I ';' J)) +* (Start-At (inspos 0 ))
by FUNCT_4:15
.=
(s +* (Start-At (inspos 0 ))) +* (I ';' J)
by SCMPDS_4:62
;
set IL = NAT ;
A5:
(s +* (Start-At (inspos 0 ))) +* (stop I),s +* (Start-At (inspos 0 )) equal_outside NAT
by AMI_1:120, FUNCT_7:28;
defpred S1[ Element of NAT ] means ( $1 <= LifeSpan (s +* (Initialized (stop I))) implies Computation (s +* (Initialized (stop I))),$1, Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),$1 equal_outside NAT );
A6:
s +* (Start-At (inspos 0 )),(s +* (Start-At (inspos 0 ))) +* (I ';' J) equal_outside NAT
by AMI_1:120;
( Computation (s +* (Initialized (stop I))),0 = s +* (Initialized (stop I)) & Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),0 = s +* ((I ';' J) +* (Start-At (inspos 0 ))) )
by AMI_1:13;
then A7:
S1[ 0 ]
by A3, A4, A5, A6, FUNCT_7:29;
A8:
for n being Element of NAT st S1[n] holds
S1[n + 1]
proof
let m be
Element of
NAT ;
:: thesis: ( S1[m] implies S1[m + 1] )
assume A9:
(
m <= LifeSpan (s +* (Initialized (stop I))) implies
Computation (s +* (Initialized (stop I))),
m,
Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),
m equal_outside NAT )
;
:: thesis: S1[m + 1]
assume A10:
m + 1
<= LifeSpan (s +* (Initialized (stop I)))
;
:: thesis: Computation (s +* (Initialized (stop I))),(m + 1), Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),(m + 1) equal_outside NAT
then A11:
m < LifeSpan (s +* (Initialized (stop I)))
by NAT_1:13;
A12:
Computation (s +* (Initialized (stop I))),
(m + 1) =
Following (Computation (s +* (Initialized (stop I))),m)
by AMI_1:14
.=
Exec (CurInstr (Computation (s +* (Initialized (stop I))),m)),
(Computation (s +* (Initialized (stop I))),m)
;
A13:
Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),
(m + 1) =
Following (Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),m)
by AMI_1:14
.=
Exec (CurInstr (Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),m)),
(Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),m)
;
A14:
IC (Computation (s +* (Initialized (stop I))),m) = IC (Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),m)
by A9, A10, AMI_1:121, NAT_1:13;
A15:
IC (Computation (s +* (Initialized (stop I))),m) in dom (stop I)
by A2, SCMPDS_4:def 9;
A16:
IC (Computation (s +* (Initialized (stop I))),m) in dom I
by A11, Th28;
then A17:
IC (Computation (s +* (Initialized (stop I))),m) in dom (I ';' J)
by FUNCT_4:13;
CurInstr (Computation (s +* (Initialized (stop I))),m) =
(s +* (Initialized (stop I))) . (IC (Computation (s +* (Initialized (stop I))),m))
by AMI_1:54
.=
(stop I) . (IC (Computation (s +* (Initialized (stop I))),m))
by A3, A15, FUNCT_4:14
.=
I . (IC (Computation (s +* (Initialized (stop I))),m))
by A16, SCMPDS_4:37
.=
(I ';' J) . (IC (Computation (s +* (Initialized (stop I))),m))
by A16, SCMPDS_4:37
.=
(s +* ((I ';' J) +* (Start-At (inspos 0 )))) . (IC (Computation (s +* (Initialized (stop I))),m))
by A4, A17, FUNCT_4:14
.=
CurInstr (Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),m)
by A14, AMI_1:54
;
hence
Computation (s +* (Initialized (stop I))),
(m + 1),
Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),
(m + 1) equal_outside NAT
by A9, A10, A12, A13, NAT_1:13, SCMPDS_4:15;
:: thesis: verum
end;
for k being Element of NAT holds S1[k]
from NAT_1:sch 1(A7, A8);
hence
Computation (s +* (Initialized (stop I))),k, Computation (s +* ((I ';' J) +* (Start-At (inspos 0 )))),k equal_outside NAT
by A1; :: thesis: verum