Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  tbw-bijust Unicode version

Theorem tbw-bijust 1531
 Description: Justification for tbw-negdf 1532. (Contributed by Anthony Hart, 15-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
tbw-bijust

Proof of Theorem tbw-bijust
StepHypRef Expression
1 dfbi1 192 . 2
2 pm2.21 108 . . . . 5
32imim2i 14 . . . 4
4 id 22 . . . . . 6
5 falim 1409 . . . . . 6
64, 5ja 161 . . . . 5
76imim2i 14 . . . 4
83, 7impbii 188 . . 3
98notbii 296 . 2
10 pm2.21 108 . . 3
11 ax-1 6 . . . . 5
12 falim 1409 . . . . 5
1311, 12ja 161 . . . 4
1413pm2.43i 47 . . 3
1510, 14impbii 188 . 2
161, 9, 153bitri 271 1
 Colors of variables: wff setvar class Syntax hints:  -.wn 3  ->wi 4  <->wb 184   wfal 1400 This theorem is referenced by:  tbw-negdf  1532 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8 This theorem depends on definitions:  df-bi 185  df-tru 1398  df-fal 1401
 Copyright terms: Public domain W3C validator