Theorem bnj1196 34929

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

Syntax hints:   → wi 4   ∧ wa 395  ∃wex 1781   ∈ wcel 2114  ∃wrex 3059

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 207  df-rex 3060

This theorem is referenced by:  bnj1209  34931  bnj1265  34947  bnj1379  34965  bnj1521  34986  bnj900  35064  bnj986  35090  bnj1189  35144  bnj1245  35149  bnj1286  35154  bnj1311  35159  bnj1450  35185  bnj1498  35196