| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ficardid | Structured version Visualization version GIF version | ||
| Description: A finite set is equinumerous to its cardinal number. (Contributed by Mario Carneiro, 21-Sep-2013.) |
| Ref | Expression |
|---|---|
| ficardid | ⊢ (𝐴 ∈ Fin → (card‘𝐴) ≈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | finnum 9901 | . 2 ⊢ (𝐴 ∈ Fin → 𝐴 ∈ dom card) | |
| 2 | cardid2 9906 | . 2 ⊢ (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (𝐴 ∈ Fin → (card‘𝐴) ≈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2141 class class class wbr 5099 dom cdm 5645 ‘cfv 6515 ≈ cen 8918 Fincfn 8921 cardccrd 9888 |
| 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 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7712 |
| 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 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4905 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-ord 6343 df-on 6344 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-om 7841 df-er 8671 df-en 8922 df-fin 8925 df-card 9892 |
| This theorem is referenced by: isinffi 9945 finnisoeu 10064 ficardadju 10151 ackbij1lem5 10174 ackbij1lem9 10178 ackbij1b 10189 ackbij2lem2 10190 fin1a2lem11 10362 mreexexd 17661 |
| Copyright terms: Public domain | W3C validator |