let q be NAT -defined the InstructionsF of SCM+FSA -valued finite non halt-free Function; :: according to AMISTD_5:def 4 :: thesis: for b1 being set
for b2 being set holds
( not b1 c= b2 or for b3 being set holds
( not q c= b3 or for b4 being set holds IC (Comput (b3,b2,b4)) in dom q ) )

let p be non empty q -autonomic FinPartState of SCM+FSA; :: thesis: for b1 being set holds
( not p c= b1 or for b2 being set holds
( not q c= b2 or for b3 being set holds IC (Comput (b2,b1,b3)) in dom q ) )

let s be State of SCM+FSA; :: thesis: ( not p c= s or for b1 being set holds
( not q c= b1 or for b2 being set holds IC (Comput (b1,s,b2)) in dom q ) )

assume A1: p c= s ; :: thesis: for b1 being set holds
( not q c= b1 or for b2 being set holds IC (Comput (b1,s,b2)) in dom q )

let P be Instruction-Sequence of SCM+FSA; :: thesis: ( not q c= P or for b1 being set holds IC (Comput (P,s,b1)) in dom q )
assume A2: q c= P ; :: thesis: for b1 being set holds IC (Comput (P,s,b1)) in dom q
let i be Nat; :: thesis: IC (Comput (P,s,i)) in dom q
set Csi = Comput (P,s,i);
set loc = IC (Comput (P,s,i));
set loc1 = (IC (Comput (P,s,i))) + 1;
assume A3: not IC (Comput (P,s,i)) in dom q ; :: thesis: contradiction
set I = () := ();
set q1 = q +* ((IC (Comput (P,s,i))) .--> (() := ()));
set q2 = q +* ((IC (Comput (P,s,i))) .--> ());
reconsider P1 = P +* ((IC (Comput (P,s,i))) .--> (() := ())) as Instruction-Sequence of SCM+FSA ;
reconsider P2 = P +* ((IC (Comput (P,s,i))) .--> ()) as Instruction-Sequence of SCM+FSA ;
A5: IC (Comput (P,s,i)) in dom ((IC (Comput (P,s,i))) .--> ()) by TARSKI:def 1;
A7: IC (Comput (P,s,i)) in dom ((IC (Comput (P,s,i))) .--> (() := ())) by TARSKI:def 1;
A8: dom q misses dom ((IC (Comput (P,s,i))) .--> ()) by ;
A9: dom q misses dom ((IC (Comput (P,s,i))) .--> (() := ())) by ;
A10: q +* ((IC (Comput (P,s,i))) .--> (() := ())) c= P1 by ;
A11: q +* ((IC (Comput (P,s,i))) .--> ()) c= P2 by ;
set Cs2i = Comput (P2,s,i);
set Cs1i = Comput (P1,s,i);
not p is q -autonomic
proof
((IC (Comput (P,s,i))) .--> ()) . (IC (Comput (P,s,i))) = halt SCM+FSA by FUNCOP_1:72;
then A12: P2 . (IC (Comput (P,s,i))) = halt SCM+FSA by ;
A13: ((IC (Comput (P,s,i))) .--> (() := ())) . (IC (Comput (P,s,i))) = () := () by FUNCOP_1:72;
take P1 ; :: according to EXTPRO_1:def 10 :: thesis: ex b1 being set st
( q c= P1 & q c= b1 & ex b2, b3 being set st
( p c= b2 & p c= b3 & not for b4 being set holds (Comput (P1,b2,b4)) | (dom p) = (Comput (b1,b3,b4)) | (dom p) ) )

take P2 ; :: thesis: ( q c= P1 & q c= P2 & ex b1, b2 being set st
( p c= b1 & p c= b2 & not for b3 being set holds (Comput (P1,b1,b3)) | (dom p) = (Comput (P2,b2,b3)) | (dom p) ) )

