| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sbid2v | Structured version Visualization version GIF version | ||
| Description: An identity law for substitution. Used in proof of Theorem 9.7 of [Megill] p. 449 (p. 16 of the preprint). Usage of this theorem is discouraged because it depends on ax-13 2403. See sbid2vw 2295 for a version with an extra disjoint variable condition requiring fewer axioms. (Contributed by NM, 5-Aug-1993.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| sbid2v | ⊢ ([𝑦 / 𝑥][𝑥 / 𝑦]𝜑 ↔ 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1947 | . 2 ⊢ Ⅎ𝑥𝜑 | |
| 2 | 1 | sbid2 2539 | 1 ⊢ ([𝑦 / 𝑥][𝑥 / 𝑦]𝜑 ↔ 𝜑) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 [wsb 2099 |
| 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-10 2178 ax-12 2215 ax-13 2403 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ex 1813 df-nf 1817 df-sb 2100 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |