Theorem sprsymrelfo 48397

Description: The mapping 𝐹 is a function from the subsets of the set of pairs over a fixed set 𝑉 onto the symmetric relations 𝑅 on the fixed set 𝑉. (Contributed by AV, 23-Nov-2021.)

Hypotheses

Ref	Expression
sprsymrelf.p	⊢ 𝑃 = 𝒫 (Pairs‘𝑉)
sprsymrelf.r	⊢ 𝑅 = {𝑟 ∈ 𝒫 (𝑉 × 𝑉) ∣ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥)}
sprsymrelf.f	⊢ 𝐹 = (𝑝 ∈ 𝑃 ↦ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}})

Assertion

Ref	Expression
sprsymrelfo	⊢ (𝑉 ∈ 𝑊 → 𝐹:𝑃–onto→𝑅)

Distinct variable groups:   𝑃,𝑝   𝑉,𝑐,𝑥,𝑦   𝑝,𝑐,𝑥,𝑦,𝑟   𝑅,𝑝   𝑉,𝑟,𝑐,𝑥,𝑦   𝑊,𝑐,𝑥,𝑦

Allowed substitution hints:   𝑃(𝑥, 𝑦, 𝑟, 𝑐)   𝑅(𝑥, 𝑦, 𝑟, 𝑐)   𝐹(𝑥, 𝑦, 𝑟, 𝑝, 𝑐)   𝑉(𝑝)   𝑊(𝑟, 𝑝)

Proof of Theorem sprsymrelfo

