Mathbox for Alexander van der Vekens < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sprsymrelf Structured version   Visualization version   GIF version

Theorem sprsymrelf 43939
 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.
StepHypRef Expression
1 sprsymrelf.f . 2 𝐹 = (𝑝𝑃 ↦ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}})
2 sprsymrelfvlem 43934 . . . . 5 (𝑝 ⊆ (Pairs‘𝑉) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉))
3 prcom 4654 . . . . . . . . . 10 {𝑥, 𝑦} = {𝑦, 𝑥}
43a1i 11 . . . . . . . . 9 (((𝑝 ⊆ (Pairs‘𝑉) ∧ (𝑥𝑉𝑦𝑉)) ∧ 𝑐𝑝) → {𝑥, 𝑦} = {𝑦, 𝑥})
54eqeq2d 2835 . . . . . . . 8 (((𝑝 ⊆ (Pairs‘𝑉) ∧ (𝑥𝑉𝑦𝑉)) ∧ 𝑐𝑝) → (𝑐 = {𝑥, 𝑦} ↔ 𝑐 = {𝑦, 𝑥}))
65rexbidva 3289 . . . . . . 7 ((𝑝 ⊆ (Pairs‘𝑉) ∧ (𝑥𝑉𝑦𝑉)) → (∃𝑐𝑝 𝑐 = {𝑥, 𝑦} ↔ ∃𝑐𝑝 𝑐 = {𝑦, 𝑥}))
7 df-br 5054 . . . . . . . 8 (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}})
8 opabidw 5400 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}} ↔ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦})
97, 8bitri 278 . . . . . . 7 (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑦 ↔ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦})
10 vex 3484 . . . . . . . 8 𝑦 ∈ V
11 vex 3484 . . . . . . . 8 𝑥 ∈ V
12 preq12 4657 . . . . . . . . . 10 ((𝑎 = 𝑦𝑏 = 𝑥) → {𝑎, 𝑏} = {𝑦, 𝑥})
1312eqeq2d 2835 . . . . . . . . 9 ((𝑎 = 𝑦𝑏 = 𝑥) → (𝑐 = {𝑎, 𝑏} ↔ 𝑐 = {𝑦, 𝑥}))
1413rexbidv 3290 . . . . . . . 8 ((𝑎 = 𝑦𝑏 = 𝑥) → (∃𝑐𝑝 𝑐 = {𝑎, 𝑏} ↔ ∃𝑐𝑝 𝑐 = {𝑦, 𝑥}))
15 preq12 4657 . . . . . . . . . . 11 ((𝑥 = 𝑎𝑦 = 𝑏) → {𝑥, 𝑦} = {𝑎, 𝑏})
1615eqeq2d 2835 . . . . . . . . . 10 ((𝑥 = 𝑎𝑦 = 𝑏) → (𝑐 = {𝑥, 𝑦} ↔ 𝑐 = {𝑎, 𝑏}))
1716rexbidv 3290 . . . . . . . . 9 ((𝑥 = 𝑎𝑦 = 𝑏) → (∃𝑐𝑝 𝑐 = {𝑥, 𝑦} ↔ ∃𝑐𝑝 𝑐 = {𝑎, 𝑏}))
1817cbvopabv 5125 . . . . . . . 8 {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}} = {⟨𝑎, 𝑏⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑎, 𝑏}}
1910, 11, 14, 18braba 5412 . . . . . . 7 (𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑥 ↔ ∃𝑐𝑝 𝑐 = {𝑦, 𝑥})
206, 9, 193bitr4g 317 . . . . . 6 ((𝑝 ⊆ (Pairs‘𝑉) ∧ (𝑥𝑉𝑦𝑉)) → (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑦𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑥))
2120ralrimivva 3186 . . . . 5 (𝑝 ⊆ (Pairs‘𝑉) → ∀𝑥𝑉𝑦𝑉 (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑦𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑥))
222, 21jca 515 . . . 4 (𝑝 ⊆ (Pairs‘𝑉) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉) ∧ ∀𝑥𝑉𝑦𝑉 (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑦𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑥)))
23 sprsymrelf.p . . . . . 6 𝑃 = 𝒫 (Pairs‘𝑉)
2423eleq2i 2907 . . . . 5 (𝑝𝑃𝑝 ∈ 𝒫 (Pairs‘𝑉))
25 vex 3484 . . . . . 6 𝑝 ∈ V
2625elpw 4527 . . . . 5 (𝑝 ∈ 𝒫 (Pairs‘𝑉) ↔ 𝑝 ⊆ (Pairs‘𝑉))
2724, 26bitri 278 . . . 4 (𝑝𝑃𝑝 ⊆ (Pairs‘𝑉))
28 nfopab1 5122 . . . . . . 7 𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}
2928nfeq2 2999 . . . . . 6 𝑥 𝑟 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}
30 nfopab2 5123 . . . . . . . 8 𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}
3130nfeq2 2999 . . . . . . 7 𝑦 𝑟 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}
32 breq 5055 . . . . . . . 8 (𝑟 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}} → (𝑥𝑟𝑦𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑦))
33 breq 5055 . . . . . . . 8 (𝑟 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}} → (𝑦𝑟𝑥𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑥))
3432, 33bibi12d 349 . . . . . . 7 (𝑟 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}} → ((𝑥𝑟𝑦𝑦𝑟𝑥) ↔ (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑦𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑥)))
3531, 34ralbid 3226 . . . . . 6 (𝑟 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}} → (∀𝑦𝑉 (𝑥𝑟𝑦𝑦𝑟𝑥) ↔ ∀𝑦𝑉 (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑦𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑥)))
3629, 35ralbid 3226 . . . . 5 (𝑟 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}} → (∀𝑥𝑉𝑦𝑉 (𝑥𝑟𝑦𝑦𝑟𝑥) ↔ ∀𝑥𝑉𝑦𝑉 (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑦𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑥)))
3736elrab 3667 . . . 4 ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}} ∈ {𝑟 ∈ 𝒫 (𝑉 × 𝑉) ∣ ∀𝑥𝑉𝑦𝑉 (𝑥𝑟𝑦𝑦𝑟𝑥)} ↔ ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉) ∧ ∀𝑥𝑉𝑦𝑉 (𝑥{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑦𝑦{⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}}𝑥)))
3822, 27, 373imtr4i 295 . . 3 (𝑝𝑃 → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}} ∈ {𝑟 ∈ 𝒫 (𝑉 × 𝑉) ∣ ∀𝑥𝑉𝑦𝑉 (𝑥𝑟𝑦𝑦𝑟𝑥)})
39 sprsymrelf.r . . 3 𝑅 = {𝑟 ∈ 𝒫 (𝑉 × 𝑉) ∣ ∀𝑥𝑉𝑦𝑉 (𝑥𝑟𝑦𝑦𝑟𝑥)}
4038, 39eleqtrrdi 2927 . 2 (𝑝𝑃 → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}} ∈ 𝑅)
411, 40fmpti 6868 1 𝐹:𝑃𝑅
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2115  ∀wral 3133  ∃wrex 3134  {crab 3137   ⊆ wss 3920  𝒫 cpw 4523  {cpr 4553  ⟨cop 4557   class class class wbr 5053  {copab 5115   ↦ cmpt 5133   × cxp 5541  ⟶wf 6340  ‘cfv 6344  Pairscspr 43921 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-rep 5177  ax-sep 5190  ax-nul 5197  ax-pow 5254  ax-pr 5318  ax-un 7456 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ne 3015  df-ral 3138  df-rex 3139  df-reu 3140  df-rab 3142  df-v 3483  df-sbc 3760  df-csb 3868  df-dif 3923  df-un 3925  df-in 3927  df-ss 3937  df-nul 4278  df-if 4452  df-pw 4525  df-sn 4552  df-pr 4554  df-op 4558  df-uni 4826  df-iun 4908  df-br 5054  df-opab 5116  df-mpt 5134  df-id 5448  df-xp 5549  df-rel 5550  df-cnv 5551  df-co 5552  df-dm 5553  df-rn 5554  df-res 5555  df-ima 5556  df-iota 6303  df-fun 6346  df-fn 6347  df-f 6348  df-f1 6349  df-fo 6350  df-f1o 6351  df-fv 6352  df-spr 43922 This theorem is referenced by:  sprsymrelf1  43940  sprsymrelfo  43941
 Copyright terms: Public domain W3C validator