Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > hashen | Structured version Visualization version GIF version |
Description: Two finite sets have the same number of elements iff they are equinumerous. (Contributed by Paul Chapman, 22-Jun-2011.) (Revised by Mario Carneiro, 15-Sep-2013.) |
Ref | Expression |
---|---|
hashen | ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → ((#‘𝐴) = (#‘𝐵) ↔ 𝐴 ≈ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fveq2 6103 | . . . 4 ⊢ ((#‘𝐴) = (#‘𝐵) → (◡(rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω)‘(#‘𝐴)) = (◡(rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω)‘(#‘𝐵))) | |
2 | eqid 2610 | . . . . . 6 ⊢ (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω) = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω) | |
3 | 2 | hashginv 12983 | . . . . 5 ⊢ (𝐴 ∈ Fin → (◡(rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω)‘(#‘𝐴)) = (card‘𝐴)) |
4 | 2 | hashginv 12983 | . . . . 5 ⊢ (𝐵 ∈ Fin → (◡(rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω)‘(#‘𝐵)) = (card‘𝐵)) |
5 | 3, 4 | eqeqan12d 2626 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → ((◡(rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω)‘(#‘𝐴)) = (◡(rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω)‘(#‘𝐵)) ↔ (card‘𝐴) = (card‘𝐵))) |
6 | 1, 5 | syl5ib 233 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → ((#‘𝐴) = (#‘𝐵) → (card‘𝐴) = (card‘𝐵))) |
7 | fveq2 6103 | . . . 4 ⊢ ((card‘𝐴) = (card‘𝐵) → ((rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω)‘(card‘𝐴)) = ((rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω)‘(card‘𝐵))) | |
8 | 2 | hashgval 12982 | . . . . 5 ⊢ (𝐴 ∈ Fin → ((rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω)‘(card‘𝐴)) = (#‘𝐴)) |
9 | 2 | hashgval 12982 | . . . . 5 ⊢ (𝐵 ∈ Fin → ((rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω)‘(card‘𝐵)) = (#‘𝐵)) |
10 | 8, 9 | eqeqan12d 2626 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → (((rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω)‘(card‘𝐴)) = ((rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω)‘(card‘𝐵)) ↔ (#‘𝐴) = (#‘𝐵))) |
11 | 7, 10 | syl5ib 233 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → ((card‘𝐴) = (card‘𝐵) → (#‘𝐴) = (#‘𝐵))) |
12 | 6, 11 | impbid 201 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → ((#‘𝐴) = (#‘𝐵) ↔ (card‘𝐴) = (card‘𝐵))) |
13 | finnum 8657 | . . 3 ⊢ (𝐴 ∈ Fin → 𝐴 ∈ dom card) | |
14 | finnum 8657 | . . 3 ⊢ (𝐵 ∈ Fin → 𝐵 ∈ dom card) | |
15 | carden2 8696 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) = (card‘𝐵) ↔ 𝐴 ≈ 𝐵)) | |
16 | 13, 14, 15 | syl2an 493 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → ((card‘𝐴) = (card‘𝐵) ↔ 𝐴 ≈ 𝐵)) |
17 | 12, 16 | bitrd 267 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → ((#‘𝐴) = (#‘𝐵) ↔ 𝐴 ≈ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 Vcvv 3173 class class class wbr 4583 ↦ cmpt 4643 ◡ccnv 5037 dom cdm 5038 ↾ cres 5040 ‘cfv 5804 (class class class)co 6549 ωcom 6957 reccrdg 7392 ≈ cen 7838 Fincfn 7841 cardccrd 8644 0cc0 9815 1c1 9816 + caddc 9818 #chash 12979 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-n0 11170 df-z 11255 df-uz 11564 df-hash 12980 |
This theorem is referenced by: hasheni 12998 hasheqf1o 12999 isfinite4 13014 hasheq0 13015 hashsng 13020 hashen1 13021 hashsdom 13031 hash1snb 13068 hashxplem 13080 hashmap 13082 hashpw 13083 hashbclem 13093 hash2pr 13108 pr2pwpr 13116 hash3tr 13127 isercolllem2 14244 isercoll 14246 fz1f1o 14288 summolem3 14292 summolem2a 14293 mertenslem1 14455 prodmolem3 14502 prodmolem2a 14503 bpolylem 14618 hashdvds 15318 crth 15321 phimullem 15322 eulerth 15326 4sqlem11 15497 lagsubg2 17478 orbsta2 17570 dfod2 17804 sylow1lem2 17837 sylow2alem2 17856 sylow2a 17857 slwhash 17862 sylow2 17864 sylow3lem1 17865 cyggenod 18109 lt6abl 18119 gsumval3lem1 18129 gsumval3lem2 18130 gsumval3 18131 ablfac1c 18293 ablfac1eu 18295 ablfaclem3 18309 fta1blem 23732 vieta1 23871 basellem5 24611 isppw 24640 eupai 26494 derangen2 30410 subfacp1lem3 30418 subfacp1lem5 30420 erdsze2lem1 30439 erdsze2lem2 30440 poimirlem9 32588 poimirlem25 32604 poimirlem26 32605 poimirlem27 32606 poimirlem28 32607 eldioph2lem1 36341 frlmpwfi 36686 isnumbasgrplem3 36694 idomsubgmo 36795 |
Copyright terms: Public domain | W3C validator |