Theorem rexeqbidva 2564

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 2365	. 2 |- ( ph -> ( E. x e. A ps <-> E. x e. A ch ) )
3		raleqbidva.1	. . 3 |- ( ph -> A = B )
4	3	rexeqdv 2556	. 2 |- ( ph -> ( E. x e. A ch <-> E. x e. B ch ) )
5	2, 4	bitrd 186	1 |- ( ph -> ( E. x e. A ps <-> E. x e. B ch ) )

Syntax hints:   -> wi 4   /\ wa 102   <-> wb 103   = wceq 1284   e. wcel 1433   E.wrex 2349

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063

This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-cleq 2074  df-clel 2077  df-nfc 2208  df-rex 2354

This theorem is referenced by: (None)