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

Theorem del34 835
Description: A distinctor elimination lemma. Formula-builder for universal quantifier.
Hypothesis
Ref Expression
del34.1 |- (A.x x = y -> (ph -> ps))
Assertion
Ref Expression
del34 |- (A.x x = y -> (A.xph -> A.yps))

Proof of Theorem del34
StepHypRef Expression
1 del34.1 . . . 4 |- (A.x x = y -> (ph -> ps))
2119.20ii 692 . . 3 |- (A.xA.x x = y -> (A.xph -> A.xps))
32eq5s 825 . 2 |- (A.x x = y -> (A.xph -> A.xps))
4 ax-10 800 . 2 |- (A.x x = y -> (A.xps -> A.yps))
53, 4syld 27 1 |- (A.x x = y -> (A.xph -> A.yps))
Colors of variables: wff set class
Syntax hints:   -> wi 2  A.wal 672   = weq 797
This theorem is referenced by:  del34b 837  del41 840
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-12 802
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679
metamath.org