Users' Mathboxes Mathbox for Andrew Salmon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elnev Unicode version

Theorem elnev 27638
Description: Any set that contains one element less than the universe is not equal to it. (Contributed by Andrew Salmon, 16-Jun-2011.)
Assertion
Ref Expression
elnev  |-  ( A  e.  _V  <->  { x  |  -.  x  =  A }  =/=  _V )
Distinct variable group:    x, A

Proof of Theorem elnev
StepHypRef Expression
1 isset 2792 . 2  |-  ( A  e.  _V  <->  E. x  x  =  A )
2 df-v 2790 . . . . 5  |-  _V  =  { x  |  x  =  x }
32eqeq2i 2293 . . . 4  |-  ( { x  |  -.  x  =  A }  =  _V  <->  { x  |  -.  x  =  A }  =  {
x  |  x  =  x } )
4 equid 1644 . . . . . . 7  |-  x  =  x
54tbt 333 . . . . . 6  |-  ( -.  x  =  A  <->  ( -.  x  =  A  <->  x  =  x ) )
65albii 1553 . . . . 5  |-  ( A. x  -.  x  =  A  <->  A. x ( -.  x  =  A  <->  x  =  x
) )
7 alnex 1530 . . . . 5  |-  ( A. x  -.  x  =  A  <->  -.  E. x  x  =  A )
8 abbi 2393 . . . . 5  |-  ( A. x ( -.  x  =  A  <->  x  =  x
)  <->  { x  |  -.  x  =  A }  =  { x  |  x  =  x } )
96, 7, 83bitr3ri 267 . . . 4  |-  ( { x  |  -.  x  =  A }  =  {
x  |  x  =  x }  <->  -.  E. x  x  =  A )
103, 9bitri 240 . . 3  |-  ( { x  |  -.  x  =  A }  =  _V  <->  -. 
E. x  x  =  A )
1110necon2abii 2501 . 2  |-  ( E. x  x  =  A  <->  { x  |  -.  x  =  A }  =/=  _V )
121, 11bitri 240 1  |-  ( A  e.  _V  <->  { x  |  -.  x  =  A }  =/=  _V )
Colors of variables: wff set class
Syntax hints:   -. wn 3    <-> wb 176   A.wal 1527   E.wex 1528    = wceq 1623    e. wcel 1684   {cab 2269    =/= wne 2446   _Vcvv 2788
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-ne 2448  df-v 2790
  Copyright terms: Public domain W3C validator