Theorem xorcom 1366

Description: ⊻ is commutative. (Contributed by David A. Wheeler, 6-Oct-2018.)

Assertion

Ref	Expression
xorcom	⊢ ((𝜑 ⊻ 𝜓) ↔ (𝜓 ⊻ 𝜑))

Proof of Theorem xorcom

Step	Hyp	Ref	Expression
1		orcom 717	. . 3 ⊢ ((𝜑 ∨ 𝜓) ↔ (𝜓 ∨ 𝜑))
2		ancom 264	. . . 4 ⊢ ((𝜑 ∧ 𝜓) ↔ (𝜓 ∧ 𝜑))
3	2	notbii 657	. . 3 ⊢ (¬ (𝜑 ∧ 𝜓) ↔ ¬ (𝜓 ∧ 𝜑))
4	1, 3	anbi12i 455	. 2 ⊢ (((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓)) ↔ ((𝜓 ∨ 𝜑) ∧ ¬ (𝜓 ∧ 𝜑)))
5		df-xor 1354	. 2 ⊢ ((𝜑 ⊻ 𝜓) ↔ ((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓)))
6		df-xor 1354	. 2 ⊢ ((𝜓 ⊻ 𝜑) ↔ ((𝜓 ∨ 𝜑) ∧ ¬ (𝜓 ∧ 𝜑)))
7	4, 5, 6	3bitr4i 211	1 ⊢ ((𝜑 ⊻ 𝜓) ↔ (𝜓 ⊻ 𝜑))

Syntax hints:  ¬ wn 3   ∧ wa 103   ↔ wb 104   ∨ wo 697   ⊻ wxo 1353

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698

This theorem depends on definitions:  df-bi 116  df-xor 1354

This theorem is referenced by:  rpnegap  9474