Theorem rexeqbii 2503

Description: Equality deduction for restricted existential 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
rexeqbii	⊢ (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐵 𝜒)

Proof of Theorem rexeqbii

Step	Hyp	Ref	Expression
1		raleqbii.1	. . . 4 ⊢ 𝐴 = 𝐵
2	1	eleq2i 2256	. . 3 ⊢ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)
3		raleqbii.2	. . 3 ⊢ (𝜓 ↔ 𝜒)
4	2, 3	anbi12i 460	. 2 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐵 ∧ 𝜒))
5	4	rexbii2 2501	1 ⊢ (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐵 𝜒)

Syntax hints:   ↔ wb 105   = wceq 1364   ∈ wcel 2160  ∃wrex 2469

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-5 1458  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-4 1521  ax-17 1537  ax-ial 1545  ax-ext 2171

This theorem depends on definitions:  df-bi 117  df-cleq 2182  df-clel 2185  df-rex 2474

This theorem is referenced by:  exmidsbthrlem  15168