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

Theorem iunon 8361
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 5955 . . 3 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
21adantl 487 . 2 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ On) → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
3 mptexg 7237 . . . 4 (𝐴 ∈ 𝑉 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V)
4 rnexg 7924 . . . 4 ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V)
53, 4syl 18 . . 3 (𝐴 ∈ 𝑉 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V)
6 eqid 2763 . . . 4 (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
76rnmptss 7134 . . 3 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On)
8 ssonuni 7804 . . . 4 (ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V → (ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On → ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ On))
98imp 412 . . 3 ((ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V ∧ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On) → ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ On)
105, 7, 9syl2an 608 . 2 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ On) → ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ On)
112, 10eqeltrd 2864 1 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ On) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ On)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ∀wral 3080  Vcvv 3454   ⊆ wss 3900  ∪ cuni 4870  ∪ ciun 4954   ↦ cmpt 5189  ran crn 5656  Oncon0 6369
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7761
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6372  df-on 6373  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555
This theorem is used by:  oacl  8557  omcl  8558  oecl  8559  rankuni2b  9880  rankval4b  9893  rankval4  9897  alephon  10161  cfsmolem  10361  hsmexlem5  10521  inar1  10873  bdayiun  28316  ofoafg  44499
  Copyright terms: Public domain W3C validator