Theorem rabbida 3441

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

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1569  Ⅎwnf 1812   ∈ 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-9 2152  ax-12 2212  ax-ext 2734

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

This theorem is used by:  rabbid  3442  rabeqbida  3444  smfpimltmpt  47488  smfpimltxrmptf  47500  smfpimgtmpt  47523  smfpimgtxrmptf  47526  smfrec  47531  smfsupmpt  47557  smfinflem  47559  smfinfmpt  47561