Theorem ssorduni 7729

Description: The union of a class of ordinal numbers is ordinal. Proposition 7.19 of [TakeutiZaring] p. 40. Lemma 2.7 of [Schloeder] p. 4. (Contributed by NM, 30-May-1994.) (Proof shortened by Andrew Salmon, 12-Aug-2011.)

Assertion

Ref	Expression
ssorduni	⊢ (𝐴 ⊆ On → Ord ∪ 𝐴)

Proof of Theorem ssorduni

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eluni2 4849	. . . . 5 ⊢ (𝑥 ∈ ∪ 𝐴 ↔ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦)
2		ssel 3916	. . . . . . . . 9 ⊢ (𝐴 ⊆ On → (𝑦 ∈ 𝐴 → 𝑦 ∈ On))
3		onelss 6359	. . . . . . . . 9 ⊢ (𝑦 ∈ On → (𝑥 ∈ 𝑦 → 𝑥 ⊆ 𝑦))
4	2, 3	syl6 35	. . . . . . . 8 ⊢ (𝐴 ⊆ On → (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝑦 → 𝑥 ⊆ 𝑦)))
5		anc2r 559	. . . . . . . 8 ⊢ ((𝑦 ∈ 𝐴 → (𝑥 ∈ 𝑦 → 𝑥 ⊆ 𝑦)) → (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝑦 → (𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝐴))))
6	4, 5	syl 17	. . . . . . 7 ⊢ (𝐴 ⊆ On → (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝑦 → (𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝐴))))
7		ssuni 4870	. . . . . . 7 ⊢ ((𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑥 ⊆ ∪ 𝐴)
8	6, 7	syl8 76	. . . . . 6 ⊢ (𝐴 ⊆ On → (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝑦 → 𝑥 ⊆ ∪ 𝐴)))
9	8	rexlimdv 3139	. . . . 5 ⊢ (𝐴 ⊆ On → (∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 → 𝑥 ⊆ ∪ 𝐴))
10	1, 9	biimtrid 243	. . . 4 ⊢ (𝐴 ⊆ On → (𝑥 ∈ ∪ 𝐴 → 𝑥 ⊆ ∪ 𝐴))
11	10	ralrimiv 3131	. . 3 ⊢ (𝐴 ⊆ On → ∀𝑥 ∈ ∪ 𝐴𝑥 ⊆ ∪ 𝐴)
12		dftr3 5191	. . 3 ⊢ (Tr ∪ 𝐴 ↔ ∀𝑥 ∈ ∪ 𝐴𝑥 ⊆ ∪ 𝐴)
13	11, 12	sylibr 235	. 2 ⊢ (𝐴 ⊆ On → Tr ∪ 𝐴)
14		onelon 6342	. . . . . . 7 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ 𝑦) → 𝑥 ∈ On)
15	14	ex 413	. . . . . 6 ⊢ (𝑦 ∈ On → (𝑥 ∈ 𝑦 → 𝑥 ∈ On))
16	2, 15	syl6 35	. . . . 5 ⊢ (𝐴 ⊆ On → (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝑦 → 𝑥 ∈ On)))
17	16	rexlimdv 3139	. . . 4 ⊢ (𝐴 ⊆ On → (∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 → 𝑥 ∈ On))
18	1, 17	biimtrid 243	. . 3 ⊢ (𝐴 ⊆ On → (𝑥 ∈ ∪ 𝐴 → 𝑥 ∈ On))
19	18	ssrdv 3928	. 2 ⊢ (𝐴 ⊆ On → ∪ 𝐴 ⊆ On)
20		ordon 7727	. . 3 ⊢ Ord On
21		trssord 6334	. . . 4 ⊢ ((Tr ∪ 𝐴 ∧ ∪ 𝐴 ⊆ On ∧ Ord On) → Ord ∪ 𝐴)
22	21	3exp 1125	. . 3 ⊢ (Tr ∪ 𝐴 → (∪ 𝐴 ⊆ On → (Ord On → Ord ∪ 𝐴)))
23	20, 22	mpii 46	. 2 ⊢ (Tr ∪ 𝐴 → (∪ 𝐴 ⊆ On → Ord ∪ 𝐴))
24	13, 19, 23	sylc 65	1 ⊢ (𝐴 ⊆ On → Ord ∪ 𝐴)

Syntax hints:   → wi 4   ∧ wa 396   ∈ wcel 2119  ∀wral 3054  ∃wrex 3064   ⊆ wss 3890  ∪ cuni 4845  Tr wtr 5186  Ord word 6316  Oncon0 6317

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712  ax-sep 5225  ax-pr 5369

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-tr 5187  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-ord 6320  df-on 6321

This theorem is referenced by:  ssonuni  7730  ssonprc  7737  orduni  7739  onsucuni  7775  limuni3  7799  onfununi  8278  tfrlem8  8320  cofon1  8605  cofon2  8606  naddcllem  8609  onssnum  9960  unialeph  10021  cfslbn  10187  hsmexlem1  10346  inaprc  10757  bdayimaon  27682  noetasuplem4  27725  noetainflem4  27729  noeta2  27778  etaslts2  27811  cutbdaybnd2lim  27814  onsupneqmaxlim0  43676  onsupnmax  43680  onsupsucismax  43731  onsucunifi  43822