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

Theorem prprc1 4710
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 4662 . 2 𝐴 ∈ V ↔ {𝐴} = ∅)
2 uneq1 4102 . . 3 ({𝐴} = ∅ → ({𝐴} ∪ {𝐵}) = (∅ ∪ {𝐵}))
3 df-pr 4571 . . 3 {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
4 uncom 4099 . . . 4 (∅ ∪ {𝐵}) = ({𝐵} ∪ ∅)
5 un0 4335 . . . 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 3430  cun 3888  c0 4274  {csn 4568  {cpr 4570
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 3432  df-dif 3893  df-un 3895  df-nul 4275  df-sn 4569  df-pr 4571
This theorem is referenced by:  prprc2  4711  prprc  4712  prneprprc  4805  prexOLD  5381  prfi  9228  elprchashprn2  14352  prssbd  32618  elsprel  47950
  Copyright terms: Public domain W3C validator