Theorem wl-df3xor2 35334

Description: Alternative definition of wl-df-3xor 35333, using triple exclusive disjunction, or XOR3. You can add more input by appending each one with a ⊻. Copy of hadass 1603. (Contributed by Mario Carneiro, 4-Sep-2016.) df-had redefined. (Revised by Wolf Lammen, 1-May-2024.)

Assertion

Ref	Expression
wl-df3xor2	⊢ (hadd(𝜑, 𝜓, 𝜒) ↔ (𝜑 ⊻ (𝜓 ⊻ 𝜒)))

Proof of Theorem wl-df3xor2

Step	Hyp	Ref	Expression
1		ifpn 1074	. 2 ⊢ (if-(𝜑, ¬ (𝜓 ⊻ 𝜒), (𝜓 ⊻ 𝜒)) ↔ if-(¬ 𝜑, (𝜓 ⊻ 𝜒), ¬ (𝜓 ⊻ 𝜒)))
2		wl-df-3xor 35333	. 2 ⊢ (hadd(𝜑, 𝜓, 𝜒) ↔ if-(𝜑, ¬ (𝜓 ⊻ 𝜒), (𝜓 ⊻ 𝜒)))
3		df-xor 1508	. . 3 ⊢ ((𝜑 ⊻ (𝜓 ⊻ 𝜒)) ↔ ¬ (𝜑 ↔ (𝜓 ⊻ 𝜒)))
4		nbbn 388	. . 3 ⊢ ((¬ 𝜑 ↔ (𝜓 ⊻ 𝜒)) ↔ ¬ (𝜑 ↔ (𝜓 ⊻ 𝜒)))
5		ifpdfbi 1071	. . 3 ⊢ ((¬ 𝜑 ↔ (𝜓 ⊻ 𝜒)) ↔ if-(¬ 𝜑, (𝜓 ⊻ 𝜒), ¬ (𝜓 ⊻ 𝜒)))
6	3, 4, 5	3bitr2i 302	. 2 ⊢ ((𝜑 ⊻ (𝜓 ⊻ 𝜒)) ↔ if-(¬ 𝜑, (𝜓 ⊻ 𝜒), ¬ (𝜓 ⊻ 𝜒)))
7	1, 2, 6	3bitr4i 306	1 ⊢ (hadd(𝜑, 𝜓, 𝜒) ↔ (𝜑 ⊻ (𝜓 ⊻ 𝜒)))

Syntax hints:  ¬ wn 3   ↔ wb 209  if-wif 1063   ⊻ wxo 1507  haddwhad 1599

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 400  df-or 848  df-ifp 1064  df-xor 1508  df-tru 1546  df-had 1600

This theorem is referenced by:  wl-df3xor3  35335  wl-3xorbi  35338