Theorem raleqbii 3334

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	⊢ 𝐴 = 𝐵
raleqbii.2	⊢ (𝜓 ↔ 𝜒)

Assertion

Ref	Expression
raleqbii	⊢ (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑥 ∈ 𝐵 𝜒)

Proof of Theorem raleqbii

Step	Hyp	Ref	Expression
1		raleqbii.1	. . . 4 ⊢ 𝐴 = 𝐵
2	1	eleq2i 2854	. . 3 ⊢ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)
3		raleqbii.2	. . 3 ⊢ (𝜓 ↔ 𝜒)
4	2, 3	imbi12i 352	. 2 ⊢ ((𝑥 ∈ 𝐴 → 𝜓) ↔ (𝑥 ∈ 𝐵 → 𝜒))
5	4	ralbii2 3104	1 ⊢ (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑥 ∈ 𝐵 𝜒)

Syntax hints:   ↔ wb 208   = wceq 1560   ∈ wcel 2142  ∀wral 3076

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734

This theorem depends on definitions:  df-bi 209  df-an 400  df-ex 1800  df-cleq 2754  df-clel 2837  df-ral 3077

This theorem is referenced by:  fprlem1  8281  frrlem15  9715  opprdomnb  20763  ply1coe  22358  ordtbaslem  23245  iscusp2  24358  isrgr  29757  iineq12i  36554  elghomOLD  38383  iscrngo2  38493  tendoset  41380  comptiunov2i  44279