let N be non empty with_non-empty_elements set ; for S being standard-ins homogeneous regular J/A-independent proper-halt non empty IC-Ins-separated halting relocable IC-recognized relocable1 AMI-Struct of N st S is CurIns-recognized & S is relocable1 & S is relocable2 & S is proper-halt holds
for F being data-only PartFunc of (FinPartSt S),(FinPartSt S)
for l being Element of NAT
for q being NAT -defined the Instructions of b1 -valued finite non halt-free Function
for p being non empty b4 -autonomic b4 -halted FinPartState of S st IC in dom p holds
for k being Element of NAT holds
( q,p computes F iff Reloc (q,k), IncIC (p,k) computes F )
let S be standard-ins homogeneous regular J/A-independent proper-halt non empty IC-Ins-separated halting relocable IC-recognized relocable1 AMI-Struct of N; ( S is CurIns-recognized & S is relocable1 & S is relocable2 & S is proper-halt implies for F being data-only PartFunc of (FinPartSt S),(FinPartSt S)
for l being Element of NAT
for q being NAT -defined the Instructions of S -valued finite non halt-free Function
for p being non empty b3 -autonomic b3 -halted FinPartState of S st IC in dom p holds
for k being Element of NAT holds
( q,p computes F iff Reloc (q,k), IncIC (p,k) computes F ) )
assume A1:
( S is CurIns-recognized & S is relocable1 & S is relocable2 & S is proper-halt )
; for F being data-only PartFunc of (FinPartSt S),(FinPartSt S)
for l being Element of NAT
for q being NAT -defined the Instructions of S -valued finite non halt-free Function
for p being non empty b3 -autonomic b3 -halted FinPartState of S st IC in dom p holds
for k being Element of NAT holds
( q,p computes F iff Reloc (q,k), IncIC (p,k) computes F )
let F be data-only PartFunc of (FinPartSt S),(FinPartSt S); for l being Element of NAT
for q being NAT -defined the Instructions of S -valued finite non halt-free Function
for p being non empty b2 -autonomic b2 -halted FinPartState of S st IC in dom p holds
for k being Element of NAT holds
( q,p computes F iff Reloc (q,k), IncIC (p,k) computes F )
let l be Element of NAT ; for q being NAT -defined the Instructions of S -valued finite non halt-free Function
for p being non empty b1 -autonomic b1 -halted FinPartState of S st IC in dom p holds
for k being Element of NAT holds
( q,p computes F iff Reloc (q,k), IncIC (p,k) computes F )
let q be NAT -defined the Instructions of S -valued finite non halt-free Function; for p being non empty q -autonomic q -halted FinPartState of S st IC in dom p holds
for k being Element of NAT holds
( q,p computes F iff Reloc (q,k), IncIC (p,k) computes F )
let p be non empty q -autonomic q -halted FinPartState of S; ( IC in dom p implies for k being Element of NAT holds
( q,p computes F iff Reloc (q,k), IncIC (p,k) computes F ) )
assume A2:
IC in dom p
; for k being Element of NAT holds
( q,p computes F iff Reloc (q,k), IncIC (p,k) computes F )
let k be Element of NAT ; ( q,p computes F iff Reloc (q,k), IncIC (p,k) computes F )
hereby ( Reloc (q,k), IncIC (p,k) computes F implies q,p computes F )
assume A5:
q,
p computes F
;
Reloc (q,k), IncIC (p,k) computes Fthus
Reloc (
q,
k),
IncIC (
p,
k)
computes F
verumproof
let x be
set ;
EXTPRO_1:def 14 ( not x in proj1 F or ex b1 being set st
( x = b1 & (IncIC (p,k)) +* b1 is Autonomy of Reloc (q,k) & F . b1 c= Result ((Reloc (q,k)),((IncIC (p,k)) +* b1)) ) )
assume A6:
x in dom F
;
ex b1 being set st
( x = b1 & (IncIC (p,k)) +* b1 is Autonomy of Reloc (q,k) & F . b1 c= Result ((Reloc (q,k)),((IncIC (p,k)) +* b1)) )
then consider d1 being
FinPartState of
S such that A7:
x = d1
and A8:
p +* d1 is
Autonomy of
q
and A9:
F . d1 c= Result (
q,
(p +* d1))
by A5, EXTPRO_1:def 14;
dom F c= FinPartSt S
by RELAT_1:def 18;
then reconsider d =
x as
FinPartState of
S by A6, MEMSTR_0:76;
reconsider d =
d as
data-only FinPartState of
S by A6, MEMSTR_0:def 14;
dom (p +* d) = (dom p) \/ (dom d)
by FUNCT_4:def 1;
then A10:
IC in dom (p +* d)
by A2, XBOOLE_0:def 3;
A17:
p +* d is
q -autonomic
by A7, A8, EXTPRO_1:def 12;
then A18:
IncIC (
(p +* d),
k) is
Reloc (
q,
k)
-autonomic
by A10, Th11, A1;
A19:
p +* d is
q -halted
by A7, A8, EXTPRO_1:def 12;
reconsider pd =
p +* d as non
empty q -autonomic q -halted FinPartState of
S by A7, A8, EXTPRO_1:def 12;
A20:
DataPart (Result (q,pd)) =
DataPart (Result ((Reloc (q,k)),(IncIC ((p +* d),k))))
by A1, A10, Th13
.=
DataPart (Result ((Reloc (q,k)),((IncIC (p,k)) +* d)))
by MEMSTR_0:54
;
reconsider Fs1 =
F . d1 as
FinPartState of
S by A9;
take
d
;
( x = d & (IncIC (p,k)) +* d is Autonomy of Reloc (q,k) & F . d c= Result ((Reloc (q,k)),((IncIC (p,k)) +* d)) )
thus
x = d
;
( (IncIC (p,k)) +* d is Autonomy of Reloc (q,k) & F . d c= Result ((Reloc (q,k)),((IncIC (p,k)) +* d)) )
(IncIC (p,k)) +* d = IncIC (
(p +* d),
k)
by MEMSTR_0:54;
hence
(IncIC (p,k)) +* d is
Autonomy of
Reloc (
q,
k)
by A17, A19, A18, EXTPRO_1:def 12;
F . d c= Result ((Reloc (q,k)),((IncIC (p,k)) +* d))
SS:
p +* d1 = pd
by A7;
A21:
Fs1 is
data-only
by A6, A7, MEMSTR_0:def 14;
F . d1 c= DataPart (Result ((Reloc (q,k)),((IncIC (p,k)) +* d)))
by A9, A21, SS, A20, MEMSTR_0:5;
hence
F . d c= Result (
(Reloc (q,k)),
((IncIC (p,k)) +* d))
by A7, A21, MEMSTR_0:5;
verum
end;
end;
assume A22:
Reloc (q,k), IncIC (p,k) computes F
; q,p computes F
let x be set ; EXTPRO_1:def 14 ( not x in proj1 F or ex b1 being set st
( x = b1 & p +* b1 is Autonomy of q & F . b1 c= Result (q,(p +* b1)) ) )
assume A23:
x in dom F
; ex b1 being set st
( x = b1 & p +* b1 is Autonomy of q & F . b1 c= Result (q,(p +* b1)) )
then consider d1 being FinPartState of S such that
A24:
x = d1
and
A25:
(IncIC (p,k)) +* d1 is Autonomy of Reloc (q,k)
and
A26:
F . d1 c= Result ((Reloc (q,k)),((IncIC (p,k)) +* d1))
by A22, EXTPRO_1:def 14;
dom F c= FinPartSt S
by RELAT_1:def 18;
then reconsider d = x as FinPartState of S by A23, MEMSTR_0:76;
reconsider d = d as data-only FinPartState of S by A23, MEMSTR_0:def 14;
B27:
dom (p +* d) = (dom p) \/ (dom d)
by FUNCT_4:def 1;
then A27:
IC in dom (p +* d)
by A2, XBOOLE_0:def 3;
A32:
(IncIC (p,k)) +* d = IncIC ((p +* d),k)
by MEMSTR_0:54;
IncIC ((p +* d),k) is Reloc (q,k) -autonomic
by A24, A25, A32, EXTPRO_1:def 12;
then A33:
p +* d is q -autonomic
by A27, Th11, A1;
RR:
IncIC ((p +* d),k) is Reloc (q,k) -halted
by A24, A25, A32, EXTPRO_1:def 12;
A34:
p +* d is q -halted
by A27, Th12, A33, RR;
reconsider pd = p +* d as non empty q -autonomic q -halted FinPartState of S by A27, Th12, A33, RR;
WR:
IC in dom pd
by B27, A2, XBOOLE_0:def 3;
A35: DataPart (Result ((Reloc (q,k)),((IncIC (p,k)) +* d1))) =
DataPart (Result ((Reloc (q,k)),(IncIC ((p +* d),k))))
by A24, MEMSTR_0:54
.=
DataPart (Result (q,(p +* d)))
by Th13, A1, WR
;
take
d
; ( x = d & p +* d is Autonomy of q & F . d c= Result (q,(p +* d)) )
thus
x = d
; ( p +* d is Autonomy of q & F . d c= Result (q,(p +* d)) )
thus
p +* d is Autonomy of q
by A33, A34, EXTPRO_1:def 12; F . d c= Result (q,(p +* d))
reconsider Fs1 = F . d1 as FinPartState of S by A26;
A37:
Fs1 is data-only
by A23, A24, MEMSTR_0:def 14;
then
F . d1 c= DataPart (Result (q,(p +* d)))
by A35, A26, MEMSTR_0:5;
hence
F . d c= Result (q,(p +* d))
by A24, A37, MEMSTR_0:5; verum