Theorem bj-abex 37632

Description: Two ways of stating that the extension of a formula is a set. (Contributed by BJ, 18-Jan-2025.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-abex	⊢ ({𝑥 ∣ 𝜑} ∈ V ↔ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ 𝜑))

Distinct variable groups:   𝑥,𝑦   𝜑,𝑦

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem bj-abex

Step	Hyp	Ref	Expression
1		isset 3467	. 2 ⊢ ({𝑥 ∣ 𝜑} ∈ V ↔ ∃𝑦 𝑦 = {𝑥 ∣ 𝜑})
2		eqabb 2900	. . 3 ⊢ (𝑦 = {𝑥 ∣ 𝜑} ↔ ∀𝑥(𝑥 ∈ 𝑦 ↔ 𝜑))
3	2	exbii 1876	. 2 ⊢ (∃𝑦 𝑦 = {𝑥 ∣ 𝜑} ↔ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ 𝜑))
4	1, 3	bitri 278	1 ⊢ ({𝑥 ∣ 𝜑} ∈ V ↔ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ 𝜑))

Syntax hints:   ↔ wb 209  ∀wal 1566   = wceq 1568  ∃wex 1807   ∈ wcel 2141  {cab 2739  Vcvv 3453

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 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1571  df-ex 1808  df-nf 1812  df-sb 2095  df-clab 2740  df-cleq 2753  df-clel 2836  df-v 3455

This theorem is referenced by: (None)