Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > hashf1rn | Structured version Visualization version GIF version |
Description: The size of a finite set which is a one-to-one function is equal to the size of the function's range. (Contributed by Alexander van der Vekens, 12-Jan-2018.) (Revised by AV, 4-May-2021.) |
Ref | Expression |
---|---|
hashf1rn | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴–1-1→𝐵) → (♯‘𝐹) = (♯‘ran 𝐹)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | f1f 6570 | . . . . 5 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴⟶𝐵) | |
2 | 1 | anim2i 618 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴–1-1→𝐵) → (𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶𝐵)) |
3 | 2 | ancomd 464 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴–1-1→𝐵) → (𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉)) |
4 | fex 6983 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → 𝐹 ∈ V) | |
5 | 3, 4 | syl 17 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴–1-1→𝐵) → 𝐹 ∈ V) |
6 | f1o2ndf1 7812 | . . . 4 ⊢ (𝐹:𝐴–1-1→𝐵 → (2nd ↾ 𝐹):𝐹–1-1-onto→ran 𝐹) | |
7 | df-2nd 7684 | . . . . . . . . 9 ⊢ 2nd = (𝑥 ∈ V ↦ ∪ ran {𝑥}) | |
8 | 7 | funmpt2 6389 | . . . . . . . 8 ⊢ Fun 2nd |
9 | resfunexg 6972 | . . . . . . . 8 ⊢ ((Fun 2nd ∧ 𝐹 ∈ V) → (2nd ↾ 𝐹) ∈ V) | |
10 | 8, 5, 9 | sylancr 589 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴–1-1→𝐵) → (2nd ↾ 𝐹) ∈ V) |
11 | f1oeq1 6599 | . . . . . . . . . 10 ⊢ ((2nd ↾ 𝐹) = 𝑓 → ((2nd ↾ 𝐹):𝐹–1-1-onto→ran 𝐹 ↔ 𝑓:𝐹–1-1-onto→ran 𝐹)) | |
12 | 11 | biimpd 231 | . . . . . . . . 9 ⊢ ((2nd ↾ 𝐹) = 𝑓 → ((2nd ↾ 𝐹):𝐹–1-1-onto→ran 𝐹 → 𝑓:𝐹–1-1-onto→ran 𝐹)) |
13 | 12 | eqcoms 2829 | . . . . . . . 8 ⊢ (𝑓 = (2nd ↾ 𝐹) → ((2nd ↾ 𝐹):𝐹–1-1-onto→ran 𝐹 → 𝑓:𝐹–1-1-onto→ran 𝐹)) |
14 | 13 | adantl 484 | . . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴–1-1→𝐵) ∧ 𝑓 = (2nd ↾ 𝐹)) → ((2nd ↾ 𝐹):𝐹–1-1-onto→ran 𝐹 → 𝑓:𝐹–1-1-onto→ran 𝐹)) |
15 | 10, 14 | spcimedv 3594 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴–1-1→𝐵) → ((2nd ↾ 𝐹):𝐹–1-1-onto→ran 𝐹 → ∃𝑓 𝑓:𝐹–1-1-onto→ran 𝐹)) |
16 | 15 | ex 415 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐹:𝐴–1-1→𝐵 → ((2nd ↾ 𝐹):𝐹–1-1-onto→ran 𝐹 → ∃𝑓 𝑓:𝐹–1-1-onto→ran 𝐹))) |
17 | 16 | com13 88 | . . . 4 ⊢ ((2nd ↾ 𝐹):𝐹–1-1-onto→ran 𝐹 → (𝐹:𝐴–1-1→𝐵 → (𝐴 ∈ 𝑉 → ∃𝑓 𝑓:𝐹–1-1-onto→ran 𝐹))) |
18 | 6, 17 | mpcom 38 | . . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → (𝐴 ∈ 𝑉 → ∃𝑓 𝑓:𝐹–1-1-onto→ran 𝐹)) |
19 | 18 | impcom 410 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴–1-1→𝐵) → ∃𝑓 𝑓:𝐹–1-1-onto→ran 𝐹) |
20 | hasheqf1oi 13706 | . 2 ⊢ (𝐹 ∈ V → (∃𝑓 𝑓:𝐹–1-1-onto→ran 𝐹 → (♯‘𝐹) = (♯‘ran 𝐹))) | |
21 | 5, 19, 20 | sylc 65 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴–1-1→𝐵) → (♯‘𝐹) = (♯‘ran 𝐹)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1533 ∃wex 1776 ∈ wcel 2110 Vcvv 3495 {csn 4561 ∪ cuni 4832 ran crn 5551 ↾ cres 5552 Fun wfun 6344 ⟶wf 6346 –1-1→wf1 6347 –1-1-onto→wf1o 6349 ‘cfv 6350 2nd c2nd 7682 ♯chash 13684 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-int 4870 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-ord 6189 df-on 6190 df-lim 6191 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-card 9362 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-n0 11892 df-z 11976 df-uz 12238 df-hash 13685 |
This theorem is referenced by: hashimarn 13795 usgrsizedg 26991 cycpmco2lem5 30767 cycpmconjslem2 30792 cyc3conja 30794 frlmdim 31004 hashf1dmrn 32350 |
Copyright terms: Public domain | W3C validator |