Theorem wl-3xornot1 38154

Description: Flipping the first input flips the triple xor. wl-3xorrot 38151 can rotate any input to the front, so flipping any one of them does the same. (Contributed by Wolf Lammen, 1-May-2024.)

Assertion

Ref	Expression
wl-3xornot1	⊢ (¬ hadd(𝜑, 𝜓, 𝜒) ↔ hadd(¬ 𝜑, 𝜓, 𝜒))

Proof of Theorem wl-3xornot1

Step	Hyp	Ref	Expression
1		wl-3xorbi 38147	. 2 ⊢ (hadd(¬ 𝜑, 𝜓, 𝜒) ↔ (¬ 𝜑 ↔ (𝜓 ↔ 𝜒)))
2		nbbn 386	. . 3 ⊢ ((¬ 𝜑 ↔ (𝜓 ↔ 𝜒)) ↔ ¬ (𝜑 ↔ (𝜓 ↔ 𝜒)))
3		wl-3xorbi 38147	. . 3 ⊢ (hadd(𝜑, 𝜓, 𝜒) ↔ (𝜑 ↔ (𝜓 ↔ 𝜒)))
4	2, 3	xchbinxr 338	. 2 ⊢ ((¬ 𝜑 ↔ (𝜓 ↔ 𝜒)) ↔ ¬ hadd(𝜑, 𝜓, 𝜒))
5	1, 4	bitr2i 279	1 ⊢ (¬ hadd(𝜑, 𝜓, 𝜒) ↔ hadd(¬ 𝜑, 𝜓, 𝜒))

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209  haddwhad 1622

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 401  df-or 861  df-ifp 1078  df-xor 1541  df-tru 1572  df-had 1623

This theorem is used by: (None)