Theorem rabbida 3419

Description: Equivalent wff's yield equal restricted class abstractions (deduction form). Version of rabbidva 3399 with disjoint variable condition replaced by nonfreeness hypothesis. (Contributed by BJ, 27-Apr-2019.) Avoid ax-10 2154, ax-11 2170. (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 585	. 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐴 ∧ 𝜒)))
4	1, 3	rabbida4 3418	1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐴 ∣ 𝜒})

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 397   = wceq 1548  Ⅎwnf 1791   ∈ wcel 2121  {crab 3393

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-9 2131  ax-12 2191  ax-ext 2713

This theorem depends on definitions:  df-bi 209  df-an 398  df-ex 1788  df-nf 1792  df-sb 2075  df-clab 2720  df-cleq 2733  df-rab 3394

This theorem is referenced by:  rabbid  3420  rabeqbida  3422  smfpimltmpt  47203  smfpimltxrmptf  47215  smfpimgtmpt  47238  smfpimgtxrmptf  47241  smfrec  47246  smfsupmpt  47272  smfinflem  47274  smfinfmpt  47276