| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eqab | Structured version Visualization version GIF version | ||
| Description: One direction of eqabb 2904 is provable from fewer axioms. (Contributed by Wolf Lammen, 13-Feb-2025.) |
| Ref | Expression |
|---|---|
| eqab | ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ 𝜑) → 𝐴 = {𝑥 ∣ 𝜑}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | abid1 2901 | . 2 ⊢ 𝐴 = {𝑥 ∣ 𝑥 ∈ 𝐴} | |
| 2 | abbi 2830 | . 2 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ 𝜑) → {𝑥 ∣ 𝑥 ∈ 𝐴} = {𝑥 ∣ 𝜑}) | |
| 3 | 1, 2 | eqtrid 2812 | 1 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ 𝜑) → 𝐴 = {𝑥 ∣ 𝜑}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∀wal 1561 = wceq 1563 ∈ wcel 2145 {cab 2743 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1566 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 |
| This theorem is referenced by: rabid2im 3449 |
| Copyright terms: Public domain | W3C validator |