MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nbior Structured version   Visualization version   Unicode version

Theorem nbior 905
Description: If two propositions are not equivalent, then at least one is true. (Contributed by BJ, 19-Apr-2019.) (Proof shortened by Wolf Lammen, 19-Jan-2020.)
Assertion
Ref Expression
nbior  |-  ( -.  ( ph  <->  ps )  ->  ( ph  \/  ps ) )

Proof of Theorem nbior
StepHypRef Expression
1 norbi 904 . 2  |-  ( -.  ( ph  \/  ps )  ->  ( ph  <->  ps )
)
21con1i 144 1  |-  ( -.  ( ph  <->  ps )  ->  ( ph  \/  ps ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 196    \/ wo 383
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 197  df-or 385
This theorem is referenced by:  nmogtmnf  27625  nmopgtmnf  28727
  Copyright terms: Public domain W3C validator