Theorem xoranor 1367

Description: One way of defining exclusive or. Equivalent to df-xor 1366. (Contributed by Jim Kingdon and Mario Carneiro, 1-Mar-2018.)

Assertion

Ref	Expression
xoranor	⊢ ((𝜑 ⊻ 𝜓) ↔ ((𝜑 ∨ 𝜓) ∧ (¬ 𝜑 ∨ ¬ 𝜓)))

Proof of Theorem xoranor

Step	Hyp	Ref	Expression
1		df-xor 1366	. . 3 ⊢ ((𝜑 ⊻ 𝜓) ↔ ((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓)))
2		ax-ia3 107	. . . . . . 7 ⊢ (𝜑 → (𝜓 → (𝜑 ∧ 𝜓)))
3	2	con3d 621	. . . . . 6 ⊢ (𝜑 → (¬ (𝜑 ∧ 𝜓) → ¬ 𝜓))
4		olc 701	. . . . . 6 ⊢ (¬ 𝜓 → (¬ 𝜑 ∨ ¬ 𝜓))
5	3, 4	syl6 33	. . . . 5 ⊢ (𝜑 → (¬ (𝜑 ∧ 𝜓) → (¬ 𝜑 ∨ ¬ 𝜓)))
6		pm3.21 262	. . . . . . 7 ⊢ (𝜓 → (𝜑 → (𝜑 ∧ 𝜓)))
7	6	con3d 621	. . . . . 6 ⊢ (𝜓 → (¬ (𝜑 ∧ 𝜓) → ¬ 𝜑))
8		orc 702	. . . . . 6 ⊢ (¬ 𝜑 → (¬ 𝜑 ∨ ¬ 𝜓))
9	7, 8	syl6 33	. . . . 5 ⊢ (𝜓 → (¬ (𝜑 ∧ 𝜓) → (¬ 𝜑 ∨ ¬ 𝜓)))
10	5, 9	jaoi 706	. . . 4 ⊢ ((𝜑 ∨ 𝜓) → (¬ (𝜑 ∧ 𝜓) → (¬ 𝜑 ∨ ¬ 𝜓)))
11	10	imdistani 442	. . 3 ⊢ (((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓)) → ((𝜑 ∨ 𝜓) ∧ (¬ 𝜑 ∨ ¬ 𝜓)))
12	1, 11	sylbi 120	. 2 ⊢ ((𝜑 ⊻ 𝜓) → ((𝜑 ∨ 𝜓) ∧ (¬ 𝜑 ∨ ¬ 𝜓)))
13		pm3.14 743	. . . 4 ⊢ ((¬ 𝜑 ∨ ¬ 𝜓) → ¬ (𝜑 ∧ 𝜓))
14	13	anim2i 340	. . 3 ⊢ (((𝜑 ∨ 𝜓) ∧ (¬ 𝜑 ∨ ¬ 𝜓)) → ((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓)))
15	14, 1	sylibr 133	. 2 ⊢ (((𝜑 ∨ 𝜓) ∧ (¬ 𝜑 ∨ ¬ 𝜓)) → (𝜑 ⊻ 𝜓))
16	12, 15	impbii 125	1 ⊢ ((𝜑 ⊻ 𝜓) ↔ ((𝜑 ∨ 𝜓) ∧ (¬ 𝜑 ∨ ¬ 𝜓)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 698   ⊻ wxo 1365

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 604  ax-in2 605  ax-io 699

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

This theorem is referenced by:  excxor  1368  xoror  1369