Theorem bnj1196 33071

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

Syntax hints:   → wi 4   ∧ wa 397  ∃wex 1781   ∈ wcel 2106  ∃wrex 3071

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 3072

This theorem is referenced by:  bnj1209  33073  bnj1265  33089  bnj1379  33107  bnj1521  33128  bnj900  33206  bnj986  33232  bnj1189  33286  bnj1245  33291  bnj1286  33296  bnj1311  33301  bnj1450  33327  bnj1498  33338