q c= q +* ((IC (Comput (P,s,i))) .--> (() := ())) by ;
hence A14: q c= P1 by ; :: thesis: ( q c= P2 & ex b1, b2 being set st
( p c= b1 & p c= b2 & not for b3 being set holds (Comput (P1,b1,b3)) | (dom p) = (Comput (P2,b2,b3)) | (dom p) ) )

q c= q +* ((IC (Comput (P,s,i))) .--> ()) by ;
hence A15: q c= P2 by ; :: thesis: ex b1, b2 being set st
( p c= b1 & p c= b2 & not for b3 being set holds (Comput (P1,b1,b3)) | (dom p) = (Comput (P2,b2,b3)) | (dom p) )

take s ; :: thesis: ex b1 being set st
( p c= s & p c= b1 & not for b2 being set holds (Comput (P1,s,b2)) | (dom p) = (Comput (P2,b1,b2)) | (dom p) )

take s ; :: thesis: ( p c= s & p c= s & not for b1 being set holds (Comput (P1,s,b1)) | (dom p) = (Comput (P2,s,b1)) | (dom p) )
thus p c= s by A1; :: thesis: ( p c= s & not for b1 being set holds (Comput (P1,s,b1)) | (dom p) = (Comput (P2,s,b1)) | (dom p) )
A16: (Comput (P1,s,i)) | (dom p) = (Comput (P,s,i)) | (dom p) by ;
thus p c= s by A1; :: thesis: not for b1 being set holds (Comput (P1,s,b1)) | (dom p) = (Comput (P2,s,b1)) | (dom p)
A17: (Comput (P1,s,i)) | (dom p) = (Comput (P2,s,i)) | (dom p) by ;
take k = i + 1; :: thesis: not (Comput (P1,s,k)) | (dom p) = (Comput (P2,s,k)) | (dom p)
set Cs1k = Comput (P1,s,k);
A18: IC in dom p by AMISTD_5:6;
IC (Comput (P,s,i)) = IC ((Comput (P,s,i)) | (dom p)) by ;
then IC (Comput (P1,s,i)) = IC (Comput (P,s,i)) by ;
then A19: CurInstr (P1,(Comput (P1,s,i))) = P1 . (IC (Comput (P,s,i))) by PBOOLE:143
.= () := () by ;
A20: Comput (P1,s,k) = Following (P1,(Comput (P1,s,i))) by EXTPRO_1:3
.= Exec ((() := ()),(Comput (P1,s,i))) by A19 ;
A21: IC (Exec ((() := ()),(Comput (P1,s,i)))) = (IC (Comput (P1,s,i))) + 1 by SCMFSA_2:63;
A22: IC in dom p by AMISTD_5:6;
A23: IC (Comput (P,s,i)) = IC ((Comput (P,s,i)) | (dom p)) by ;
then A24: IC (Comput (P1,s,k)) = (IC (Comput (P,s,i))) + 1 by
.= (IC (Comput (P,s,i))) + 1 ;
set Cs2k = Comput (P2,s,k);
A25: Comput (P2,s,k) = Following (P2,(Comput (P2,s,i))) by EXTPRO_1:3
.= Exec ((CurInstr (P2,(Comput (P2,s,i)))),(Comput (P2,s,i))) ;
A26: P2 /. (IC (Comput (P2,s,i))) = P2 . (IC (Comput (P2,s,i))) by PBOOLE:143;
IC (Comput (P2,s,i)) = IC (Comput (P,s,i)) by ;
then A27: IC (Comput (P2,s,k)) = IC (Comput (P,s,i)) by ;
( IC ((Comput (P1,s,k)) | (dom p)) = IC (Comput (P1,s,k)) & IC ((Comput (P2,s,k)) | (dom p)) = IC (Comput (P2,s,k)) ) by ;
hence not (Comput (P1,s,k)) | (dom p) = (Comput (P2,s,k)) | (dom p) by ; :: thesis: verum
end;
hence contradiction ; :: thesis: verum