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 6264 | . 2 ⊢ (Ord 𝐴 → E We 𝐴) | |
2 | wefr 5570 | . 2 ⊢ ( E We 𝐴 → E Fr 𝐴) | |
3 | 1, 2 | syl 17 | 1 ⊢ (Ord 𝐴 → E Fr 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 E cep 5485 Fr wfr 5532 We wwe 5534 Ord word 6250 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem depends on definitions: df-bi 206 df-an 396 df-we 5537 df-ord 6254 |
This theorem is referenced by: ordirr 6269 tz7.7 6277 onfr 6290 bnj580 32793 bnj1053 32856 bnj1071 32857 |
Copyright terms: Public domain | W3C validator |