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

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

Proof of Theorem dvdemo2
StepHypRef Expression
1 el 2751 . 2 |- E.x z e. x
2 ax-1 4 . . 3 |- (z e. x -> (x = y -> z e. x))
3219.22i 1040 . 2 |- (E.x z e. x -> E.x(x = y -> z e. x))
41, 3ax-mp 7 1 |- E.x(x = y -> z e. x)
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 956   e. wcel 958  E.wex 980
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413
Copyright terms: Public domain