Theorem rabbida2 42203

Description: Equivalent wff's yield equal restricted class abstractions. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

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

Assertion

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

Proof of Theorem rabbida2

Step	Hyp	Ref	Expression
1		rabbida2.1	. . 3 ⊢ Ⅎ𝑥𝜑
2		rabbida2.2	. . . . 5 ⊢ (𝜑 → 𝐴 = 𝐵)
3	2	eleq2d 2818	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
4		rabbida2.3	. . . 4 ⊢ (𝜑 → (𝜓 ↔ 𝜒))
5	3, 4	anbi12d 634	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐵 ∧ 𝜒)))
6	1, 5	abbid 2804	. 2 ⊢ (𝜑 → {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜓)} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜒)})
7		df-rab 3062	. 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜓)}
8		df-rab 3062	. 2 ⊢ {𝑥 ∈ 𝐵 ∣ 𝜒} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜒)}
9	6, 7, 8	3eqtr4g 2798	1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐵 ∣ 𝜒})

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1542  Ⅎwnf 1790   ∈ wcel 2113  {cab 2716  {crab 3057

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1916  ax-6 1974  ax-7 2019  ax-8 2115  ax-9 2123  ax-12 2178  ax-ext 2710

This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1787  df-nf 1791  df-sb 2074  df-clab 2717  df-cleq 2730  df-clel 2811  df-rab 3062

This theorem is referenced by:  smflimmpt  43866