let N be non empty with_non-empty_elements set ; :: thesis: for S being non empty stored-program IC-Ins-separated definite steady-programmed AMI-Struct of N
for P being the Instructions of b₁ -valued ManySortedSet of NAT
for s being State of S
for i, k being Element of NAT holds s . i = (Comput (P,s,k)) . i
let S be non empty stored-program IC-Ins-separated definite steady-programmed AMI-Struct of N; :: thesis: for P being the Instructions of S -valued ManySortedSet of NAT
for s being State of S
for i, k being Element of NAT holds s . i = (Comput (P,s,k)) . i
let P be the Instructions of S -valued ManySortedSet of NAT ; :: thesis: for s being State of S
for i, k being Element of NAT holds s . i = (Comput (P,s,k)) . i
let s be State of S; :: thesis: for i, k being Element of NAT holds s . i = (Comput (P,s,k)) . i
let i be Element of NAT ; :: thesis: for k being Element of NAT holds s . i = (Comput (P,s,k)) . i
defpred S₁[ Nat] means s . i = (Comput (P,s,$1)) . i;

A1: now

let k be Element of NAT ; :: thesis: ( S₁[k] implies S₁[k + 1] )
assume S₁[k] ; :: thesis: S₁[k + 1]
then s . i = (Following (P,(Comput (P,s,k)))) . i by Def13
.= (Comput (P,s,(k + 1))) . i by EXTPRO_1:4 ;
hence S₁[k + 1] ; :: thesis: verum

end;

A2: S₁[ 0 ] by EXTPRO_1:3;
thus for k being Element of NAT holds S₁[k] from NAT_1:sch 1(A2, A1); :: thesis: verum