| Intuitionistic Logic Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > ILE Home > Th. List > oridm | Unicode version | ||
| 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.) | 
| Ref | Expression | 
|---|---|
| oridm | 
 | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | pm1.2 757 | 
. 2
 | |
| 2 | pm2.07 738 | 
. 2
 | |
| 3 | 1, 2 | impbii 126 | 
1
 | 
| Colors of variables: wff set class | 
| Syntax hints:     | 
| 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 710 | 
| This theorem depends on definitions: df-bi 117 | 
| This theorem is referenced by: pm4.25 759 orordi 774 orordir 775 truortru 1416 falorfal 1419 truxortru 1430 falxorfal 1433 unidm 3306 preqsn 3805 reapirr 8604 reapti 8606 lt2msq 8913 nn0ge2m1nn 9309 absext 11228 prmdvdsexp 12316 sqpweven 12343 2sqpwodd 12344 | 
| Copyright terms: Public domain | W3C validator |