Theorem hbe1 2132

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

Assertion

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

Proof of Theorem hbe1

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

Syntax hints:  ¬ wn 3   → wi 4  ∀wal 1532  ∃wex 1774

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-10 2130

This theorem depends on definitions:  df-bi 206  df-ex 1775

This theorem is referenced by:  nfe1  2140  equs5eALT  2359  nfeqf2  2371  equs5e  2452  axie1  2692  bj-wnf2  36118  bj-nnfe1  36160  ac6s6  37567  exlimexi  43876  vk15.4j  43880  vk15.4jVD  44266