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

Theorem prprc1 4731
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 4683 . 2 𝐴 ∈ V ↔ {𝐴} = ∅)
2 uneq1 4115 . . 3 ({𝐴} = ∅ → ({𝐴} ∪ {𝐵}) = (∅ ∪ {𝐵}))
3 df-pr 4592 . . 3 {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
4 uncom 4112 . . . 4 (∅ ∪ {𝐵}) = ({𝐵} ∪ ∅)
5 un0 4351 . . . 4 ({𝐵} ∪ ∅) = {𝐵}
64, 5eqtr2i 2787 . . 3 {𝐵} = (∅ ∪ {𝐵})
72, 3, 63eqtr4g 2823 . 2 ({𝐴} = ∅ → {𝐴, 𝐵} = {𝐵})
81, 7sylbi 220 1 𝐴 ∈ V → {𝐴, 𝐵} = {𝐵})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1570  wcel 2143  Vcvv 3455  cun 3903  c0 4286  {csn 4589  {cpr 4591
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-v 3457  df-dif 3908  df-un 3910  df-nul 4287  df-sn 4590  df-pr 4592
This theorem is referenced by:  prprc2  4732  prprc  4733  prneprprc  4826  prexOLD  5414  prfi  9279  elprchashprn2  14428  prssbd  32876  elsprel  48224
  Copyright terms: Public domain W3C validator