Theorem bj-rabeqd 35245

Description: Deduction form of rabeq 3417. Note that contrary to rabeq 3417 it has no disjoint variable condition. (Contributed by BJ, 27-Apr-2019.)

Hypotheses

Ref	Expression
bj-rabeqd.nf	⊢ Ⅎ𝑥𝜑
bj-rabeqd.1	⊢ (𝜑 → 𝐴 = 𝐵)

Assertion

Ref	Expression
bj-rabeqd	⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐵 ∣ 𝜓})

Proof of Theorem bj-rabeqd

Step	Hyp	Ref	Expression
1		bj-rabeqd.nf	. 2 ⊢ Ⅎ𝑥𝜑
2		bj-rabeqd.1	. . 3 ⊢ (𝜑 → 𝐴 = 𝐵)
3		eleq2 2825	. . . 4 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
4	3	anbi1d 630	. . 3 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐵 ∧ 𝜓)))
5	2, 4	syl 17	. 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐵 ∧ 𝜓)))
6	1, 5	bj-rabbida2 35244	1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐵 ∣ 𝜓})

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1540  Ⅎwnf 1784   ∈ wcel 2105  {crab 3403

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-12 2170  ax-ext 2707

This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1781  df-nf 1785  df-sb 2067  df-clab 2714  df-cleq 2728  df-clel 2814  df-rab 3404

This theorem is referenced by:  bj-rabeqbid  35246  bj-rabeqbida  35247  bj-inrab2  35254