theorem Th13:
for
p being
Instruction-Sequence of
SCM+FSA for
I being
really-closed InitHalting keepInt0_1 Program of
SCM+FSA for
J being
really-closed InitHalting Program of
SCM+FSA for
s being
State of
SCM+FSA st
Initialize ((intloc 0) .--> 1) c= s &
I ";" J c= p holds
(
IC (Comput (p,s,((LifeSpan ((p +* I),s)) + 1))) = card I &
DataPart (Comput (p,s,((LifeSpan ((p +* I),s)) + 1))) = DataPart ((Comput ((p +* I),s,(LifeSpan ((p +* I),s)))) +* (Initialize ((intloc 0) .--> 1))) &
Reloc (
J,
(card I))
c= p &
(Comput (p,s,((LifeSpan ((p +* I),s)) + 1))) . (intloc 0) = 1 &
p halts_on s &
LifeSpan (
p,
s)
= ((LifeSpan ((p +* I),s)) + 1) + (LifeSpan (((p +* I) +* J),((Result ((p +* I),s)) +* (Initialize ((intloc 0) .--> 1))))) & (
J is
keeping_0 implies
(Result (p,s)) . (intloc 0) = 1 ) )