Theorem dcun 3637

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 3396	. . . . 5 ⊢ (𝐶 ∈ 𝐴 → 𝐶 ∈ (𝐴 ∪ 𝐵))
2	1	adantl 277	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ (𝐴 ∪ 𝐵))
3	2	orcd 745	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐴) → (𝐶 ∈ (𝐴 ∪ 𝐵) ∨ ¬ 𝐶 ∈ (𝐴 ∪ 𝐵)))
4		df-dc 847	. . 3 ⊢ (DECID 𝐶 ∈ (𝐴 ∪ 𝐵) ↔ (𝐶 ∈ (𝐴 ∪ 𝐵) ∨ ¬ 𝐶 ∈ (𝐴 ∪ 𝐵)))
5	3, 4	sylibr 134	. 2 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐴) → DECID 𝐶 ∈ (𝐴 ∪ 𝐵))
6		elun2 3397	. . . . . 6 ⊢ (𝐶 ∈ 𝐵 → 𝐶 ∈ (𝐴 ∪ 𝐵))
7	6	adantl 277	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ 𝐶 ∈ 𝐵) → 𝐶 ∈ (𝐴 ∪ 𝐵))
8	7	orcd 745	. . . 4 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ 𝐶 ∈ 𝐵) → (𝐶 ∈ (𝐴 ∪ 𝐵) ∨ ¬ 𝐶 ∈ (𝐴 ∪ 𝐵)))
9	8, 4	sylibr 134	. . 3 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ 𝐶 ∈ 𝐵) → DECID 𝐶 ∈ (𝐴 ∪ 𝐵))
10		simplr 533	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ ¬ 𝐶 ∈ 𝐵) → ¬ 𝐶 ∈ 𝐴)
11		simpr 110	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ ¬ 𝐶 ∈ 𝐵) → ¬ 𝐶 ∈ 𝐵)
12		ioran 764	. . . . . . 7 ⊢ (¬ (𝐶 ∈ 𝐴 ∨ 𝐶 ∈ 𝐵) ↔ (¬ 𝐶 ∈ 𝐴 ∧ ¬ 𝐶 ∈ 𝐵))
13	10, 11, 12	sylanbrc 421	. . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ ¬ 𝐶 ∈ 𝐵) → ¬ (𝐶 ∈ 𝐴 ∨ 𝐶 ∈ 𝐵))
14		elun 3370	. . . . . 6 ⊢ (𝐶 ∈ (𝐴 ∪ 𝐵) ↔ (𝐶 ∈ 𝐴 ∨ 𝐶 ∈ 𝐵))
15	13, 14	sylnibr 688	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ ¬ 𝐶 ∈ 𝐵) → ¬ 𝐶 ∈ (𝐴 ∪ 𝐵))
16	15	olcd 746	. . . 4 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ ¬ 𝐶 ∈ 𝐵) → (𝐶 ∈ (𝐴 ∪ 𝐵) ∨ ¬ 𝐶 ∈ (𝐴 ∪ 𝐵)))
17	16, 4	sylibr 134	. . 3 ⊢ (((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) ∧ ¬ 𝐶 ∈ 𝐵) → DECID 𝐶 ∈ (𝐴 ∪ 𝐵))
18		dcun.b	. . . . 5 ⊢ (𝜑 → DECID 𝐶 ∈ 𝐵)
19		exmiddc 848	. . . . 5 ⊢ (DECID 𝐶 ∈ 𝐵 → (𝐶 ∈ 𝐵 ∨ ¬ 𝐶 ∈ 𝐵))
20	18, 19	syl 14	. . . 4 ⊢ (𝜑 → (𝐶 ∈ 𝐵 ∨ ¬ 𝐶 ∈ 𝐵))
21	20	adantr 276	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) → (𝐶 ∈ 𝐵 ∨ ¬ 𝐶 ∈ 𝐵))
22	9, 17, 21	mpjaodan 810	. 2 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝐴) → DECID 𝐶 ∈ (𝐴 ∪ 𝐵))
23		dcun.a	. . 3 ⊢ (𝜑 → DECID 𝐶 ∈ 𝐴)
24		exmiddc 848	. . 3 ⊢ (DECID 𝐶 ∈ 𝐴 → (𝐶 ∈ 𝐴 ∨ ¬ 𝐶 ∈ 𝐴))
25	23, 24	syl 14	. 2 ⊢ (𝜑 → (𝐶 ∈ 𝐴 ∨ ¬ 𝐶 ∈ 𝐴))
26	5, 22, 25	mpjaodan 810	1 ⊢ (𝜑 → DECID 𝐶 ∈ (𝐴 ∪ 𝐵))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 720  DECID wdc 846   ∈ wcel 2209   ∪ cun 3218

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  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-dc 847  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224  df-in 3226  df-ss 3233

This theorem is used by:  tpfidceq  7237  fissfi  7263  sumsplitdc  12218  ballotfilemcdc  13275