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 2069. If the substitution of a variable for a nonfree one in a wff gives a theorem, then the original wff is a theorem. Usage of this theorem is discouraged because it depends on ax-13 2372. (Contributed by BJ, 15-Sep-2018.) (New usage is discouraged.) |
Ref | Expression |
---|---|
sbtr.nf | ⊢ Ⅎ𝑦𝜑 |
sbtr.1 | ⊢ [𝑦 / 𝑥]𝜑 |
Ref | Expression |
---|---|
sbtr | ⊢ 𝜑 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbtr.nf | . . 3 ⊢ Ⅎ𝑦𝜑 | |
2 | 1 | sbtrt 2519 | . 2 ⊢ (∀𝑦[𝑦 / 𝑥]𝜑 → 𝜑) |
3 | sbtr.1 | . 2 ⊢ [𝑦 / 𝑥]𝜑 | |
4 | 2, 3 | mpg 1800 | 1 ⊢ 𝜑 |
Colors of variables: wff setvar class |
Syntax hints: Ⅎwnf 1786 [wsb 2067 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-10 2137 ax-12 2171 ax-13 2372 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-ex 1783 df-nf 1787 df-sb 2068 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |