Theorem bj-rabeqbid 34363

Description: Version of rabeqbidv 3433 with two disjoint variable conditions removed and the third replaced by a nonfreeness hypothesis. (Contributed by BJ, 27-Apr-2019.)

Hypotheses

Ref	Expression
bj-rabeqbid.nf	⊢ Ⅎ𝑥𝜑
bj-rabeqbid.1	⊢ (𝜑 → 𝐴 = 𝐵)
bj-rabeqbid.2	⊢ (𝜑 → (𝜓 ↔ 𝜒))

Assertion

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

Proof of Theorem bj-rabeqbid

Step	Hyp	Ref	Expression
1		bj-rabeqbid.nf	. . 3 ⊢ Ⅎ𝑥𝜑
2		bj-rabeqbid.1	. . 3 ⊢ (𝜑 → 𝐴 = 𝐵)
3	1, 2	bj-rabeqd 34362	. 2 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐵 ∣ 𝜓})
4		bj-rabeqbid.2	. . 3 ⊢ (𝜑 → (𝜓 ↔ 𝜒))
5	1, 4	rabbid 3422	. 2 ⊢ (𝜑 → {𝑥 ∈ 𝐵 ∣ 𝜓} = {𝑥 ∈ 𝐵 ∣ 𝜒})
6	3, 5	eqtrd 2833	1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐵 ∣ 𝜒})

Syntax hints:   → wi 4   ↔ wb 209   = wceq 1538  Ⅎwnf 1785  {crab 3110

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-ral 3111  df-rab 3115

This theorem is referenced by: (None)