Theorem xorcom 1437

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 740	. . 3 ⊢ ((𝜑 ∨ 𝜓) ↔ (𝜓 ∨ 𝜑))
2		ancom 266	. . . 4 ⊢ ((𝜑 ∧ 𝜓) ↔ (𝜓 ∧ 𝜑))
3	2	notbii 678	. . 3 ⊢ (¬ (𝜑 ∧ 𝜓) ↔ ¬ (𝜓 ∧ 𝜑))
4	1, 3	anbi12i 464	. 2 ⊢ (((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓)) ↔ ((𝜓 ∨ 𝜑) ∧ ¬ (𝜓 ∧ 𝜑)))
5		df-xor 1425	. 2 ⊢ ((𝜑 ⊻ 𝜓) ↔ ((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓)))
6		df-xor 1425	. 2 ⊢ ((𝜓 ⊻ 𝜑) ↔ ((𝜓 ∨ 𝜑) ∧ ¬ (𝜓 ∧ 𝜑)))
7	4, 5, 6	3bitr4i 212	1 ⊢ ((𝜑 ⊻ 𝜓) ↔ (𝜓 ⊻ 𝜑))

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 104   ↔ wb 105   ∨ wo 720   ⊻ wxo 1424

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721

This proof depends on definitions:  df-bi 117  df-xor 1425

This theorem is used by:  rpnegap  10098