Theorem dcun 3525

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

Hypotheses

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

Assertion

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

Proof of Theorem dcun

Step	Hyp	Ref	Expression
1		elun1 3294	. . . . 5 ⊢ (𝑘 ∈ 𝐴 → 𝑘 ∈ (𝐴 ∪ 𝐵))
2	1	adantl 275	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ (𝐴 ∪ 𝐵))
3	2	orcd 728	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑘 ∈ (𝐴 ∪ 𝐵) ∨ ¬ 𝑘 ∈ (𝐴 ∪ 𝐵)))
4		df-dc 830	. . 3 ⊢ (DECID 𝑘 ∈ (𝐴 ∪ 𝐵) ↔ (𝑘 ∈ (𝐴 ∪ 𝐵) ∨ ¬ 𝑘 ∈ (𝐴 ∪ 𝐵)))
5	3, 4	sylibr 133	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → DECID 𝑘 ∈ (𝐴 ∪ 𝐵))
6		elun2 3295	. . . . . 6 ⊢ (𝑘 ∈ 𝐵 → 𝑘 ∈ (𝐴 ∪ 𝐵))
7	6	adantl 275	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝑘 ∈ 𝐴) ∧ 𝑘 ∈ 𝐵) → 𝑘 ∈ (𝐴 ∪ 𝐵))
8	7	orcd 728	. . . 4 ⊢ (((𝜑 ∧ ¬ 𝑘 ∈ 𝐴) ∧ 𝑘 ∈ 𝐵) → (𝑘 ∈ (𝐴 ∪ 𝐵) ∨ ¬ 𝑘 ∈ (𝐴 ∪ 𝐵)))
9	8, 4	sylibr 133	. . 3 ⊢ (((𝜑 ∧ ¬ 𝑘 ∈ 𝐴) ∧ 𝑘 ∈ 𝐵) → DECID 𝑘 ∈ (𝐴 ∪ 𝐵))
10		simplr 525	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑘 ∈ 𝐴) ∧ ¬ 𝑘 ∈ 𝐵) → ¬ 𝑘 ∈ 𝐴)
11		simpr 109	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑘 ∈ 𝐴) ∧ ¬ 𝑘 ∈ 𝐵) → ¬ 𝑘 ∈ 𝐵)
12		ioran 747	. . . . . . 7 ⊢ (¬ (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ 𝐵) ↔ (¬ 𝑘 ∈ 𝐴 ∧ ¬ 𝑘 ∈ 𝐵))
13	10, 11, 12	sylanbrc 415	. . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝑘 ∈ 𝐴) ∧ ¬ 𝑘 ∈ 𝐵) → ¬ (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ 𝐵))
14		elun 3268	. . . . . 6 ⊢ (𝑘 ∈ (𝐴 ∪ 𝐵) ↔ (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ 𝐵))
15	13, 14	sylnibr 672	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝑘 ∈ 𝐴) ∧ ¬ 𝑘 ∈ 𝐵) → ¬ 𝑘 ∈ (𝐴 ∪ 𝐵))
16	15	olcd 729	. . . 4 ⊢ (((𝜑 ∧ ¬ 𝑘 ∈ 𝐴) ∧ ¬ 𝑘 ∈ 𝐵) → (𝑘 ∈ (𝐴 ∪ 𝐵) ∨ ¬ 𝑘 ∈ (𝐴 ∪ 𝐵)))
17	16, 4	sylibr 133	. . 3 ⊢ (((𝜑 ∧ ¬ 𝑘 ∈ 𝐴) ∧ ¬ 𝑘 ∈ 𝐵) → DECID 𝑘 ∈ (𝐴 ∪ 𝐵))
18		dcun.b	. . . . 5 ⊢ (𝜑 → DECID 𝑘 ∈ 𝐵)
19		exmiddc 831	. . . . 5 ⊢ (DECID 𝑘 ∈ 𝐵 → (𝑘 ∈ 𝐵 ∨ ¬ 𝑘 ∈ 𝐵))
20	18, 19	syl 14	. . . 4 ⊢ (𝜑 → (𝑘 ∈ 𝐵 ∨ ¬ 𝑘 ∈ 𝐵))
21	20	adantr 274	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑘 ∈ 𝐴) → (𝑘 ∈ 𝐵 ∨ ¬ 𝑘 ∈ 𝐵))
22	9, 17, 21	mpjaodan 793	. 2 ⊢ ((𝜑 ∧ ¬ 𝑘 ∈ 𝐴) → DECID 𝑘 ∈ (𝐴 ∪ 𝐵))
23		dcun.a	. . 3 ⊢ (𝜑 → DECID 𝑘 ∈ 𝐴)
24		exmiddc 831	. . 3 ⊢ (DECID 𝑘 ∈ 𝐴 → (𝑘 ∈ 𝐴 ∨ ¬ 𝑘 ∈ 𝐴))
25	23, 24	syl 14	. 2 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ∨ ¬ 𝑘 ∈ 𝐴))
26	5, 22, 25	mpjaodan 793	1 ⊢ (𝜑 → DECID 𝑘 ∈ (𝐴 ∪ 𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ∨ wo 703  DECID wdc 829   ∈ wcel 2141   ∪ cun 3119

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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152

This theorem depends on definitions:  df-bi 116  df-dc 830  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-v 2732  df-un 3125  df-in 3127  df-ss 3134

This theorem is referenced by:  sumsplitdc  11395