This is an inofficial mirror of http://metamath.tirix.org for personal testing of a visualizer extension only.

Metamath Proof Explorer

Theorem nfralw

Description: Bound-variable hypothesis builder for restricted quantification. Version of nfral with a disjoint variable condition, which does not require ax-13 . (Contributed by NM, 1-Sep-1999) Avoid ax-13 . (Revised by GG, 10-Jan-2024) (Proof shortened by Wolf Lammen, 13-Dec-2024)

Ref Expression
Hypotheses nfralw.1 ⊢ Ⅎ _ x A
nfralw.2 ⊢ Ⅎ x φ
Assertion nfralw ⊢ Ⅎ x ∀ y ∈ A φ

Proof

Step Hyp Ref Expression
1 nfralw.1 ⊢ Ⅎ _ x A
2 nfralw.2 ⊢ Ⅎ x φ
3 1 nfcrii ⊢ y ∈ A → ∀ x y ∈ A
4 2 nf5ri ⊢ φ → ∀ x φ
5 3 4 hbral ⊢ ∀ y ∈ A φ → ∀ x ∀ y ∈ A φ
6 5 nf5i ⊢ Ⅎ x ∀ y ∈ A φ