| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sbco2vv | Structured version Visualization version GIF version | ||
| Description: A composition law for substitution. Version of sbco2 2541 with disjoint variable conditions and fewer axioms. (Contributed by NM, 30-Jun-1994.) (Revised by BJ, 22-Dec-2020.) (Proof shortened by Wolf Lammen, 29-Apr-2023.) |
| Ref | Expression |
|---|---|
| sbco2vv | ⊢ ([𝑦 / 𝑧][𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbequ 2115 | . 2 ⊢ (𝑧 = 𝑤 → ([𝑧 / 𝑥]𝜑 ↔ [𝑤 / 𝑥]𝜑)) | |
| 2 | sbequ 2115 | . 2 ⊢ (𝑤 = 𝑦 → ([𝑤 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑)) | |
| 3 | 1, 2 | sbievw2 2131 | 1 ⊢ ([𝑦 / 𝑧][𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 [wsb 2089 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1799 df-sb 2090 |
| This theorem is referenced by: cbvsbv 2133 sbco4lemOLD 2206 sbco4OLD 2207 sbralie 3339 sbralieALT 3340 sbralieOLD 3341 sbccow 3765 wl-equsb3 38020 2reu8i 47668 |
| Copyright terms: Public domain | W3C validator |