Metamath Proof Explorer


Theorem nfral

Description: Bound-variable hypothesis builder for restricted quantification. Usage of this theorem is discouraged because it depends on ax-13 . Use the weaker nfralw when possible. (Contributed by NM, 1-Sep-1999) (Revised by Mario Carneiro, 7-Oct-2016) (New usage is discouraged.)

Ref Expression
Hypotheses nfral.1 ⊢ Ⅎ 𝑥 𝐴
nfral.2 ⊢ Ⅎ 𝑥 𝜑
Assertion nfral Ⅎ 𝑥 ∀ 𝑦 ∈ 𝐴 𝜑

Proof

Step Hyp Ref Expression
1 nfral.1 ⊢ Ⅎ 𝑥 𝐴
2 nfral.2 ⊢ Ⅎ 𝑥 𝜑
3 nftru ⊢ Ⅎ 𝑦 ⊤
4 1 a1i ⊢ ( ⊤ → Ⅎ 𝑥 𝐴 )
5 2 a1i ⊢ ( ⊤ → Ⅎ 𝑥 𝜑 )
6 3 4 5 nfrald ⊢ ( ⊤ → Ⅎ 𝑥 ∀ 𝑦 ∈ 𝐴 𝜑 )
7 6 mptru ⊢ Ⅎ 𝑥 ∀ 𝑦 ∈ 𝐴 𝜑