![]() |
New Foundations Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > NFE Home > Th. List > bianfi | Unicode version |
Description: A wff conjoined with falsehood is false. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 26-Nov-2012.) |
Ref | Expression |
---|---|
bianfi.1 |
![]() ![]() ![]() |
Ref | Expression |
---|---|
bianfi |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bianfi.1 |
. 2
![]() ![]() ![]() | |
2 | 1 | intnan 880 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
3 | 1, 2 | 2false 339 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff setvar class |
Syntax hints: ![]() ![]() ![]() |
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 177 df-an 360 |
This theorem is referenced by: in0 3577 |
Copyright terms: Public domain | W3C validator |