Theorem bnj1299 32698

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

Hypothesis

Ref	Expression
bnj1299.1	⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (𝜓 ∧ 𝜒))

Assertion

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

Proof of Theorem bnj1299

Step	Hyp	Ref	Expression
1		bnj1299.1	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (𝜓 ∧ 𝜒))
2		bnj1239 32685	. 2 ⊢ (∃𝑥 ∈ 𝐴 (𝜓 ∧ 𝜒) → ∃𝑥 ∈ 𝐴 𝜓)
3	1, 2	syl 17	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝜓)

Syntax hints:   → wi 4   ∧ wa 395  ∃wrex 3064

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

This theorem depends on definitions:  df-bi 206  df-an 396  df-ex 1784  df-rex 3069

This theorem is referenced by:  bnj1497  32940  bnj1498  32941  bnj1501  32947