Theorem rabbida 3415

Description: Equivalent wff's yield equal restricted class abstractions (deduction form). Version of rabbidva 3395 with disjoint variable condition replaced by nonfreeness hypothesis. (Contributed by BJ, 27-Apr-2019.) Avoid ax-10 2147, ax-11 2163. (Revised by Wolf Lammen, 14-Mar-2025.)

Hypotheses

Ref	Expression
rabbida.n	⊢ Ⅎ𝑥𝜑
rabbida.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒))

Assertion

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

Proof of Theorem rabbida

Step	Hyp	Ref	Expression
1		rabbida.n	. 2 ⊢ Ⅎ𝑥𝜑
2		rabbida.1	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒))
3	2	pm5.32da 579	. 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐴 ∧ 𝜒)))
4	1, 3	rabbida4 3414	1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐴 ∣ 𝜒})

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542  Ⅎwnf 1785   ∈ wcel 2114  {crab 3389

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 1912  ax-6 1969  ax-7 2010  ax-9 2124  ax-12 2185  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2715  df-cleq 2728  df-rab 3390

This theorem is referenced by:  rabbid  3416  rabeqbida  3418  smfpimltmpt  47174  smfpimltxrmptf  47186  smfpimgtmpt  47209  smfpimgtxrmptf  47212  smfrec  47217  smfsupmpt  47243  smfinflem  47245  smfinfmpt  47247