Theorem hbe1 2182

Description: The setvar 𝑥 is not free in ∃𝑥𝜑. Corresponds to the axiom (5) of modal logic (see also modal5 2195). (Contributed by NM, 24-Jan-1993.)

Assertion

Ref	Expression
hbe1	⊢ (∃𝑥𝜑 → ∀𝑥∃𝑥𝜑)

Proof of Theorem hbe1

Step	Hyp	Ref	Expression
1		df-ex 1813	. 2 ⊢ (∃𝑥𝜑 ↔ ¬ ∀𝑥 ¬ 𝜑)
2		hbn1 2181	. 2 ⊢ (¬ ∀𝑥 ¬ 𝜑 → ∀𝑥 ¬ ∀𝑥 ¬ 𝜑)
3	1, 2	hbxfrbi 1858	1 ⊢ (∃𝑥𝜑 → ∀𝑥∃𝑥𝜑)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∀wal 1568  ∃wex 1812

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-10 2180

This proof depends on definitions:  df-bi 210  df-ex 1813

This theorem is used by:  nf5di  2184  nfe1  2190  nfexhe  2214  equs5eALT  2399  nfeqf2  2409  equs5e  2490  axie1  2729  bj-wnf2  37813  bj-nnfe1  37878  ac6s6  39307  nfale2  43472  exlimexi  45709  vk15.4j  45713  vk15.4jVD  46098