Theorem mobidv 2072

Description: Formula-building rule for "at most one" quantifier (deduction form). (Contributed by Mario Carneiro, 7-Oct-2016.)

Hypothesis

Ref	Expression
mobidv.1	|- ( ph -> ( ps <-> ch ) )

Assertion

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

Distinct variable group:   ph, x

Allowed substitution hints:   ps( x)   ch( x)

Proof of Theorem mobidv

Step	Hyp	Ref	Expression
1		nfv 1538	. 2 |- F/ x ph
2		mobidv.1	. 2 |- ( ph -> ( ps <-> ch ) )
3	1, 2	mobid 2071	1 |- ( ph -> ( E* x ps <-> E* x ch ) )

Syntax hints:   -> wi 4   <-> wb 105   E*wmo 2037

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1457  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-4 1520  ax-17 1536  ax-ial 1544

This theorem depends on definitions:  df-bi 117  df-nf 1471  df-eu 2039  df-mo 2040

This theorem is referenced by:  mobii  2073  mosubopt  4703  dffun6f  5241  funmo  5243  1stconst  6236  2ndconst  6237  exmidmotap  7274  imasaddfnlemg  12753  dvfgg  14453