Theorem bnj1517 30174

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 30164	. 2 ⊢ (𝑥 ∈ 𝐴 → (𝜑 ∧ 𝜓))
3	2	simprd 478	1 ⊢ (𝑥 ∈ 𝐴 → 𝜓)

Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  {cab 2596

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-12 2034  ax-ext 2590

This theorem depends on definitions:  df-bi 196  df-an 385  df-tru 1478  df-ex 1696  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606

This theorem is referenced by:  bnj1286  30341  bnj1450  30372  bnj1501  30389