![]() |
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 8812 | . 2 ⊢ (𝐴 ∈ Fin → 𝐴 ∈ dom card) | |
2 | cardid2 8817 | . 2 ⊢ (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴) | |
3 | 1, 2 | syl 17 | 1 ⊢ (𝐴 ∈ Fin → (card‘𝐴) ≈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2030 class class class wbr 4685 dom cdm 5143 ‘cfv 5926 ≈ cen 7994 Fincfn 7997 cardccrd 8799 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-ral 2946 df-rex 2947 df-rab 2950 df-v 3233 df-sbc 3469 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-pss 3623 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-tp 4215 df-op 4217 df-uni 4469 df-int 4508 df-br 4686 df-opab 4746 df-mpt 4763 df-tr 4786 df-id 5053 df-eprel 5058 df-po 5064 df-so 5065 df-fr 5102 df-we 5104 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-ord 5764 df-on 5765 df-lim 5766 df-suc 5767 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-om 7108 df-er 7787 df-en 7998 df-fin 8001 df-card 8803 |
This theorem is referenced by: isinffi 8856 finnisoeu 8974 ackbij1lem5 9084 ackbij1lem9 9088 ackbij1b 9099 ackbij2lem2 9100 fin1a2lem11 9270 mreexexd 16355 |
Copyright terms: Public domain | W3C validator |