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 halts_at IC (Computation s,k) 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 halts_at IC (Computation s,k) 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 halts_at IC (Computation s,k) holds
Result s = Computation s,k
let s be State of S; :: thesis: for k being Element of NAT st s halts_at IC (Computation s,k) holds
Result s = Computation s,k
let k be Element of NAT ; :: thesis: ( s halts_at IC (Computation s,k) implies Result s = Computation s,k )
assume A1: s halts_at IC (Computation s,k) ; :: thesis: Result s = Computation s,k
then s is halting by Th83;
hence Result s = Computation s,k by A1, Th85; :: thesis: verum