| Mathbox for Andrew Salmon |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > sbeqal1 | Structured version Visualization version GIF version | ||
| Description: If 𝑥 = 𝑦 always implies 𝑥 = 𝑧, then 𝑦 = 𝑧. (Contributed by Andrew Salmon, 2-Jun-2011.) |
| Ref | Expression |
|---|---|
| sbeqal1 | ⊢ (∀𝑥(𝑥 = 𝑦 → 𝑥 = 𝑧) → 𝑦 = 𝑧) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sb2 2510 | . 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝑥 = 𝑧) → [𝑦 / 𝑥]𝑥 = 𝑧) | |
| 2 | equsb3 2137 | . 2 ⊢ ([𝑦 / 𝑥]𝑥 = 𝑧 ↔ 𝑦 = 𝑧) | |
| 3 | 1, 2 | sylib 221 | 1 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝑥 = 𝑧) → 𝑦 = 𝑧) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∀wal 1567 [wsb 2095 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-10 2175 ax-12 2212 ax-13 2403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-ex 1809 df-nf 1813 df-sb 2096 |
| This theorem is used by: sbeqal1i 45137 |
| Copyright terms: Public domain | W3C validator |