Theorem sprsymrelf1 46464

Description: The mapping 𝐹 is a one-to-one 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
sprsymrelf1	⊢ 𝐹:𝑃–1-1→𝑅

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

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

Proof of Theorem sprsymrelf1

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

Step	Hyp	Ref	Expression
1		sprsymrelf.p	. . 3 ⊢ 𝑃 = 𝒫 (Pairs‘𝑉)
2		sprsymrelf.r	. . 3 ⊢ 𝑅 = {𝑟 ∈ 𝒫 (𝑉 × 𝑉) ∣ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥)}
3		sprsymrelf.f	. . 3 ⊢ 𝐹 = (𝑝 ∈ 𝑃 ↦ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}})
4	1, 2, 3	sprsymrelf 46463	. 2 ⊢ 𝐹:𝑃⟶𝑅
5	1, 2, 3	sprsymrelfv 46462	. . . . 5 ⊢ (𝑎 ∈ 𝑃 → (𝐹‘𝑎) = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}})
6	1, 2, 3	sprsymrelfv 46462	. . . . 5 ⊢ (𝑏 ∈ 𝑃 → (𝐹‘𝑏) = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}})
7	5, 6	eqeqan12d 2745	. . . 4 ⊢ ((𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃) → ((𝐹‘𝑎) = (𝐹‘𝑏) ↔ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}}))
8	1	eleq2i 2824	. . . . . 6 ⊢ (𝑎 ∈ 𝑃 ↔ 𝑎 ∈ 𝒫 (Pairs‘𝑉))
9		vex 3477	. . . . . . 7 ⊢ 𝑎 ∈ V
10	9	elpw 4607	. . . . . 6 ⊢ (𝑎 ∈ 𝒫 (Pairs‘𝑉) ↔ 𝑎 ⊆ (Pairs‘𝑉))
11	8, 10	bitri 274	. . . . 5 ⊢ (𝑎 ∈ 𝑃 ↔ 𝑎 ⊆ (Pairs‘𝑉))
12	1	eleq2i 2824	. . . . . 6 ⊢ (𝑏 ∈ 𝑃 ↔ 𝑏 ∈ 𝒫 (Pairs‘𝑉))
13		vex 3477	. . . . . . 7 ⊢ 𝑏 ∈ V
14	13	elpw 4607	. . . . . 6 ⊢ (𝑏 ∈ 𝒫 (Pairs‘𝑉) ↔ 𝑏 ⊆ (Pairs‘𝑉))
15	12, 14	bitri 274	. . . . 5 ⊢ (𝑏 ∈ 𝑃 ↔ 𝑏 ⊆ (Pairs‘𝑉))
16		sprsymrelf1lem 46459	. . . . . . . 8 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} → 𝑎 ⊆ 𝑏))
17	16	imp 406	. . . . . . 7 ⊢ (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}}) → 𝑎 ⊆ 𝑏)
18		eqcom 2738	. . . . . . . . . 10 ⊢ ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} ↔ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}})
19		sprsymrelf1lem 46459	. . . . . . . . . 10 ⊢ ((𝑏 ⊆ (Pairs‘𝑉) ∧ 𝑎 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} → 𝑏 ⊆ 𝑎))
20	18, 19	biimtrid 241	. . . . . . . . 9 ⊢ ((𝑏 ⊆ (Pairs‘𝑉) ∧ 𝑎 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} → 𝑏 ⊆ 𝑎))
21	20	ancoms 458	. . . . . . . 8 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} → 𝑏 ⊆ 𝑎))
22	21	imp 406	. . . . . . 7 ⊢ (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}}) → 𝑏 ⊆ 𝑎)
23	17, 22	eqssd 4000	. . . . . 6 ⊢ (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}}) → 𝑎 = 𝑏)
24	23	ex 412	. . . . 5 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} → 𝑎 = 𝑏))
25	11, 15, 24	syl2anb 597	. . . 4 ⊢ ((𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} → 𝑎 = 𝑏))
26	7, 25	sylbid 239	. . 3 ⊢ ((𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃) → ((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏))
27	26	rgen2 3196	. 2 ⊢ ∀𝑎 ∈ 𝑃 ∀𝑏 ∈ 𝑃 ((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏)
28		dff13 7257	. 2 ⊢ (𝐹:𝑃–1-1→𝑅 ↔ (𝐹:𝑃⟶𝑅 ∧ ∀𝑎 ∈ 𝑃 ∀𝑏 ∈ 𝑃 ((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏)))
29	4, 27, 28	mpbir2an 708	1 ⊢ 𝐹:𝑃–1-1→𝑅

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1540   ∈ wcel 2105  ∀wral 3060  ∃wrex 3069  {crab 3431   ⊆ wss 3949  𝒫 cpw 4603  {cpr 4631   class class class wbr 5149  {copab 5211   ↦ cmpt 5232   × cxp 5675  ⟶wf 6540  –1-1→wf1 6541  ‘cfv 6544  Pairscspr 46445

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7728

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fv 6552  df-spr 46446

This theorem is referenced by:  sprsymrelf1o  46466