Theorem bnj1521 32233

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

Hypotheses

Ref	Expression
bnj1521.1	⊢ (𝜒 → ∃𝑥 ∈ 𝐵 𝜑)
bnj1521.2	⊢ (𝜃 ↔ (𝜒 ∧ 𝑥 ∈ 𝐵 ∧ 𝜑))
bnj1521.3	⊢ (𝜒 → ∀𝑥𝜒)

Assertion

Ref	Expression
bnj1521	⊢ (𝜒 → ∃𝑥𝜃)

Proof of Theorem bnj1521

Step	Hyp	Ref	Expression
1		bnj1521.1	. . 3 ⊢ (𝜒 → ∃𝑥 ∈ 𝐵 𝜑)
2	1	bnj1196 32176	. 2 ⊢ (𝜒 → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))
3		bnj1521.2	. 2 ⊢ (𝜃 ↔ (𝜒 ∧ 𝑥 ∈ 𝐵 ∧ 𝜑))
4		bnj1521.3	. 2 ⊢ (𝜒 → ∀𝑥𝜒)
5	2, 3, 4	bnj1345 32206	1 ⊢ (𝜒 → ∃𝑥𝜃)

Syntax hints:   → wi 4   ↔ wb 209   ∧ w3a 1084  ∀wal 1536  ∃wex 1781   ∈ wcel 2111  ∃wrex 3107

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 1911  ax-6 1970  ax-7 2015  ax-10 2142  ax-12 2175

This theorem depends on definitions:  df-bi 210  df-an 400  df-3an 1086  df-ex 1782  df-nf 1786  df-rex 3112

This theorem is referenced by:  bnj1204  32394  bnj1311  32406  bnj1398  32416  bnj1408  32418  bnj1450  32432  bnj1312  32440  bnj1501  32449  bnj1523  32453