| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 3oran | Structured version Visualization version GIF version | ||
| Description: Triple disjunction in terms of triple conjunction. (Contributed by NM, 8-Oct-2012.) |
| Ref | Expression |
|---|---|
| 3oran | ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ ¬ (¬ 𝜑 ∧ ¬ 𝜓 ∧ ¬ 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3ioran 1119 | . . 3 ⊢ (¬ (𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (¬ 𝜑 ∧ ¬ 𝜓 ∧ ¬ 𝜒)) | |
| 2 | 1 | con1bii 358 | . 2 ⊢ (¬ (¬ 𝜑 ∧ ¬ 𝜓 ∧ ¬ 𝜒) ↔ (𝜑 ∨ 𝜓 ∨ 𝜒)) |
| 3 | 2 | bicomi 226 | 1 ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ ¬ (¬ 𝜑 ∧ ¬ 𝜓 ∧ ¬ 𝜒)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 208 ∨ w3o 1098 ∧ w3a 1099 |
| 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 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 |
| This theorem is referenced by: nolt02o 27760 nogt01o 27761 nosupbnd1lem6 27778 noinfbnd1lem6 27793 dalawlem10 40505 |
| Copyright terms: Public domain | W3C validator |