![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > sbcom | Structured version Visualization version GIF version |
Description: A commutativity law for substitution. Usage of this theorem is discouraged because it depends on ax-13 2375. Check out sbcom3vv 2095 for a version requiring fewer axioms. (Contributed by NM, 27-May-1997.) (Proof shortened by Wolf Lammen, 20-Sep-2018.) (New usage is discouraged.) |
Ref | Expression |
---|---|
sbcom | ⊢ ([𝑦 / 𝑧][𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥][𝑦 / 𝑧]𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbco3 2516 | . 2 ⊢ ([𝑦 / 𝑧][𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥][𝑥 / 𝑧]𝜑) | |
2 | sbcom3 2509 | . 2 ⊢ ([𝑦 / 𝑧][𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑧][𝑦 / 𝑥]𝜑) | |
3 | sbcom3 2509 | . 2 ⊢ ([𝑦 / 𝑥][𝑥 / 𝑧]𝜑 ↔ [𝑦 / 𝑥][𝑦 / 𝑧]𝜑) | |
4 | 1, 2, 3 | 3bitr3i 301 | 1 ⊢ ([𝑦 / 𝑧][𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥][𝑦 / 𝑧]𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 [wsb 2062 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-10 2139 ax-11 2155 ax-12 2175 ax-13 2375 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1540 df-ex 1777 df-nf 1781 df-sb 2063 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |