Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nbior | Structured version Visualization version GIF version |
Description: If two propositions are not equivalent, then at least one is true. (Contributed by BJ, 19-Apr-2019.) (Proof shortened by Wolf Lammen, 19-Jan-2020.) |
Ref | Expression |
---|---|
nbior | ⊢ (¬ (𝜑 ↔ 𝜓) → (𝜑 ∨ 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | norbi 883 | . 2 ⊢ (¬ (𝜑 ∨ 𝜓) → (𝜑 ↔ 𝜓)) | |
2 | 1 | con1i 147 | 1 ⊢ (¬ (𝜑 ↔ 𝜓) → (𝜑 ∨ 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∨ 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-or 844 |
This theorem is referenced by: nmogtmnf 29033 nmopgtmnf 30131 |
Copyright terms: Public domain | W3C validator |