Theorem raleqbidva 2679

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
raleqbidva	|- ( ph -> ( A. x e. A ps <-> A. x e. B ch ) )

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

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

Proof of Theorem raleqbidva

Step	Hyp	Ref	Expression
1		raleqbidva.2	. . 3 |- ( ( ph /\ x e. A ) -> ( ps <-> ch ) )
2	1	ralbidva 2466	. 2 |- ( ph -> ( A. x e. A ps <-> A. x e. A ch ) )
3		raleqbidva.1	. . 3 |- ( ph -> A = B )
4	3	raleqdv 2671	. 2 |- ( ph -> ( A. x e. A ch <-> A. x e. B ch ) )
5	2, 4	bitrd 187	1 |- ( ph -> ( A. x e. A ps <-> A. x e. B ch ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   = wceq 1348   e. wcel 2141   A.wral 2448

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-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152

This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453

This theorem is referenced by: (None)