Theorem bnj1521 35148

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 35091	. 2 ⊢ (𝜒 → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))
3		bnj1521.2	. 2 ⊢ (𝜃 ↔ (𝜒 ∧ 𝑥 ∈ 𝐵 ∧ 𝜑))
4		bnj1521.3	. 2 ⊢ (𝜒 → ∀𝑥𝜒)
5	2, 3, 4	bnj1345 35121	1 ⊢ (𝜒 → ∃𝑥𝜃)

Syntax hints:   → wi 4   ↔ wb 208   ∧ w3a 1099  ∀wal 1560  ∃wex 1801   ∈ wcel 2144  ∃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  ax-5 1932  ax-6 1989  ax-7 2030  ax-10 2177  ax-12 2214

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

This theorem is referenced by:  bnj1204  35309  bnj1311  35321  bnj1398  35331  bnj1408  35333  bnj1450  35347  bnj1312  35355  bnj1501  35364  bnj1523  35368