| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cbvabw | Structured version Visualization version GIF version | ||
| Description: Rule used to change bound variables, using implicit substitution. Version of cbvab 2813 with a disjoint variable condition, which does not require ax-10 2154, ax-13 2382. (Contributed by Andrew Salmon, 11-Jul-2011.) (Revised by GG, 23-May-2024.) |
| Ref | Expression |
|---|---|
| cbvabw.1 | ⊢ Ⅎ𝑦𝜑 |
| cbvabw.2 | ⊢ Ⅎ𝑥𝜓 |
| cbvabw.3 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| cbvabw | ⊢ {𝑥 ∣ 𝜑} = {𝑦 ∣ 𝜓} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvabw.1 | . . . 4 ⊢ Ⅎ𝑦𝜑 | |
| 2 | cbvabw.2 | . . . 4 ⊢ Ⅎ𝑥𝜓 | |
| 3 | cbvabw.3 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
| 4 | 1, 2, 3 | cbvsbvf 2373 | . . 3 ⊢ ([𝑧 / 𝑥]𝜑 ↔ [𝑧 / 𝑦]𝜓) |
| 5 | df-clab 2720 | . . 3 ⊢ (𝑧 ∈ {𝑥 ∣ 𝜑} ↔ [𝑧 / 𝑥]𝜑) | |
| 6 | df-clab 2720 | . . 3 ⊢ (𝑧 ∈ {𝑦 ∣ 𝜓} ↔ [𝑧 / 𝑦]𝜓) | |
| 7 | 4, 5, 6 | 3bitr4i 305 | . 2 ⊢ (𝑧 ∈ {𝑥 ∣ 𝜑} ↔ 𝑧 ∈ {𝑦 ∣ 𝜓}) |
| 8 | 7 | eqriv 2738 | 1 ⊢ {𝑥 ∣ 𝜑} = {𝑦 ∣ 𝜓} |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 = wceq 1548 Ⅎwnf 1791 [wsb 2074 ∈ wcel 2121 {cab 2719 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-9 2131 ax-11 2170 ax-12 2191 ax-ext 2713 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-ex 1788 df-nf 1792 df-sb 2075 df-clab 2720 df-cleq 2733 |
| This theorem is referenced by: cbvrabw 3428 cbvrabwOLD 3429 cbvsbcw 3758 cbvrabcsfw 3874 rabsnifsb 4657 dfdmf 5845 dfrnf 5899 funfv2f 6920 abrexex2g 7910 bnj873 35121 fineqvrep 35310 ptrest 38001 poimirlem26 38028 poimirlem27 38029 |
| Copyright terms: Public domain | W3C validator |