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

Theorem tbw-bijust 1453
 Description: Justification for tbw-negdf 1454. (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 184 . 2
2 pm2.21 100 . . . . 5
32imim2i 13 . . . 4
4 id 19 . . . . . 6
5 falim 1319 . . . . . 6
64, 5ja 153 . . . . 5
76imim2i 13 . . . 4
83, 7impbii 180 . . 3
98notbii 287 . 2
10 pm2.21 100 . . 3
11 ax-1 5 . . . . 5
12 falim 1319 . . . . 5
1311, 12ja 153 . . . 4
1413pm2.43i 43 . . 3
1510, 14impbii 180 . 2
161, 9, 153bitri 262 1
 Colors of variables: wff set class Syntax hints:   wn 3   wi 4   wb 176   wfal 1308 This theorem is referenced by:  tbw-negdf  1454 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8 This theorem depends on definitions:  df-bi 177  df-tru 1310  df-fal 1311
 Copyright terms: Public domain W3C validator