Dummy variables 𝑎 𝑏 𝑓 𝑞 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sprsymrelf.p	. . . 4 ⊢ 𝑃 = 𝒫 (Pairs‘𝑉)
2		sprsymrelf.r	. . . 4 ⊢ 𝑅 = {𝑟 ∈ 𝒫 (𝑉 × 𝑉) ∣ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥)}
3		sprsymrelf.f	. . . 4 ⊢ 𝐹 = (𝑝 ∈ 𝑃 ↦ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}})
4	1, 2, 3	sprsymrelf 48395	. . 3 ⊢ 𝐹:𝑃⟶𝑅
5	4	a1i 11	. 2 ⊢ (𝑉 ∈ 𝑊 → 𝐹:𝑃⟶𝑅)
6		breq 5105	. . . . . . . . 9 ⊢ (𝑟 = 𝑡 → (𝑥𝑟𝑦 ↔ 𝑥𝑡𝑦))
7		breq 5105	. . . . . . . . 9 ⊢ (𝑟 = 𝑡 → (𝑦𝑟𝑥 ↔ 𝑦𝑡𝑥))
8	6, 7	bibi12d 348	. . . . . . . 8 ⊢ (𝑟 = 𝑡 → ((𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥) ↔ (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥)))
9	8	2ralbidv 3226	. . . . . . 7 ⊢ (𝑟 = 𝑡 → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥) ↔ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥)))
10	9, 2	elrab2 3649	. . . . . 6 ⊢ (𝑡 ∈ 𝑅 ↔ (𝑡 ∈ 𝒫 (𝑉 × 𝑉) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥)))
11		eqid 2760	. . . . . . . . . . 11 ⊢ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)} = {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}
12	11	sprsymrelfolem1 48392	. . . . . . . . . 10 ⊢ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)} ∈ 𝒫 (Pairs‘𝑉)
13	12, 1	eleqtrri 2859	. . . . . . . . 9 ⊢ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)} ∈ 𝑃
14	13	a1i 11	. . . . . . . 8 ⊢ (((𝑡 ∈ 𝒫 (𝑉 × 𝑉) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥)) ∧ 𝑉 ∈ 𝑊) → {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)} ∈ 𝑃)
15		rexeq 3315	. . . . . . . . . . 11 ⊢ (𝑓 = {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)} → (∃𝑐 ∈ 𝑓 𝑐 = {𝑥, 𝑦} ↔ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}))
16	15	opabbidv 5171	. . . . . . . . . 10 ⊢ (𝑓 = {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)} → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑓 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}})
17	16	eqeq2d 2771	. . . . . . . . 9 ⊢ (𝑓 = {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)} → (𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑓 𝑐 = {𝑥, 𝑦}} ↔ 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}}))
18	17	adantl 487	. . . . . . . 8 ⊢ ((((𝑡 ∈ 𝒫 (𝑉 × 𝑉) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥)) ∧ 𝑉 ∈ 𝑊) ∧ 𝑓 = {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}) → (𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑓 𝑐 = {𝑥, 𝑦}} ↔ 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}}))
19		velpw 4562	. . . . . . . . . 10 ⊢ (𝑡 ∈ 𝒫 (𝑉 × 𝑉) ↔ 𝑡 ⊆ (𝑉 × 𝑉))
20		xpss 5671	. . . . . . . . . . . . . . . 16 ⊢ (𝑉 × 𝑉) ⊆ (V × V)
21		sstr2 3938	. . . . . . . . . . . . . . . 16 ⊢ (𝑡 ⊆ (𝑉 × 𝑉) → ((𝑉 × 𝑉) ⊆ (V × V) → 𝑡 ⊆ (V × V)))
22	20, 21	mpi 21	. . . . . . . . . . . . . . 15 ⊢ (𝑡 ⊆ (𝑉 × 𝑉) → 𝑡 ⊆ (V × V))
23		df-rel 5662	. . . . . . . . . . . . . . 15 ⊢ (Rel 𝑡 ↔ 𝑡 ⊆ (V × V))
24	22, 23	sylibr 237	. . . . . . . . . . . . . 14 ⊢ (𝑡 ⊆ (𝑉 × 𝑉) → Rel 𝑡)
25	24	adantl 487	. . . . . . . . . . . . 13 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑡 ⊆ (𝑉 × 𝑉)) → Rel 𝑡)
26		dfrel4v 6183	. . . . . . . . . . . . . 14 ⊢ (Rel 𝑡 ↔ 𝑡 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑡𝑦})
27		nfv 1947	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑥(𝑉 ∈ 𝑊 ∧ 𝑡 ⊆ (𝑉 × 𝑉))
28		nfra1 3286	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥)
29	27, 28	nfan 1932	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑥((𝑉 ∈ 𝑊 ∧ 𝑡 ⊆ (𝑉 × 𝑉)) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥))
30		nfv 1947	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑦(𝑉 ∈ 𝑊 ∧ 𝑡 ⊆ (𝑉 × 𝑉))
31		nfra2w 3298	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥)
32	30, 31	nfan 1932	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑦((𝑉 ∈ 𝑊 ∧ 𝑡 ⊆ (𝑉 × 𝑉)) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥))
33	11	sprsymrelfolem2 48393	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑡 ⊆ (𝑉 × 𝑉) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥)) → (𝑥𝑡𝑦 ↔ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}))
34	33	3expa 1136	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑡 ⊆ (𝑉 × 𝑉)) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥)) → (𝑥𝑡𝑦 ↔ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}))
35	29, 32, 34	opabbid 5170	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑡 ⊆ (𝑉 × 𝑉)) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥)) → {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑡𝑦} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}})
36	35	eqeq2d 2771	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑡 ⊆ (𝑉 × 𝑉)) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥)) → (𝑡 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑡𝑦} ↔ 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}}))
37	36	biimpd 232	. . . . . . . . . . . . . . . 16 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑡 ⊆ (𝑉 × 𝑉)) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥)) → (𝑡 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑡𝑦} → 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}}))
38	37	ex 418	. . . . . . . . . . . . . . 15 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑡 ⊆ (𝑉 × 𝑉)) → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥) → (𝑡 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑡𝑦} → 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}})))
39	38	com23 87	. . . . . . . . . . . . . 14 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑡 ⊆ (𝑉 × 𝑉)) → (𝑡 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑡𝑦} → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥) → 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}})))
40	26, 39	biimtrid 245	. . . . . . . . . . . . 13 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑡 ⊆ (𝑉 × 𝑉)) → (Rel 𝑡 → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥) → 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}})))
41	25, 40	mpd 16	. . . . . . . . . . . 12 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑡 ⊆ (𝑉 × 𝑉)) → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥) → 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}}))
42	41	expcom 419	. . . . . . . . . . 11 ⊢ (𝑡 ⊆ (𝑉 × 𝑉) → (𝑉 ∈ 𝑊 → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥) → 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}})))
43	42	com23 87	. . . . . . . . . 10 ⊢ (𝑡 ⊆ (𝑉 × 𝑉) → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥) → (𝑉 ∈ 𝑊 → 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}})))
44	19, 43	sylbi 220	. . . . . . . . 9 ⊢ (𝑡 ∈ 𝒫 (𝑉 × 𝑉) → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥) → (𝑉 ∈ 𝑊 → 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}})))
45	44	imp31 423	. . . . . . . 8 ⊢ (((𝑡 ∈ 𝒫 (𝑉 × 𝑉) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥)) ∧ 𝑉 ∈ 𝑊) → 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ {𝑞 ∈ (Pairs‘𝑉) ∣ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑞 = {𝑎, 𝑏} → 𝑎𝑡𝑏)}𝑐 = {𝑥, 𝑦}})
46	14, 18, 45	rspcedvd 3578	. . . . . . 7 ⊢ (((𝑡 ∈ 𝒫 (𝑉 × 𝑉) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥)) ∧ 𝑉 ∈ 𝑊) → ∃𝑓 ∈ 𝑃 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑓 𝑐 = {𝑥, 𝑦}})
47	46	ex 418	. . . . . 6 ⊢ ((𝑡 ∈ 𝒫 (𝑉 × 𝑉) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑡𝑦 ↔ 𝑦𝑡𝑥)) → (𝑉 ∈ 𝑊 → ∃𝑓 ∈ 𝑃 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑓 𝑐 = {𝑥, 𝑦}}))
48	10, 47	sylbi 220	. . . . 5 ⊢ (𝑡 ∈ 𝑅 → (𝑉 ∈ 𝑊 → ∃𝑓 ∈ 𝑃 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑓 𝑐 = {𝑥, 𝑦}}))
49	48	impcom 413	. . . 4 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑡 ∈ 𝑅) → ∃𝑓 ∈ 𝑃 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑓 𝑐 = {𝑥, 𝑦}})
50	1, 2, 3	sprsymrelfv 48394	. . . . . . 7 ⊢ (𝑓 ∈ 𝑃 → (𝐹‘𝑓) = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑓 𝑐 = {𝑥, 𝑦}})
51	50	adantl 487	. . . . . 6 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑡 ∈ 𝑅) ∧ 𝑓 ∈ 𝑃) → (𝐹‘𝑓) = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑓 𝑐 = {𝑥, 𝑦}})
52	51	eqeq2d 2771	. . . . 5 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑡 ∈ 𝑅) ∧ 𝑓 ∈ 𝑃) → (𝑡 = (𝐹‘𝑓) ↔ 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑓 𝑐 = {𝑥, 𝑦}}))
53	52	rexbidva 3184	. . . 4 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑡 ∈ 𝑅) → (∃𝑓 ∈ 𝑃 𝑡 = (𝐹‘𝑓) ↔ ∃𝑓 ∈ 𝑃 𝑡 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑓 𝑐 = {𝑥, 𝑦}}))
54	49, 53	mpbird 260	. . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑡 ∈ 𝑅) → ∃𝑓 ∈ 𝑃 𝑡 = (𝐹‘𝑓))
55	54	ralrimiva 3154	. 2 ⊢ (𝑉 ∈ 𝑊 → ∀𝑡 ∈ 𝑅 ∃𝑓 ∈ 𝑃 𝑡 = (𝐹‘𝑓))
56		dffo3 7095	. 2 ⊢ (𝐹:𝑃–onto→𝑅 ↔ (𝐹:𝑃⟶𝑅 ∧ ∀𝑡 ∈ 𝑅 ∃𝑓 ∈ 𝑃 𝑡 = (𝐹‘𝑓)))
57	5, 55, 56	sylanbrc 595	1 ⊢ (𝑉 ∈ 𝑊 → 𝐹:𝑃–onto→𝑅)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086  {crab 3412  Vcvv 3450   ⊆ wss 3899  𝒫 cpw 4557  {cpr 4586   class class class wbr 5103  {copab 5167   ↦ cmpt 5186   × cxp 5653  Rel wrel 5660  ⟶wf 6529  –onto→wfo 6531  ‘cfv 6533  Pairscspr 48377

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  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 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fo 6539  df-fv 6541  df-spr 48378

This theorem is used by:  sprsymrelf1o  48398