Theorem wl-df3-3mintru2 38377

Description: The adder carry in conjunctive normal form. An alternative highly symmetric definition emphasizing the independence of order of the inputs 𝜑, 𝜓 and 𝜒. Copy of cadan 1642. (Contributed by Mario Carneiro, 4-Sep-2016.) df-cad redefined. (Revised by Wolf Lammen, 18-Jun-2024.)

Assertion

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

Proof of Theorem wl-df3-3mintru2

Step	Hyp	Ref	Expression
1		ordi 1023	. . 3 ⊢ ((𝜑 ∨ (𝜓 ∧ 𝜒)) ↔ ((𝜑 ∨ 𝜓) ∧ (𝜑 ∨ 𝜒)))
2	1	anbi1i 636	. 2 ⊢ (((𝜑 ∨ (𝜓 ∧ 𝜒)) ∧ (𝜓 ∨ 𝜒)) ↔ (((𝜑 ∨ 𝜓) ∧ (𝜑 ∨ 𝜒)) ∧ (𝜓 ∨ 𝜒)))
3		wl-df-3mintru2 38375	. . 3 ⊢ (cadd(𝜑, 𝜓, 𝜒) ↔ if-(𝜑, (𝜓 ∨ 𝜒), (𝜓 ∧ 𝜒)))
4		animorl 993	. . . 4 ⊢ ((𝜓 ∧ 𝜒) → (𝜓 ∨ 𝜒))
5		wl-ifp4impr 38358	. . . 4 ⊢ (((𝜓 ∧ 𝜒) → (𝜓 ∨ 𝜒)) → (if-(𝜑, (𝜓 ∨ 𝜒), (𝜓 ∧ 𝜒)) ↔ ((𝜑 ∨ (𝜓 ∧ 𝜒)) ∧ (𝜓 ∨ 𝜒))))
6	4, 5	ax-mp 5	. . 3 ⊢ (if-(𝜑, (𝜓 ∨ 𝜒), (𝜓 ∧ 𝜒)) ↔ ((𝜑 ∨ (𝜓 ∧ 𝜒)) ∧ (𝜓 ∨ 𝜒)))
7	3, 6	bitri 278	. 2 ⊢ (cadd(𝜑, 𝜓, 𝜒) ↔ ((𝜑 ∨ (𝜓 ∧ 𝜒)) ∧ (𝜓 ∨ 𝜒)))
8		df-3an 1105	. 2 ⊢ (((𝜑 ∨ 𝜓) ∧ (𝜑 ∨ 𝜒) ∧ (𝜓 ∨ 𝜒)) ↔ (((𝜑 ∨ 𝜓) ∧ (𝜑 ∨ 𝜒)) ∧ (𝜓 ∨ 𝜒)))
9	2, 7, 8	3bitr4i 306	1 ⊢ (cadd(𝜑, 𝜓, 𝜒) ↔ ((𝜑 ∨ 𝜓) ∧ (𝜑 ∨ 𝜒) ∧ (𝜓 ∨ 𝜒)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861  if-wif 1078   ∧ w3a 1103  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-ifp 1079  df-3or 1104  df-3an 1105  df-xor 1542  df-cad 1640

This theorem is used by: (None)