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

Theorem sprvalpw 42055
 Description: The set of all unordered pairs over a given set 𝑉, expressed by a restricted class abstraction. (Contributed by AV, 21-Nov-2021.)
Assertion
Ref Expression
sprvalpw (𝑉𝑊 → (Pairs‘𝑉) = {𝑝 ∈ 𝒫 𝑉 ∣ ∃𝑎𝑉𝑏𝑉 𝑝 = {𝑎, 𝑏}})
Distinct variable groups:   𝑉,𝑎,𝑏,𝑝   𝑊,𝑎,𝑏,𝑝

Proof of Theorem sprvalpw
StepHypRef Expression
1 sprval 42054 . 2 (𝑉𝑊 → (Pairs‘𝑉) = {𝑝 ∣ ∃𝑎𝑉𝑏𝑉 𝑝 = {𝑎, 𝑏}})
2 prssi 4385 . . . . . . . 8 ((𝑎𝑉𝑏𝑉) → {𝑎, 𝑏} ⊆ 𝑉)
3 eleq1 2718 . . . . . . . . 9 (𝑝 = {𝑎, 𝑏} → (𝑝 ∈ 𝒫 𝑉 ↔ {𝑎, 𝑏} ∈ 𝒫 𝑉))
4 prex 4939 . . . . . . . . . 10 {𝑎, 𝑏} ∈ V
54elpw 4197 . . . . . . . . 9 ({𝑎, 𝑏} ∈ 𝒫 𝑉 ↔ {𝑎, 𝑏} ⊆ 𝑉)
63, 5syl6bb 276 . . . . . . . 8 (𝑝 = {𝑎, 𝑏} → (𝑝 ∈ 𝒫 𝑉 ↔ {𝑎, 𝑏} ⊆ 𝑉))
72, 6syl5ibrcom 237 . . . . . . 7 ((𝑎𝑉𝑏𝑉) → (𝑝 = {𝑎, 𝑏} → 𝑝 ∈ 𝒫 𝑉))
87rexlimivv 3065 . . . . . 6 (∃𝑎𝑉𝑏𝑉 𝑝 = {𝑎, 𝑏} → 𝑝 ∈ 𝒫 𝑉)
98pm4.71ri 666 . . . . 5 (∃𝑎𝑉𝑏𝑉 𝑝 = {𝑎, 𝑏} ↔ (𝑝 ∈ 𝒫 𝑉 ∧ ∃𝑎𝑉𝑏𝑉 𝑝 = {𝑎, 𝑏}))
109a1i 11 . . . 4 (𝑉𝑊 → (∃𝑎𝑉𝑏𝑉 𝑝 = {𝑎, 𝑏} ↔ (𝑝 ∈ 𝒫 𝑉 ∧ ∃𝑎𝑉𝑏𝑉 𝑝 = {𝑎, 𝑏})))
1110abbidv 2770 . . 3 (𝑉𝑊 → {𝑝 ∣ ∃𝑎𝑉𝑏𝑉 𝑝 = {𝑎, 𝑏}} = {𝑝 ∣ (𝑝 ∈ 𝒫 𝑉 ∧ ∃𝑎𝑉𝑏𝑉 𝑝 = {𝑎, 𝑏})})
12 df-rab 2950 . . 3 {𝑝 ∈ 𝒫 𝑉 ∣ ∃𝑎𝑉𝑏𝑉 𝑝 = {𝑎, 𝑏}} = {𝑝 ∣ (𝑝 ∈ 𝒫 𝑉 ∧ ∃𝑎𝑉𝑏𝑉 𝑝 = {𝑎, 𝑏})}
1311, 12syl6eqr 2703 . 2 (𝑉𝑊 → {𝑝 ∣ ∃𝑎𝑉𝑏𝑉 𝑝 = {𝑎, 𝑏}} = {𝑝 ∈ 𝒫 𝑉 ∣ ∃𝑎𝑉𝑏𝑉 𝑝 = {𝑎, 𝑏}})
141, 13eqtrd 2685 1 (𝑉𝑊 → (Pairs‘𝑉) = {𝑝 ∈ 𝒫 𝑉 ∣ ∃𝑎𝑉𝑏𝑉 𝑝 = {𝑎, 𝑏}})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   = wceq 1523   ∈ wcel 2030  {cab 2637  ∃wrex 2942  {crab 2945   ⊆ wss 3607  𝒫 cpw 4191  {cpr 4212  ‘cfv 5926  Pairscspr 42052 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pr 4936  ax-un 6991 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-reu 2948  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-spr 42053 This theorem is referenced by:  sprvalpwn0  42058  sprel  42059  prelspr  42061
 Copyright terms: Public domain W3C validator