Theorem unon 7831

Description: The class of all ordinal numbers is its own union. Exercise 11 of [TakeutiZaring] p. 40. (Contributed by NM, 12-Nov-2003.)

Assertion

Ref	Expression
unon	⊢ ∪ On = On

Proof of Theorem unon

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

Step	Hyp	Ref	Expression
1		eluni2 4874	. . . 4 ⊢ (𝑥 ∈ ∪ On ↔ ∃𝑦 ∈ On 𝑥 ∈ 𝑦)
2		onelon 6386	. . . . 5 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ 𝑦) → 𝑥 ∈ On)
3	2	rexlimiva 3157	. . . 4 ⊢ (∃𝑦 ∈ On 𝑥 ∈ 𝑦 → 𝑥 ∈ On)
4	1, 3	sylbi 220	. . 3 ⊢ (𝑥 ∈ ∪ On → 𝑥 ∈ On)
5		vex 3457	. . . . 5 ⊢ 𝑥 ∈ V
6	5	sucid 6446	. . . 4 ⊢ 𝑥 ∈ suc 𝑥
7		onsuc 7813	. . . 4 ⊢ (𝑥 ∈ On → suc 𝑥 ∈ On)
8		elunii 4875	. . . 4 ⊢ ((𝑥 ∈ suc 𝑥 ∧ suc 𝑥 ∈ On) → 𝑥 ∈ ∪ On)
9	6, 7, 8	sylancr 599	. . 3 ⊢ (𝑥 ∈ On → 𝑥 ∈ ∪ On)
10	4, 9	impbii 212	. 2 ⊢ (𝑥 ∈ ∪ On ↔ 𝑥 ∈ On)
11	10	eqriv 2759	1 ⊢ ∪ On = On

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2145  ∃wrex 3088  ∪ cuni 4870  Oncon0 6361  suc csuc 6363

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pr 5402  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-tr 5217  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-ord 6364  df-on 6365  df-suc 6367

This theorem is used by:  ordunisuc  7832  limon  7836  orduninsuc  7843  ordtoplem  37062  ordcmp  37074  onsupnmax  44077