![]() |
Mathbox for Jarvin Udandy |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > conimpfalt | Structured version Visualization version Unicode version |
Description: Assuming a, not b, and a implies b, there exists a proof that a is false.) (Contributed by Jarvin Udandy, 29-Aug-2016.) |
Ref | Expression |
---|---|
conimpfalt.1 |
![]() ![]() |
conimpfalt.2 |
![]() ![]() ![]() |
conimpfalt.3 |
![]() ![]() ![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
conimpfalt |
![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | conimpfalt.3 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() | |
2 | conimpfalt.2 |
. 2
![]() ![]() ![]() | |
3 | 1, 2 | aibnbaif 41074 |
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 197 df-tru 1486 df-fal 1489 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |