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

Theorem prprc1 4736
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 4688 . 2 𝐴 ∈ V ↔ {𝐴} = ∅)
2 uneq1 4123 . . 3 ({𝐴} = ∅ → ({𝐴} ∪ {𝐵}) = (∅ ∪ {𝐵}))
3 df-pr 4597 . . 3 {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
4 uncom 4120 . . . 4 (∅ ∪ {𝐵}) = ({𝐵} ∪ ∅)
5 un0 4358 . . . 4 ({𝐵} ∪ ∅) = {𝐵}
64, 5eqtr2i 2793 . . 3 {𝐵} = (∅ ∪ {𝐵})
72, 3, 63eqtr4g 2829 . 2 ({𝐴} = ∅ → {𝐴, 𝐵} = {𝐵})
81, 7sylbi 220 1 𝐴 ∈ V → {𝐴, 𝐵} = {𝐵})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1567  wcel 2149  Vcvv 3463  cun 3911  c0 4294  {csn 4594  {cpr 4596
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-v 3465  df-dif 3916  df-un 3918  df-nul 4295  df-sn 4595  df-pr 4597
This theorem is referenced by:  prprc2  4737  prprc  4738  prneprprc  4830  prexOLD  5415  prfi  9282  elprchashprn2  14431  prssbd  32816  elsprel  48112
  Copyright terms: Public domain W3C validator