Theorem cadtru 1653

Description: The adder carry is true as soon as its first two inputs are the truth constant. (Contributed by Mario Carneiro, 4-Sep-2016.)

Assertion

Ref	Expression
cadtru	⊢ cadd(⊤, ⊤, 𝜑)

Proof of Theorem cadtru

Step	Hyp	Ref	Expression
1		tru 1574	. 2 ⊢ ⊤
2		cad11 1649	. 2 ⊢ ((⊤ ∧ ⊤) → cadd(⊤, ⊤, 𝜑))
3	1, 1, 2	mp2an 705	1 ⊢ cadd(⊤, ⊤, 𝜑)

This proof depends on syntax axioms:  ⊤wtru 1571  caddwcad 1639

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-cad 1640

This theorem is used by: (None)