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

Theorem dtruex 4311
Description: At least two sets exist (or in terms of first-order logic, the universe of discourse has two or more objects). Although dtruarb 3970 can also be summarized as "at least two sets exist", the difference is that dtruarb 3970 shows the existence of two sets which are not equal to each other, but this theorem says that given a specific  y, we can construct a set  x which does not equal it. (Contributed by Jim Kingdon, 29-Dec-2018.)
Assertion
Ref Expression
dtruex  |-  E. x  -.  x  =  y
Distinct variable group:    x, y

Proof of Theorem dtruex
StepHypRef Expression
1 vex 2577 . . . . 5  |-  y  e. 
_V
2 snexgOLD 3963 . . . . 5  |-  ( y  e.  _V  ->  { y }  e.  _V )
31, 2ax-mp 7 . . . 4  |-  { y }  e.  _V
4 isset 2578 . . . 4  |-  ( { y }  e.  _V  <->  E. x  x  =  {
y } )
53, 4mpbi 137 . . 3  |-  E. x  x  =  { y }
6 elirr 4294 . . . . . . . 8  |-  -.  y  e.  y
7 vsnid 3431 . . . . . . . . 9  |-  y  e. 
{ y }
8 eleq2 2117 . . . . . . . . 9  |-  ( y  =  { y }  ->  ( y  e.  y  <->  y  e.  {
y } ) )
97, 8mpbiri 161 . . . . . . . 8  |-  ( y  =  { y }  ->  y  e.  y )
106, 9mto 598 . . . . . . 7  |-  -.  y  =  { y }
11 eqtr 2073 . . . . . . 7  |-  ( ( y  =  x  /\  x  =  { y } )  ->  y  =  { y } )
1210, 11mto 598 . . . . . 6  |-  -.  (
y  =  x  /\  x  =  { y } )
13 ancom 257 . . . . . 6  |-  ( ( y  =  x  /\  x  =  { y } )  <->  ( x  =  { y }  /\  y  =  x )
)
1412, 13mtbi 605 . . . . 5  |-  -.  (
x  =  { y }  /\  y  =  x )
1514imnani 635 . . . 4  |-  ( x  =  { y }  ->  -.  y  =  x )
1615eximi 1507 . . 3  |-  ( E. x  x  =  {
y }  ->  E. x  -.  y  =  x
)
175, 16ax-mp 7 . 2  |-  E. x  -.  y  =  x
18 eqcom 2058 . . . 4  |-  ( y  =  x  <->  x  =  y )
1918notbii 604 . . 3  |-  ( -.  y  =  x  <->  -.  x  =  y )
2019exbii 1512 . 2  |-  ( E. x  -.  y  =  x  <->  E. x  -.  x  =  y )
2117, 20mpbi 137 1  |-  E. x  -.  x  =  y
Colors of variables: wff set class
Syntax hints:   -. wn 3    /\ wa 101    = wceq 1259   E.wex 1397    e. wcel 1409   _Vcvv 2574   {csn 3403
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3903  ax-pow 3955  ax-setind 4290
This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ne 2221  df-ral 2328  df-v 2576  df-dif 2948  df-in 2952  df-ss 2959  df-pw 3389  df-sn 3409
This theorem is referenced by:  dtru  4312  eunex  4313  brprcneu  5199
  Copyright terms: Public domain W3C validator