| 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.) Avoid ax-pow 5334 and ax-un 7740. (Revised by Umit Teoman Dogan, 10-Jun-2026.) |
| Ref | Expression |
|---|---|
| cfon | ⊢ (cf‘𝐴) ∈ On |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cff 10253 | . 2 ⊢ cf:On⟶On | |
| 2 | 0elon 6417 | . 2 ⊢ ∅ ∈ On | |
| 3 | 1, 2 | f0cli 7095 | 1 ⊢ (cf‘𝐴) ∈ On |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2145 Oncon0 6361 ‘cfv 6537 cfccf 9946 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-ord 6364 df-on 6365 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-card 9948 df-cf 9950 |
| This theorem is used by: cfslb2n 10274 cfsmolem 10276 cfcoflem 10278 cfcof 10280 cfidm 10281 alephreg 10595 winaon 10701 inawina 10703 winainf 10707 rankcf 10790 tskcard 10794 gruina 10831 |
| Copyright terms: Public domain | W3C validator |