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 st ex k being Element of NAT st s halts_at IC (Computation s,k) holds
for i being Element of NAT holds Result s = Result (Computation s,i)
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 st ex k being Element of NAT st s halts_at IC (Computation s,k) holds
for i being Element of NAT holds Result s = Result (Computation s,i)
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 st ex k being Element of NAT st s halts_at IC (Computation s,k) holds
for i being Element of NAT holds Result s = Result (Computation s,i)
let s be State of S; :: thesis: ( ex k being Element of NAT st s halts_at IC (Computation s,k) implies for i being Element of NAT holds Result s = Result (Computation s,i) )
given k being Element of NAT such that A1: s halts_at IC (Computation s,k) ; :: thesis: for i being Element of NAT holds Result s = Result (Computation s,i)
let i be Element of NAT ; :: thesis: Result s = Result (Computation s,i)
s . (IC (Computation s,k)) = halt S by A1, Def42;
hence Result s = Result (Computation s,i) by Th57; :: thesis: verum