Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dfom6 Structured version   Visualization version   GIF version

Theorem dfom6 44104
Description: Let ω be defined to be the union of the set of all finite ordinals. (Contributed by RP, 27-Sep-2023.)
Assertion
Ref Expression
dfom6 ω = (On ∩ Fin)

Proof of Theorem dfom6
StepHypRef Expression
1 limom 7862 . . 3 Lim ω
2 limuni 6408 . . 3 (Lim ω → ω = ω)
31, 2ax-mp 5 . 2 ω = ω
4 onfin2 9185 . . 3 ω = (On ∩ Fin)
54unieqi 4877 . 2 ω = (On ∩ Fin)
63, 5eqtri 2785 1 ω = (On ∩ Fin)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1560  cin 3903   cuni 4865  Oncon0 6346  Lim wlim 6347  ωcom 7846  Fincfn 8927
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-om 7847  df-1o 8437  df-en 8928  df-dom 8929  df-sdom 8930  df-fin 8931
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator