let N be non empty with_non-empty_elements set ; :: thesis: for S being non empty stored-program halting IC-Ins-separated steady-programmed definite AMI-Struct of N
for s being State of S
for m being Element of NAT holds
( ProgramPart s halts_on s iff ProgramPart s halts_on Comput (ProgramPart s),s,m )

let S be non empty stored-program halting IC-Ins-separated steady-programmed definite AMI-Struct of N; :: thesis: for s being State of S
for m being Element of NAT holds
( ProgramPart s halts_on s iff ProgramPart s halts_on Comput (ProgramPart s),s,m )

let s be State of S; :: thesis: for m being Element of NAT holds
( ProgramPart s halts_on s iff ProgramPart s halts_on Comput (ProgramPart s),s,m )

let m be Element of NAT ; :: thesis: ( ProgramPart s halts_on s iff ProgramPart s halts_on Comput (ProgramPart s),s,m )
Y: ProgramPart (Comput (ProgramPart s),s,m) = ProgramPart s by LmY;
hereby :: thesis: ( ProgramPart s halts_on Comput (ProgramPart s),s,m implies ProgramPart s halts_on s ) end;
given n being Element of NAT such that W1: IC (Comput (ProgramPart (Comput (ProgramPart s),s,m)),(Comput (ProgramPart s),s,m),n) in dom (ProgramPart s) and
W2: (ProgramPart s) /. (IC (Comput (ProgramPart (Comput (ProgramPart s),s,m)),(Comput (ProgramPart s),s,m),n)) = halt S ; :: according to AMI_1:def 20 :: thesis: ProgramPart s halts_on s
take m + n ; :: according to AMI_1:def 20 :: thesis: ( IC (Comput (ProgramPart s),s,(m + n)) in dom (ProgramPart s) & (ProgramPart s) /. (IC (Comput (ProgramPart s),s,(m + n))) = halt S )
thus ( IC (Comput (ProgramPart s),s,(m + n)) in dom (ProgramPart s) & (ProgramPart s) /. (IC (Comput (ProgramPart s),s,(m + n))) = halt S ) by W1, W2, Th51, Y; :: thesis: verum