Theorem del36 838

Description: A distinctor elimination lemma. Formula-builder for universal quantifier.

Hypothesis

Ref	Expression
del36.1	|- (A.x x = y -> (ph -> ps))

Assertion

Ref	Expression
del36	|- (A.x x = y -> (A.zph -> A.zps))

Proof of Theorem del36

Step	Hyp	Ref	Expression
1		del36.1	. . 3 |- (A.x x = y -> (ph -> ps))
2	1	19.20ii 692	. 2 |- (A.zA.x x = y -> (A.zph -> A.zps))
3	2	eq5s 825	1 |- (A.x x = y -> (A.zph -> A.zps))

Syntax hints:   -> wi 2  A.wal 672   = weq 797

This theorem is referenced by:  del42 841  axpowndlem3 3745

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