| 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 758 |
. 2
| |
| 2 | pm2.07 739 |
. 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 711 |
| This theorem depends on definitions: df-bi 117 |
| This theorem is referenced by: pm4.25 760 orordi 775 orordir 776 truortru 1425 falorfal 1428 truxortru 1439 falxorfal 1442 unidm 3324 preqsn 3829 funopsn 5785 reapirr 8685 reapti 8687 lt2msq 8994 nn0ge2m1nn 9390 absext 11489 prmdvdsexp 12585 sqpweven 12612 2sqpwodd 12613 |
| Copyright terms: Public domain | W3C validator |