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 2371. See sbid2vw 2256 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 1922 | . 2 ⊢ Ⅎ𝑥𝜑 | |
2 | 1 | sbid2 2511 | 1 ⊢ ([𝑦 / 𝑥][𝑥 / 𝑦]𝜑 ↔ 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 [wsb 2070 |
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 1976 ax-7 2016 ax-10 2141 ax-12 2175 ax-13 2371 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-ex 1788 df-nf 1792 df-sb 2071 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |