| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hashfn | Structured version Visualization version GIF version | ||
| Description: A function is equinumerous to its domain. (Contributed by Mario Carneiro, 12-Mar-2015.) |
| Ref | Expression |
|---|---|
| hashfn | ⊢ (𝐹 Fn 𝐴 → (♯‘𝐹) = (♯‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fndmeng 9009 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ V) → 𝐴 ≈ 𝐹) | |
| 2 | ensym 8977 | . . 3 ⊢ (𝐴 ≈ 𝐹 → 𝐹 ≈ 𝐴) | |
| 3 | hasheni 14320 | . . 3 ⊢ (𝐹 ≈ 𝐴 → (♯‘𝐹) = (♯‘𝐴)) | |
| 4 | 1, 2, 3 | 3syl 18 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ V) → (♯‘𝐹) = (♯‘𝐴)) |
| 5 | dmexg 7880 | . . . . . 6 ⊢ (𝐹 ∈ V → dom 𝐹 ∈ V) | |
| 6 | fndm 6624 | . . . . . . 7 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 7 | 6 | eleq1d 2814 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 → (dom 𝐹 ∈ V ↔ 𝐴 ∈ V)) |
| 8 | 5, 7 | imbitrid 244 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝐹 ∈ V → 𝐴 ∈ V)) |
| 9 | 8 | con3dimp 408 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ ¬ 𝐴 ∈ V) → ¬ 𝐹 ∈ V) |
| 10 | fvprc 6853 | . . . 4 ⊢ (¬ 𝐹 ∈ V → (♯‘𝐹) = ∅) | |
| 11 | 9, 10 | syl 17 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ¬ 𝐴 ∈ V) → (♯‘𝐹) = ∅) |
| 12 | fvprc 6853 | . . . 4 ⊢ (¬ 𝐴 ∈ V → (♯‘𝐴) = ∅) | |
| 13 | 12 | adantl 481 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ¬ 𝐴 ∈ V) → (♯‘𝐴) = ∅) |
| 14 | 11, 13 | eqtr4d 2768 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ ¬ 𝐴 ∈ V) → (♯‘𝐹) = (♯‘𝐴)) |
| 15 | 4, 14 | pm2.61dan 812 | 1 ⊢ (𝐹 Fn 𝐴 → (♯‘𝐹) = (♯‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 Vcvv 3450 ∅c0 4299 class class class wbr 5110 dom cdm 5641 Fn wfn 6509 ‘cfv 6514 ≈ cen 8918 ♯chash 14302 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4914 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-1o 8437 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-card 9899 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-nn 12194 df-n0 12450 df-z 12537 df-uz 12801 df-hash 14303 |
| This theorem is referenced by: fseq1hash 14348 hashfun 14409 hashimarn 14412 fnfz0hash 14418 fnfz0hashnn0 14420 ffzo0hash 14421 fnfzo0hashnn0 14423 wrdred1hash 14533 ccatlen 14547 swrdlen 14619 swrdwrdsymb 14634 pfxlen 14655 revlen 14734 repswlen 14748 lenco 14805 ofccat 14942 pmtrdifwrdellem2 19419 1arithidomlem1 33513 1arithidomlem2 33514 1arithidom 33515 frlmdim 33614 ply1degltdim 33626 subiwrdlen 34384 signstlen 34565 signsvtn0 34568 signstres 34573 signshlen 34588 sticksstones2 42142 frlmvscadiccat 42501 upgrimwlklem1 47901 grtriclwlk3 47948 |
| Copyright terms: Public domain | W3C validator |