MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ordfr Structured version   Visualization version   GIF version

Theorem ordfr 6366
Description: Membership is well-founded on an ordinal class. In other words, an ordinal class is well-founded. (Contributed by NM, 22-Apr-1994.)
Assertion
Ref Expression
ordfr (Ord 𝐴 → E Fr 𝐴)

Proof of Theorem ordfr
StepHypRef Expression
1 ordwe 6364 . 2 (Ord 𝐴 → E We 𝐴)
2 wefr 5637 . 2 ( E We 𝐴 → E Fr 𝐴)
31, 2syl 18 1 (Ord 𝐴 → E Fr 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   E cep 5546   Fr wfr 5597   We wwe 5599  Ord word 6350
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This proof depends on definitions:  df-bi 210  df-an 402  df-we 5602  df-ord 6354
This theorem is used by:  ordirr  6369  tz7.7  6377  onfr  6391  bnj580  35477  bnj1053  35540  bnj1071  35541
  Copyright terms: Public domain W3C validator