| 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 264 | . 2 ⊢ (¬ 𝜑 ↔ ¬ 𝜓) |
| 4 | 3 | con4bii 321 | 1 ⊢ (𝜑 ↔ 𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 206 |
| 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 |
| This theorem is referenced by: bianfi 533 bifal 1556 dfnul3 4312 co02 6249 0er 8757 00lss 20898 00ply1bas 22175 2lgslem4 27369 signswch 34593 pexmidlem8N 39996 dandysum2p2e4 47027 |
| Copyright terms: Public domain | W3C validator |