Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dfnot | Structured version Visualization version Unicode version |
Description: Given falsum , we can define the negation of a wff as the statement that follows from assuming . (Contributed by Mario Carneiro, 9-Feb-2017.) (Proof shortened by Wolf Lammen, 21-Jul-2019.) |
Ref | Expression |
---|---|
dfnot |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fal 1490 | . 2 | |
2 | mtt 354 | . 2 | |
3 | 1, 2 | ax-mp 5 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wi 4 wb 196 wfal 1488 |
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 197 df-tru 1486 df-fal 1489 |
This theorem is referenced by: inegd 1503 bj-godellob 32590 |
Copyright terms: Public domain | W3C validator |