| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sb3 | GIF version | ||
| Description: One direction of a simplified definition of substitution when variables are distinct. (Contributed by NM, 5-Aug-1993.) |
| Ref | Expression |
|---|---|
| sb3 | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) → [𝑦 / 𝑥]𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | equs5 1853 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) → ∀𝑥(𝑥 = 𝑦 → 𝜑))) | |
| 2 | sb2 1791 | . 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → [𝑦 / 𝑥]𝜑) | |
| 3 | 1, 2 | syl6 33 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) → [𝑦 / 𝑥]𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∀wal 1371 ∃wex 1516 [wsb 1786 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 |
| This theorem depends on definitions: df-bi 117 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |