theorem Th48:
for
s being
State of
SCM+FSA for
p being
Instruction-Sequence of
SCM+FSA for
k being
Nat for
a being
read-write Int-Location for
J being
good really-closed MacroInstruction of
SCM+FSA st not
J destroys a &
((StepTimes (a,J,p,s)) . k) . (intloc 0) = 1 &
J is_halting_on (StepTimes (a,J,p,s)) . k,
p +* (Times (a,J)) holds
(
((StepTimes (a,J,p,s)) . (k + 1)) . (intloc 0) = 1 & (
((StepTimes (a,J,p,s)) . k) . a > 0 implies
((StepTimes (a,J,p,s)) . (k + 1)) . a = (((StepTimes (a,J,p,s)) . k) . a) - 1 ) )