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

Theorem tbw-bijust 1473
 Description: Justification for tbw-negdf 1474. (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 186 . 2
2 pm2.21 103 . . . . 5
32imim2i 14 . . . 4
4 id 21 . . . . . 6
5 falim 1338 . . . . . 6
64, 5ja 156 . . . . 5
76imim2i 14 . . . 4
83, 7impbii 182 . . 3
98notbii 289 . 2
10 pm2.21 103 . . 3
11 ax-1 6 . . . . 5
12 falim 1338 . . . . 5
1311, 12ja 156 . . . 4
1413pm2.43i 46 . . 3
1510, 14impbii 182 . 2
161, 9, 153bitri 264 1
 Colors of variables: wff set class Syntax hints:   wn 3   wi 4   wb 178   wfal 1327 This theorem is referenced by:  tbw-negdf  1474 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 179  df-tru 1329  df-fal 1330
 Copyright terms: Public domain W3C validator