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

Theorem iunon 8385
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 5962 . . 3 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
21adantl 487 . 2 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ On) → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
3 mptexg 7258 . . . 4 (𝐴 ∈ 𝑉 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V)
4 rnexg 7948 . . . 4 ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V)
53, 4syl 18 . . 3 (𝐴 ∈ 𝑉 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V)
6 eqid 2763 . . . 4 (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
76rnmptss 7155 . . 3 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On)
8 ssonuni 7828 . . . 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 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ⊆ wss 3900  ∪ cuni 4872  ∪ ciun 4956   ↦ cmpt 5192  ran crn 5659  Oncon0 6388
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574
This theorem is used by:  oacl  8581  omcl  8582  oecl  8583  rankuni2b  9904  rankval4b  9917  rankval4  9921  alephon  10187  cfsmolem  10387  hsmexlem5  10547  inar1  10899  bdayiun  28358  ofoafg  44678
  Copyright terms: Public domain W3C validator