Theorem dtruex 4536

Description: At least two sets exist (or in terms of first-order logic, the universe of discourse has two or more objects). Although dtruarb 4170 can also be summarized as "at least two sets exist", the difference is that dtruarb 4170 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

Step	Hyp	Ref	Expression
1		vex 2729	. . . . 5 |- y e. _V
2	1	snex 4164	. . . 4 |- { y } e. _V
3	2	isseti 2734	. . 3 |- E. x x = { y }
4		elirrv 4525	. . . . . . 7 |- -. y e. y
5		vsnid 3608	. . . . . . . 8 |- y e. { y }
6		eleq2 2230	. . . . . . . 8 |- ( y = { y } -> ( y e. y <-> y e. { y } ) )
7	5, 6	mpbiri 167	. . . . . . 7 |- ( y = { y } -> y e. y )
8	4, 7	mto 652	. . . . . 6 |- -. y = { y }
9		eqtr 2183	. . . . . 6 |- ( ( y = x /\ x = { y } ) -> y = { y } )
10	8, 9	mto 652	. . . . 5 |- -. ( y = x /\ x = { y } )
11		ancom 264	. . . . 5 |- ( ( y = x /\ x = { y } ) <-> ( x = { y } /\ y = x ) )
12	10, 11	mtbi 660	. . . 4 |- -. ( x = { y } /\ y = x )
13	12	imnani 681	. . 3 |- ( x = { y } -> -. y = x )
14	3, 13	eximii 1590	. 2 |- E. x -. y = x
15		equcom 1694	. . . 4 |- ( y = x <-> x = y )
16	15	notbii 658	. . 3 |- ( -. y = x <-> -. x = y )
17	16	exbii 1593	. 2 |- ( E. x -. y = x <-> E. x -. x = y )
18	14, 17	mpbi 144	1 |- E. x -. x = y

Syntax hints:   -. wn 3   /\ wa 103   = wceq 1343   E.wex 1480   e. wcel 2136   {csn 3576

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 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-setind 4514

This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-v 2728  df-dif 3118  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582

This theorem is referenced by:  dtru  4537  eunex  4538  brprcneu  5479