MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  eqab Structured version   Visualization version   GIF version

Theorem eqab 2899
Description: One direction of eqabb 2900 is provable from fewer axioms. (Contributed by Wolf Lammen, 13-Feb-2025.)
Assertion
Ref Expression
eqab (∀𝑥(𝑥 ∈ 𝐴 ↔ 𝜑) → 𝐴 = {𝑥 ∣ 𝜑})
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem eqab
StepHypRef Expression
1 abid1 2897 . 2 𝐴 = {𝑥 ∣ 𝑥 ∈ 𝐴}
2 abbi 2826 . 2 (∀𝑥(𝑥 ∈ 𝐴 ↔ 𝜑) → {𝑥 ∣ 𝑥 ∈ 𝐴} = {𝑥 ∣ 𝜑})
31, 2eqtrid 2808 1 (∀𝑥(𝑥 ∈ 𝐴 ↔ 𝜑) → 𝐴 = {𝑥 ∣ 𝜑})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570   ∈ wcel 2145  {cab 2739
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836
This theorem is used by:  rabid2im  3444
  Copyright terms: Public domain W3C validator