reserve X, Y for non empty set;
reserve X for non empty set;
reserve R for RMembership_Func of X,X;

theorem Th24:
  0 iter R = Imf(X,X)
proof
  ex F being sequence of Funcs([:X,X:],[. 0,1 .]) st 0 iter R = F.0 & F
  .0 = Imf(X,X) & for k being Nat ex Q being RMembership_Func of X,X
  st F.k = Q & F.(k + 1) = Q (#) R by Def9;
  hence thesis;
end;
