![]() |
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 6378 | . 2 ⊢ (Ord 𝐴 → E We 𝐴) | |
2 | wefr 5667 | . 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 5580 Fr wfr 5629 We wwe 5631 Ord word 6364 |
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 395 df-we 5634 df-ord 6368 |
This theorem is referenced by: ordirr 6383 tz7.7 6391 onfr 6404 bnj580 34220 bnj1053 34283 bnj1071 34284 |
Copyright terms: Public domain | W3C validator |