Theorem sprbisymrel 48407

Description: There is a bijection between the subsets of the set of pairs over a fixed set 𝑉 and the symmetric relations 𝑅 on the fixed set 𝑉. (Contributed by AV, 23-Nov-2021.)

Hypotheses

Ref	Expression
sprsymrelf.p	⊢ 𝑃 = 𝒫 (Pairs‘𝑉)
sprsymrelf.r	⊢ 𝑅 = {𝑟 ∈ 𝒫 (𝑉 × 𝑉) ∣ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥)}

Assertion

Ref	Expression
sprbisymrel	⊢ (𝑉 ∈ 𝑊 → ∃𝑓 𝑓:𝑃–1-1-onto→𝑅)

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

Allowed substitution hints:   𝑃(𝑥, 𝑦, 𝑟)   𝑅(𝑥, 𝑦, 𝑟)   𝑉(𝑓)   𝑊(𝑓, 𝑟)

Proof of Theorem sprbisymrel

Dummy variables 𝑝 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sprsymrelf.p	. . . 4 ⊢ 𝑃 = 𝒫 (Pairs‘𝑉)
2		fvex 6895	. . . . 5 ⊢ (Pairs‘𝑉) ∈ V
3	2	pwex 5349	. . . 4 ⊢ 𝒫 (Pairs‘𝑉) ∈ V
4	1, 3	eqeltri 2858	. . 3 ⊢ 𝑃 ∈ V
5		mptexg 7224	. . 3 ⊢ (𝑃 ∈ V → (𝑝 ∈ 𝑃 ↦ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) ∈ V)
6	4, 5	mp1i 14	. 2 ⊢ (𝑉 ∈ 𝑊 → (𝑝 ∈ 𝑃 ↦ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) ∈ V)
7		sprsymrelf.r	. . 3 ⊢ 𝑅 = {𝑟 ∈ 𝒫 (𝑉 × 𝑉) ∣ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥)}
8		eqid 2762	. . 3 ⊢ (𝑝 ∈ 𝑃 ↦ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) = (𝑝 ∈ 𝑃 ↦ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}})
9	1, 7, 8	sprsymrelf1o 48406	. 2 ⊢ (𝑉 ∈ 𝑊 → (𝑝 ∈ 𝑃 ↦ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}):𝑃–1-1-onto→𝑅)
10		f1oeq1 6809	. . 3 ⊢ (𝑓 = (𝑝 ∈ 𝑃 ↦ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) → (𝑓:𝑃–1-1-onto→𝑅 ↔ (𝑝 ∈ 𝑃 ↦ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}):𝑃–1-1-onto→𝑅))
11	10	spcegv 3554	. 2 ⊢ ((𝑝 ∈ 𝑃 ↦ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) ∈ V → ((𝑝 ∈ 𝑃 ↦ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}):𝑃–1-1-onto→𝑅 → ∃𝑓 𝑓:𝑃–1-1-onto→𝑅))
12	6, 9, 11	sylc 66	1 ⊢ (𝑉 ∈ 𝑊 → ∃𝑓 𝑓:𝑃–1-1-onto→𝑅)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088  {crab 3414  Vcvv 3453  𝒫 cpw 4560  {cpr 4589   class class class wbr 5107  {copab 5171   ↦ cmpt 5190   × cxp 5657  –1-1-onto→wf1o 6536  ‘cfv 6537  Pairscspr 48385

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-spr 48386

This theorem is used by:  sprsymrelen  48408