| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2false | Structured version Visualization version GIF version | ||
| Description: Two falsehoods are equivalent. (Contributed by NM, 4-Apr-2005.) (Proof shortened by Wolf Lammen, 19-May-2013.) |
| Ref | Expression |
|---|---|
| 2false.1 | ⊢ ¬ 𝜑 |
| 2false.2 | ⊢ ¬ 𝜓 |
| Ref | Expression |
|---|---|
| 2false | ⊢ (𝜑 ↔ 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2false.1 | . . 3 ⊢ ¬ 𝜑 | |
| 2 | 2false.2 | . . 3 ⊢ ¬ 𝜓 | |
| 3 | 1, 2 | 2th 267 | . 2 ⊢ (¬ 𝜑 ↔ ¬ 𝜓) |
| 4 | 3 | con4bii 324 | 1 ⊢ (𝜑 ↔ 𝜓) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
| This proof depends on definitions: df-bi 210 |
| This theorem is used by: bianfi 543 bifal 1586 dfnul3 4286 co02 6261 0er 8739 00lss 21131 00ply1bas 22470 2lgslem4 27650 signswch 35077 pexmidlem8N 40858 dandysum2p2e4 47894 |
| Copyright terms: Public domain | W3C validator |