|   | 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 2066. 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 2377. (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 2520 | . 2 ⊢ (∀𝑦[𝑦 / 𝑥]𝜑 → 𝜑) | 
| 3 | sbtr.1 | . 2 ⊢ [𝑦 / 𝑥]𝜑 | |
| 4 | 2, 3 | mpg 1797 | 1 ⊢ 𝜑 | 
| Colors of variables: wff setvar class | 
| Syntax hints: Ⅎwnf 1783 [wsb 2064 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-10 2141 ax-12 2177 ax-13 2377 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-ex 1780 df-nf 1784 df-sb 2065 | 
| This theorem is referenced by: (None) | 
| Copyright terms: Public domain | W3C validator |