| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ornld | Structured version Visualization version GIF version | ||
| Description: Selecting one statement from a disjunction if one of the disjuncted statements is false. (Contributed by AV, 6-Sep-2018.) (Proof shortened by AV, 13-Oct-2018.) (Proof shortened by Wolf Lammen, 19-Jan-2020.) |
| Ref | Expression |
|---|---|
| ornld | ⊢ (𝜑 → (((𝜑 → (𝜃 ∨ 𝜏)) ∧ ¬ 𝜃) → 𝜏)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm3.35 803 | . . 3 ⊢ ((𝜑 ∧ (𝜑 → (𝜃 ∨ 𝜏))) → (𝜃 ∨ 𝜏)) | |
| 2 | 1 | ord 865 | . 2 ⊢ ((𝜑 ∧ (𝜑 → (𝜃 ∨ 𝜏))) → (¬ 𝜃 → 𝜏)) |
| 3 | 2 | expimpd 453 | 1 ⊢ (𝜑 → (((𝜑 → (𝜃 ∨ 𝜏)) ∧ ¬ 𝜃) → 𝜏)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 848 |
| 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-an 396 df-or 849 |
| This theorem is referenced by: friendshipgt3 30417 ralralimp 47290 |
| Copyright terms: Public domain | W3C validator |