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

Theorem prprc1 4732
Description: A proper class vanishes in an unordered pair. (Contributed by NM, 15-Jul-1993.)
Assertion
Ref Expression
prprc1 𝐴 ∈ V → {𝐴, 𝐵} = {𝐵})

Proof of Theorem prprc1
StepHypRef Expression
1 snprc 4684 . 2 𝐴 ∈ V ↔ {𝐴} = ∅)
2 uneq1 4127 . . 3 ({𝐴} = ∅ → ({𝐴} ∪ {𝐵}) = (∅ ∪ {𝐵}))
3 df-pr 4595 . . 3 {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
4 uncom 4124 . . . 4 (∅ ∪ {𝐵}) = ({𝐵} ∪ ∅)
5 un0 4360 . . . 4 ({𝐵} ∪ ∅) = {𝐵}
64, 5eqtr2i 2754 . . 3 {𝐵} = (∅ ∪ {𝐵})
72, 3, 63eqtr4g 2790 . 2 ({𝐴} = ∅ → {𝐴, 𝐵} = {𝐵})
81, 7sylbi 217 1 𝐴 ∈ V → {𝐴, 𝐵} = {𝐵})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1540  wcel 2109  Vcvv 3450  cun 3915  c0 4299  {csn 4592  {cpr 4594
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-v 3452  df-dif 3920  df-un 3922  df-nul 4300  df-sn 4593  df-pr 4595
This theorem is referenced by:  prprc2  4733  prprc  4734  prneprprc  4828  prex  5395  prfi  9281  elprchashprn2  14368  prssbd  32466  elsprel  47480
  Copyright terms: Public domain W3C validator