let IL be non empty set ; :: thesis: for N being with_non-empty_elements set
for S being non empty stored-program halting IC-Ins-separated steady-programmed definite AMI-Struct of IL,N
for s being State of S
for k being Element of NAT st s . (IC (Computation s,k)) = halt S holds
Result s = Computation s,k
let N be with_non-empty_elements set ; :: thesis: for S being non empty stored-program halting IC-Ins-separated steady-programmed definite AMI-Struct of IL,N
for s being State of S
for k being Element of NAT st s . (IC (Computation s,k)) = halt S holds
Result s = Computation s,k
let S be non empty stored-program halting IC-Ins-separated steady-programmed definite AMI-Struct of IL,N; :: thesis: for s being State of S
for k being Element of NAT st s . (IC (Computation s,k)) = halt S holds
Result s = Computation s,k
let s be State of S; :: thesis: for k being Element of NAT st s . (IC (Computation s,k)) = halt S holds
Result s = Computation s,k
let k be Element of NAT ; :: thesis: ( s . (IC (Computation s,k)) = halt S implies Result s = Computation s,k )
assume A1: s . (IC (Computation s,k)) = halt S ; :: thesis: Result s = Computation s,k
A2: CurInstr (Computation s,k) = halt S by A1, Th54;
then s is halting by Def20;
hence Result s = Computation s,k by A2, Def22; :: thesis: verum