Theorem sprsymrelf1 41746

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 41745	. 2 ⊢ 𝐹:𝑃⟶𝑅
5	1, 2, 3	sprsymrelfv 41744	. . . . 5 ⊢ (𝑎 ∈ 𝑃 → (𝐹‘𝑎) = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}})
6	1, 2, 3	sprsymrelfv 41744	. . . . 5 ⊢ (𝑏 ∈ 𝑃 → (𝐹‘𝑏) = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}})
7	5, 6	eqeqan12d 2638	. . . 4 ⊢ ((𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃) → ((𝐹‘𝑎) = (𝐹‘𝑏) ↔ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}}))
8	1	eleq2i 2693	. . . . . 6 ⊢ (𝑎 ∈ 𝑃 ↔ 𝑎 ∈ 𝒫 (Pairs‘𝑉))
9		vex 3203	. . . . . . 7 ⊢ 𝑎 ∈ V
10	9	elpw 4164	. . . . . 6 ⊢ (𝑎 ∈ 𝒫 (Pairs‘𝑉) ↔ 𝑎 ⊆ (Pairs‘𝑉))
11	8, 10	bitri 264	. . . . 5 ⊢ (𝑎 ∈ 𝑃 ↔ 𝑎 ⊆ (Pairs‘𝑉))
12	1	eleq2i 2693	. . . . . 6 ⊢ (𝑏 ∈ 𝑃 ↔ 𝑏 ∈ 𝒫 (Pairs‘𝑉))
13		vex 3203	. . . . . . 7 ⊢ 𝑏 ∈ V
14	13	elpw 4164	. . . . . 6 ⊢ (𝑏 ∈ 𝒫 (Pairs‘𝑉) ↔ 𝑏 ⊆ (Pairs‘𝑉))
15	12, 14	bitri 264	. . . . 5 ⊢ (𝑏 ∈ 𝑃 ↔ 𝑏 ⊆ (Pairs‘𝑉))
16		sprsymrelf1lem 41741	. . . . . . . 8 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} → 𝑎 ⊆ 𝑏))
17	16	imp 445	. . . . . . 7 ⊢ (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}}) → 𝑎 ⊆ 𝑏)
18		eqcom 2629	. . . . . . . . . 10 ⊢ ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} ↔ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}})
19		sprsymrelf1lem 41741	. . . . . . . . . 10 ⊢ ((𝑏 ⊆ (Pairs‘𝑉) ∧ 𝑎 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} → 𝑏 ⊆ 𝑎))
20	18, 19	syl5bi 232	. . . . . . . . 9 ⊢ ((𝑏 ⊆ (Pairs‘𝑉) ∧ 𝑎 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} → 𝑏 ⊆ 𝑎))
21	20	ancoms 469	. . . . . . . 8 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} → 𝑏 ⊆ 𝑎))
22	21	imp 445	. . . . . . 7 ⊢ (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}}) → 𝑏 ⊆ 𝑎)
23	17, 22	eqssd 3620	. . . . . 6 ⊢ (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}}) → 𝑎 = 𝑏)
24	23	ex 450	. . . . 5 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} → 𝑎 = 𝑏))
25	11, 15, 24	syl2anb 496	. . . 4 ⊢ ((𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑏 𝑐 = {𝑥, 𝑦}} → 𝑎 = 𝑏))
26	7, 25	sylbid 230	. . 3 ⊢ ((𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃) → ((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏))
27	26	rgen2a 2977	. 2 ⊢ ∀𝑎 ∈ 𝑃 ∀𝑏 ∈ 𝑃 ((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏)
28		dff13 6512	. 2 ⊢ (𝐹:𝑃–1-1→𝑅 ↔ (𝐹:𝑃⟶𝑅 ∧ ∀𝑎 ∈ 𝑃 ∀𝑏 ∈ 𝑃 ((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏)))
29	4, 27, 28	mpbir2an 955	1 ⊢ 𝐹:𝑃–1-1→𝑅

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1483   ∈ wcel 1990  ∀wral 2912  ∃wrex 2913  {crab 2916   ⊆ wss 3574  𝒫 cpw 4158  {cpr 4179   class class class wbr 4653  {copab 4712   ↦ cmpt 4729   × cxp 5112  ⟶wf 5884  –1-1→wf1 5885  ‘cfv 5888  Pairscspr 41727

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-spr 41728

This theorem is referenced by:  sprsymrelf1o  41748