Theorem wl-df4-3mintru2 35169

Description: An alternative definition of the adder carry. Copy of df-cad 1610. (Contributed by Mario Carneiro, 4-Sep-2016.) df-cad redefined. (Revised by Wolf Lammen, 19-Jun-2024.)

Assertion

Ref	Expression
wl-df4-3mintru2	⊢ (cadd(𝜑, 𝜓, 𝜒) ↔ ((𝜑 ∧ 𝜓) ∨ (𝜒 ∧ (𝜑 ⊻ 𝜓))))

Proof of Theorem wl-df4-3mintru2

Step	Hyp	Ref	Expression
1		3orass 1088	. 2 ⊢ (((𝜑 ∧ 𝜓) ∨ (𝜑 ∧ 𝜒) ∨ (𝜓 ∧ 𝜒)) ↔ ((𝜑 ∧ 𝜓) ∨ ((𝜑 ∧ 𝜒) ∨ (𝜓 ∧ 𝜒))))
2		wl-df2-3mintru2 35167	. 2 ⊢ (cadd(𝜑, 𝜓, 𝜒) ↔ ((𝜑 ∧ 𝜓) ∨ (𝜑 ∧ 𝜒) ∨ (𝜓 ∧ 𝜒)))
3		xor2 1510	. . . . . . 7 ⊢ ((𝜑 ⊻ 𝜓) ↔ ((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓)))
4	3	biancomi 467	. . . . . 6 ⊢ ((𝜑 ⊻ 𝜓) ↔ (¬ (𝜑 ∧ 𝜓) ∧ (𝜑 ∨ 𝜓)))
5	4	anbi1ci 629	. . . . 5 ⊢ ((𝜒 ∧ (𝜑 ⊻ 𝜓)) ↔ ((¬ (𝜑 ∧ 𝜓) ∧ (𝜑 ∨ 𝜓)) ∧ 𝜒))
6		anass 473	. . . . 5 ⊢ (((¬ (𝜑 ∧ 𝜓) ∧ (𝜑 ∨ 𝜓)) ∧ 𝜒) ↔ (¬ (𝜑 ∧ 𝜓) ∧ ((𝜑 ∨ 𝜓) ∧ 𝜒)))
7	5, 6	bitri 278	. . . 4 ⊢ ((𝜒 ∧ (𝜑 ⊻ 𝜓)) ↔ (¬ (𝜑 ∧ 𝜓) ∧ ((𝜑 ∨ 𝜓) ∧ 𝜒)))
8	7	orbi2i 911	. . 3 ⊢ (((𝜑 ∧ 𝜓) ∨ (𝜒 ∧ (𝜑 ⊻ 𝜓))) ↔ ((𝜑 ∧ 𝜓) ∨ (¬ (𝜑 ∧ 𝜓) ∧ ((𝜑 ∨ 𝜓) ∧ 𝜒))))
9		pm5.63 1018	. . 3 ⊢ (((𝜑 ∧ 𝜓) ∨ ((𝜑 ∨ 𝜓) ∧ 𝜒)) ↔ ((𝜑 ∧ 𝜓) ∨ (¬ (𝜑 ∧ 𝜓) ∧ ((𝜑 ∨ 𝜓) ∧ 𝜒))))
10		andir 1007	. . . 4 ⊢ (((𝜑 ∨ 𝜓) ∧ 𝜒) ↔ ((𝜑 ∧ 𝜒) ∨ (𝜓 ∧ 𝜒)))
11	10	orbi2i 911	. . 3 ⊢ (((𝜑 ∧ 𝜓) ∨ ((𝜑 ∨ 𝜓) ∧ 𝜒)) ↔ ((𝜑 ∧ 𝜓) ∨ ((𝜑 ∧ 𝜒) ∨ (𝜓 ∧ 𝜒))))
12	8, 9, 11	3bitr2i 303	. 2 ⊢ (((𝜑 ∧ 𝜓) ∨ (𝜒 ∧ (𝜑 ⊻ 𝜓))) ↔ ((𝜑 ∧ 𝜓) ∨ ((𝜑 ∧ 𝜒) ∨ (𝜓 ∧ 𝜒))))
13	1, 2, 12	3bitr4i 307	1 ⊢ (cadd(𝜑, 𝜓, 𝜒) ↔ ((𝜑 ∧ 𝜓) ∨ (𝜒 ∧ (𝜑 ⊻ 𝜓))))

Syntax hints:  ¬ wn 3   ↔ wb 209   ∧ wa 400   ∨ wo 845   ∨ w3o 1084   ⊻ wxo 1503  caddwcad 1609

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-an 401  df-or 846  df-ifp 1060  df-3or 1086  df-3an 1087  df-xor 1504  df-cad 1610

This theorem is referenced by: (None)