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

Theorem dveel1 1356
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 971 . 2 |- (w e. z -> A.x w e. z)
2 ax-17 971 . 2 |- (y e. z -> A.w y e. z)
3 elequ1 1136 . 2 |- (w = y -> (w e. z <-> y e. z))
41, 2, 3dvelimfALT 1153 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 954   = wceq 956   e. wcel 958
This theorem is referenced by:  axrepndlem2 4937  axunnd 4940  axpowndlem2 4942  axpowndlem3 4943  axpowndlem4 4944  axpownd 4945  axregndlem2 4947  axinfndlem1 4949  axacndlem4 4954  axacnd 4956
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-12 968  ax-13 969  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140
This theorem depends on definitions:  df-bi 147  df-an 225
Copyright terms: Public domain