Theorem mobidh 2037

Description: Formula-building rule for "at most one" quantifier (deduction form). (Contributed by NM, 8-Mar-1995.)

Hypotheses

Ref	Expression
mobidh.1	|- ( ph -> A. x ph )
mobidh.2	|- ( ph -> ( ps <-> ch ) )

Assertion

Ref	Expression
mobidh	|- ( ph -> ( E* x ps <-> E* x ch ) )

Proof of Theorem mobidh

Step	Hyp	Ref	Expression
1		mobidh.1	. . . 4 |- ( ph -> A. x ph )
2		mobidh.2	. . . 4 |- ( ph -> ( ps <-> ch ) )
3	1, 2	exbidh 1591	. . 3 |- ( ph -> ( E. x ps <-> E. x ch ) )
4	1, 2	eubidh 2009	. . 3 |- ( ph -> ( E! x ps <-> E! x ch ) )
5	3, 4	imbi12d 233	. 2 |- ( ph -> ( ( E. x ps -> E! x ps ) <-> ( E. x ch -> E! x ch ) ) )
6		df-mo 2007	. 2 |- ( E* x ps <-> ( E. x ps -> E! x ps ) )
7		df-mo 2007	. 2 |- ( E* x ch <-> ( E. x ch -> E! x ch ) )
8	5, 6, 7	3bitr4g 222	1 |- ( ph -> ( E* x ps <-> E* x ch ) )

Syntax hints:   -> wi 4   <-> wb 104   A.wal 1330   E.wex 1469   E!weu 2003   E*wmo 2004

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1424  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-4 1487  ax-17 1503  ax-ial 1511

This theorem depends on definitions:  df-bi 116  df-eu 2006  df-mo 2007

This theorem is referenced by:  euan  2059