| 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 2830, 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 2740 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑) | |
| 3 | df-clab 2740 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜓} ↔ [𝑦 / 𝑥]𝜓) | |
| 4 | 1, 2, 3 | 3bitr4g 317 | . 2 ⊢ (∀𝑥(𝜑 ↔ 𝜓) → (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ 𝜓})) |
| 5 | 4 | eqrdv 2759 | 1 ⊢ (∀𝑥(𝜑 ↔ 𝜓) → {𝑥 ∣ 𝜑} = {𝑥 ∣ 𝜓}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∀wal 1568 = wceq 1570 [wsb 2099 ∈ 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-9 2155 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 |
| This theorem is used by: abbidv 2827 abbii 2828 abbid 2829 eqab 2899 sbcbi2 3797 iuneq12df 4978 axrep6g 5243 iotabi 6507 uniabio 6508 iotaval 6512 iotanul 6518 iuneq12daf 33151 bj-abv 37818 bj-cleq 37875 abbi1sn 43277 iotain 45400 |
| Copyright terms: Public domain | W3C validator |