Theorem unon 7783

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 4869	. . . 4 ⊢ (𝑥 ∈ ∪ On ↔ ∃𝑦 ∈ On 𝑥 ∈ 𝑦)
2		onelon 6350	. . . . 5 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ 𝑦) → 𝑥 ∈ On)
3	2	rexlimiva 3131	. . . 4 ⊢ (∃𝑦 ∈ On 𝑥 ∈ 𝑦 → 𝑥 ∈ On)
4	1, 3	sylbi 217	. . 3 ⊢ (𝑥 ∈ ∪ On → 𝑥 ∈ On)
5		vex 3446	. . . . 5 ⊢ 𝑥 ∈ V
6	5	sucid 6409	. . . 4 ⊢ 𝑥 ∈ suc 𝑥
7		onsuc 7765	. . . 4 ⊢ (𝑥 ∈ On → suc 𝑥 ∈ On)
8		elunii 4870	. . . 4 ⊢ ((𝑥 ∈ suc 𝑥 ∧ suc 𝑥 ∈ On) → 𝑥 ∈ ∪ On)
9	6, 7, 8	sylancr 588	. . 3 ⊢ (𝑥 ∈ On → 𝑥 ∈ ∪ On)
10	4, 9	impbii 209	. 2 ⊢ (𝑥 ∈ ∪ On ↔ 𝑥 ∈ On)
11	10	eqriv 2734	1 ⊢ ∪ On = On

Syntax hints:   = wceq 1542   ∈ wcel 2114  ∃wrex 3062  ∪ cuni 4865  Oncon0 6325  suc csuc 6327

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-tr 5208  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-ord 6328  df-on 6329  df-suc 6331

This theorem is referenced by:  ordunisuc  7784  limon  7788  orduninsuc  7795  ordtoplem  36648  ordcmp  36660  onsupnmax  43579