let j be Element of NAT ; :: thesis: for IL being non empty set
for N being non empty 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 LifeSpan s <= j & s is halting holds
Computation s,j = Computation s,(LifeSpan s)
let IL be non empty set ; :: thesis: for N being non empty 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 LifeSpan s <= j & s is halting holds
Computation s,j = Computation s,(LifeSpan s)
let N be non empty 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 LifeSpan s <= j & s is halting holds
Computation s,j = 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 LifeSpan s <= j & s is halting holds
Computation s,j = Computation s,(LifeSpan s)
let s be State of S; :: thesis: ( LifeSpan s <= j & s is halting implies Computation s,j = Computation s,(LifeSpan s) )
assume that
A1: LifeSpan s <= j and
A2: s is halting ; :: thesis: Computation s,j = Computation s,(LifeSpan s)
CurInstr (Computation s,(LifeSpan s)) = halt S by A2, Def46;
hence Computation s,j = Computation s,(LifeSpan s) by A1, Th52; :: thesis: verum