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) (Revised by Gino Giotto, 10-Jan-2024)

Ref Expression
Hypotheses nfralw.1 𝑥 𝐴
nfralw.2 𝑥 𝜑
Assertion nfralw 𝑥𝑦𝐴 𝜑

Proof

Step Hyp Ref Expression
1 nfralw.1 𝑥 𝐴
2 nfralw.2 𝑥 𝜑
3 nftru 𝑦
4 1 a1i ( ⊤ → 𝑥 𝐴 )
5 2 a1i ( ⊤ → Ⅎ 𝑥 𝜑 )
6 3 4 5 nfraldw ( ⊤ → Ⅎ 𝑥𝑦𝐴 𝜑 )
7 6 mptru 𝑥𝑦𝐴 𝜑