Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dfsb2 | Structured version Visualization version GIF version |
Description: An alternate definition of proper substitution that, like df-sb 1868, mixes free and bound variables to avoid distinct variable requirements. (Contributed by NM, 17-Feb-2005.) |
Ref | Expression |
---|---|
dfsb2 | ⊢ ([𝑦 / 𝑥]𝜑 ↔ ((𝑥 = 𝑦 ∧ 𝜑) ∨ ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sp 2041 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → 𝑥 = 𝑦) | |
2 | sbequ2 1869 | . . . . 5 ⊢ (𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 → 𝜑)) | |
3 | 2 | sps 2043 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 → 𝜑)) |
4 | orc 399 | . . . 4 ⊢ ((𝑥 = 𝑦 ∧ 𝜑) → ((𝑥 = 𝑦 ∧ 𝜑) ∨ ∀𝑥(𝑥 = 𝑦 → 𝜑))) | |
5 | 1, 3, 4 | syl6an 566 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 → ((𝑥 = 𝑦 ∧ 𝜑) ∨ ∀𝑥(𝑥 = 𝑦 → 𝜑)))) |
6 | sb4 2344 | . . . 4 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑))) | |
7 | olc 398 | . . . 4 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ((𝑥 = 𝑦 ∧ 𝜑) ∨ ∀𝑥(𝑥 = 𝑦 → 𝜑))) | |
8 | 6, 7 | syl6 34 | . . 3 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 → ((𝑥 = 𝑦 ∧ 𝜑) ∨ ∀𝑥(𝑥 = 𝑦 → 𝜑)))) |
9 | 5, 8 | pm2.61i 175 | . 2 ⊢ ([𝑦 / 𝑥]𝜑 → ((𝑥 = 𝑦 ∧ 𝜑) ∨ ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
10 | sbequ1 2096 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 → [𝑦 / 𝑥]𝜑)) | |
11 | 10 | imp 444 | . . 3 ⊢ ((𝑥 = 𝑦 ∧ 𝜑) → [𝑦 / 𝑥]𝜑) |
12 | sb2 2340 | . . 3 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → [𝑦 / 𝑥]𝜑) | |
13 | 11, 12 | jaoi 393 | . 2 ⊢ (((𝑥 = 𝑦 ∧ 𝜑) ∨ ∀𝑥(𝑥 = 𝑦 → 𝜑)) → [𝑦 / 𝑥]𝜑) |
14 | 9, 13 | impbii 198 | 1 ⊢ ([𝑦 / 𝑥]𝜑 ↔ ((𝑥 = 𝑦 ∧ 𝜑) ∨ ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∨ wo 382 ∧ wa 383 ∀wal 1473 [wsb 1867 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-12 2034 ax-13 2234 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 |
This theorem is referenced by: dfsb3 2362 |
Copyright terms: Public domain | W3C validator |