reserve
  a,b,c,d,e for Ordinal,
  m,n for Nat,
  f for Ordinal-Sequence,
  x for object;
reserve S,S1,S2 for Sequence;

theorem Th47:
  b is non empty limit_ordinal implies
  (x in epsilon_b iff ex c st c in b & x in epsilon_c)
  proof assume
A1: b is non empty limit_ordinal;
    deffunc F(Ordinal) = epsilon_$1;
    consider f such that
A2: dom f = b & for c st c in b holds f.c = F(c) from ORDINAL2:sch 3;
A3: Union f = epsilon_b by A1,A2,Th46;
    hereby assume x in epsilon_b; then
      consider c being object such that
A4:   c in dom f & x in f.c by A3,CARD_5:2;
      reconsider c as Ordinal by A4;
      take c;
      thus c in b by A2,A4;
      thus x in epsilon_c by A2,A4;
    end;
    given c such that
A5: c in b & x in epsilon_c;
    f.c = F(c) by A2,A5;
    hence x in epsilon_b by A2,A3,A5,CARD_5:2;
  end;
