| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sbievw | Structured version Visualization version GIF version | ||
| Description: Conversion of implicit substitution to explicit substitution. Version of sbie 2504 and sbiev 2317 with more disjoint variable conditions, requiring fewer axioms. (Contributed by NM, 30-Jun-1994.) (Revised by BJ, 18-Jul-2023.) (Proof shortened by SN, 24-Aug-2025.) |
| Ref | Expression |
|---|---|
| sbievw.is | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| sbievw | ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbievw.is | . . 3 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
| 2 | 1 | sbbiiev 2097 | . 2 ⊢ ([𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜓) |
| 3 | sbv 2093 | . 2 ⊢ ([𝑦 / 𝑥]𝜓 ↔ 𝜓) | |
| 4 | 2, 3 | bitri 275 | 1 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 [wsb 2067 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1781 df-sb 2068 |
| This theorem is referenced by: sbiedvw 2100 2sbievw 2101 sbievw2 2103 cbvsbv 2105 sbco4 2107 sbid2vw 2264 2mosOLD 2648 eqabbw 2807 sbralie 3320 sbralieALT 3321 rabrabi 3416 elabgw 3630 ralab 3649 sbcco2 3765 sbcie2g 3779 csbied 3883 dfss2 3917 unabw 4257 notabw 4263 2reu8i 47301 ichcircshi 47642 |
| Copyright terms: Public domain | W3C validator |