Theorem bnj937 35169

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

Hypothesis

Ref	Expression
bnj937.1	⊢ (𝜑 → ∃𝑥𝜓)

Assertion

Ref	Expression
bnj937	⊢ (𝜑 → 𝜓)

Distinct variable group:   𝜓,𝑥

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem bnj937

Step	Hyp	Ref	Expression
1		bnj937.1	. 2 ⊢ (𝜑 → ∃𝑥𝜓)
2		19.9v 2013	. 2 ⊢ (∃𝑥𝜓 ↔ 𝜓)
3	1, 2	sylib 221	1 ⊢ (𝜑 → 𝜓)

This proof depends on syntax axioms:   → wi 4  ∃wex 1808

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996

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

This theorem is used by:  bnj1265  35209  bnj1379  35227  bnj852  35318  bnj1148  35393  bnj1154  35396  bnj1189  35406  bnj1245  35411  bnj1286  35416  bnj1311  35421  bnj1371  35426  bnj1374  35428  bnj1498  35458  bnj1514  35460