Theorem imasetpreimafvbijlemfo 48456

Description: Lemma for imasetpreimafvbij 48457: the mapping 𝐻 is a function onto the range of function 𝐹. (Contributed by AV, 22-Mar-2024.)

Hypotheses

Ref	Expression
fundcmpsurinj.p	⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
fundcmpsurinj.h	⊢ 𝐻 = (𝑝 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑝))

Assertion

Ref	Expression
imasetpreimafvbijlemfo	⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝐻:𝑃–onto→(𝐹 “ 𝐴))

Distinct variable groups:   𝑥,𝐴,𝑧   𝑥,𝐹,𝑧,𝑝   𝑃,𝑝   𝐴,𝑝,𝑥,𝑧   𝑥,𝑃   𝑉,𝑝

Allowed substitution hints:   𝑃(𝑧)   𝐻(𝑥, 𝑧, 𝑝)   𝑉(𝑥, 𝑧)

Proof of Theorem imasetpreimafvbijlemfo

Dummy variables 𝑦 𝑎 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fundcmpsurinj.p	. . . 4 ⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
2		fundcmpsurinj.h	. . . 4 ⊢ 𝐻 = (𝑝 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑝))
3	1, 2	imasetpreimafvbijlemf 48452	. . 3 ⊢ (𝐹 Fn 𝐴 → 𝐻:𝑃⟶(𝐹 “ 𝐴))
4	3	adantr 486	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝐻:𝑃⟶(𝐹 “ 𝐴))
5	1	preimafvelsetpreimafv 48439	. . . . . . . . 9 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴) → (◡𝐹 “ {(𝐹‘𝑎)}) ∈ 𝑃)
6	5	3expa 1136	. . . . . . . 8 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) → (◡𝐹 “ {(𝐹‘𝑎)}) ∈ 𝑃)
7		imaeq2 6048	. . . . . . . . . . 11 ⊢ (𝑝 = (◡𝐹 “ {(𝐹‘𝑎)}) → (𝐹 “ 𝑝) = (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)})))
8	7	unieqd 4880	. . . . . . . . . 10 ⊢ (𝑝 = (◡𝐹 “ {(𝐹‘𝑎)}) → ∪ (𝐹 “ 𝑝) = ∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)})))
9	8	eqeq2d 2772	. . . . . . . . 9 ⊢ (𝑝 = (◡𝐹 “ {(𝐹‘𝑎)}) → ((𝐹‘𝑎) = ∪ (𝐹 “ 𝑝) ↔ (𝐹‘𝑎) = ∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)}))))
10	9	adantl 487	. . . . . . . 8 ⊢ ((((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) ∧ 𝑝 = (◡𝐹 “ {(𝐹‘𝑎)})) → ((𝐹‘𝑎) = ∪ (𝐹 “ 𝑝) ↔ (𝐹‘𝑎) = ∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)}))))
11		uniimaprimaeqfv 48433	. . . . . . . . . 10 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑎 ∈ 𝐴) → ∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)})) = (𝐹‘𝑎))
12	11	adantlr 728	. . . . . . . . 9 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) → ∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)})) = (𝐹‘𝑎))
13	12	eqcomd 2767	. . . . . . . 8 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) → (𝐹‘𝑎) = ∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)})))
14	6, 10, 13	rspcedvd 3579	. . . . . . 7 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) → ∃𝑝 ∈ 𝑃 (𝐹‘𝑎) = ∪ (𝐹 “ 𝑝))
15		eqeq1 2765	. . . . . . . . 9 ⊢ (𝑦 = (𝐹‘𝑎) → (𝑦 = ∪ (𝐹 “ 𝑝) ↔ (𝐹‘𝑎) = ∪ (𝐹 “ 𝑝)))
16	15	eqcoms 2769	. . . . . . . 8 ⊢ ((𝐹‘𝑎) = 𝑦 → (𝑦 = ∪ (𝐹 “ 𝑝) ↔ (𝐹‘𝑎) = ∪ (𝐹 “ 𝑝)))
17	16	rexbidv 3187	. . . . . . 7 ⊢ ((𝐹‘𝑎) = 𝑦 → (∃𝑝 ∈ 𝑃 𝑦 = ∪ (𝐹 “ 𝑝) ↔ ∃𝑝 ∈ 𝑃 (𝐹‘𝑎) = ∪ (𝐹 “ 𝑝)))
18	14, 17	syl5ibrcom 250	. . . . . 6 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) → ((𝐹‘𝑎) = 𝑦 → ∃𝑝 ∈ 𝑃 𝑦 = ∪ (𝐹 “ 𝑝)))
19	18	rexlimdva 3164	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → (∃𝑎 ∈ 𝐴 (𝐹‘𝑎) = 𝑦 → ∃𝑝 ∈ 𝑃 𝑦 = ∪ (𝐹 “ 𝑝)))
20	8	eqcomd 2767	. . . . . . . . . . 11 ⊢ (𝑝 = (◡𝐹 “ {(𝐹‘𝑎)}) → ∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)})) = ∪ (𝐹 “ 𝑝))
21	13, 20	sylan9eq 2816	. . . . . . . . . 10 ⊢ ((((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) ∧ 𝑝 = (◡𝐹 “ {(𝐹‘𝑎)})) → (𝐹‘𝑎) = ∪ (𝐹 “ 𝑝))
22	21	ex 418	. . . . . . . . 9 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) → (𝑝 = (◡𝐹 “ {(𝐹‘𝑎)}) → (𝐹‘𝑎) = ∪ (𝐹 “ 𝑝)))
23	22	reximdva 3176	. . . . . . . 8 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → (∃𝑎 ∈ 𝐴 𝑝 = (◡𝐹 “ {(𝐹‘𝑎)}) → ∃𝑎 ∈ 𝐴 (𝐹‘𝑎) = ∪ (𝐹 “ 𝑝)))
24	1	elsetpreimafv 48436	. . . . . . . . 9 ⊢ (𝑝 ∈ 𝑃 → ∃𝑥 ∈ 𝐴 𝑝 = (◡𝐹 “ {(𝐹‘𝑥)}))
25		fveq2 6883	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑥 → (𝐹‘𝑎) = (𝐹‘𝑥))
26	25	sneqd 4596	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑥 → {(𝐹‘𝑎)} = {(𝐹‘𝑥)})
27	26	imaeq2d 6052	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → (◡𝐹 “ {(𝐹‘𝑎)}) = (◡𝐹 “ {(𝐹‘𝑥)}))
28	27	eqeq2d 2772	. . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → (𝑝 = (◡𝐹 “ {(𝐹‘𝑎)}) ↔ 𝑝 = (◡𝐹 “ {(𝐹‘𝑥)})))
29	28	cbvrexvw 3242	. . . . . . . . 9 ⊢ (∃𝑎 ∈ 𝐴 𝑝 = (◡𝐹 “ {(𝐹‘𝑎)}) ↔ ∃𝑥 ∈ 𝐴 𝑝 = (◡𝐹 “ {(𝐹‘𝑥)}))
30	24, 29	sylibr 237	. . . . . . . 8 ⊢ (𝑝 ∈ 𝑃 → ∃𝑎 ∈ 𝐴 𝑝 = (◡𝐹 “ {(𝐹‘𝑎)}))
31	23, 30	impel 515	. . . . . . 7 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝑝 ∈ 𝑃) → ∃𝑎 ∈ 𝐴 (𝐹‘𝑎) = ∪ (𝐹 “ 𝑝))
32		eqeq2 2773	. . . . . . . 8 ⊢ (𝑦 = ∪ (𝐹 “ 𝑝) → ((𝐹‘𝑎) = 𝑦 ↔ (𝐹‘𝑎) = ∪ (𝐹 “ 𝑝)))
33	32	rexbidv 3187	. . . . . . 7 ⊢ (𝑦 = ∪ (𝐹 “ 𝑝) → (∃𝑎 ∈ 𝐴 (𝐹‘𝑎) = 𝑦 ↔ ∃𝑎 ∈ 𝐴 (𝐹‘𝑎) = ∪ (𝐹 “ 𝑝)))
34	31, 33	syl5ibrcom 250	. . . . . 6 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝑝 ∈ 𝑃) → (𝑦 = ∪ (𝐹 “ 𝑝) → ∃𝑎 ∈ 𝐴 (𝐹‘𝑎) = 𝑦))
35	34	rexlimdva 3164	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → (∃𝑝 ∈ 𝑃 𝑦 = ∪ (𝐹 “ 𝑝) → ∃𝑎 ∈ 𝐴 (𝐹‘𝑎) = 𝑦))
36	19, 35	impbid 215	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → (∃𝑎 ∈ 𝐴 (𝐹‘𝑎) = 𝑦 ↔ ∃𝑝 ∈ 𝑃 𝑦 = ∪ (𝐹 “ 𝑝)))
37	36	abbidv 2827	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → {𝑦 ∣ ∃𝑎 ∈ 𝐴 (𝐹‘𝑎) = 𝑦} = {𝑦 ∣ ∃𝑝 ∈ 𝑃 𝑦 = ∪ (𝐹 “ 𝑝)})
38		fnfun 6637	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
39		fndm 6640	. . . . . . 7 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
40		eqimss2 3990	. . . . . . 7 ⊢ (dom 𝐹 = 𝐴 → 𝐴 ⊆ dom 𝐹)
41	39, 40	syl 18	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → 𝐴 ⊆ dom 𝐹)
42	38, 41	jca 521	. . . . 5 ⊢ (𝐹 Fn 𝐴 → (Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹))
43	42	adantr 486	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → (Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹))
44		dfimafn 6945	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑎 ∈ 𝐴 (𝐹‘𝑎) = 𝑦})
45	43, 44	syl 18	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑎 ∈ 𝐴 (𝐹‘𝑎) = 𝑦})
46	2	rnmpt 5939	. . . 4 ⊢ ran 𝐻 = {𝑦 ∣ ∃𝑝 ∈ 𝑃 𝑦 = ∪ (𝐹 “ 𝑝)}
47	46	a1i 11	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → ran 𝐻 = {𝑦 ∣ ∃𝑝 ∈ 𝑃 𝑦 = ∪ (𝐹 “ 𝑝)})
48	37, 45, 47	3eqtr4rd 2807	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → ran 𝐻 = (𝐹 “ 𝐴))
49		dffo2 6798	. 2 ⊢ (𝐻:𝑃–onto→(𝐹 “ 𝐴) ↔ (𝐻:𝑃⟶(𝐹 “ 𝐴) ∧ ran 𝐻 = (𝐹 “ 𝐴)))
50	4, 48, 49	sylanbrc 595	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝐻:𝑃–onto→(𝐹 “ 𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  ∃wrex 3087   ⊆ wss 3899  {csn 4584  ∪ cuni 4867   ↦ cmpt 5186  ^◡ccnv 5650  dom cdm 5651  ran crn 5652   “ cima 5654  Fun wfun 6531   Fn wfn 6532  ⟶wf 6533  –onto→wfo 6535  ‘cfv 6537

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 7749

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  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-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545

This theorem is used by:  imasetpreimafvbij  48457