| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > bifal | Structured version Visualization version GIF version | ||
| Description: A contradiction is equivalent to falsehood. (Contributed by Mario Carneiro, 9-May-2015.) |
| Ref | Expression |
|---|---|
| bifal.1 | ⊢ ¬ 𝜑 |
| Ref | Expression |
|---|---|
| bifal | ⊢ (𝜑 ↔ ⊥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bifal.1 | . 2 ⊢ ¬ 𝜑 | |
| 2 | fal 1584 | . 2 ⊢ ¬ ⊥ | |
| 3 | 1, 2 | 2false 378 | 1 ⊢ (𝜑 ↔ ⊥) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ⊥wfal 1582 |
| 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 df-tru 1573 df-fal 1583 |
| This theorem is used by: falantru 1605 dfnul4 4283 dfnul2 4284 abf 4367 ralnralall 4472 tgcgr4 29051 frgrregord013 31053 nrmo 37413 bj-ntrufal 37654 bicontr 39280 aibnbaif 48250 aifftbifffaibif 48264 atnaiana 48266 |
| Copyright terms: Public domain | W3C validator |