NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  rb-bijust Unicode version

Theorem rb-bijust 1514
Description: Justification for rb-imdf 1515. (Contributed by Anthony Hart, 17-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
rb-bijust

Proof of Theorem rb-bijust
StepHypRef Expression
1 dfbi1 184 . 2
2 imor 401 . . . 4
3 imor 401 . . . . 5
43notbii 287 . . . 4
52, 4imbi12i 316 . . 3
65notbii 287 . 2
7 pm4.62 408 . . 3
87notbii 287 . 2
91, 6, 83bitri 262 1
Colors of variables: wff setvar class
Syntax hints:   wn 3   wi 4   wb 176   wo 357
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 177  df-or 359
This theorem is referenced by:  rb-imdf  1515
  Copyright terms: Public domain W3C validator