Theorem wl-3xorfal 38213

Description: If the first input is false, then triple xor is equivalent to the exclusive disjunction of the other two inputs. (Contributed by Mario Carneiro, 4-Sep-2016.) df-had redefined. (Revised by Wolf Lammen, 29-Apr-2024.)

Assertion

Ref	Expression
wl-3xorfal	⊢ (¬ 𝜑 → (hadd(𝜑, 𝜓, 𝜒) ↔ (𝜓 ⊻ 𝜒)))

Proof of Theorem wl-3xorfal

Step	Hyp	Ref	Expression
1		wl-df-3xor 38209	. 2 ⊢ (hadd(𝜑, 𝜓, 𝜒) ↔ if-(𝜑, ¬ (𝜓 ⊻ 𝜒), (𝜓 ⊻ 𝜒)))
2		ifpfal 1092	. 2 ⊢ (¬ 𝜑 → (if-(𝜑, ¬ (𝜓 ⊻ 𝜒), (𝜓 ⊻ 𝜒)) ↔ (𝜓 ⊻ 𝜒)))
3	1, 2	bitrid 286	1 ⊢ (¬ 𝜑 → (hadd(𝜑, 𝜓, 𝜒) ↔ (𝜓 ⊻ 𝜒)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209  if-wif 1078   ⊻ wxo 1541  haddwhad 1623

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-xor 1542  df-tru 1573  df-had 1624

This theorem is used by: (None)