Theorem bnj1196 35191

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

Hypothesis

Ref	Expression
bnj1196.1	⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝜓)

Assertion

Ref	Expression
bnj1196	⊢ (𝜑 → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))

Proof of Theorem bnj1196

Step	Hyp	Ref	Expression
1		bnj1196.1	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝜓)
2		df-rex 3089	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
3	1, 2	sylib 221	1 ⊢ (𝜑 → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400  ∃wex 1808   ∈ wcel 2142  ∃wrex 3088

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This proof depends on definitions:  df-bi 210  df-rex 3089

This theorem is used by:  bnj1209  35193  bnj1265  35209  bnj1379  35227  bnj1521  35248  bnj900  35326  bnj986  35352  bnj1189  35406  bnj1245  35411  bnj1286  35416  bnj1311  35421  bnj1450  35447  bnj1498  35458