Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sbequvvOLD | Structured version Visualization version GIF version |
Description: Obsolete version of sbequ 2090 as of 7-Jul-2023. Version of sbequ 2090 with disjoint variable conditions, not requiring ax-13 2390. (Contributed by Wolf Lammen, 19-Jan-2023.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
sbequvvOLD | ⊢ (𝑥 = 𝑦 → ([𝑥 / 𝑧]𝜑 ↔ [𝑦 / 𝑧]𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbequivvOLD 2334 | . 2 ⊢ (𝑥 = 𝑦 → ([𝑥 / 𝑧]𝜑 → [𝑦 / 𝑧]𝜑)) | |
2 | sbequivvOLD 2334 | . . 3 ⊢ (𝑦 = 𝑥 → ([𝑦 / 𝑧]𝜑 → [𝑥 / 𝑧]𝜑)) | |
3 | 2 | equcoms 2027 | . 2 ⊢ (𝑥 = 𝑦 → ([𝑦 / 𝑧]𝜑 → [𝑥 / 𝑧]𝜑)) |
4 | 1, 3 | impbid 214 | 1 ⊢ (𝑥 = 𝑦 → ([𝑥 / 𝑧]𝜑 ↔ [𝑦 / 𝑧]𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 [wsb 2069 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1781 df-sb 2070 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |