Theorem dcun 3601

Description: The union of two decidable classes is decidable. (Contributed by Jim Kingdon, 5-Oct-2022.) (Revised by Jim Kingdon, 13-Oct-2025.)

Hypotheses

Ref	Expression
dcun.a	⊢ (𝜑 → DECID 𝐶 ∈ 𝐴)
dcun.b	⊢ (𝜑 → DECID 𝐶 ∈ 𝐵)

Assertion

Ref	Expression
dcun	⊢ (𝜑 → DECID 𝐶 ∈ (𝐴 ∪ 𝐵))

Proof of Theorem dcun

Step	Hyp	Ref	Expression
1		elun1 3371	. . . . 5 ⊢ (𝐶 ∈ 𝐴 → 𝐶 ∈ (𝐴 ∪ 𝐵))
2	1	adantl 277	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ (𝐴 ∪ 𝐵))
3	2	orcd 738	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐴) → (𝐶 ∈ (𝐴 ∪ 𝐵) ∨ ¬ 𝐶 ∈ (𝐴 ∪ 𝐵)))
4		df-dc 840	. . 3 ⊢ (DECID 𝐶 ∈ (𝐴 ∪ 𝐵) ↔ (𝐶 ∈ (𝐴 ∪ 𝐵) ∨ ¬ 𝐶 ∈ (𝐴 ∪ 𝐵)))
5	3, 4	sylibr 134	. 2 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐴) → DECID 𝐶 ∈ (𝐴 ∪ 𝐵))
6		elun2 3372	. . . . . 6 ⊢ (𝐶 ∈ 𝐵 → 𝐶 ∈ (𝐴 ∪ 𝐵))
7	6	adantl 277	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ 𝐶 ∈ 𝐵) → 𝐶 ∈ (𝐴 ∪ 𝐵))
8	7	orcd 738	. . . 4 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ 𝐶 ∈ 𝐵) → (𝐶 ∈ (𝐴 ∪ 𝐵) ∨ ¬ 𝐶 ∈ (𝐴 ∪ 𝐵)))
9	8, 4	sylibr 134	. . 3 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ 𝐶 ∈ 𝐵) → DECID 𝐶 ∈ (𝐴 ∪ 𝐵))
10		simplr 528	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ ¬ 𝐶 ∈ 𝐵) → ¬ 𝐶 ∈ 𝐴)
11		simpr 110	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ ¬ 𝐶 ∈ 𝐵) → ¬ 𝐶 ∈ 𝐵)
12		ioran 757	. . . . . . 7 ⊢ (¬ (𝐶 ∈ 𝐴 ∨ 𝐶 ∈ 𝐵) ↔ (¬ 𝐶 ∈ 𝐴 ∧ ¬ 𝐶 ∈ 𝐵))
13	10, 11, 12	sylanbrc 417	. . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ ¬ 𝐶 ∈ 𝐵) → ¬ (𝐶 ∈ 𝐴 ∨ 𝐶 ∈ 𝐵))
14		elun 3345	. . . . . 6 ⊢ (𝐶 ∈ (𝐴 ∪ 𝐵) ↔ (𝐶 ∈ 𝐴 ∨ 𝐶 ∈ 𝐵))
15	13, 14	sylnibr 681	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ ¬ 𝐶 ∈ 𝐵) → ¬ 𝐶 ∈ (𝐴 ∪ 𝐵))
16	15	olcd 739	. . . 4 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ ¬ 𝐶 ∈ 𝐵) → (𝐶 ∈ (𝐴 ∪ 𝐵) ∨ ¬ 𝐶 ∈ (𝐴 ∪ 𝐵)))
17	16, 4	sylibr 134	. . 3 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ ¬ 𝐶 ∈ 𝐵) → DECID 𝐶 ∈ (𝐴 ∪ 𝐵))
18		dcun.b	. . . . 5 ⊢ (𝜑 → DECID 𝐶 ∈ 𝐵)
19		exmiddc 841	. . . . 5 ⊢ (DECID 𝐶 ∈ 𝐵 → (𝐶 ∈ 𝐵 ∨ ¬ 𝐶 ∈ 𝐵))
20	18, 19	syl 14	. . . 4 ⊢ (𝜑 → (𝐶 ∈ 𝐵 ∨ ¬ 𝐶 ∈ 𝐵))
21	20	adantr 276	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) → (𝐶 ∈ 𝐵 ∨ ¬ 𝐶 ∈ 𝐵))
22	9, 17, 21	mpjaodan 803	. 2 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) → DECID 𝐶 ∈ (𝐴 ∪ 𝐵))
23		dcun.a	. . 3 ⊢ (𝜑 → DECID 𝐶 ∈ 𝐴)
24		exmiddc 841	. . 3 ⊢ (DECID 𝐶 ∈ 𝐴 → (𝐶 ∈ 𝐴 ∨ ¬ 𝐶 ∈ 𝐴))
25	23, 24	syl 14	. 2 ⊢ (𝜑 → (𝐶 ∈ 𝐴 ∨ ¬ 𝐶 ∈ 𝐴))
26	5, 22, 25	mpjaodan 803	1 ⊢ (𝜑 → DECID 𝐶 ∈ (𝐴 ∪ 𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 713  DECID wdc 839   ∈ wcel 2200   ∪ cun 3195

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-dc 840  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-v 2801  df-un 3201  df-in 3203  df-ss 3210

This theorem is referenced by:  tpfidceq  7100  sumsplitdc  11951