Metamath Proof Explorer


Theorem oaun3lem2

Description: The class of all ordinal sums of elements from two ordinals is bounded by the sum. Lemma for oaun3 . (Contributed by RP, 13-Feb-2025)

Ref Expression
Assertion oaun3lem2 ⊢ A ∈ On ∧ B ∈ On → x | ∃ a ∈ A ∃ b ∈ B x = a + 𝑜 b ⊆ A + 𝑜 B

Proof

Step Hyp Ref Expression
1 simpr ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B ∧ x = a + 𝑜 b → x = a + 𝑜 b
2 onelon ⊢ A ∈ On ∧ a ∈ A → a ∈ On
3 2 ad2ant2r ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → a ∈ On
4 onelon ⊢ B ∈ On ∧ b ∈ B → b ∈ On
5 4 ad2ant2l ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → b ∈ On
6 oacl ⊢ a ∈ On ∧ b ∈ On → a + 𝑜 b ∈ On
7 3 5 6 syl2anc ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → a + 𝑜 b ∈ On
8 oacl ⊢ A ∈ On ∧ B ∈ On → A + 𝑜 B ∈ On
9 8 adantr ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → A + 𝑜 B ∈ On
10 7 9 jca ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → a + 𝑜 b ∈ On ∧ A + 𝑜 B ∈ On
11 simpl ⊢ A ∈ On ∧ B ∈ On → A ∈ On
12 11 adantr ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → A ∈ On
13 3 12 5 3jca ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → a ∈ On ∧ A ∈ On ∧ b ∈ On
14 simpl ⊢ a ∈ A ∧ b ∈ B → a ∈ A
15 14 adantl ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → a ∈ A
16 eloni ⊢ a ∈ On → Ord ⁡ a
17 eloni ⊢ A ∈ On → Ord ⁡ A
18 16 17 anim12i ⊢ a ∈ On ∧ A ∈ On → Ord ⁡ a ∧ Ord ⁡ A
19 3 12 18 syl2anc ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → Ord ⁡ a ∧ Ord ⁡ A
20 ordelpss ⊢ Ord ⁡ a ∧ Ord ⁡ A → a ∈ A ↔ a ⊂ A
21 19 20 syl ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → a ∈ A ↔ a ⊂ A
22 15 21 mpbid ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → a ⊂ A
23 22 pssssd ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → a ⊆ A
24 oawordri ⊢ a ∈ On ∧ A ∈ On ∧ b ∈ On → a ⊆ A → a + 𝑜 b ⊆ A + 𝑜 b
25 13 23 24 sylc ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → a + 𝑜 b ⊆ A + 𝑜 b
26 pm3.22 ⊢ A ∈ On ∧ B ∈ On → B ∈ On ∧ A ∈ On
27 26 adantr ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → B ∈ On ∧ A ∈ On
28 simpr ⊢ a ∈ A ∧ b ∈ B → b ∈ B
29 28 adantl ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → b ∈ B
30 oaordi ⊢ B ∈ On ∧ A ∈ On → b ∈ B → A + 𝑜 b ∈ A + 𝑜 B
31 27 29 30 sylc ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → A + 𝑜 b ∈ A + 𝑜 B
32 25 31 jca ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → a + 𝑜 b ⊆ A + 𝑜 b ∧ A + 𝑜 b ∈ A + 𝑜 B
33 ontr2 ⊢ a + 𝑜 b ∈ On ∧ A + 𝑜 B ∈ On → a + 𝑜 b ⊆ A + 𝑜 b ∧ A + 𝑜 b ∈ A + 𝑜 B → a + 𝑜 b ∈ A + 𝑜 B
34 10 32 33 sylc ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B → a + 𝑜 b ∈ A + 𝑜 B
35 34 adantr ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B ∧ x = a + 𝑜 b → a + 𝑜 b ∈ A + 𝑜 B
36 1 35 eqeltrd ⊢ A ∈ On ∧ B ∈ On ∧ a ∈ A ∧ b ∈ B ∧ x = a + 𝑜 b → x ∈ A + 𝑜 B
37 36 exp31 ⊢ A ∈ On ∧ B ∈ On → a ∈ A ∧ b ∈ B → x = a + 𝑜 b → x ∈ A + 𝑜 B
38 37 rexlimdvv ⊢ A ∈ On ∧ B ∈ On → ∃ a ∈ A ∃ b ∈ B x = a + 𝑜 b → x ∈ A + 𝑜 B
39 38 abssdv ⊢ A ∈ On ∧ B ∈ On → x | ∃ a ∈ A ∃ b ∈ B x = a + 𝑜 b ⊆ A + 𝑜 B