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 9668 | . 2 ⊢ (card‘(cf‘𝐴)) = (cf‘𝐴) | |
2 | cardon 9367 | . 2 ⊢ (card‘(cf‘𝐴)) ∈ On | |
3 | 1, 2 | eqeltrri 2910 | 1 ⊢ (cf‘𝐴) ∈ On |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2110 Oncon0 6186 ‘cfv 6350 cardccrd 9358 cfccf 9360 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3497 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-int 4870 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-ord 6189 df-on 6190 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-er 8283 df-en 8504 df-card 9362 df-cf 9364 |
This theorem is referenced by: cfslb2n 9684 cfsmolem 9686 cfcoflem 9688 cfcof 9690 cfidm 9691 alephreg 9998 winaon 10104 inawina 10106 winainf 10110 rankcf 10193 tskcard 10197 gruina 10234 |
Copyright terms: Public domain | W3C validator |