let IL be non empty set ; :: thesis: for N being with_non-empty_elements set
for S being non empty stored-program IC-Ins-separated definite AMI-Struct of IL,N
for s being State of S holds Computation s,0 = s
let N be with_non-empty_elements set ; :: thesis: for S being non empty stored-program IC-Ins-separated definite AMI-Struct of IL,N
for s being State of S holds Computation s,0 = s
let S be non empty stored-program IC-Ins-separated definite AMI-Struct of IL,N; :: thesis: for s being State of S holds Computation s,0 = s
let s be State of S; :: thesis: Computation s,0 = s
ex f being Function of NAT ,(product the Object-Kind of S) st
( Computation s,0 = f . 0 & f . 0 = s & ( for i being Nat holds f . (i + 1) = Following (f . i) ) ) by Def19;
hence Computation s,0 = s ; :: thesis: verum