Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sb2vOLDOLD | Structured version Visualization version GIF version |
Description: Obsolete version of sb2 2504 as of 8-Jul-2023. Version of sb2 2504 with a disjoint variable condition, which does not require ax-13 2390. (Contributed by BJ, 31-May-2019.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
sb2vOLDOLD | ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → [𝑦 / 𝑥]𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sp 2182 | . 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → (𝑥 = 𝑦 → 𝜑)) | |
2 | equs4v 2006 | . 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)) | |
3 | dfsb1 2510 | . 2 ⊢ ([𝑦 / 𝑥]𝜑 ↔ ((𝑥 = 𝑦 → 𝜑) ∧ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))) | |
4 | 1, 2, 3 | sylanbrc 585 | 1 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → [𝑦 / 𝑥]𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∀wal 1535 ∃wex 1780 [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 ax-10 2145 ax-12 2177 ax-13 2390 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-ex 1781 df-nf 1785 df-sb 2070 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |