Theorem exbidh 1591

Description: Formula-building rule for existential quantifier (deduction rule). (Contributed by NM, 5-Aug-1993.)

Hypotheses

Ref	Expression
exbidh.1	|- (ph -> A.xph)
exbidh.2	|- (ph -> (ps <-> ch))

Assertion

Ref	Expression
exbidh	|- (ph -> (E.xps <-> E.xch))

Proof of Theorem exbidh

Step	Hyp	Ref	Expression
1		exbidh.1	. . 3 |- (ph -> A.xph)
2		exbidh.2	. . 3 |- (ph -> (ps <-> ch))
3	1, 2	alrimih 1565	. 2 |- (ph -> A.x(ps <-> ch))
4		exbi 1581	. 2 |- (A.x(ps <-> ch) -> (E.xps <-> E.xch))
5	3, 4	syl 15	1 |- (ph -> (E.xps <-> E.xch))

Syntax hints:   -> wi 4   <-> wb 176  A.wal 1540  E.wex 1541

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557

This theorem depends on definitions:  df-bi 177  df-ex 1542

This theorem is referenced by:  exbidv  1626  exbid  1773  drex2  1968