
theorem Th2:
  for X being finite set holds canFS X is Enumeration of X
  proof
    let X be finite set;
    rng canFS X = X by FUNCT_2:def 3;
    hence thesis by RLAFFIN3:def 1;
  end;
