Metamath Proof Explorer


Theorem rabbida

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

Ref Expression
Hypotheses rabbida.n ⊢ Ⅎ x φ
rabbida.1 ⊢ φ ∧ x ∈ A → ψ ↔ χ
Assertion rabbida ⊢ φ → x ∈ A | ψ = x ∈ A | χ

Proof

Step Hyp Ref Expression
1 rabbida.n ⊢ Ⅎ x φ
2 rabbida.1 ⊢ φ ∧ x ∈ A → ψ ↔ χ
3 2 pm5.32da ⊢ φ → x ∈ A ∧ ψ ↔ x ∈ A ∧ χ
4 1 3 rabbida4 ⊢ φ → x ∈ A | ψ = x ∈ A | χ