Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > jaoi2 | Structured version Visualization version GIF version |
Description: Inference removing a negated conjunct in a disjunction of an antecedent if this conjunct is part of the disjunction. (Contributed by Alexander van der Vekens, 3-Nov-2017.) (Proof shortened by Wolf Lammen, 21-Sep-2018.) |
Ref | Expression |
---|---|
jaoi2.1 | ⊢ ((𝜑 ∨ (¬ 𝜑 ∧ 𝜒)) → 𝜓) |
Ref | Expression |
---|---|
jaoi2 | ⊢ ((𝜑 ∨ 𝜒) → 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pm5.63 1016 | . 2 ⊢ ((𝜑 ∨ 𝜒) ↔ (𝜑 ∨ (¬ 𝜑 ∧ 𝜒))) | |
2 | jaoi2.1 | . 2 ⊢ ((𝜑 ∨ (¬ 𝜑 ∧ 𝜒)) → 𝜓) | |
3 | 1, 2 | sylbi 216 | 1 ⊢ ((𝜑 ∨ 𝜒) → 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 843 |
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 206 df-an 396 df-or 844 |
This theorem is referenced by: jaoi3 1057 |
Copyright terms: Public domain | W3C validator |