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 definite AMI-Struct of IL,N
for s being State of S st s is halting holds
Result s = Computation s,(LifeSpan s)
let N be with_non-empty_elements set ; :: thesis: for S being non empty stored-program halting IC-Ins-separated definite AMI-Struct of IL,N
for s being State of S st s is halting holds
Result s = Computation s,(LifeSpan s)
let S be non empty stored-program halting IC-Ins-separated definite AMI-Struct of IL,N; :: thesis: for s being State of S st s is halting holds
Result s = Computation s,(LifeSpan s)
let s be State of S; :: thesis: ( s is halting implies Result s = Computation s,(LifeSpan s) )
assume A1: s is halting ; :: thesis: Result s = Computation s,(LifeSpan s)
then A2: CurInstr (Computation s,(LifeSpan s)) = halt S by Def46;
consider m being Element of NAT such that
A3: Result s = Computation s,m and
A4: CurInstr (Result s) = halt S by A1, Def22;
LifeSpan s <= m by A1, A3, A4, Def46;
hence Result s = Computation s,(LifeSpan s) by A2, A3, Th52; :: thesis: verum