| 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 9063 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ V) → 𝐴 ≈ 𝐹) | |
| 2 | ensym 9030 | . . 3 ⊢ (𝐴 ≈ 𝐹 → 𝐹 ≈ 𝐴) | |
| 3 | hasheni 14492 | . . 3 ⊢ (𝐹 ≈ 𝐴 → (♯‘𝐹) = (♯‘𝐴)) | |
| 4 | 1, 2, 3 | 3syl 19 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ V) → (♯‘𝐹) = (♯‘𝐴)) |
| 5 | dmexg 7913 | . . . . . 6 ⊢ (𝐹 ∈ V → dom 𝐹 ∈ V) | |
| 6 | fndm 6642 | . . . . . . 7 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 7 | 6 | eleq1d 2846 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 → (dom 𝐹 ∈ V ↔ 𝐴 ∈ V)) |
| 8 | 5, 7 | imbitrid 247 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝐹 ∈ V → 𝐴 ∈ V)) |
| 9 | 8 | con3dimp 414 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ ¬ 𝐴 ∈ V) → ¬ 𝐹 ∈ V) |
| 10 | fvprc 6877 | . . . 4 ⊢ (¬ 𝐹 ∈ V → (♯‘𝐹) = ∅) | |
| 11 | 9, 10 | syl 18 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ¬ 𝐴 ∈ V) → (♯‘𝐹) = ∅) |
| 12 | fvprc 6877 | . . . 4 ⊢ (¬ 𝐴 ∈ V → (♯‘𝐴) = ∅) | |
| 13 | 12 | adantl 487 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ¬ 𝐴 ∈ V) → (♯‘𝐴) = ∅) |
| 14 | 11, 13 | eqtr4d 2799 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ ¬ 𝐴 ∈ V) → (♯‘𝐹) = (♯‘𝐴)) |
| 15 | 4, 14 | pm2.61dan 825 | 1 ⊢ (𝐹 Fn 𝐴 → (♯‘𝐹) = (♯‘𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 Vcvv 3451 ∅c0 4279 class class class wbr 5103 dom cdm 5651 Fn wfn 6533 ‘cfv 6538 ≈ cen 8970 ♯chash 14474 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-card 10020 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-n0 12607 df-z 12694 df-uz 12966 df-hash 14475 |
| This theorem is used by: fseq1hash 14520 hashfun 14582 hashimarn 14585 fnfz0hash 14591 fnfz0hashnn0 14593 ffzo0hash 14594 fnfzo0hashnn0 14596 wrdred1hash 14706 ccatlen 14720 swrdlen 14795 swrdwrdsymb 14812 pfxlen 14833 revlen 14911 repswlen 14927 lenco 14983 s3rex 15101 ofccat 15122 pmtrdifwrdellem2 19696 elcgrabasi 29375 1arithidomlem1 34067 1arithidomlem2 34068 1arithidom 34069 frlmdim 34243 ply1degltdim 34255 subiwrdlen 35018 signstlen 35196 signsvtn0 35199 signstres 35204 signshlen 35219 sticksstones2 43197 frlmvscadiccat 43573 upgrimwlklem1 48994 grtriclwlk3 49042 |
| Copyright terms: Public domain | W3C validator |