Theorem rexeqbidva 2688

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 2474	. 2 |- ( ph -> ( E. x e. A ps <-> E. x e. A ch ) )
3		raleqbidva.1	. . 3 |- ( ph -> A = B )
4	3	rexeqdv 2680	. 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 1353   e. wcel 2148   E.wrex 2456

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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-cleq 2170  df-clel 2173  df-nfc 2308  df-rex 2461

This theorem is referenced by: (None)