theorem
for
q being
NAT -defined the
InstructionsF of
SCM -valued finite non
halt-free Function for
p being non
empty b1 -autonomic FinPartState of
SCM for
s1,
s2 being
State of
SCM st
p c= s1 &
p c= s2 holds
for
P1,
P2 being
Instruction-Sequence of
SCM st
q c= P1 &
q c= P2 holds
for
i being
Nat for
da being
Data-Location for
loc being
Nat for
I being
Instruction of
SCM st
I = CurInstr (
P1,
(Comput (P1,s1,i))) &
I = da >0_goto loc &
loc <> (IC (Comput (P1,s1,i))) + 1 holds
(
(Comput (P1,s1,i)) . da > 0 iff
(Comput (P2,s2,i)) . da > 0 )