Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cadtru | Structured version Visualization version Unicode version |
Description: The adder carry is true as soon as its first two inputs are the truth constant. (Contributed by Mario Carneiro, 4-Sep-2016.) |
Ref | Expression |
---|---|
cadtru | cadd |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tru 1487 | . 2 | |
2 | cad11 1558 | . 2 cadd | |
3 | 1, 1, 2 | mp2an 708 | 1 cadd |
Colors of variables: wff setvar class |
Syntax hints: wtru 1484 caddwcad 1545 |
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-or 385 df-an 386 df-tru 1486 df-cad 1546 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |