| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sbidm | Structured version Visualization version GIF version | ||
| Description: An idempotent law for substitution. Usage of this theorem is discouraged because it depends on ax-13 2403. (Contributed by NM, 30-Jun-1994.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 13-Jul-2019.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| sbidm | ⊢ ([𝑦 / 𝑥][𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbcom3 2537 | . 2 ⊢ ([𝑦 / 𝑥][𝑥 / 𝑥]𝜑 ↔ [𝑦 / 𝑥][𝑦 / 𝑥]𝜑) | |
| 2 | sbid 2290 | . . 3 ⊢ ([𝑥 / 𝑥]𝜑 ↔ 𝜑) | |
| 3 | 2 | sbbii 2109 | . 2 ⊢ ([𝑦 / 𝑥][𝑥 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑) |
| 4 | 1, 3 | bitr3i 280 | 1 ⊢ ([𝑦 / 𝑥][𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 [wsb 2095 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-10 2175 ax-12 2212 ax-13 2403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-ex 1809 df-nf 1813 df-sb 2096 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |