Theorem bnj1397 32110

Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj1397.1	⊢ (𝜑 → ∃𝑥𝜓)
bnj1397.2	⊢ (𝜓 → ∀𝑥𝜓)

Assertion

Ref	Expression
bnj1397	⊢ (𝜑 → 𝜓)

Proof of Theorem bnj1397

Step	Hyp	Ref	Expression
1		bnj1397.1	. 2 ⊢ (𝜑 → ∃𝑥𝜓)
2		bnj1397.2	. . 3 ⊢ (𝜓 → ∀𝑥𝜓)
3	2	19.9h 2293	. 2 ⊢ (∃𝑥𝜓 ↔ 𝜓)
4	1, 3	sylib 220	1 ⊢ (𝜑 → 𝜓)

Syntax hints:   → wi 4  ∀wal 1534  ∃wex 1779

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-10 2144  ax-12 2176

This theorem depends on definitions:  df-bi 209  df-ex 1780  df-nf 1784

This theorem is referenced by:  bnj1398  32310  bnj1408  32312  bnj1450  32326  bnj1501  32343