| 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 9101 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ V) → 𝐴 ≈ 𝐹) | |
| 2 | ensym 9068 | . . 3 ⊢ (𝐴 ≈ 𝐹 → 𝐹 ≈ 𝐴) | |
| 3 | hasheni 14533 | . . 3 ⊢ (𝐹 ≈ 𝐴 → (♯‘𝐹) = (♯‘𝐴)) | |
| 4 | 1, 2, 3 | 3syl 19 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ V) → (♯‘𝐹) = (♯‘𝐴)) |
| 5 | dmexg 7947 | . . . . . 6 ⊢ (𝐹 ∈ V → dom 𝐹 ∈ V) | |
| 6 | fndm 6672 | . . . . . . 7 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 7 | 6 | eleq1d 2849 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 → (dom 𝐹 ∈ V ↔ 𝐴 ∈ V)) |
| 8 | 5, 7 | imbitrid 247 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝐹 ∈ V → 𝐴 ∈ V)) |
| 9 | 8 | con3dimp 414 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ ¬ 𝐴 ∈ V) → ¬ 𝐹 ∈ V) |
| 10 | fvprc 6908 | . . . 4 ⊢ (¬ 𝐹 ∈ V → (♯‘𝐹) = ∅) | |
| 11 | 9, 10 | syl 18 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ¬ 𝐴 ∈ V) → (♯‘𝐹) = ∅) |
| 12 | fvprc 6908 | . . . 4 ⊢ (¬ 𝐴 ∈ V → (♯‘𝐴) = ∅) | |
| 13 | 12 | adantl 487 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ¬ 𝐴 ∈ V) → (♯‘𝐴) = ∅) |
| 14 | 11, 13 | eqtr4d 2801 | . 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 2147 Vcvv 3454 ∅c0 4281 class class class wbr 5108 dom cdm 5658 Fn wfn 6561 ‘cfv 6566 ≈ cen 9008 ♯chash 14515 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 df-hash 14516 |
| This theorem is used by: fseq1hash 14561 hashfun 14623 hashimarn 14626 fnfz0hash 14632 fnfz0hashnn0 14634 ffzo0hash 14635 fnfzo0hashnn0 14637 wrdred1hash 14747 ccatlen 14761 swrdlen 14837 swrdwrdsymb 14854 pfxlen 14875 revlen 14953 repswlen 14969 lenco 15025 s3rex 15144 ofccat 15165 pmtrdifwrdellem2 19747 elcgrabasi 29432 1arithidomlem1 34171 1arithidomlem2 34172 1arithidom 34173 frlmdim 34354 ply1degltdim 34366 subiwrdlen 35129 signstlen 35307 signsvtn0 35310 signstres 35315 signshlen 35330 sticksstones2 43463 frlmvscadiccat 43839 upgrimwlklem1 49268 grtriclwlk3 49316 |
| Copyright terms: Public domain | W3C validator |