| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isnum3 | Structured version Visualization version GIF version | ||
| Description: A set is numerable iff it is equinumerous with its cardinal. (Contributed by Mario Carneiro, 29-Apr-2015.) |
| Ref | Expression |
|---|---|
| isnum3 | ⊢ (𝐴 ∈ dom card ↔ (card‘𝐴) ≈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cardid2 9940 | . 2 ⊢ (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴) | |
| 2 | cardon 9931 | . . 3 ⊢ (card‘𝐴) ∈ On | |
| 3 | isnumi 9933 | . . 3 ⊢ (((card‘𝐴) ∈ On ∧ (card‘𝐴) ≈ 𝐴) → 𝐴 ∈ dom card) | |
| 4 | 2, 3 | mpan 702 | . 2 ⊢ ((card‘𝐴) ≈ 𝐴 → 𝐴 ∈ dom card) |
| 5 | 1, 4 | impbii 212 | 1 ⊢ (𝐴 ∈ dom card ↔ (card‘𝐴) ≈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∈ wcel 2143 class class class wbr 5110 dom cdm 5663 Oncon0 6362 ‘cfv 6538 ≈ cen 8941 cardccrd 9922 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-ord 6365 df-on 6366 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-en 8945 df-card 9926 |
| This theorem is referenced by: ttukey2g 10501 |
| Copyright terms: Public domain | W3C validator |