ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  prprc Unicode version

Theorem prprc 3633
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 3631 . 2  |-  ( -.  A  e.  _V  ->  { A ,  B }  =  { B } )
2 snprc 3588 . . 3  |-  ( -.  B  e.  _V  <->  { B }  =  (/) )
32biimpi 119 . 2  |-  ( -.  B  e.  _V  ->  { B }  =  (/) )
41, 3sylan9eq 2192 1  |-  ( ( -.  A  e.  _V  /\ 
-.  B  e.  _V )  ->  { A ,  B }  =  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    = wceq 1331    e. wcel 1480   _Vcvv 2686   (/)c0 3363   {csn 3527   {cpr 3528
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-v 2688  df-dif 3073  df-un 3075  df-nul 3364  df-sn 3533  df-pr 3534
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator