Theorem sprsymrelf 43060

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

Hypotheses

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

Assertion

Ref	Expression
sprsymrelf	⊢ 𝐹:𝑃⟶𝑅

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

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

Proof of Theorem sprsymrelf

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

Step	Hyp	Ref	Expression
1		sprsymrelf.f	. 2 ⊢ 𝐹 = (𝑝 ∈ 𝑃 ↦ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}})
2		sprsymrelfvlem 43055	. . . . 5 ⊢ (𝑝 ⊆ (Pairs‘𝑉) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉))
3		prcom 4547	. . . . . . . . . 10 ⊢ {𝑥, 𝑦} = {𝑦, 𝑥}
4	3	a1i 11	. . . . . . . . 9 ⊢ (((𝑝 ⊆ (Pairs‘𝑉) ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) ∧ 𝑐 ∈ 𝑝) → {𝑥, 𝑦} = {𝑦, 𝑥})
5	4	eqeq2d 2790	. . . . . . . 8 ⊢ (((𝑝 ⊆ (Pairs‘𝑉) ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) ∧ 𝑐 ∈ 𝑝) → (𝑐 = {𝑥, 𝑦} ↔ 𝑐 = {𝑦, 𝑥}))
6	5	rexbidva 3243	. . . . . . 7 ⊢ ((𝑝 ⊆ (Pairs‘𝑉) ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦} ↔ ∃𝑐 ∈ 𝑝 𝑐 = {𝑦, 𝑥}))
7		df-br 4935	. . . . . . . 8 ⊢ (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}})
8		opabid 5272	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}} ↔ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦})
9	7, 8	bitri 267	. . . . . . 7 ⊢ (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑦 ↔ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦})
10		vex 3420	. . . . . . . 8 ⊢ 𝑦 ∈ V
11		vex 3420	. . . . . . . 8 ⊢ 𝑥 ∈ V
12		preq12 4550	. . . . . . . . . 10 ⊢ ((𝑎 = 𝑦 ∧ 𝑏 = 𝑥) → {𝑎, 𝑏} = {𝑦, 𝑥})
13	12	eqeq2d 2790	. . . . . . . . 9 ⊢ ((𝑎 = 𝑦 ∧ 𝑏 = 𝑥) → (𝑐 = {𝑎, 𝑏} ↔ 𝑐 = {𝑦, 𝑥}))
14	13	rexbidv 3244	. . . . . . . 8 ⊢ ((𝑎 = 𝑦 ∧ 𝑏 = 𝑥) → (∃𝑐 ∈ 𝑝 𝑐 = {𝑎, 𝑏} ↔ ∃𝑐 ∈ 𝑝 𝑐 = {𝑦, 𝑥}))
15		preq12 4550	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → {𝑥, 𝑦} = {𝑎, 𝑏})
16	15	eqeq2d 2790	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → (𝑐 = {𝑥, 𝑦} ↔ 𝑐 = {𝑎, 𝑏}))
17	16	rexbidv 3244	. . . . . . . . 9 ⊢ ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → (∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦} ↔ ∃𝑐 ∈ 𝑝 𝑐 = {𝑎, 𝑏}))
18	17	cbvopabv 5006	. . . . . . . 8 ⊢ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}} = {⟨𝑎, 𝑏⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑎, 𝑏}}
19	10, 11, 14, 18	braba 5282	. . . . . . 7 ⊢ (𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑥 ↔ ∃𝑐 ∈ 𝑝 𝑐 = {𝑦, 𝑥})
20	6, 9, 19	3bitr4g 306	. . . . . 6 ⊢ ((𝑝 ⊆ (Pairs‘𝑉) ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑦 ↔ 𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑥))
21	20	ralrimivva 3143	. . . . 5 ⊢ (𝑝 ⊆ (Pairs‘𝑉) → ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑦 ↔ 𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑥))
22	2, 21	jca 504	. . . 4 ⊢ (𝑝 ⊆ (Pairs‘𝑉) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑦 ↔ 𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑥)))
23		sprsymrelf.p	. . . . . 6 ⊢ 𝑃 = 𝒫 (Pairs‘𝑉)
24	23	eleq2i 2859	. . . . 5 ⊢ (𝑝 ∈ 𝑃 ↔ 𝑝 ∈ 𝒫 (Pairs‘𝑉))
25		vex 3420	. . . . . 6 ⊢ 𝑝 ∈ V
26	25	elpw 4431	. . . . 5 ⊢ (𝑝 ∈ 𝒫 (Pairs‘𝑉) ↔ 𝑝 ⊆ (Pairs‘𝑉))
27	24, 26	bitri 267	. . . 4 ⊢ (𝑝 ∈ 𝑃 ↔ 𝑝 ⊆ (Pairs‘𝑉))
28		nfopab1 5003	. . . . . . 7 ⊢ Ⅎ𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}
29	28	nfeq2 2949	. . . . . 6 ⊢ Ⅎ𝑥 𝑟 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}
30		nfopab2 5004	. . . . . . . 8 ⊢ Ⅎ𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}
31	30	nfeq2 2949	. . . . . . 7 ⊢ Ⅎ𝑦 𝑟 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}
32		breq 4936	. . . . . . . 8 ⊢ (𝑟 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}} → (𝑥𝑟𝑦 ↔ 𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑦))
33		breq 4936	. . . . . . . 8 ⊢ (𝑟 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}} → (𝑦𝑟𝑥 ↔ 𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑥))
34	32, 33	bibi12d 338	. . . . . . 7 ⊢ (𝑟 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}} → ((𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥) ↔ (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑦 ↔ 𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑥)))
35	31, 34	ralbid 3180	. . . . . 6 ⊢ (𝑟 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}} → (∀𝑦 ∈ 𝑉 (𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥) ↔ ∀𝑦 ∈ 𝑉 (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑦 ↔ 𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑥)))
36	29, 35	ralbid 3180	. . . . 5 ⊢ (𝑟 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}} → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥) ↔ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑦 ↔ 𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑥)))
37	36	elrab 3597	. . . 4 ⊢ ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}} ∈ {𝑟 ∈ 𝒫 (𝑉 × 𝑉) ∣ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥)} ↔ ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑦 ↔ 𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}𝑥)))
38	22, 27, 37	3imtr4i 284	. . 3 ⊢ (𝑝 ∈ 𝑃 → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}} ∈ {𝑟 ∈ 𝒫 (𝑉 × 𝑉) ∣ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥)})
39		sprsymrelf.r	. . 3 ⊢ 𝑅 = {𝑟 ∈ 𝒫 (𝑉 × 𝑉) ∣ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥)}
40	38, 39	syl6eleqr 2879	. 2 ⊢ (𝑝 ∈ 𝑃 → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}} ∈ 𝑅)
41	1, 40	fmpti 6705	1 ⊢ 𝐹:𝑃⟶𝑅

Syntax hints:   ↔ wb 198   ∧ wa 387   = wceq 1508   ∈ wcel 2051  ∀wral 3090  ∃wrex 3091  {crab 3094   ⊆ wss 3831  𝒫 cpw 4425  {cpr 4446  ⟨cop 4450   class class class wbr 4934  {copab 4996   ↦ cmpt 5013   × cxp 5409  ⟶wf 6189  ‘cfv 6193  Pairscspr 43042

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1759  ax-4 1773  ax-5 1870  ax-6 1929  ax-7 1966  ax-8 2053  ax-9 2060  ax-10 2080  ax-11 2094  ax-12 2107  ax-13 2302  ax-ext 2752  ax-rep 5053  ax-sep 5064  ax-nul 5071  ax-pow 5123  ax-pr 5190  ax-un 7285

This theorem depends on definitions:  df-bi 199  df-an 388  df-or 835  df-3an 1071  df-tru 1511  df-ex 1744  df-nf 1748  df-sb 2017  df-mo 2551  df-eu 2589  df-clab 2761  df-cleq 2773  df-clel 2848  df-nfc 2920  df-ne 2970  df-ral 3095  df-rex 3096  df-reu 3097  df-rab 3099  df-v 3419  df-sbc 3684  df-csb 3789  df-dif 3834  df-un 3836  df-in 3838  df-ss 3845  df-nul 4182  df-if 4354  df-pw 4427  df-sn 4445  df-pr 4447  df-op 4451  df-uni 4718  df-iun 4799  df-br 4935  df-opab 4997  df-mpt 5014  df-id 5316  df-xp 5417  df-rel 5418  df-cnv 5419  df-co 5420  df-dm 5421  df-rn 5422  df-res 5423  df-ima 5424  df-iota 6157  df-fun 6195  df-fn 6196  df-f 6197  df-f1 6198  df-fo 6199  df-f1o 6200  df-fv 6201  df-spr 43043

This theorem is referenced by:  sprsymrelf1  43061  sprsymrelfo  43062