Theorem hbral 3306

Description: Bound-variable hypothesis builder for restricted quantification. (Contributed by NM, 1-Sep-1999.) (Revised by David Abernethy, 13-Dec-2009.)

Hypotheses

Ref	Expression
hbral.1	⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴)
hbral.2	⊢ (𝜑 → ∀𝑥𝜑)

Assertion

Ref	Expression
hbral	⊢ (∀𝑦 ∈ 𝐴 𝜑 → ∀𝑥∀𝑦 ∈ 𝐴 𝜑)

Proof of Theorem hbral

Step	Hyp	Ref	Expression
1		df-ral 3077	. 2 ⊢ (∀𝑦 ∈ 𝐴 𝜑 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝜑))
2		hbral.1	. . . 4 ⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴)
3		hbral.2	. . . 4 ⊢ (𝜑 → ∀𝑥𝜑)
4	2, 3	hbim 2332	. . 3 ⊢ ((𝑦 ∈ 𝐴 → 𝜑) → ∀𝑥(𝑦 ∈ 𝐴 → 𝜑))
5	4	hbal 2203	. 2 ⊢ (∀𝑦(𝑦 ∈ 𝐴 → 𝜑) → ∀𝑥∀𝑦(𝑦 ∈ 𝐴 → 𝜑))
6	1, 5	hbxfrbi 1857	1 ⊢ (∀𝑦 ∈ 𝐴 𝜑 → ∀𝑥∀𝑦 ∈ 𝐴 𝜑)

This proof depends on syntax axioms:   → wi 4  ∀wal 1567   ∈ wcel 2144  ∀wral 3076

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-10 2177  ax-11 2193  ax-12 2212

This proof depends on definitions:  df-bi 210  df-ex 1812  df-nf 1816  df-ral 3077

This theorem is used by:  nfralw  3309  tratrbVD  45950