| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cfon | Structured version Visualization version GIF version | ||
| Description: The cofinality of any set is an ordinal (although it only makes sense when 𝐴 is an ordinal). (Contributed by Mario Carneiro, 9-Mar-2013.) |
| Ref | Expression |
|---|---|
| cfon | ⊢ (cf‘𝐴) ∈ On |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cardcf 10174 | . 2 ⊢ (card‘(cf‘𝐴)) = (cf‘𝐴) | |
| 2 | cardon 9868 | . 2 ⊢ (card‘(cf‘𝐴)) ∈ On | |
| 3 | 1, 2 | eqeltrri 2833 | 1 ⊢ (cf‘𝐴) ∈ On |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2114 Oncon0 6323 ‘cfv 6498 cardccrd 9859 cfccf 9861 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-ord 6326 df-on 6327 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-er 8643 df-en 8894 df-card 9863 df-cf 9865 |
| This theorem is referenced by: cfslb2n 10190 cfsmolem 10192 cfcoflem 10194 cfcof 10196 cfidm 10197 alephreg 10505 winaon 10611 inawina 10613 winainf 10617 rankcf 10700 tskcard 10704 gruina 10741 |
| Copyright terms: Public domain | W3C validator |