let I be Program of SCM+FSA ; :: thesis: ( I is InitClosed iff for s being State of SCM+FSA holds I is_closed_onInit s )
hereby :: thesis: ( ( for s being State of SCM+FSA holds I is_closed_onInit s ) implies I is InitClosed ) end;
assume A2: for s being State of SCM+FSA holds I is_closed_onInit s ; :: thesis: I is InitClosed
now
let s be State of SCM+FSA ; :: thesis: for k being Element of NAT st Initialized I c= s holds
IC (Comput (ProgramPart s),s,k) in dom I

let k be Element of NAT ; :: thesis: ( Initialized I c= s implies IC (Comput (ProgramPart s),s,k) in dom I )
assume Initialized I c= s ; :: thesis: IC (Comput (ProgramPart s),s,k) in dom I
then A3: s = s +* (Initialized I) by FUNCT_4:79;
I is_closed_onInit s by A2;
hence IC (Comput (ProgramPart s),s,k) in dom I by A3, Def4; :: thesis: verum
end;
hence I is InitClosed by Def1; :: thesis: verum