Theorem rexeqbidva 2721

Description: Equality deduction for restricted universal quantifier. (Contributed by Mario Carneiro, 5-Jan-2017.)

Hypotheses

Ref	Expression
raleqbidva.1	|- ( ph -> A = B )
raleqbidva.2	|- ( ( ph /\ x e. A ) -> ( ps <-> ch ) )

Assertion

Ref	Expression
rexeqbidva	|- ( ph -> ( E. x e. A ps <-> E. x e. B ch ) )

Distinct variable groups:   x, A   x, B   ph, x

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

Proof of Theorem rexeqbidva

Step	Hyp	Ref	Expression
1		raleqbidva.2	. . 3 |- ( ( ph /\ x e. A ) -> ( ps <-> ch ) )
2	1	rexbidva 2503	. 2 |- ( ph -> ( E. x e. A ps <-> E. x e. A ch ) )
3		raleqbidva.1	. . 3 |- ( ph -> A = B )
4	3	rexeqdv 2709	. 2 |- ( ph -> ( E. x e. A ch <-> E. x e. B ch ) )
5	2, 4	bitrd 188	1 |- ( ph -> ( E. x e. A ps <-> E. x e. B ch ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1373   e. wcel 2176   E.wrex 2485

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-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1484  df-sb 1786  df-cleq 2198  df-clel 2201  df-nfc 2337  df-rex 2490

This theorem is referenced by: (None)