| 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 1554 | . 2 ⊢ ¬ ⊥ | |
| 3 | 1, 2 | 2false 375 | 1 ⊢ (𝜑 ↔ ⊥) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 206 ⊥wfal 1552 |
| 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 df-tru 1543 df-fal 1553 |
| This theorem is referenced by: falantru 1575 dfnul4 4310 dfnul2 4311 abf 4381 ralnralall 4490 tgcgr4 28510 frgrregord013 30376 nrmo 36428 bj-ntrufal 36587 bicontr 38104 aibnbaif 46936 aifftbifffaibif 46950 atnaiana 46952 |
| Copyright terms: Public domain | W3C validator |