Theorem raleqbii 2378

Description: Equality deduction for restricted universal quantifier, changing both formula and quantifier domain. Inference form. (Contributed by David Moews, 1-May-2017.)

Hypotheses

Ref	Expression
raleqbii.1	|- A = B
raleqbii.2	|- ( ps <-> ch )

Assertion

Ref	Expression
raleqbii	|- ( A. x e. A ps <-> A. x e. B ch )

Proof of Theorem raleqbii

Step	Hyp	Ref	Expression
1		raleqbii.1	. . . 4 |- A = B
2	1	eleq2i 2145	. . 3 |- ( x e. A <-> x e. B )
3		raleqbii.2	. . 3 |- ( ps <-> ch )
4	2, 3	imbi12i 237	. 2 |- ( ( x e. A -> ps ) <-> ( x e. B -> ch ) )
5	4	ralbii2 2376	1 |- ( A. x e. A ps <-> A. x e. B ch )

Syntax hints:   <-> wb 103   = wceq 1284   e. wcel 1433   A.wral 2348

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-5 1376  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-4 1440  ax-17 1459  ax-ial 1467  ax-ext 2063

This theorem depends on definitions:  df-bi 115  df-cleq 2074  df-clel 2077  df-ral 2353

This theorem is referenced by: (None)