Theorem bnj1517 35208

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

Hypothesis

Ref	Expression
bnj1517.1	⊢ 𝐴 = {𝑥 ∣ (𝜑 ∧ 𝜓)}

Assertion

Ref	Expression
bnj1517	⊢ (𝑥 ∈ 𝐴 → 𝜓)

Proof of Theorem bnj1517

Step	Hyp	Ref	Expression
1		bnj1517.1	. . 3 ⊢ 𝐴 = {𝑥 ∣ (𝜑 ∧ 𝜓)}
2	1	bnj1436 35197	. 2 ⊢ (𝑥 ∈ 𝐴 → (𝜑 ∧ 𝜓))
3	2	simprd 500	1 ⊢ (𝑥 ∈ 𝐴 → 𝜓)

Syntax hints:   → wi 4   ∧ wa 400   = wceq 1568   ∈ wcel 2150  {cab 2748

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2152  ax-9 2160  ax-12 2220  ax-ext 2742

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1571  df-ex 1808  df-sb 2099  df-clab 2749  df-cleq 2762  df-clel 2845

This theorem is referenced by:  bnj1286  35377  bnj1450  35408  bnj1501  35425