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

Theorem dvdemo1 2765
Description: Demonstration of a theorem that requires x and y to be distinct, but no others. Compare dvdemo2 2766.
Assertion
Ref Expression
dvdemo1 |- E.x(x = y -> z e. x)
Distinct variable group:   x,y

Proof of Theorem dvdemo1
StepHypRef Expression
1 dtru 2762 . . 3 |- -. A.x x = y
2 exnal 1034 . . 3 |- (E.x -. x = y <-> -. A.x x = y)
31, 2mpbir 190 . 2 |- E.x -. x = y
4 pm2.21 76 . . 3 |- (-. x = y -> (x = y -> z e. x))
5419.22i 1036 . 2 |- (E.x -. x = y -> E.x(x = y -> z e. x))
63, 5ax-mp 7 1 |- E.x(x = y -> z e. x)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3  A.wal 951   = wceq 953   e. wcel 955  E.wex 977
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-sep 2693  ax-nul 2700  ax-pow 2732
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-v 1803  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271  df-pw 2392  df-sn 2402  df-pr 2403
Copyright terms: Public domain