let R be good Ring; :: thesis: for i1 being Element of NAT
for k being natural number holds IncAddr (goto i1,R),k = goto (i1 + k),R
let i1 be Element of NAT ; :: thesis: for k being natural number holds IncAddr (goto i1,R),k = goto (i1 + k),R
let k be natural number ; :: thesis: IncAddr (goto i1,R),k = goto (i1 + k),R
X1: JumpPart (IncAddr (goto i1,R),k) = k + (JumpPart (goto i1,R)) by AMISTD_2:def 14;
then A1: dom (JumpPart (IncAddr (goto i1,R),k)) = dom (JumpPart (goto i1,R)) by VALUED_1:def 2;
A2: dom (JumpPart (goto (i1 + k),R)) = dom <*(i1 + k)*> by RECDEF_2:def 2
.= Seg 1 by FINSEQ_1:def 8
.= dom <*i1*> by FINSEQ_1:def 8
.= dom (JumpPart (goto i1,R)) by RECDEF_2:def 2 ;
A3: for x being set st x in dom (JumpPart (goto i1,R)) holds
(JumpPart (IncAddr (goto i1,R),k)) . x = (JumpPart (goto (i1 + k),R)) . x

proof

let x be set ; :: thesis: ( x in dom (JumpPart (goto i1,R)) implies (JumpPart (IncAddr (goto i1,R),k)) . x = (JumpPart (goto (i1 + k),R)) . x )
assume A4: x in dom (JumpPart (goto i1,R)) ; :: thesis: (JumpPart (IncAddr (goto i1,R),k)) . x = (JumpPart (goto (i1 + k),R)) . x
then x in dom <*i1*> by RECDEF_2:def 2;
then A5: x = 1 by Lm1;
reconsider f = (JumpPart (goto i1,R)) . x as Element of NAT by ORDINAL1:def 13;
A7: (JumpPart (IncAddr (goto i1,R),k)) . x = k + f by A4, X1, A1, VALUED_1:def 2;
f = <*i1*> . x by RECDEF_2:def 2
.= i1 by A5, FINSEQ_1:def 8 ;
hence (JumpPart (IncAddr (goto i1,R),k)) . x = <*(i1 + k)*> . x by A5, A7, FINSEQ_1:def 8
.= (JumpPart (goto (i1 + k),R)) . x by RECDEF_2:def 2 ;
:: thesis: verum

end;

X: InsCode (IncAddr (goto i1,R),k) = InsCode (goto i1,R) by AMISTD_2:def 14
.= 6 by RECDEF_2:def 1
.= InsCode (goto (i1 + k),R) by RECDEF_2:def 1 ;
Y: AddressPart (IncAddr (goto i1,R),k) = AddressPart (goto i1,R) by AMISTD_2:def 14
.= {} by RECDEF_2:def 3
.= AddressPart (goto (i1 + k),R) by RECDEF_2:def 3 ;
JumpPart (IncAddr (goto i1,R),k) = JumpPart (goto (i1 + k),R) by A1, A2, A3, FUNCT_1:9;
hence IncAddr (goto i1,R),k = goto (i1 + k),R by X, Y, COMPOS_1:7; :: thesis: verum