Mathbox for Norm Megill < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dedths Structured version   Unicode version

Theorem dedths 32447
 Description: A version of weak deduction theorem dedth 3957 using explicit substitution. (Contributed by NM, 15-Jun-2019.)
Hypothesis
Ref Expression
dedths.1
Assertion
Ref Expression
dedths

Proof of Theorem dedths
StepHypRef Expression
1 dfsbcq 3298 . . 3
2 dedths.1 . . . 4
3 sbcid 3313 . . . . 5
4 ifbi 3927 . . . . 5
5 dfsbcq 3298 . . . . 5
63, 4, 5mp2b 10 . . . 4
72, 6mpbir 212 . . 3
81, 7dedth 3957 . 2
9 sbcid 3313 . 2
108, 3, 93imtr3i 268 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 187   wceq 1437  wsbc 3296  cif 3906 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1665  ax-4 1678  ax-5 1748  ax-6 1794  ax-7 1838  ax-10 1886  ax-11 1891  ax-12 1904  ax-13 2052  ax-ext 2398 This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-tru 1440  df-ex 1660  df-nf 1664  df-sb 1787  df-clab 2406  df-cleq 2412  df-clel 2415  df-sbc 3297  df-if 3907 This theorem is referenced by:  renegclALT  32448
 Copyright terms: Public domain W3C validator