Theorem bnj1436 34815

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

Hypothesis

Ref	Expression
bnj1436.1	⊢ 𝐴 = {𝑥 ∣ 𝜑}

Assertion

Ref	Expression
bnj1436	⊢ (𝑥 ∈ 𝐴 → 𝜑)

Proof of Theorem bnj1436

Step	Hyp	Ref	Expression
1		bnj1436.1	. . 3 ⊢ 𝐴 = {𝑥 ∣ 𝜑}
2	1	eqabri 2888	. 2 ⊢ (𝑥 ∈ 𝐴 ↔ 𝜑)
3	2	biimpi 216	1 ⊢ (𝑥 ∈ 𝐴 → 𝜑)

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2108  {cab 2717

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-12 2178  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819

This theorem is referenced by:  bnj1517  34826  bnj66  34836  bnj900  34905  bnj1296  34997  bnj1371  35005  bnj1374  35007  bnj1398  35010  bnj1450  35026  bnj1497  35036  bnj1498  35037  bnj1514  35039  bnj1501  35043