| 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 9039 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ V) → 𝐴 ≈ 𝐹) | |
| 2 | ensym 9006 | . . 3 ⊢ (𝐴 ≈ 𝐹 → 𝐹 ≈ 𝐴) | |
| 3 | hasheni 14404 | . . 3 ⊢ (𝐹 ≈ 𝐴 → (♯‘𝐹) = (♯‘𝐴)) | |
| 4 | 1, 2, 3 | 3syl 19 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ V) → (♯‘𝐹) = (♯‘𝐴)) |
| 5 | dmexg 7904 | . . . . . 6 ⊢ (𝐹 ∈ V → dom 𝐹 ∈ V) | |
| 6 | fndm 6642 | . . . . . . 7 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 7 | 6 | eleq1d 2850 | . . . . . 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 2803 | . 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 2146 Vcvv 3457 ∅c0 4286 class class class wbr 5111 dom cdm 5663 Fn wfn 6535 ‘cfv 6540 ≈ cen 8946 ♯chash 14386 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 ax-pre-mulgt0 11194 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-card 9941 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-nn 12251 df-n0 12522 df-z 12609 df-uz 12881 df-hash 14387 |
| This theorem is used by: fseq1hash 14432 hashfun 14494 hashimarn 14497 fnfz0hash 14503 fnfz0hashnn0 14505 ffzo0hash 14506 fnfzo0hashnn0 14508 wrdred1hash 14618 ccatlen 14632 swrdlen 14707 swrdwrdsymb 14724 pfxlen 14745 revlen 14823 repswlen 14839 lenco 14895 ofccat 15032 pmtrdifwrdellem2 19598 1arithidomlem1 33891 1arithidomlem2 33892 1arithidom 33893 frlmdim 34067 ply1degltdim 34079 subiwrdlen 34843 signstlen 35021 signsvtn0 35024 signstres 35029 signshlen 35044 sticksstones2 42974 frlmvscadiccat 43340 upgrimwlklem1 48722 grtriclwlk3 48770 |
| Copyright terms: Public domain | W3C validator |