let i, j be Nat; :: thesis: ( i <= j implies for N being non empty with_non-empty_elements set
for S being non empty stored-program halting IC-Ins-separated definite AMI-Struct of N
for f being NAT -defined the Instructions of b₂ -valued finite Function
for s being State of S st CurInstr f,(Comput f,s,i) = halt S holds
Comput f,s,j = Comput f,s,i )
assume i <= j ; :: thesis: for N being non empty with_non-empty_elements set
for S being non empty stored-program halting IC-Ins-separated definite AMI-Struct of N
for f being NAT -defined the Instructions of b₂ -valued finite Function
for s being State of S st CurInstr f,(Comput f,s,i) = halt S holds
Comput f,s,j = Comput f,s,i
then consider k being Nat such that
A1: j = i + k by NAT_1:10;
reconsider k = k as Element of NAT by ORDINAL1:def 13;
A2: j = i + k by A1;
let N be non empty with_non-empty_elements set ; :: thesis: for S being non empty stored-program halting IC-Ins-separated definite AMI-Struct of N
for f being NAT -defined the Instructions of b₁ -valued finite Function
for s being State of S st CurInstr f,(Comput f,s,i) = halt S holds
Comput f,s,j = Comput f,s,i
let S be non empty stored-program halting IC-Ins-separated definite AMI-Struct of N; :: thesis: for f being NAT -defined the Instructions of S -valued finite Function
for s being State of S st CurInstr f,(Comput f,s,i) = halt S holds
Comput f,s,j = Comput f,s,i
let f be NAT -defined the Instructions of S -valued finite Function; :: thesis: for s being State of S st CurInstr f,(Comput f,s,i) = halt S holds
Comput f,s,j = Comput f,s,i
let s be State of S; :: thesis: ( CurInstr f,(Comput f,s,i) = halt S implies Comput f,s,j = Comput f,s,i )
assume A3: CurInstr f,(Comput f,s,i) = halt S ; :: thesis: Comput f,s,j = Comput f,s,i
defpred S₁[ Element of NAT ] means Comput f,s,(i + $1) = Comput f,s,i;
A4: S₁[ 0 ] ;

A5: now

let k be Element of NAT ; :: thesis: ( S₁[k] implies S₁[k + 1] )
assume A6: S₁[k] ; :: thesis: S₁[k + 1]
Comput f,s,(i + (k + 1)) = Comput f,s,((i + k) + 1)
.= Following f,(Comput f,s,(i + k)) by AMI_1:14
.= Comput f,s,i by A3, A6, AMI_1:def 8 ;
hence S₁[k + 1] ; :: thesis: verum

end;

for k being Element of NAT holds S₁[k] from NAT_1:sch 1(A4, A5);
hence Comput f,s,j = Comput f,s,i by A2; :: thesis: verum