Theorem rabeqbidva 3431

Description: Equality of restricted class abstractions. (Contributed by Mario Carneiro, 26-Jan-2017.) Remove DV conditions. (Revised by GG, 1-Sep-2025.)

Hypotheses

Ref	Expression
rabeqbidva.1	⊢ (𝜑 → 𝐴 = 𝐵)
rabeqbidva.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒))

Assertion

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

Distinct variable group:   𝜑,𝑥

Allowed substitution hints:   𝜓(𝑥)   𝜒(𝑥)   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem rabeqbidva

Step	Hyp	Ref	Expression
1		rabeqbidva.2	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒))
2	1	rabbidva 3421	. 2 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐴 ∣ 𝜒})
3		rabeqbidva.1	. . . . 5 ⊢ (𝜑 → 𝐴 = 𝐵)
4	3	eleq2d 2848	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
5	4	anbi1d 642	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝜒) ↔ (𝑥 ∈ 𝐵 ∧ 𝜒)))
6	5	rabbidva2 3417	. 2 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜒} = {𝑥 ∈ 𝐵 ∣ 𝜒})
7	2, 6	eqtrd 2797	1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐵 ∣ 𝜒})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1569   ∈ wcel 2142  {crab 3415

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3416

This theorem is used by:  rabeqbidv  3433  scotteqd  9857  natpropd  18042  gsumpropd2lem  18743  elntg  29345  rmfsupp2  33566  poimirlem28  38327  uspgrlimlem1  48781  domnmsuppn0  49177  eenglngeehlnm  49547