Theorem hbex 2333

Description: If 𝑥 is not free in 𝜑, it is not free in ∃𝑦𝜑. (Contributed by NM, 12-Mar-1993.) Reduce symbol count in nfex 2332, hbex 2333. (Revised by Wolf Lammen, 16-Oct-2021.)

Hypothesis

Ref	Expression
hbex.1	⊢ (𝜑 → ∀𝑥𝜑)

Assertion

Ref	Expression
hbex	⊢ (∃𝑦𝜑 → ∀𝑥∃𝑦𝜑)

Proof of Theorem hbex

Step	Hyp	Ref	Expression
1		hbex.1	. . . 4 ⊢ (𝜑 → ∀𝑥𝜑)
2	1	nf5i 2147	. . 3 ⊢ Ⅎ𝑥𝜑
3	2	nfex 2332	. 2 ⊢ Ⅎ𝑥∃𝑦𝜑
4	3	nf5ri 2193	1 ⊢ (∃𝑦𝜑 → ∀𝑥∃𝑦𝜑)

Syntax hints:   → wi 4  ∀wal 1536  ∃wex 1781

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-10 2142  ax-11 2158  ax-12 2175

This theorem depends on definitions:  df-bi 210  df-or 845  df-ex 1782  df-nf 1786

This theorem is referenced by: (None)