| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sbtr | Structured version Visualization version GIF version | ||
| Description: A partial converse to sbt 2419. If the substitution of a variable for a non-free one in a wff gives a theorem, then the original wff is a theorem. (Contributed by BJ, 15-Sep-2018.) |
| Ref | Expression |
|---|---|
| sbtr.nf | ⊢ Ⅎ𝑦𝜑 |
| sbtr.1 | ⊢ [𝑦 / 𝑥]𝜑 |
| Ref | Expression |
|---|---|
| sbtr | ⊢ 𝜑 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbtr.nf | . . 3 ⊢ Ⅎ𝑦𝜑 | |
| 2 | 1 | sbtrt 2420 | . 2 ⊢ (∀𝑦[𝑦 / 𝑥]𝜑 → 𝜑) |
| 3 | sbtr.1 | . 2 ⊢ [𝑦 / 𝑥]𝜑 | |
| 4 | 2, 3 | mpg 1724 | 1 ⊢ 𝜑 |
| Colors of variables: wff setvar class |
| Syntax hints: Ⅎwnf 1708 [wsb 1880 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-10 2019 ax-12 2047 ax-13 2246 |
| This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-ex 1705 df-nf 1710 df-sb 1881 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |