MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pwpr Structured version   Visualization version   GIF version

Theorem pwpr 4894
Description: The power set of an unordered pair. (Contributed by NM, 1-May-2009.)
Assertion
Ref Expression
pwpr 𝒫 {𝐴, 𝐵} = ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}})

Proof of Theorem pwpr
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 sspr 4828 . . . 4 (𝑥 ⊆ {𝐴, 𝐵} ↔ ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})))
2 vex 3476 . . . . . 6 𝑥 ∈ V
32elpr 4644 . . . . 5 (𝑥 ∈ {∅, {𝐴}} ↔ (𝑥 = ∅ ∨ 𝑥 = {𝐴}))
42elpr 4644 . . . . 5 (𝑥 ∈ {{𝐵}, {𝐴, 𝐵}} ↔ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵}))
53, 4orbi12i 913 . . . 4 ((𝑥 ∈ {∅, {𝐴}} ∨ 𝑥 ∈ {{𝐵}, {𝐴, 𝐵}}) ↔ ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})))
61, 5bitr4i 277 . . 3 (𝑥 ⊆ {𝐴, 𝐵} ↔ (𝑥 ∈ {∅, {𝐴}} ∨ 𝑥 ∈ {{𝐵}, {𝐴, 𝐵}}))
7 velpw 4600 . . 3 (𝑥 ∈ 𝒫 {𝐴, 𝐵} ↔ 𝑥 ⊆ {𝐴, 𝐵})
8 elun 4143 . . 3 (𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ↔ (𝑥 ∈ {∅, {𝐴}} ∨ 𝑥 ∈ {{𝐵}, {𝐴, 𝐵}}))
96, 7, 83bitr4i 302 . 2 (𝑥 ∈ 𝒫 {𝐴, 𝐵} ↔ 𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}))
109eqriv 2728 1 𝒫 {𝐴, 𝐵} = ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}})
Colors of variables: wff setvar class
Syntax hints:  wo 845   = wceq 1541  wcel 2106  cun 3941  wss 3943  c0 4317  𝒫 cpw 4595  {csn 4621  {cpr 4623
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2702
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2709  df-cleq 2723  df-clel 2809  df-ral 3061  df-v 3474  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-pw 4597  df-sn 4622  df-pr 4624
This theorem is referenced by:  pwpwpw0  4896  ord3ex  5377  hash2pwpr  14418  pr2pwpr  14421  prsiga  32946  prsal  44795
  Copyright terms: Public domain W3C validator