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

Theorem prprc 4302
Description: An unordered pair containing two proper classes is the empty set. (Contributed by NM, 22-Mar-2006.)
Assertion
Ref Expression
prprc  |-  ( ( -.  A  e.  _V  /\ 
-.  B  e.  _V )  ->  { A ,  B }  =  (/) )

Proof of Theorem prprc
StepHypRef Expression
1 prprc1 4300 . 2  |-  ( -.  A  e.  _V  ->  { A ,  B }  =  { B } )
2 snprc 4253 . . 3  |-  ( -.  B  e.  _V  <->  { B }  =  (/) )
32biimpi 206 . 2  |-  ( -.  B  e.  _V  ->  { B }  =  (/) )
41, 3sylan9eq 2676 1  |-  ( ( -.  A  e.  _V  /\ 
-.  B  e.  _V )  ->  { A ,  B }  =  (/) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 384    = wceq 1483    e. wcel 1990   _Vcvv 3200   (/)c0 3915   {csn 4177   {cpr 4179
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-v 3202  df-dif 3577  df-un 3579  df-nul 3916  df-sn 4178  df-pr 4180
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator