let p be non NAT -defined autonomic FinPartState of SCM ; :: thesis: for s1, s2 being State of SCM st p c= s1 & p c= s2 holds
for i being Element of NAT
for I being Instruction of SCM st I = CurInstr (Computation s1,i) holds
( IC (Computation s1,i) = IC (Computation s2,i) & I = CurInstr (Computation s2,i) )
let s1, s2 be State of SCM ; :: thesis: ( p c= s1 & p c= s2 implies for i being Element of NAT
for I being Instruction of SCM st I = CurInstr (Computation s1,i) holds
( IC (Computation s1,i) = IC (Computation s2,i) & I = CurInstr (Computation s2,i) ) )
assume A1: ( p c= s1 & p c= s2 ) ; :: thesis: for i being Element of NAT
for I being Instruction of SCM st I = CurInstr (Computation s1,i) holds
( IC (Computation s1,i) = IC (Computation s2,i) & I = CurInstr (Computation s2,i) )
let i be Element of NAT ; :: thesis: for I being Instruction of SCM st I = CurInstr (Computation s1,i) holds
( IC (Computation s1,i) = IC (Computation s2,i) & I = CurInstr (Computation s2,i) )
let I be Instruction of SCM ; :: thesis: ( I = CurInstr (Computation s1,i) implies ( IC (Computation s1,i) = IC (Computation s2,i) & I = CurInstr (Computation s2,i) ) )
assume A2: I = CurInstr (Computation s1,i) ; :: thesis: ( IC (Computation s1,i) = IC (Computation s2,i) & I = CurInstr (Computation s2,i) )
set Cs1i = Computation s1,i;
set Cs2i = Computation s2,i;
thus A3: IC (Computation s1,i) = IC (Computation s2,i) :: thesis: I = CurInstr (Computation s2,i)

proof

assume A4: IC (Computation s1,i) <> IC (Computation s2,i) ; :: thesis: contradiction
( ((Computation s1,i) | (dom p)) . (IC SCM ) = (Computation s1,i) . (IC SCM ) & ((Computation s2,i) | (dom p)) . (IC SCM ) = (Computation s2,i) . (IC SCM ) ) by Th84, FUNCT_1:72;
hence contradiction by A1, A4, AMI_1:def 25; :: thesis: verum

end;

thus I = CurInstr (Computation s2,i) :: thesis: verum

proof

assume A5: I <> CurInstr (Computation s2,i) ; :: thesis: contradiction
A6: ( IC (Computation s1,i) in dom (ProgramPart p) & IC (Computation s2,i) in dom (ProgramPart p) ) by A1, Th86;
ProgramPart p c= p by RELAT_1:88;
then dom (ProgramPart p) c= dom p by GRFUNC_1:8;
then ( ((Computation s1,i) | (dom p)) . (IC (Computation s1,i)) = (Computation s1,i) . (IC (Computation s1,i)) & ((Computation s2,i) | (dom p)) . (IC (Computation s2,i)) = (Computation s2,i) . (IC (Computation s2,i)) ) by A6, FUNCT_1:72;
hence contradiction by A1, A2, A3, A5, AMI_1:def 25; :: thesis: verum

end;