Theorem rexeqbid 3365

Description: Equality deduction for restricted existential quantifier. See rexeqbidv 3355 for a version based on fewer axioms. (Contributed by Thierry Arnoux, 8-Mar-2017.)

Hypotheses

Ref	Expression
raleqbid.0	⊢ Ⅎ𝑥𝜑
raleqbid.1	⊢ Ⅎ𝑥𝐴
raleqbid.2	⊢ Ⅎ𝑥𝐵
raleqbid.3	⊢ (𝜑 → 𝐴 = 𝐵)
raleqbid.4	⊢ (𝜑 → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
rexeqbid	⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐵 𝜒))

Proof of Theorem rexeqbid

Step	Hyp	Ref	Expression
1		raleqbid.3	. . 3 ⊢ (𝜑 → 𝐴 = 𝐵)
2		raleqbid.1	. . . 4 ⊢ Ⅎ𝑥𝐴
3		raleqbid.2	. . . 4 ⊢ Ⅎ𝑥𝐵
4	2, 3	rexeqf 3362	. . 3 ⊢ (𝐴 = 𝐵 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐵 𝜓))
5	1, 4	syl 17	. 2 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐵 𝜓))
6		raleqbid.0	. . 3 ⊢ Ⅎ𝑥𝜑
7		raleqbid.4	. . 3 ⊢ (𝜑 → (𝜓 ↔ 𝜒))
8	6, 7	rexbid 3280	. 2 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 𝜓 ↔ ∃𝑥 ∈ 𝐵 𝜒))
9	5, 8	bitrd 279	1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐵 𝜒))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1537  Ⅎwnf 1781  Ⅎwnfc 2893  ∃wrex 3076

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-nf 1782  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ral 3068  df-rex 3077

This theorem is referenced by:  iuneq12df  5041