let p be non NAT -defined autonomic FinPartState of ; :: according to AMISTD_5:def 4 :: thesis: for s being State of (STC N) st NPP p c= s holds
for P being the Instructions of (STC N) -valued ManySortedSet of NAT st ProgramPart p c= P holds
for i being Element of NAT holds IC (Comput (P,s,i)) in dom (ProgramPart p)
let s be State of (STC N); :: thesis: ( NPP p c= s implies for P being the Instructions of (STC N) -valued ManySortedSet of NAT st ProgramPart p c= P holds
for i being Element of NAT holds IC (Comput (P,s,i)) in dom (ProgramPart p) )
assume A1: NPP p c= s ; :: thesis: for P being the Instructions of (STC N) -valued ManySortedSet of NAT st ProgramPart p c= P holds
for i being Element of NAT holds IC (Comput (P,s,i)) in dom (ProgramPart p)
let P be the Instructions of (STC N) -valued ManySortedSet of NAT ; :: thesis: ( ProgramPart p c= P implies for i being Element of NAT holds IC (Comput (P,s,i)) in dom (ProgramPart p) )
assume A2: ProgramPart p c= P ; :: thesis: for i being Element of NAT holds IC (Comput (P,s,i)) in dom (ProgramPart p)
let i be Element of NAT ; :: thesis: IC (Comput (P,s,i)) in dom (ProgramPart p)
set Csi = Comput (P,s,i);
set loc = IC (Comput (P,s,i));
set loc1 = (IC (Comput (P,s,i))) + 1;
A3: ( IC (Comput (P,s,i)) in dom (ProgramPart p) iff IC (Comput (P,s,i)) in (dom p) /\ NAT ) by RELAT_1:90;
assume not IC (Comput (P,s,i)) in dom (ProgramPart p) ; :: thesis: contradiction
then A4: not IC (Comput (P,s,i)) in dom p by A3, XBOOLE_0:def 4;
the Instructions of (STC N) = {[0,0,0],[1,0,0]} by AMISTD_1:def 11;
then reconsider I = [1,0,0] as Instruction of (STC N) by TARSKI:def 2;
set p1 = p +* ((IC (Comput (P,s,i))) .--> I);
set p2 = p +* ((IC (Comput (P,s,i))) .--> (halt (STC N)));
reconsider P1 = P +* ((IC (Comput (P,s,i))) .--> I) as the Instructions of (STC N) -valued ManySortedSet of NAT ;
reconsider P2 = P +* ((IC (Comput (P,s,i))) .--> (halt (STC N))) as the Instructions of (STC N) -valued ManySortedSet of NAT ;
A6: dom ((IC (Comput (P,s,i))) .--> (halt (STC N))) = {(IC (Comput (P,s,i)))} by FUNCOP_1:19;
then A7: IC (Comput (P,s,i)) in dom ((IC (Comput (P,s,i))) .--> (halt (STC N))) by TARSKI:def 1;
A12: dom ((IC (Comput (P,s,i))) .--> I) = {(IC (Comput (P,s,i)))} by FUNCOP_1:19;
then A13: IC (Comput (P,s,i)) in dom ((IC (Comput (P,s,i))) .--> I) by TARSKI:def 1;
Y6: dom p misses dom ((IC (Comput (P,s,i))) .--> (halt (STC N))) by A4, A6, ZFMISC_1:56;
Y5: dom p misses dom ((IC (Comput (P,s,i))) .--> I) by A4, A12, ZFMISC_1:56;
ProgramPart (p +* ((IC (Comput (P,s,i))) .--> I)) = (ProgramPart p) +* (ProgramPart ((IC (Comput (P,s,i))) .--> I)) by FUNCT_4:75
.= (ProgramPart p) +* ((IC (Comput (P,s,i))) .--> I) by RELAT_1:209 ;
then P3: ProgramPart (p +* ((IC (Comput (P,s,i))) .--> I)) c= P1 by A2, FUNCT_4:131;
ProgramPart (p +* ((IC (Comput (P,s,i))) .--> (halt (STC N)))) = (ProgramPart p) +* (ProgramPart ((IC (Comput (P,s,i))) .--> (halt (STC N)))) by FUNCT_4:75
.= (ProgramPart p) +* ((IC (Comput (P,s,i))) .--> (halt (STC N))) by RELAT_1:209 ;
then P4: ProgramPart (p +* ((IC (Comput (P,s,i))) .--> (halt (STC N)))) c= P2 by A2, FUNCT_4:131;
set Cs2i = Comput (P2,s,i);
set Cs1i = Comput (P1,s,i);
not p is autonomic
proof
((IC (Comput (P,s,i))) .--> (halt (STC N))) . (IC (Comput (P,s,i))) = halt (STC N) by FUNCOP_1:87;
then A18: P2 . (IC (Comput (P,s,i))) = halt (STC N) by A7, FUNCT_4:14;
((IC (Comput (P,s,i))) .--> I) . (IC (Comput (P,s,i))) = I by FUNCOP_1:87;
then A19: P1 . (IC (Comput (P,s,i))) = I by A13, FUNCT_4:14;
take P1 ; :: according to EXTPRO_1:def 9 :: thesis: ex b1 being set st
( ProgramPart p c= P1 & ProgramPart p c= b1 & ex b2, b3 being set st
( NPP p c= b2 & NPP p c= b3 & not for b4 being Element of NAT holds (Comput (P1,b2,b4)) | (proj1 (NPP p)) = (Comput (b1,b3,b4)) | (proj1 (NPP p)) ) )
take P2 ; :: thesis: ( ProgramPart p c= P1 & ProgramPart p c= P2 & ex b1, b2 being set st
( NPP p c= b1 & NPP p c= b2 & not for b3 being Element of NAT holds (Comput (P1,b1,b3)) | (proj1 (NPP p)) = (Comput (P2,b2,b3)) | (proj1 (NPP p)) ) )
ProgramPart p c= ProgramPart (p +* ((IC (Comput (P,s,i))) .--> I)) by Y5, FUNCT_4:33, RELAT_1:105;
hence A25: ProgramPart p c= P1 by P3, XBOOLE_1:1; :: thesis: ( ProgramPart p c= P2 & ex b1, b2 being set st
( NPP p c= b1 & NPP p c= b2 & not for b3 being Element of NAT holds (Comput (P1,b1,b3)) | (proj1 (NPP p)) = (Comput (P2,b2,b3)) | (proj1 (NPP p)) ) )
ProgramPart p c= ProgramPart (p +* ((IC (Comput (P,s,i))) .--> (halt (STC N)))) by Y6, FUNCT_4:33, RELAT_1:105;
hence A27: ProgramPart p c= P2 by P4, XBOOLE_1:1; :: thesis: ex b1, b2 being set st
( NPP p c= b1 & NPP p c= b2 & not for b3 being Element of NAT holds (Comput (P1,b1,b3)) | (proj1 (NPP p)) = (Comput (P2,b2,b3)) | (proj1 (NPP p)) )
take s ; :: thesis: ex b1 being set st
( NPP p c= s & NPP p c= b1 & not for b2 being Element of NAT holds (Comput (P1,s,b2)) | (proj1 (NPP p)) = (Comput (P2,b1,b2)) | (proj1 (NPP p)) )
take s ; :: thesis: ( NPP p c= s & NPP p c= s & not for b1 being Element of NAT holds (Comput (P1,s,b1)) | (proj1 (NPP p)) = (Comput (P2,s,b1)) | (proj1 (NPP p)) )
thus NPP p c= s by A1; :: thesis: ( NPP p c= s & not for b1 being Element of NAT holds (Comput (P1,s,b1)) | (proj1 (NPP p)) = (Comput (P2,s,b1)) | (proj1 (NPP p)) )
A28: (Comput (P1,s,i)) | (dom (NPP p)) = (Comput (P,s,i)) | (dom (NPP p)) by A25, A2, A1, EXTPRO_1:def 9;
thus NPP p c= s by A1; :: thesis: not for b1 being Element of NAT holds (Comput (P1,s,b1)) | (proj1 (NPP p)) = (Comput (P2,s,b1)) | (proj1 (NPP p))
A29: (Comput (P1,s,i)) | (dom (NPP p)) = (Comput (P2,s,i)) | (dom (NPP p)) by A25, A27, A1, EXTPRO_1:def 9;
take k = i + 1; :: thesis: not (Comput (P1,s,k)) | (proj1 (NPP p)) = (Comput (P2,s,k)) | (proj1 (NPP p))
set Cs1k = Comput (P1,s,k);
A31: Comput (P1,s,k) = Following (P1,(Comput (P1,s,i))) by EXTPRO_1:4
.= Exec ((CurInstr (P1,(Comput (P1,s,i)))),(Comput (P1,s,i))) ;
InsCode I = 1 by RECDEF_2:def 1;
then A32: IC (Exec (I,(Comput (P1,s,i)))) = succ (IC (Comput (P1,s,i))) by AMISTD_1:38;
A33: IC in dom p by Th6;
A34: IC (Comput (P,s,i)) = IC ((Comput (P,s,i)) | (dom (NPP p))) by A33, COMPOS_1:179, FUNCT_1:72;
then IC (Comput (P1,s,i)) = IC (Comput (P,s,i)) by A28, A33, COMPOS_1:179, FUNCT_1:72;
then A35: IC (Comput (P1,s,k)) = (IC (Comput (P,s,i))) + 1 by A32, A31, A19, PBOOLE:158;
set Cs2k = Comput (P2,s,k);
A36: Comput (P2,s,k) = Following (P2,(Comput (P2,s,i))) by EXTPRO_1:4
.= Exec ((CurInstr (P2,(Comput (P2,s,i)))),(Comput (P2,s,i))) ;
A37: P2 /. (IC (Comput (P2,s,i))) = P2 . (IC (Comput (P2,s,i))) by PBOOLE:158;
IC (Comput (P2,s,i)) = IC (Comput (P,s,i)) by A28, A34, A29, A33, COMPOS_1:179, FUNCT_1:72;
then A38: IC (Comput (P2,s,k)) = IC (Comput (P,s,i)) by A36, A18, A37, EXTPRO_1:def 3;
( IC ((Comput (P1,s,k)) | (dom (NPP p))) = IC (Comput (P1,s,k)) & IC ((Comput (P2,s,k)) | (dom (NPP p))) = IC (Comput (P2,s,k)) ) by A33, COMPOS_1:179, FUNCT_1:72;
hence not (Comput (P1,s,k)) | (proj1 (NPP p)) = (Comput (P2,s,k)) | (proj1 (NPP p)) by A35, A38; :: thesis: verum
end;
hence contradiction ; :: thesis: verum