Theorem hashimarn 13800

Description: The size of the image of a one-to-one function 𝐸 under the range of a function 𝐹 which is a one-to-one function into the domain of 𝐸 equals the size of the function 𝐹. (Contributed by Alexander van der Vekens, 4-Feb-2018.) (Proof shortened by AV, 4-May-2021.)

Assertion

Ref	Expression
hashimarn	⊢ ((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ 𝐸 ∈ 𝑉) → (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸 → (♯‘(𝐸 “ ran 𝐹)) = (♯‘𝐹)))

Proof of Theorem hashimarn

Step	Hyp	Ref	Expression
1		f1f 6574	. . . . . . 7 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐸)
2	1	frnd 6520	. . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸 → ran 𝐹 ⊆ dom 𝐸)
3	2	adantl 484	. . . . 5 ⊢ (((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ 𝐸 ∈ 𝑉) ∧ 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸) → ran 𝐹 ⊆ dom 𝐸)
4		ssdmres 5875	. . . . 5 ⊢ (ran 𝐹 ⊆ dom 𝐸 ↔ dom (𝐸 ↾ ran 𝐹) = ran 𝐹)
5	3, 4	sylib 220	. . . 4 ⊢ (((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ 𝐸 ∈ 𝑉) ∧ 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸) → dom (𝐸 ↾ ran 𝐹) = ran 𝐹)
6	5	fveq2d 6673	. . 3 ⊢ (((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ 𝐸 ∈ 𝑉) ∧ 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸) → (♯‘dom (𝐸 ↾ ran 𝐹)) = (♯‘ran 𝐹))
7		f1fun 6576	. . . . . . . 8 ⊢ (𝐸:dom 𝐸–1-1→ran 𝐸 → Fun 𝐸)
8		funres 6396	. . . . . . . . 9 ⊢ (Fun 𝐸 → Fun (𝐸 ↾ ran 𝐹))
9	8	funfnd 6385	. . . . . . . 8 ⊢ (Fun 𝐸 → (𝐸 ↾ ran 𝐹) Fn dom (𝐸 ↾ ran 𝐹))
10	7, 9	syl 17	. . . . . . 7 ⊢ (𝐸:dom 𝐸–1-1→ran 𝐸 → (𝐸 ↾ ran 𝐹) Fn dom (𝐸 ↾ ran 𝐹))
11	10	ad2antrr 724	. . . . . 6 ⊢ (((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ 𝐸 ∈ 𝑉) ∧ 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸) → (𝐸 ↾ ran 𝐹) Fn dom (𝐸 ↾ ran 𝐹))
12		hashfn 13735	. . . . . 6 ⊢ ((𝐸 ↾ ran 𝐹) Fn dom (𝐸 ↾ ran 𝐹) → (♯‘(𝐸 ↾ ran 𝐹)) = (♯‘dom (𝐸 ↾ ran 𝐹)))
13	11, 12	syl 17	. . . . 5 ⊢ (((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ 𝐸 ∈ 𝑉) ∧ 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸) → (♯‘(𝐸 ↾ ran 𝐹)) = (♯‘dom (𝐸 ↾ ran 𝐹)))
14		ovex 7188	. . . . . . . 8 ⊢ (0..^(♯‘𝐹)) ∈ V
15		fex 6988	. . . . . . . 8 ⊢ ((𝐹:(0..^(♯‘𝐹))⟶dom 𝐸 ∧ (0..^(♯‘𝐹)) ∈ V) → 𝐹 ∈ V)
16	1, 14, 15	sylancl 588	. . . . . . 7 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸 → 𝐹 ∈ V)
17		rnexg 7613	. . . . . . 7 ⊢ (𝐹 ∈ V → ran 𝐹 ∈ V)
18	16, 17	syl 17	. . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸 → ran 𝐹 ∈ V)
19		simpll 765	. . . . . . 7 ⊢ (((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ 𝐸 ∈ 𝑉) ∧ 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸) → 𝐸:dom 𝐸–1-1→ran 𝐸)
20		f1ssres 6581	. . . . . . 7 ⊢ ((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ ran 𝐹 ⊆ dom 𝐸) → (𝐸 ↾ ran 𝐹):ran 𝐹–1-1→ran 𝐸)
21	19, 3, 20	syl2anc 586	. . . . . 6 ⊢ (((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ 𝐸 ∈ 𝑉) ∧ 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸) → (𝐸 ↾ ran 𝐹):ran 𝐹–1-1→ran 𝐸)
22		hashf1rn 13712	. . . . . 6 ⊢ ((ran 𝐹 ∈ V ∧ (𝐸 ↾ ran 𝐹):ran 𝐹–1-1→ran 𝐸) → (♯‘(𝐸 ↾ ran 𝐹)) = (♯‘ran (𝐸 ↾ ran 𝐹)))
23	18, 21, 22	syl2an2 684	. . . . 5 ⊢ (((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ 𝐸 ∈ 𝑉) ∧ 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸) → (♯‘(𝐸 ↾ ran 𝐹)) = (♯‘ran (𝐸 ↾ ran 𝐹)))
24	13, 23	eqtr3d 2858	. . . 4 ⊢ (((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ 𝐸 ∈ 𝑉) ∧ 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸) → (♯‘dom (𝐸 ↾ ran 𝐹)) = (♯‘ran (𝐸 ↾ ran 𝐹)))
25		df-ima 5567	. . . . 5 ⊢ (𝐸 “ ran 𝐹) = ran (𝐸 ↾ ran 𝐹)
26	25	fveq2i 6672	. . . 4 ⊢ (♯‘(𝐸 “ ran 𝐹)) = (♯‘ran (𝐸 ↾ ran 𝐹))
27	24, 26	syl6reqr 2875	. . 3 ⊢ (((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ 𝐸 ∈ 𝑉) ∧ 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸) → (♯‘(𝐸 “ ran 𝐹)) = (♯‘dom (𝐸 ↾ ran 𝐹)))
28		hashf1rn 13712	. . . . 5 ⊢ (((0..^(♯‘𝐹)) ∈ V ∧ 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸) → (♯‘𝐹) = (♯‘ran 𝐹))
29	14, 28	mpan 688	. . . 4 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸 → (♯‘𝐹) = (♯‘ran 𝐹))
30	29	adantl 484	. . 3 ⊢ (((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ 𝐸 ∈ 𝑉) ∧ 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸) → (♯‘𝐹) = (♯‘ran 𝐹))
31	6, 27, 30	3eqtr4d 2866	. 2 ⊢ (((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ 𝐸 ∈ 𝑉) ∧ 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸) → (♯‘(𝐸 “ ran 𝐹)) = (♯‘𝐹))
32	31	ex 415	1 ⊢ ((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ 𝐸 ∈ 𝑉) → (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐸 → (♯‘(𝐸 “ ran 𝐹)) = (♯‘𝐹)))

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1533   ∈ wcel 2110  Vcvv 3494   ⊆ wss 3935  dom cdm 5554  ran crn 5555   ↾ cres 5556   “ cima 5557  Fun wfun 6348   Fn wfn 6349  ⟶wf 6350  –1-1→wf1 6351  ‘cfv 6354  (class class class)co 7155  0cc0 10536  ..^cfzo 13032  ♯chash 13689

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 2157  ax-12 2173  ax-ext 2793  ax-rep 5189  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329  ax-un 7460  ax-cnex 10592  ax-resscn 10593  ax-1cn 10594  ax-icn 10595  ax-addcl 10596  ax-addrcl 10597  ax-mulcl 10598  ax-mulrcl 10599  ax-mulcom 10600  ax-addass 10601  ax-mulass 10602  ax-distr 10603  ax-i2m1 10604  ax-1ne0 10605  ax-1rid 10606  ax-rnegex 10607  ax-rrecex 10608  ax-cnre 10609  ax-pre-lttri 10610  ax-pre-lttrn 10611  ax-pre-ltadd 10612  ax-pre-mulgt0 10613

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 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4567  df-pr 4569  df-tp 4571  df-op 4573  df-uni 4838  df-int 4876  df-iun 4920  df-br 5066  df-opab 5128  df-mpt 5146  df-tr 5172  df-id 5459  df-eprel 5464  df-po 5473  df-so 5474  df-fr 5513  df-we 5515  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-pred 6147  df-ord 6193  df-on 6194  df-lim 6195  df-suc 6196  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-riota 7113  df-ov 7158  df-oprab 7159  df-mpo 7160  df-om 7580  df-2nd 7689  df-wrecs 7946  df-recs 8007  df-rdg 8045  df-1o 8101  df-er 8288  df-en 8509  df-dom 8510  df-sdom 8511  df-fin 8512  df-card 9367  df-pnf 10676  df-mnf 10677  df-xr 10678  df-ltxr 10679  df-le 10680  df-sub 10871  df-neg 10872  df-nn 11638  df-n0 11897  df-z 11981  df-uz 12243  df-hash 13690

This theorem is referenced by:  hashimarni  13801