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

Theorem prprc1 4724
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 4676 . 2 𝐴 ∈ V ↔ {𝐴} = ∅)
2 uneq1 4115 . . 3 ({𝐴} = ∅ → ({𝐴} ∪ {𝐵}) = (∅ ∪ {𝐵}))
3 df-pr 4585 . . 3 {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
4 uncom 4112 . . . 4 (∅ ∪ {𝐵}) = ({𝐵} ∪ ∅)
5 un0 4348 . . . 4 ({𝐵} ∪ ∅) = {𝐵}
64, 5eqtr2i 2761 . . 3 {𝐵} = (∅ ∪ {𝐵})
72, 3, 63eqtr4g 2797 . 2 ({𝐴} = ∅ → {𝐴, 𝐵} = {𝐵})
81, 7sylbi 217 1 𝐴 ∈ V → {𝐴, 𝐵} = {𝐵})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1542  wcel 2114  Vcvv 3442  cun 3901  c0 4287  {csn 4582  {cpr 4584
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 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-v 3444  df-dif 3906  df-un 3908  df-nul 4288  df-sn 4583  df-pr 4585
This theorem is referenced by:  prprc2  4725  prprc  4726  prneprprc  4819  prexOLD  5389  prfi  9236  elprchashprn2  14331  prssbd  32617  elsprel  47835
  Copyright terms: Public domain W3C validator