| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfsb | Structured version Visualization version GIF version | ||
| Description: Simplify definition df-sb 2102 by removing its provable hypothesis. (Contributed by Wolf Lammen, 5-Feb-2026.) |
| Ref | Expression |
|---|---|
| dfsb | ⊢ ([𝑡 / 𝑥]𝜑 ↔ ∀𝑦(𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbjust 2100 | . 2 ⊢ (∀𝑦(𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑)) ↔ ∀𝑧(𝑧 = 𝑡 → ∀𝑥(𝑥 = 𝑧 → 𝜑))) | |
| 2 | 1 | df-sb 2102 | 1 ⊢ ([𝑡 / 𝑥]𝜑 ↔ ∀𝑦(𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∀wal 1568 [wsb 2101 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-sb 2102 |
| This theorem is used by: stdpc4 2107 sbi1 2110 spsbe 2121 sbequ 2122 sb6 2124 sbal 2209 sbequ1 2287 sbequ2 2288 dfsb7 2316 sbn 2317 sbrim 2341 cbvsbvf 2395 sb4b 2507 sbequbidv 37194 cbvsbdavw 37234 cbvsbdavw2 37235 bj-ssbeq 37743 bj-ssbid2ALT 37753 bj-ssbid1ALT 37755 |
| Copyright terms: Public domain | W3C validator |