Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ssorduni | Structured version Visualization version GIF version |
Description: The union of a class of ordinal numbers is ordinal. Proposition 7.19 of [TakeutiZaring] p. 40. (Contributed by NM, 30-May-1994.) (Proof shortened by Andrew Salmon, 12-Aug-2011.) |
Ref | Expression |
---|---|
ssorduni | ⊢ (𝐴 ⊆ On → Ord ∪ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eluni2 4840 | . . . . 5 ⊢ (𝑥 ∈ ∪ 𝐴 ↔ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) | |
2 | ssel 3910 | . . . . . . . . 9 ⊢ (𝐴 ⊆ On → (𝑦 ∈ 𝐴 → 𝑦 ∈ On)) | |
3 | onelss 6293 | . . . . . . . . 9 ⊢ (𝑦 ∈ On → (𝑥 ∈ 𝑦 → 𝑥 ⊆ 𝑦)) | |
4 | 2, 3 | syl6 35 | . . . . . . . 8 ⊢ (𝐴 ⊆ On → (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝑦 → 𝑥 ⊆ 𝑦))) |
5 | anc2r 554 | . . . . . . . 8 ⊢ ((𝑦 ∈ 𝐴 → (𝑥 ∈ 𝑦 → 𝑥 ⊆ 𝑦)) → (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝑦 → (𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝐴)))) | |
6 | 4, 5 | syl 17 | . . . . . . 7 ⊢ (𝐴 ⊆ On → (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝑦 → (𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝐴)))) |
7 | ssuni 4863 | . . . . . . 7 ⊢ ((𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑥 ⊆ ∪ 𝐴) | |
8 | 6, 7 | syl8 76 | . . . . . 6 ⊢ (𝐴 ⊆ On → (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝑦 → 𝑥 ⊆ ∪ 𝐴))) |
9 | 8 | rexlimdv 3211 | . . . . 5 ⊢ (𝐴 ⊆ On → (∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 → 𝑥 ⊆ ∪ 𝐴)) |
10 | 1, 9 | syl5bi 241 | . . . 4 ⊢ (𝐴 ⊆ On → (𝑥 ∈ ∪ 𝐴 → 𝑥 ⊆ ∪ 𝐴)) |
11 | 10 | ralrimiv 3106 | . . 3 ⊢ (𝐴 ⊆ On → ∀𝑥 ∈ ∪ 𝐴𝑥 ⊆ ∪ 𝐴) |
12 | dftr3 5191 | . . 3 ⊢ (Tr ∪ 𝐴 ↔ ∀𝑥 ∈ ∪ 𝐴𝑥 ⊆ ∪ 𝐴) | |
13 | 11, 12 | sylibr 233 | . 2 ⊢ (𝐴 ⊆ On → Tr ∪ 𝐴) |
14 | onelon 6276 | . . . . . . 7 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ 𝑦) → 𝑥 ∈ On) | |
15 | 14 | ex 412 | . . . . . 6 ⊢ (𝑦 ∈ On → (𝑥 ∈ 𝑦 → 𝑥 ∈ On)) |
16 | 2, 15 | syl6 35 | . . . . 5 ⊢ (𝐴 ⊆ On → (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝑦 → 𝑥 ∈ On))) |
17 | 16 | rexlimdv 3211 | . . . 4 ⊢ (𝐴 ⊆ On → (∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 → 𝑥 ∈ On)) |
18 | 1, 17 | syl5bi 241 | . . 3 ⊢ (𝐴 ⊆ On → (𝑥 ∈ ∪ 𝐴 → 𝑥 ∈ On)) |
19 | 18 | ssrdv 3923 | . 2 ⊢ (𝐴 ⊆ On → ∪ 𝐴 ⊆ On) |
20 | ordon 7604 | . . 3 ⊢ Ord On | |
21 | trssord 6268 | . . . 4 ⊢ ((Tr ∪ 𝐴 ∧ ∪ 𝐴 ⊆ On ∧ Ord On) → Ord ∪ 𝐴) | |
22 | 21 | 3exp 1117 | . . 3 ⊢ (Tr ∪ 𝐴 → (∪ 𝐴 ⊆ On → (Ord On → Ord ∪ 𝐴))) |
23 | 20, 22 | mpii 46 | . 2 ⊢ (Tr ∪ 𝐴 → (∪ 𝐴 ⊆ On → Ord ∪ 𝐴)) |
24 | 13, 19, 23 | sylc 65 | 1 ⊢ (𝐴 ⊆ On → Ord ∪ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2108 ∀wral 3063 ∃wrex 3064 ⊆ wss 3883 ∪ cuni 4836 Tr wtr 5187 Ord word 6250 Oncon0 6251 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-11 2156 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-tr 5188 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-ord 6254 df-on 6255 |
This theorem is referenced by: ssonuni 7607 ssonprc 7614 orduni 7616 onsucuni 7650 limuni3 7674 onfununi 8143 tfrlem8 8186 onssnum 9727 unialeph 9788 cfslbn 9954 hsmexlem1 10113 inaprc 10523 naddcllem 33758 bdayimaon 33823 noetasuplem4 33866 noetainflem4 33870 noeta2 33906 etasslt2 33935 scutbdaybnd2lim 33938 |
Copyright terms: Public domain | W3C validator |