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 ⊢ Ⅎ _ x A
nfral.2 ⊢ Ⅎ x φ
Assertion nfral ⊢ Ⅎ x ∀ y ∈ A φ

Proof

Step Hyp Ref Expression
1 nfral.1 ⊢ Ⅎ _ x A
2 nfral.2 ⊢ Ⅎ x φ
3 nftru ⊢ Ⅎ y ⊤
4 1 a1i ⊢ ⊤ → Ⅎ _ x A
5 2 a1i ⊢ ⊤ → Ⅎ x φ
6 3 4 5 nfrald ⊢ ⊤ → Ⅎ x ∀ y ∈ A φ
7 6 mptru ⊢ Ⅎ x ∀ y ∈ A φ