| 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 2834, 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 2110 | . . 3 ⊢ (∀𝑥(𝜑 ↔ 𝜓) → ([𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜓)) | |
| 2 | df-clab 2744 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑) | |
| 3 | df-clab 2744 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜓} ↔ [𝑦 / 𝑥]𝜓) | |
| 4 | 1, 2, 3 | 3bitr4g 317 | . 2 ⊢ (∀𝑥(𝜑 ↔ 𝜓) → (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ 𝜓})) |
| 5 | 4 | eqrdv 2763 | 1 ⊢ (∀𝑥(𝜑 ↔ 𝜓) → {𝑥 ∣ 𝜑} = {𝑥 ∣ 𝜓}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∀wal 1568 = wceq 1570 [wsb 2099 ∈ wcel 2146 {cab 2743 |
| 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-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 |
| This theorem is used by: abbidv 2831 abbii 2832 abbid 2833 eqab 2903 sbcbi2 3804 iuneq12df 4985 axrep6g 5253 iotabi 6509 uniabio 6510 iotaval 6514 iotanul 6520 iuneq12daf 32976 bj-abv 37602 bj-cleq 37659 abbi1sn 43056 iotain 45204 |
| Copyright terms: Public domain | W3C validator |