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

Theorem dveel1 1354
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 969 . 2 |- (w e. z -> A.x w e. z)
2 ax-17 969 . 2 |- (y e. z -> A.w y e. z)
3 elequ1 1134 . 2 |- (w = y -> (w e. z <-> y e. z))
41, 2, 3dvelimfALT 1151 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 952   = wceq 954   e. wcel 956
This theorem is referenced by:  axrepndlem2 4925  axunnd 4928  axpowndlem2 4930  axpowndlem3 4931  axpowndlem4 4932  axpownd 4933  axregndlem2 4935  axinfndlem1 4937  axacndlem4 4942  axacnd 4944
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-12 966  ax-13 967  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138
This theorem depends on definitions:  df-bi 147  df-an 225
Copyright terms: Public domain