Theorem rabbida 3423

Description: Equivalent wff's yield equal restricted class abstractions (deduction form). Version of rabbidva 3403 with disjoint variable condition replaced by nonfreeness hypothesis. (Contributed by BJ, 27-Apr-2019.) Avoid ax-10 2146, ax-11 2162. (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 3422	1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐴 ∣ 𝜒})

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541  Ⅎwnf 1784   ∈ wcel 2113  {crab 3397

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-9 2123  ax-12 2182  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2713  df-cleq 2726  df-rab 3398

This theorem is referenced by:  rabbid  3424  rabeqbida  3426  smfpimltmpt  46932  smfpimltxrmptf  46944  smfpimgtmpt  46967  smfpimgtxrmptf  46970  smfrec  46975  smfsupmpt  47001  smfinflem  47003  smfinfmpt  47005