let p be Instruction-Sequence of SCM+FSA; :: thesis: for s being State of SCM+FSA
for I being good InitHalting Program of SCM+FSA
for a being read-write Int-Location st not I destroys a & s . (intloc 0) = 1 holds
( Times (a,I) is_closed_on s,p & Times (a,I) is_halting_on s,p )

let s be State of SCM+FSA; :: thesis: for I being good InitHalting Program of SCM+FSA
for a being read-write Int-Location st not I destroys a & s . (intloc 0) = 1 holds
( Times (a,I) is_closed_on s,p & Times (a,I) is_halting_on s,p )

let I be good InitHalting Program of SCM+FSA; :: thesis: for a being read-write Int-Location st not I destroys a & s . (intloc 0) = 1 holds
( Times (a,I) is_closed_on s,p & Times (a,I) is_halting_on s,p )

let a be read-write Int-Location ; :: thesis: ( not I destroys a & s . (intloc 0) = 1 implies ( Times (a,I) is_closed_on s,p & Times (a,I) is_halting_on s,p ) )
assume A1: not I destroys a ; :: thesis: ( not s . (intloc 0) = 1 or ( Times (a,I) is_closed_on s,p & Times (a,I) is_halting_on s,p ) )
assume A2: s . (intloc 0) = 1 ; :: thesis: ( Times (a,I) is_closed_on s,p & Times (a,I) is_halting_on s,p )
per cases ( s . a > 0 or s . a <= 0 ) ;
end;