Theorem bnj31 35017

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

Hypotheses

Ref	Expression
bnj31.1	⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝜓)
bnj31.2	⊢ (𝜓 → 𝜒)

Assertion

Ref	Expression
bnj31	⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝜒)

Proof of Theorem bnj31

Step	Hyp	Ref	Expression
1		bnj31.1	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝜓)
2		bnj31.2	. . 3 ⊢ (𝜓 → 𝜒)
3	2	reximi 3102	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝜓 → ∃𝑥 ∈ 𝐴 𝜒)
4	1, 3	syl 17	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝜒)

Syntax hints:   → wi 4  ∃wrex 3088

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

This theorem depends on definitions:  df-bi 209  df-an 400  df-ex 1802  df-rex 3089

This theorem is referenced by:  bnj168  35028  bnj110  35155  bnj906  35227  bnj1253  35314  bnj1280  35317  bnj1296  35318  bnj1371  35326  bnj1497  35357  bnj1498  35358  bnj1501  35364