MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  iunon Structured version   Visualization version   GIF version

Theorem iunon 8353
Description: The indexed union of a set of ordinal numbers 𝐵(𝑥) is an ordinal number. (Contributed by NM, 13-Oct-2003.) (Revised by Mario Carneiro, 5-Dec-2016.)
Assertion
Ref Expression
iunon ((𝐴𝑉 ∧ ∀𝑥𝐴 𝐵 ∈ On) → 𝑥𝐴 𝐵 ∈ On)
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝐵(𝑥)   𝑉(𝑥)

Proof of Theorem iunon
StepHypRef Expression
1 dfiun3g 5947 . . 3 (∀𝑥𝐴 𝐵 ∈ On → 𝑥𝐴 𝐵 = ran (𝑥𝐴𝐵))
21adantl 481 . 2 ((𝐴𝑉 ∧ ∀𝑥𝐴 𝐵 ∈ On) → 𝑥𝐴 𝐵 = ran (𝑥𝐴𝐵))
3 mptexg 7213 . . . 4 (𝐴𝑉 → (𝑥𝐴𝐵) ∈ V)
4 rnexg 7898 . . . 4 ((𝑥𝐴𝐵) ∈ V → ran (𝑥𝐴𝐵) ∈ V)
53, 4syl 17 . . 3 (𝐴𝑉 → ran (𝑥𝐴𝐵) ∈ V)
6 eqid 2735 . . . 4 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
76rnmptss 7113 . . 3 (∀𝑥𝐴 𝐵 ∈ On → ran (𝑥𝐴𝐵) ⊆ On)
8 ssonuni 7774 . . . 4 (ran (𝑥𝐴𝐵) ∈ V → (ran (𝑥𝐴𝐵) ⊆ On → ran (𝑥𝐴𝐵) ∈ On))
98imp 406 . . 3 ((ran (𝑥𝐴𝐵) ∈ V ∧ ran (𝑥𝐴𝐵) ⊆ On) → ran (𝑥𝐴𝐵) ∈ On)
105, 7, 9syl2an 596 . 2 ((𝐴𝑉 ∧ ∀𝑥𝐴 𝐵 ∈ On) → ran (𝑥𝐴𝐵) ∈ On)
112, 10eqeltrd 2834 1 ((𝐴𝑉 ∧ ∀𝑥𝐴 𝐵 ∈ On) → 𝑥𝐴 𝐵 ∈ On)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2108  wral 3051  Vcvv 3459  wss 3926   cuni 4883   ciun 4967  cmpt 5201  ran crn 5655  Oncon0 6352
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pr 5402  ax-un 7729
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-ord 6355  df-on 6356  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539
This theorem is referenced by:  oacl  8547  omcl  8548  oecl  8549  rankuni2b  9867  rankval4  9881  alephon  10083  cfsmolem  10284  hsmexlem5  10444  inar1  10789  ofoafg  43378
  Copyright terms: Public domain W3C validator