| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > carden2 | Structured version Visualization version GIF version | ||
| Description: Two numerable sets are equinumerous iff their cardinal numbers are equal. Unlike carden 10502, the Axiom of Choice is not required. (Contributed by Mario Carneiro, 22-Sep-2013.) |
| Ref | Expression |
|---|---|
| carden2 | ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) = (card‘𝐵) ↔ 𝐴 ≈ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | carddom2 9929 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) ⊆ (card‘𝐵) ↔ 𝐴 ≼ 𝐵)) | |
| 2 | carddom2 9929 | . . . 4 ⊢ ((𝐵 ∈ dom card ∧ 𝐴 ∈ dom card) → ((card‘𝐵) ⊆ (card‘𝐴) ↔ 𝐵 ≼ 𝐴)) | |
| 3 | 2 | ancoms 462 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐵) ⊆ (card‘𝐴) ↔ 𝐵 ≼ 𝐴)) |
| 4 | 1, 3 | anbi12d 641 | . 2 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (((card‘𝐴) ⊆ (card‘𝐵) ∧ (card‘𝐵) ⊆ (card‘𝐴)) ↔ (𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴))) |
| 5 | eqss 3949 | . . 3 ⊢ ((card‘𝐴) = (card‘𝐵) ↔ ((card‘𝐴) ⊆ (card‘𝐵) ∧ (card‘𝐵) ⊆ (card‘𝐴))) | |
| 6 | 5 | bicomi 226 | . 2 ⊢ (((card‘𝐴) ⊆ (card‘𝐵) ∧ (card‘𝐵) ⊆ (card‘𝐴)) ↔ (card‘𝐴) = (card‘𝐵)) |
| 7 | sbthb 9064 | . 2 ⊢ ((𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴) ↔ 𝐴 ≈ 𝐵) | |
| 8 | 4, 6, 7 | 3bitr3g 315 | 1 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) = (card‘𝐵) ↔ 𝐴 ≈ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ⊆ wss 3902 class class class wbr 5097 dom cdm 5643 ‘cfv 6516 ≈ cen 8918 ≼ cdom 8919 cardccrd 9887 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4903 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-ord 6344 df-on 6345 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-er 8672 df-en 8922 df-dom 8923 df-sdom 8924 df-card 9891 |
| This theorem is referenced by: cardsdom2 9940 pm54.43lem 9952 sdom2en01 10253 fin23lem22 10278 fin1a2lem9 10359 pwfseqlem4 10614 hashen 14354 |
| Copyright terms: Public domain | W3C validator |