let s be State of ; :: thesis: for I being parahalting Program of
for J being Program of st Initialized (stop I) c= s holds
for m being Element of NAT st m <= LifeSpan s holds
Computation s,m, Computation (s +* (Initialized (stop (I ';' J)))),m equal_outside NAT
let I be parahalting Program of ; :: thesis: for J being Program of st Initialized (stop I) c= s holds
for m being Element of NAT st m <= LifeSpan s holds
Computation s,m, Computation (s +* (Initialized (stop (I ';' J)))),m equal_outside NAT
let J be Program of ; :: thesis: ( Initialized (stop I) c= s implies for m being Element of NAT st m <= LifeSpan s holds
Computation s,m, Computation (s +* (Initialized (stop (I ';' J)))),m equal_outside NAT )
assume A1: Initialized (stop I) c= s ; :: thesis: for m being Element of NAT st m <= LifeSpan s holds
Computation s,m, Computation (s +* (Initialized (stop (I ';' J)))),m equal_outside NAT
set sIJ = stop (I ';' J);
set SS = Stop SCMPDS ;
let m be Element of NAT ; :: thesis: ( m <= LifeSpan s implies Computation s,m, Computation (s +* (Initialized (stop (I ';' J)))),m equal_outside NAT )
assume A2: m <= LifeSpan s ; :: thesis: Computation s,m, Computation (s +* (Initialized (stop (I ';' J)))),m equal_outside NAT
stop (I ';' J) = I ';' (J ';' (Stop SCMPDS )) by SCMPDS_4:46;
then s +* (Initialized (stop (I ';' J))) = s +* (I ';' (J ';' (Stop SCMPDS ))) by A1, SCMPDS_4:34;
hence Computation s,m, Computation (s +* (Initialized (stop (I ';' J)))),m equal_outside NAT by A1, A2, Th23; :: thesis: verum