let s be State of ; :: thesis: for P being initial FinPartState of st P is_pseudo-closed_on s holds
for n being Element of NAT st n < pseudo-LifeSpan s,P holds
( IC (Computation (s +* (P +* (Start-At (insloc 0 )))),n) in dom P & CurInstr (Computation (s +* (P +* (Start-At (insloc 0 )))),n) <> halt SCM+FSA )

let P be initial FinPartState of ; :: thesis: ( P is_pseudo-closed_on s implies for n being Element of NAT st n < pseudo-LifeSpan s,P holds
( IC (Computation (s +* (P +* (Start-At (insloc 0 )))),n) in dom P & CurInstr (Computation (s +* (P +* (Start-At (insloc 0 )))),n) <> halt SCM+FSA ) )

set k = pseudo-LifeSpan s,P;
assume A1: P is_pseudo-closed_on s ; :: thesis: for n being Element of NAT st n < pseudo-LifeSpan s,P holds
( IC (Computation (s +* (P +* (Start-At (insloc 0 )))),n) in dom P & CurInstr (Computation (s +* (P +* (Start-At (insloc 0 )))),n) <> halt SCM+FSA )

then A2: IC (Computation (s +* (P +* (Start-At (insloc 0 )))),(pseudo-LifeSpan s,P)) = insloc (card (ProgramPart P)) by Def5;
hereby :: thesis: verum end;