ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  oridm Unicode version

Theorem oridm 762
Description: Idempotent law for disjunction. Theorem *4.25 of [WhiteheadRussell] p. 117. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 16-Apr-2011.) (Proof shortened by Wolf Lammen, 10-Mar-2013.)
Assertion
Ref Expression
oridm  |-  ( (
ph  \/  ph )  <->  ph )

Proof of Theorem oridm
StepHypRef Expression
1 pm1.2 761 . 2  |-  ( (
ph  \/  ph )  ->  ph )
2 pm2.07 742 . 2  |-  ( ph  ->  ( ph  \/  ph ) )
31, 2impbii 126 1  |-  ( (
ph  \/  ph )  <->  ph )
Colors of variables: wff set class
Syntax hints:    <-> wb 105    \/ wo 713
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714
This theorem depends on definitions:  df-bi 117
This theorem is referenced by:  pm4.25  763  orordi  778  orordir  779  truortru  1447  falorfal  1450  truxortru  1461  falxorfal  1464  unidm  3347  preqsn  3853  funopsn  5817  reapirr  8724  reapti  8726  lt2msq  9033  nn0ge2m1nn  9429  absext  11574  prmdvdsexp  12670  sqpweven  12697  2sqpwodd  12698
  Copyright terms: Public domain W3C validator