Metamath Proof Explorer


Theorem oacl2g

Description: Closure law for ordinal addition. Here we show that ordinal addition is closed within the empty set or any ordinal power of omega. (Contributed by RP, 5-Jan-2025)

Ref Expression
Assertion oacl2g ⊢ A ∈ C ∧ B ∈ C ∧ C = ∅ ∨ C = ω ↑ 𝑜 D ∧ D ∈ On → A + 𝑜 B ∈ C

Proof

Step Hyp Ref Expression
1 eleq2 ⊢ C = ∅ → A ∈ C ↔ A ∈ ∅
2 noel ⊢ ¬ A ∈ ∅
3 2 pm2.21i ⊢ A ∈ ∅ → A + 𝑜 B ∈ C
4 1 3 biimtrdi ⊢ C = ∅ → A ∈ C → A + 𝑜 B ∈ C
5 4 com12 ⊢ A ∈ C → C = ∅ → A + 𝑜 B ∈ C
6 5 adantr ⊢ A ∈ C ∧ B ∈ C → C = ∅ → A + 𝑜 B ∈ C
7 simpl ⊢ A ∈ C ∧ B ∈ C → A ∈ C
8 simpl ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On → C = ω ↑ 𝑜 D
9 simpr ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On → D ∈ On
10 omelon ⊢ ω ∈ On
11 9 10 jctil ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On → ω ∈ On ∧ D ∈ On
12 oecl ⊢ ω ∈ On ∧ D ∈ On → ω ↑ 𝑜 D ∈ On
13 11 12 syl ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On → ω ↑ 𝑜 D ∈ On
14 8 13 eqeltrd ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On → C ∈ On
15 14 adantl ⊢ A ∈ C ∧ B ∈ C ∧ C = ω ↑ 𝑜 D ∧ D ∈ On → C ∈ On
16 onelon ⊢ C ∈ On ∧ A ∈ C → A ∈ On
17 16 expcom ⊢ A ∈ C → C ∈ On → A ∈ On
18 17 adantr ⊢ A ∈ C ∧ B ∈ C → C ∈ On → A ∈ On
19 18 adantr ⊢ A ∈ C ∧ B ∈ C ∧ C = ω ↑ 𝑜 D ∧ D ∈ On → C ∈ On → A ∈ On
20 15 19 jcai ⊢ A ∈ C ∧ B ∈ C ∧ C = ω ↑ 𝑜 D ∧ D ∈ On → C ∈ On ∧ A ∈ On
21 simpr ⊢ A ∈ C ∧ B ∈ C → B ∈ C
22 21 adantr ⊢ A ∈ C ∧ B ∈ C ∧ C = ω ↑ 𝑜 D ∧ D ∈ On → B ∈ C
23 oaordi ⊢ C ∈ On ∧ A ∈ On → B ∈ C → A + 𝑜 B ∈ A + 𝑜 C
24 20 22 23 sylc ⊢ A ∈ C ∧ B ∈ C ∧ C = ω ↑ 𝑜 D ∧ D ∈ On → A + 𝑜 B ∈ A + 𝑜 C
25 oveq1 ⊢ x = A → x + 𝑜 C = A + 𝑜 C
26 25 eliuni ⊢ A ∈ C ∧ A + 𝑜 B ∈ A + 𝑜 C → A + 𝑜 B ∈ ⋃ x ∈ C x + 𝑜 C
27 7 24 26 syl2an2r ⊢ A ∈ C ∧ B ∈ C ∧ C = ω ↑ 𝑜 D ∧ D ∈ On → A + 𝑜 B ∈ ⋃ x ∈ C x + 𝑜 C
28 simpr ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On ∧ x ∈ C → x ∈ C
29 8 adantr ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On ∧ x ∈ C → C = ω ↑ 𝑜 D
30 28 29 eleqtrd ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On ∧ x ∈ C → x ∈ ω ↑ 𝑜 D
31 14 adantr ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On ∧ x ∈ C → C ∈ On
32 8 eqcomd ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On → ω ↑ 𝑜 D = C
33 ssid ⊢ C ⊆ C
34 32 33 eqsstrdi ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On → ω ↑ 𝑜 D ⊆ C
35 34 adantr ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On ∧ x ∈ C → ω ↑ 𝑜 D ⊆ C
36 oaabs2 ⊢ x ∈ ω ↑ 𝑜 D ∧ C ∈ On ∧ ω ↑ 𝑜 D ⊆ C → x + 𝑜 C = C
37 30 31 35 36 syl21anc ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On ∧ x ∈ C → x + 𝑜 C = C
38 37 33 eqsstrdi ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On ∧ x ∈ C → x + 𝑜 C ⊆ C
39 38 iunssd ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On → ⋃ x ∈ C x + 𝑜 C ⊆ C
40 peano1 ⊢ ∅ ∈ ω
41 oen0 ⊢ ω ∈ On ∧ D ∈ On ∧ ∅ ∈ ω → ∅ ∈ ω ↑ 𝑜 D
42 11 40 41 sylancl ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On → ∅ ∈ ω ↑ 𝑜 D
43 42 32 eleqtrd ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On → ∅ ∈ C
44 simpr ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On ∧ x = ∅ → x = ∅
45 44 oveq1d ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On ∧ x = ∅ → x + 𝑜 C = ∅ + 𝑜 C
46 oa0r ⊢ C ∈ On → ∅ + 𝑜 C = C
47 14 46 syl ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On → ∅ + 𝑜 C = C
48 47 adantr ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On ∧ x = ∅ → ∅ + 𝑜 C = C
49 45 48 eqtrd ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On ∧ x = ∅ → x + 𝑜 C = C
50 49 sseq2d ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On ∧ x = ∅ → C ⊆ x + 𝑜 C ↔ C ⊆ C
51 ssidd ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On → C ⊆ C
52 43 50 51 rspcedvd ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On → ∃ x ∈ C C ⊆ x + 𝑜 C
53 ssiun ⊢ ∃ x ∈ C C ⊆ x + 𝑜 C → C ⊆ ⋃ x ∈ C x + 𝑜 C
54 52 53 syl ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On → C ⊆ ⋃ x ∈ C x + 𝑜 C
55 39 54 eqssd ⊢ C = ω ↑ 𝑜 D ∧ D ∈ On → ⋃ x ∈ C x + 𝑜 C = C
56 55 adantl ⊢ A ∈ C ∧ B ∈ C ∧ C = ω ↑ 𝑜 D ∧ D ∈ On → ⋃ x ∈ C x + 𝑜 C = C
57 27 56 eleqtrd ⊢ A ∈ C ∧ B ∈ C ∧ C = ω ↑ 𝑜 D ∧ D ∈ On → A + 𝑜 B ∈ C
58 57 ex ⊢ A ∈ C ∧ B ∈ C → C = ω ↑ 𝑜 D ∧ D ∈ On → A + 𝑜 B ∈ C
59 6 58 jaod ⊢ A ∈ C ∧ B ∈ C → C = ∅ ∨ C = ω ↑ 𝑜 D ∧ D ∈ On → A + 𝑜 B ∈ C
60 59 imp ⊢ A ∈ C ∧ B ∈ C ∧ C = ∅ ∨ C = ω ↑ 𝑜 D ∧ D ∈ On → A + 𝑜 B ∈ C