Theorem bnj1275 33090

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

Hypotheses

Ref	Expression
bnj1275.1	⊢ (𝜑 → ∃𝑥(𝜓 ∧ 𝜒))
bnj1275.2	⊢ (𝜑 → ∀𝑥𝜑)

Assertion

Ref	Expression
bnj1275	⊢ (𝜑 → ∃𝑥(𝜑 ∧ 𝜓 ∧ 𝜒))

Proof of Theorem bnj1275

Step	Hyp	Ref	Expression
1		bnj1275.2	. . 3 ⊢ (𝜑 → ∀𝑥𝜑)
2		bnj1275.1	. . 3 ⊢ (𝜑 → ∃𝑥(𝜓 ∧ 𝜒))
3	1, 2	bnj596 33023	. 2 ⊢ (𝜑 → ∃𝑥(𝜑 ∧ (𝜓 ∧ 𝜒)))
4		3anass 1095	. 2 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ (𝜑 ∧ (𝜓 ∧ 𝜒)))
5	3, 4	bnj1198 33072	1 ⊢ (𝜑 → ∃𝑥(𝜑 ∧ 𝜓 ∧ 𝜒))

Syntax hints:   → wi 4   ∧ wa 397   ∧ w3a 1087  ∀wal 1539  ∃wex 1781

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-10 2137  ax-12 2171

This theorem depends on definitions:  df-bi 206  df-an 398  df-3an 1089  df-ex 1782  df-nf 1786

This theorem is referenced by:  bnj1345  33101  bnj1279  33295