HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem eq0 2298
Description: The empty set has no elements. Theorem 2 of [Suppes] p. 22.
Assertion
Ref Expression
eq0 |- (A = (/) <-> A.x -. x e. A)
Distinct variable group:   x,A

Proof of Theorem eq0
StepHypRef Expression
1 n0 2293 . . 3 |- (-. A = (/) <-> E.x x e. A)
2 df-ex 983 . . 3 |- (E.x x e. A <-> -. A.x -. x e. A)
31, 2bitr 173 . 2 |- (-. A = (/) <-> -. A.x -. x e. A)
43con4bii 525 1 |- (A = (/) <-> A.x -. x e. A)
Colors of variables: wff set class
Syntax hints:  -. wn 2   <-> wb 146  A.wal 956   = wceq 958   e. wcel 960  E.wex 982  (/)c0 2283
This theorem is referenced by:  0el 2300  ssdif0 2331  difin0ss 2336  inssdif0 2337  ralf0 2363  0ex 2716  snex 2756  reldm0 3337  tz6.12-2 3745  uzwo4OLD 6212  uzwo 6456  uzwoOLD 6457
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-12 970  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-v 1815  df-dif 2052  df-nul 2284
Copyright terms: Public domain