Theorem had0 1610

Description: If the first input is false, then the adder sum is equivalent to the exclusive disjunction of the other two inputs. (Contributed by Mario Carneiro, 4-Sep-2016.) (Proof shortened by Wolf Lammen, 12-Jul-2020.)

Assertion

Ref	Expression
had0	⊢ (¬ 𝜑 → (hadd(𝜑, 𝜓, 𝜒) ↔ (𝜓 ⊻ 𝜒)))

Proof of Theorem had0

Step	Hyp	Ref	Expression
1		had1 1609	. . 3 ⊢ (¬ 𝜑 → (hadd(¬ 𝜑, ¬ 𝜓, ¬ 𝜒) ↔ (¬ 𝜓 ↔ ¬ 𝜒)))
2		hadnot 1608	. . 3 ⊢ (¬ hadd(𝜑, 𝜓, 𝜒) ↔ hadd(¬ 𝜑, ¬ 𝜓, ¬ 𝜒))
3		xnor 1508	. . . 4 ⊢ ((𝜓 ↔ 𝜒) ↔ ¬ (𝜓 ⊻ 𝜒))
4		notbi 322	. . . 4 ⊢ ((𝜓 ↔ 𝜒) ↔ (¬ 𝜓 ↔ ¬ 𝜒))
5	3, 4	bitr3i 280	. . 3 ⊢ (¬ (𝜓 ⊻ 𝜒) ↔ (¬ 𝜓 ↔ ¬ 𝜒))
6	1, 2, 5	3bitr4g 317	. 2 ⊢ (¬ 𝜑 → (¬ hadd(𝜑, 𝜓, 𝜒) ↔ ¬ (𝜓 ⊻ 𝜒)))
7	6	con4bid 320	1 ⊢ (¬ 𝜑 → (hadd(𝜑, 𝜓, 𝜒) ↔ (𝜓 ⊻ 𝜒)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ⊻ wxo 1506  haddwhad 1598

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 210  df-xor 1507  df-had 1599

This theorem is referenced by:  hadifp  1611  sadadd2lem2  15893  saddisjlem  15907