| 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 764 |
. 2
| |
| 2 | pm2.07 745 |
. 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 717 |
| This theorem depends on definitions: df-bi 117 |
| This theorem is referenced by: pm4.25 766 orordi 781 orordir 782 truortru 1450 falorfal 1453 truxortru 1464 falxorfal 1467 unidm 3352 preqsn 3863 funopsn 5838 reapirr 8816 reapti 8818 lt2msq 9125 nn0ge2m1nn 9523 absext 11703 prmdvdsexp 12800 sqpweven 12827 2sqpwodd 12828 |
| Copyright terms: Public domain | W3C validator |