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

Theorem dveel1 1349
Description: Quantifier introduction when one pair of variables is distinct.
Assertion
Ref Expression
dveel1 |- (-. A.x x = y -> (y e. z -> A.x y e. z))
Distinct variable group:   x,z

Proof of Theorem dveel1
StepHypRef Expression
1 ax-17 968 . 2 |- (w e. z -> A.x w e. z)
2 ax-17 968 . 2 |- (y e. z -> A.w y e. z)
3 elequ1 1132 . 2 |- (w = y -> (w e. z <-> y e. z))
41, 2, 3dvelimfALT 1149 1 |- (-. A.x x = y -> (y e. z -> A.x y e. z))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3  A.wal 951   = wceq 953   e. wcel 955
This theorem is referenced by:  axrepndlem2 4917  axunnd 4920  axpowndlem2 4922  axpowndlem3 4923  axpowndlem4 4924  axpownd 4925  axregndlem2 4927  axinfndlem1 4929  axacndlem4 4934  axacnd 4936
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-12 965  ax-13 966  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136
This theorem depends on definitions:  df-bi 147  df-an 225
Copyright terms: Public domain