| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > abbi | Structured version Visualization version GIF version | ||
| Description: Equivalent formulas yield equal class abstractions (closed form). This is the backward implication of abbib 2832, proved from fewer axioms, and hence is independently named. (Contributed by BJ and WL and SN, 20-Aug-2023.) |
| Ref | Expression |
|---|---|
| abbi | ⊢ (∀𝑥(𝜑 ↔ 𝜓) → {𝑥 ∣ 𝜑} = {𝑥 ∣ 𝜓}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | spsbbi 2112 | . . 3 ⊢ (∀𝑥(𝜑 ↔ 𝜓) → ([𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜓)) | |
| 2 | df-clab 2742 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑) | |
| 3 | df-clab 2742 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜓} ↔ [𝑦 / 𝑥]𝜓) | |
| 4 | 1, 2, 3 | 3bitr4g 317 | . 2 ⊢ (∀𝑥(𝜑 ↔ 𝜓) → (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ 𝜓})) |
| 5 | 4 | eqrdv 2761 | 1 ⊢ (∀𝑥(𝜑 ↔ 𝜓) → {𝑥 ∣ 𝜑} = {𝑥 ∣ 𝜓}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∀wal 1568 = wceq 1570 [wsb 2101 ∈ wcel 2147 {cab 2741 |
| 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 1945 ax-6 2002 ax-7 2043 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 |
| This theorem is used by: abbidv 2829 abbii 2830 abbid 2831 eqab 2902 sbcbi2 3800 iuneq12df 4983 axrep6g 5249 iotabi 6533 uniabio 6534 iotaval 6538 iotain 6539 iotanul 6545 iuneq12daf 33249 bj-abv 38033 bj-cleq 38090 abbi1sn 43544 |
| Copyright terms: Public domain | W3C validator |