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 43772
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 7824 . . 3 Lim ω
2 limuni 6379 . . 3 (Lim ω → ω = ω)
31, 2ax-mp 5 . 2 ω = ω
4 onfin2 9141 . . 3 ω = (On ∩ Fin)
54unieqi 4875 . 2 ω = (On ∩ Fin)
63, 5eqtri 2759 1 ω = (On ∩ Fin)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1541  cin 3900   cuni 4863  Oncon0 6317  Lim wlim 6318  ωcom 7808  Fincfn 8883
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-om 7809  df-1o 8397  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator