| 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 2097 by removing its provable hypothesis. (Contributed by Wolf Lammen, 5-Feb-2026.) |
| Ref | Expression |
|---|---|
| dfsb | ⊢ ([𝑡 / 𝑥]𝜑 ↔ ∀𝑦(𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbjust 2095 | . 2 ⊢ (∀𝑦(𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑)) ↔ ∀𝑧(𝑧 = 𝑡 → ∀𝑥(𝑥 = 𝑧 → 𝜑))) | |
| 2 | 1 | df-sb 2097 | 1 ⊢ ([𝑡 / 𝑥]𝜑 ↔ ∀𝑦(𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∀wal 1568 [wsb 2096 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1810 df-sb 2097 |
| This theorem is referenced by: stdpc4 2102 sbi1 2105 spsbe 2116 sbequ 2117 sb6 2119 sbal 2204 sbequ1 2284 sbequ2 2285 dfsb7 2314 sbn 2315 sbrim 2339 cbvsbvf 2395 sb4b 2507 sbequbidv 36704 cbvsbdavw 36744 cbvsbdavw2 36745 bj-ssbeq 37253 bj-ssbid2ALT 37263 bj-ssbid1ALT 37265 |
| Copyright terms: Public domain | W3C validator |