Theorem bnj1196 34271

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 3070	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
3	1, 2	sylib 217	1 ⊢ (𝜑 → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))

Syntax hints:   → wi 4   ∧ wa 395  ∃wex 1780   ∈ wcel 2105  ∃wrex 3069

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This theorem depends on definitions:  df-bi 206  df-rex 3070

This theorem is referenced by:  bnj1209  34273  bnj1265  34289  bnj1379  34307  bnj1521  34328  bnj900  34406  bnj986  34432  bnj1189  34486  bnj1245  34491  bnj1286  34496  bnj1311  34501  bnj1450  34527  bnj1498  34538