| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > oridm | Structured version Visualization version GIF version | ||
| Description: Idempotent law for disjunction. Theorem *4.25 of [WhiteheadRussell] p. 117. (Contributed by NM, 11-May-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 903 | . 2 ⊢ ((𝜑 ∨ 𝜑) → 𝜑) | |
| 2 | pm2.07 902 | . 2 ⊢ (𝜑 → (𝜑 ∨ 𝜑)) | |
| 3 | 1, 2 | impbii 209 | 1 ⊢ ((𝜑 ∨ 𝜑) ↔ 𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∨ wo 847 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
| This theorem depends on definitions: df-bi 207 df-or 848 |
| This theorem is referenced by: pm4.25 905 orordi 928 orordir 929 nornot 1532 truortru 1578 falorfal 1581 unidm 4109 dfsn2ALT 4602 preqsnd 4815 tz7.48lem 8372 msq0i 11786 msq0d 11787 prmdvdsexp 16642 metn0 24304 rrxcph 25348 nb3grprlem2 29454 pm11.7 44637 euoreqb 47355 |
| Copyright terms: Public domain | W3C validator |