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

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

Proof of Theorem dvdemo1
StepHypRef Expression
1 dtru 2778 . . 3 |- -. A.x x = y
2 exnal 1040 . . 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 1042 . 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 956   = wceq 958   e. wcel 960  E.wex 982
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-11 969  ax-12 970  ax-13 971  ax-14 972  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  ax-sep 2708  ax-nul 2715  ax-pow 2748
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417
Copyright terms: Public domain