| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ordfr | Structured version Visualization version GIF version | ||
| Description: Membership is well-founded on an ordinal class. In other words, an ordinal class is well-founded. (Contributed by NM, 22-Apr-1994.) |
| Ref | Expression |
|---|---|
| ordfr | ⊢ (Ord 𝐴 → E Fr 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordwe 6373 | . 2 ⊢ (Ord 𝐴 → E We 𝐴) | |
| 2 | wefr 5650 | . 2 ⊢ ( E We 𝐴 → E Fr 𝐴) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (Ord 𝐴 → E Fr 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 E cep 5559 Fr wfr 5610 We wwe 5612 Ord word 6359 |
| 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 401 df-we 5615 df-ord 6363 |
| This theorem is used by: ordirr 6378 tz7.7 6386 onfr 6400 bnj580 35310 bnj1053 35373 bnj1071 35374 |
| Copyright terms: Public domain | W3C validator |