Theorem had1 1611

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

Assertion

Ref	Expression
had1	⊢ (𝜑 → (hadd(𝜑, 𝜓, 𝜒) ↔ (𝜓 ↔ 𝜒)))

Proof of Theorem had1

Step	Hyp	Ref	Expression
1		hadrot 1609	. . . 4 ⊢ (hadd(𝜑, 𝜓, 𝜒) ↔ hadd(𝜓, 𝜒, 𝜑))
2		hadbi 1606	. . . 4 ⊢ (hadd(𝜓, 𝜒, 𝜑) ↔ ((𝜓 ↔ 𝜒) ↔ 𝜑))
3	1, 2	bitri 277	. . 3 ⊢ (hadd(𝜑, 𝜓, 𝜒) ↔ ((𝜓 ↔ 𝜒) ↔ 𝜑))
4		biass 386	. . 3 ⊢ (((hadd(𝜑, 𝜓, 𝜒) ↔ (𝜓 ↔ 𝜒)) ↔ 𝜑) ↔ (hadd(𝜑, 𝜓, 𝜒) ↔ ((𝜓 ↔ 𝜒) ↔ 𝜑)))
5	3, 4	mpbir 233	. 2 ⊢ ((hadd(𝜑, 𝜓, 𝜒) ↔ (𝜓 ↔ 𝜒)) ↔ 𝜑)
6	5	biimpri 230	1 ⊢ (𝜑 → (hadd(𝜑, 𝜓, 𝜒) ↔ (𝜓 ↔ 𝜒)))

Syntax hints:   → wi 4   ↔ wb 208  haddwhad 1601

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 209  df-xor 1520  df-had 1602

This theorem is referenced by:  had0  1612  hadifp  1613  sadadd2lem2  16414