Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > oncard | Structured version Visualization version GIF version |
Description: A set is a cardinal number iff it equals its own cardinal number. Proposition 10.9 of [TakeutiZaring] p. 85. (Contributed by Mario Carneiro, 7-Jan-2013.) |
Ref | Expression |
---|---|
oncard | ⊢ (∃𝑥 𝐴 = (card‘𝑥) ↔ 𝐴 = (card‘𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | id 22 | . . . 4 ⊢ (𝐴 = (card‘𝑥) → 𝐴 = (card‘𝑥)) | |
2 | fveq2 6756 | . . . . 5 ⊢ (𝐴 = (card‘𝑥) → (card‘𝐴) = (card‘(card‘𝑥))) | |
3 | cardidm 9648 | . . . . 5 ⊢ (card‘(card‘𝑥)) = (card‘𝑥) | |
4 | 2, 3 | eqtrdi 2795 | . . . 4 ⊢ (𝐴 = (card‘𝑥) → (card‘𝐴) = (card‘𝑥)) |
5 | 1, 4 | eqtr4d 2781 | . . 3 ⊢ (𝐴 = (card‘𝑥) → 𝐴 = (card‘𝐴)) |
6 | 5 | exlimiv 1934 | . 2 ⊢ (∃𝑥 𝐴 = (card‘𝑥) → 𝐴 = (card‘𝐴)) |
7 | fvex 6769 | . . . 4 ⊢ (card‘𝐴) ∈ V | |
8 | eleq1 2826 | . . . 4 ⊢ (𝐴 = (card‘𝐴) → (𝐴 ∈ V ↔ (card‘𝐴) ∈ V)) | |
9 | 7, 8 | mpbiri 257 | . . 3 ⊢ (𝐴 = (card‘𝐴) → 𝐴 ∈ V) |
10 | fveq2 6756 | . . . . 5 ⊢ (𝑥 = 𝐴 → (card‘𝑥) = (card‘𝐴)) | |
11 | 10 | eqeq2d 2749 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝐴 = (card‘𝑥) ↔ 𝐴 = (card‘𝐴))) |
12 | 11 | spcegv 3526 | . . 3 ⊢ (𝐴 ∈ V → (𝐴 = (card‘𝐴) → ∃𝑥 𝐴 = (card‘𝑥))) |
13 | 9, 12 | mpcom 38 | . 2 ⊢ (𝐴 = (card‘𝐴) → ∃𝑥 𝐴 = (card‘𝑥)) |
14 | 6, 13 | impbii 208 | 1 ⊢ (∃𝑥 𝐴 = (card‘𝑥) ↔ 𝐴 = (card‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 = wceq 1539 ∃wex 1783 ∈ wcel 2108 Vcvv 3422 ‘cfv 6418 cardccrd 9624 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-ord 6254 df-on 6255 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-er 8456 df-en 8692 df-card 9628 |
This theorem is referenced by: iscard4 41038 |
Copyright terms: Public domain | W3C validator |