let s be State of ; :: thesis: for I being Program of
for i being Element of NAT st Initialized (stop I) c= s & I is_closed_on s & I is_halting_on s & i < LifeSpan s holds
IC (Computation s,i) in dom I
let I be Program of ; :: thesis: for i being Element of NAT st Initialized (stop I) c= s & I is_closed_on s & I is_halting_on s & i < LifeSpan s holds
IC (Computation s,i) in dom I
let i be Element of NAT ; :: thesis: ( Initialized (stop I) c= s & I is_closed_on s & I is_halting_on s & i < LifeSpan s implies IC (Computation s,i) in dom I )
set sI = stop I;
set iI = Initialized (stop I);
set Ci = Computation s,i;
set Lc = IC (Computation s,i);
assume that
A1: Initialized (stop I) c= s and
A2: I is_closed_on s and
A3: I is_halting_on s and
A4: i < LifeSpan s ; :: thesis: IC (Computation s,i) in dom I
A5: s = s +* (Initialized (stop I)) by A1, FUNCT_4:79;
then A6: IC (Computation s,i) in dom (stop I) by A2, SCMPDS_6:def 2;
stop I c= Initialized (stop I) by SCMPDS_4:9;
then A7: stop I c= s by A1, XBOOLE_1:1;
A8: ProgramPart s halts_on s by A3, A5, SCMPDS_6:def 3;

now

assume A9: (stop I) . (IC (Computation s,i)) = halt SCMPDS ; :: thesis: contradiction
CurInstr (Computation s,i) = s . (IC (Computation s,i)) by AMI_1:54
.= halt SCMPDS by A6, A7, A9, GRFUNC_1:8 ;
hence contradiction by A4, A8, AMI_1:def 46; :: thesis: verum

end;

hence IC (Computation s,i) in dom I by A6, SCMPDS_5:3; :: thesis: verum