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

Theorem ex-or 20808
Description: Example for df-or 359. Example by David A. Wheeler. (Contributed by Mario Carneiro, 9-May-2015.)
Assertion
Ref Expression
ex-or  |-  ( 2  =  3  \/  4  =  4 )

Proof of Theorem ex-or
StepHypRef Expression
1 eqid 2283 . 2  |-  4  =  4
21olci 380 1  |-  ( 2  =  3  \/  4  =  4 )
Colors of variables: wff set class
Syntax hints:    \/ wo 357    = wceq 1623   2c2 9795   3c3 9796   4c4 9797
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-cleq 2276
  Copyright terms: Public domain W3C validator