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

Theorem sprsymrelf1 45299
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.
StepHypRef Expression
1 sprsymrelf.p . . 3 𝑃 = 𝒫 (Pairs‘𝑉)
2 sprsymrelf.r . . 3 𝑅 = {𝑟 ∈ 𝒫 (𝑉 × 𝑉) ∣ ∀𝑥𝑉𝑦𝑉 (𝑥𝑟𝑦𝑦𝑟𝑥)}
3 sprsymrelf.f . . 3 𝐹 = (𝑝𝑃 ↦ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑝 𝑐 = {𝑥, 𝑦}})
41, 2, 3sprsymrelf 45298 . 2 𝐹:𝑃𝑅
51, 2, 3sprsymrelfv 45297 . . . . 5 (𝑎𝑃 → (𝐹𝑎) = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}})
61, 2, 3sprsymrelfv 45297 . . . . 5 (𝑏𝑃 → (𝐹𝑏) = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})
75, 6eqeqan12d 2750 . . . 4 ((𝑎𝑃𝑏𝑃) → ((𝐹𝑎) = (𝐹𝑏) ↔ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}))
81eleq2i 2828 . . . . . 6 (𝑎𝑃𝑎 ∈ 𝒫 (Pairs‘𝑉))
9 vex 3445 . . . . . . 7 𝑎 ∈ V
109elpw 4551 . . . . . 6 (𝑎 ∈ 𝒫 (Pairs‘𝑉) ↔ 𝑎 ⊆ (Pairs‘𝑉))
118, 10bitri 274 . . . . 5 (𝑎𝑃𝑎 ⊆ (Pairs‘𝑉))
121eleq2i 2828 . . . . . 6 (𝑏𝑃𝑏 ∈ 𝒫 (Pairs‘𝑉))
13 vex 3445 . . . . . . 7 𝑏 ∈ V
1413elpw 4551 . . . . . 6 (𝑏 ∈ 𝒫 (Pairs‘𝑉) ↔ 𝑏 ⊆ (Pairs‘𝑉))
1512, 14bitri 274 . . . . 5 (𝑏𝑃𝑏 ⊆ (Pairs‘𝑉))
16 sprsymrelf1lem 45294 . . . . . . . 8 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} → 𝑎𝑏))
1716imp 407 . . . . . . 7 (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) → 𝑎𝑏)
18 eqcom 2743 . . . . . . . . . 10 ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} ↔ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}})
19 sprsymrelf1lem 45294 . . . . . . . . . 10 ((𝑏 ⊆ (Pairs‘𝑉) ∧ 𝑎 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} → 𝑏𝑎))
2018, 19biimtrid 241 . . . . . . . . 9 ((𝑏 ⊆ (Pairs‘𝑉) ∧ 𝑎 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} → 𝑏𝑎))
2120ancoms 459 . . . . . . . 8 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} → 𝑏𝑎))
2221imp 407 . . . . . . 7 (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) → 𝑏𝑎)
2317, 22eqssd 3949 . . . . . 6 (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) → 𝑎 = 𝑏)
2423ex 413 . . . . 5 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} → 𝑎 = 𝑏))
2511, 15, 24syl2anb 598 . . . 4 ((𝑎𝑃𝑏𝑃) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} → 𝑎 = 𝑏))
267, 25sylbid 239 . . 3 ((𝑎𝑃𝑏𝑃) → ((𝐹𝑎) = (𝐹𝑏) → 𝑎 = 𝑏))
2726rgen2 3190 . 2 𝑎𝑃𝑏𝑃 ((𝐹𝑎) = (𝐹𝑏) → 𝑎 = 𝑏)
28 dff13 7184 . 2 (𝐹:𝑃1-1𝑅 ↔ (𝐹:𝑃𝑅 ∧ ∀𝑎𝑃𝑏𝑃 ((𝐹𝑎) = (𝐹𝑏) → 𝑎 = 𝑏)))
294, 27, 28mpbir2an 708 1 𝐹:𝑃1-1𝑅
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1540  wcel 2105  wral 3061  wrex 3070  {crab 3403  wss 3898  𝒫 cpw 4547  {cpr 4575   class class class wbr 5092  {copab 5154  cmpt 5175   × cxp 5618  wf 6475  1-1wf1 6476  cfv 6479  Pairscspr 45280
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 2707  ax-rep 5229  ax-sep 5243  ax-nul 5250  ax-pow 5308  ax-pr 5372  ax-un 7650
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2886  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3404  df-v 3443  df-sbc 3728  df-csb 3844  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4270  df-if 4474  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4853  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5176  df-id 5518  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-iota 6431  df-fun 6481  df-fn 6482  df-f 6483  df-f1 6484  df-fv 6487  df-spr 45281
This theorem is referenced by:  sprsymrelf1o  45301
  Copyright terms: Public domain W3C validator