let i, j be Element of NAT ; :: thesis: for N being with_non-empty_elements set st i <= j holds
for S being non empty stored-program halting IC-Ins-separated steady-programmed definite AMI-Struct of N
for s being State of S st s halts_at IC (Computation s,i) holds
s halts_at IC (Computation s,j)
let N be with_non-empty_elements set ; :: thesis: ( i <= j implies for S being non empty stored-program halting IC-Ins-separated steady-programmed definite AMI-Struct of N
for s being State of S st s halts_at IC (Computation s,i) holds
s halts_at IC (Computation s,j) )
assume A1: i <= j ; :: 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 st s halts_at IC (Computation s,i) holds
s halts_at IC (Computation s,j)
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 st s halts_at IC (Computation s,i) holds
s halts_at IC (Computation s,j)
let s be State of S; :: thesis: ( s halts_at IC (Computation s,i) implies s halts_at IC (Computation s,j) )
assume A2: s . (IC (Computation s,i)) = halt S ; :: according to AMI_1:def 42 :: thesis: s halts_at IC (Computation s,j)
then CurInstr (Computation s,i) = halt S by Th54;
hence s . (IC (Computation s,j)) = halt S by A1, A2, Th52; :: according to AMI_1:def 42 :: thesis: verum