let s be State of ; :: thesis: ( ProgramPart s halts_on s implies for k being Element of NAT st LifeSpan s <= k holds
CurInstr (Computation s,k) = halt SCM+FSA )
assume ProgramPart s halts_on s ; :: thesis: for k being Element of NAT st LifeSpan s <= k holds
CurInstr (Computation s,k) = halt SCM+FSA
then A1: CurInstr (Computation s,(LifeSpan s)) = halt SCM+FSA by AMI_1:def 46;
let k be Element of NAT ; :: thesis: ( LifeSpan s <= k implies CurInstr (Computation s,k) = halt SCM+FSA )
assume LifeSpan s <= k ; :: thesis: CurInstr (Computation s,k) = halt SCM+FSA
hence CurInstr (Computation s,k) = halt SCM+FSA by A1, AMI_1:52; :: thesis: verum