Metamath Proof Explorer


Theorem nfrabw

Description: A variable not free in a wff remains so in a restricted class abstraction. Version of nfrab with a disjoint variable condition, which does not require ax-13 . (Contributed by NM, 13-Oct-2003) Avoid ax-13 . (Revised by GG, 10-Jan-2024) (Proof shortened by Wolf Lammen, 23-Nov-2024)

Ref Expression
Hypotheses nfrabw.1 ⊢ Ⅎ x φ
nfrabw.2 ⊢ Ⅎ _ x A
Assertion nfrabw ⊢ Ⅎ _ x y ∈ A | φ

Proof

Step Hyp Ref Expression
1 nfrabw.1 ⊢ Ⅎ x φ
2 nfrabw.2 ⊢ Ⅎ _ x A
3 df-rab ⊢ y ∈ A | φ = y | y ∈ A ∧ φ
4 2 nfcri ⊢ Ⅎ x y ∈ A
5 4 1 nfan ⊢ Ⅎ x y ∈ A ∧ φ
6 5 nfab ⊢ Ⅎ _ x y | y ∈ A ∧ φ
7 3 6 nfcxfr ⊢ Ⅎ _ x y ∈ A | φ