Theorem or3or 44611

Description: Decompose disjunction into three cases. (Contributed by RP, 5-Jul-2021.)

Assertion

Ref	Expression
or3or	⊢ ((𝜑 ∨ 𝜓) ↔ ((𝜑 ∧ 𝜓) ∨ (𝜑 ∧ ¬ 𝜓) ∨ (¬ 𝜑 ∧ 𝜓)))

Proof of Theorem or3or

Step	Hyp	Ref	Expression
1		excxor 1539	. . 3 ⊢ ((𝜑 ⊻ 𝜓) ↔ ((𝜑 ∧ ¬ 𝜓) ∨ (¬ 𝜑 ∧ 𝜓)))
2	1	orbi2i 925	. 2 ⊢ (((𝜑 ∧ 𝜓) ∨ (𝜑 ⊻ 𝜓)) ↔ ((𝜑 ∧ 𝜓) ∨ ((𝜑 ∧ ¬ 𝜓) ∨ (¬ 𝜑 ∧ 𝜓))))
3		orc 880	. . . 4 ⊢ (𝜑 → (𝜑 ∨ 𝜓))
4		exmid 907	. . . . 5 ⊢ (𝜓 ∨ ¬ 𝜓)
5		pm3.2 474	. . . . . 6 ⊢ (𝜑 → (𝜓 → (𝜑 ∧ 𝜓)))
6		biimp 218	. . . . . . . . . 10 ⊢ ((𝜑 ↔ 𝜓) → (𝜑 → 𝜓))
7		iman 406	. . . . . . . . . 10 ⊢ ((𝜑 → 𝜓) ↔ ¬ (𝜑 ∧ ¬ 𝜓))
8	6, 7	sylib 221	. . . . . . . . 9 ⊢ ((𝜑 ↔ 𝜓) → ¬ (𝜑 ∧ ¬ 𝜓))
9	8	con2i 140	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝜓) → ¬ (𝜑 ↔ 𝜓))
10	9	ex 417	. . . . . . 7 ⊢ (𝜑 → (¬ 𝜓 → ¬ (𝜑 ↔ 𝜓)))
11		df-xor 1535	. . . . . . . 8 ⊢ ((𝜑 ⊻ 𝜓) ↔ ¬ (𝜑 ↔ 𝜓))
12	11	bicomi 227	. . . . . . 7 ⊢ (¬ (𝜑 ↔ 𝜓) ↔ (𝜑 ⊻ 𝜓))
13	10, 12	imbitrdi 254	. . . . . 6 ⊢ (𝜑 → (¬ 𝜓 → (𝜑 ⊻ 𝜓)))
14	5, 13	orim12d 979	. . . . 5 ⊢ (𝜑 → ((𝜓 ∨ ¬ 𝜓) → ((𝜑 ∧ 𝜓) ∨ (𝜑 ⊻ 𝜓))))
15	4, 14	mpi 21	. . . 4 ⊢ (𝜑 → ((𝜑 ∧ 𝜓) ∨ (𝜑 ⊻ 𝜓)))
16	3, 15	2thd 268	. . 3 ⊢ (𝜑 → ((𝜑 ∨ 𝜓) ↔ ((𝜑 ∧ 𝜓) ∨ (𝜑 ⊻ 𝜓))))
17		bicom 225	. . . . . . 7 ⊢ ((𝜑 ↔ 𝜓) ↔ (𝜓 ↔ 𝜑))
18		bibif 374	. . . . . . 7 ⊢ (¬ 𝜑 → ((𝜓 ↔ 𝜑) ↔ ¬ 𝜓))
19	17, 18	bitrid 286	. . . . . 6 ⊢ (¬ 𝜑 → ((𝜑 ↔ 𝜓) ↔ ¬ 𝜓))
20	19	con2bid 357	. . . . 5 ⊢ (¬ 𝜑 → (𝜓 ↔ ¬ (𝜑 ↔ 𝜓)))
21	20, 12	bitrdi 290	. . . 4 ⊢ (¬ 𝜑 → (𝜓 ↔ (𝜑 ⊻ 𝜓)))
22		biorf 949	. . . 4 ⊢ (¬ 𝜑 → (𝜓 ↔ (𝜑 ∨ 𝜓)))
23		simpl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → 𝜑)
24		biorf 949	. . . . 5 ⊢ (¬ (𝜑 ∧ 𝜓) → ((𝜑 ⊻ 𝜓) ↔ ((𝜑 ∧ 𝜓) ∨ (𝜑 ⊻ 𝜓))))
25	23, 24	nsyl5 160	. . . 4 ⊢ (¬ 𝜑 → ((𝜑 ⊻ 𝜓) ↔ ((𝜑 ∧ 𝜓) ∨ (𝜑 ⊻ 𝜓))))
26	21, 22, 25	3bitr3d 312	. . 3 ⊢ (¬ 𝜑 → ((𝜑 ∨ 𝜓) ↔ ((𝜑 ∧ 𝜓) ∨ (𝜑 ⊻ 𝜓))))
27	16, 26	pm2.61i 184	. 2 ⊢ ((𝜑 ∨ 𝜓) ↔ ((𝜑 ∧ 𝜓) ∨ (𝜑 ⊻ 𝜓)))
28		3orass 1104	. 2 ⊢ (((𝜑 ∧ 𝜓) ∨ (𝜑 ∧ ¬ 𝜓) ∨ (¬ 𝜑 ∧ 𝜓)) ↔ ((𝜑 ∧ 𝜓) ∨ ((𝜑 ∧ ¬ 𝜓) ∨ (¬ 𝜑 ∧ 𝜓))))
29	2, 27, 28	3bitr4i 306	1 ⊢ ((𝜑 ∨ 𝜓) ↔ ((𝜑 ∧ 𝜓) ∨ (𝜑 ∧ ¬ 𝜓) ∨ (¬ 𝜑 ∧ 𝜓)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   ∨ w3o 1100   ⊻ wxo 1534

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-xor 1535

This theorem is referenced by:  uneqsn  44613