ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  iunon GIF version

Theorem iunon 5899
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 4589 . . 3 (∀𝑥𝐴 𝐵 ∈ On → 𝑥𝐴 𝐵 = ran (𝑥𝐴𝐵))
21adantl 262 . 2 ((𝐴𝑉 ∧ ∀𝑥𝐴 𝐵 ∈ On) → 𝑥𝐴 𝐵 = ran (𝑥𝐴𝐵))
3 mptexg 5386 . . . 4 (𝐴𝑉 → (𝑥𝐴𝐵) ∈ V)
4 rnexg 4597 . . . 4 ((𝑥𝐴𝐵) ∈ V → ran (𝑥𝐴𝐵) ∈ V)
53, 4syl 14 . . 3 (𝐴𝑉 → ran (𝑥𝐴𝐵) ∈ V)
6 eqid 2040 . . . . 5 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
76fmpt 5319 . . . 4 (∀𝑥𝐴 𝐵 ∈ On ↔ (𝑥𝐴𝐵):𝐴⟶On)
8 frn 5052 . . . 4 ((𝑥𝐴𝐵):𝐴⟶On → ran (𝑥𝐴𝐵) ⊆ On)
97, 8sylbi 114 . . 3 (∀𝑥𝐴 𝐵 ∈ On → ran (𝑥𝐴𝐵) ⊆ On)
10 ssonuni 4214 . . . 4 (ran (𝑥𝐴𝐵) ∈ V → (ran (𝑥𝐴𝐵) ⊆ On → ran (𝑥𝐴𝐵) ∈ On))
1110imp 115 . . 3 ((ran (𝑥𝐴𝐵) ∈ V ∧ ran (𝑥𝐴𝐵) ⊆ On) → ran (𝑥𝐴𝐵) ∈ On)
125, 9, 11syl2an 273 . 2 ((𝐴𝑉 ∧ ∀𝑥𝐴 𝐵 ∈ On) → ran (𝑥𝐴𝐵) ∈ On)
132, 12eqeltrd 2114 1 ((𝐴𝑉 ∧ ∀𝑥𝐴 𝐵 ∈ On) → 𝑥𝐴 𝐵 ∈ On)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 97   = wceq 1243  wcel 1393  wral 2306  Vcvv 2557  wss 2917   cuni 3580   ciun 3657  cmpt 3818  Oncon0 4100  ran crn 4346  wf 4898
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-pow 3927  ax-pr 3944  ax-un 4170
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-tr 3855  df-id 4030  df-iord 4103  df-on 4105  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910
This theorem is referenced by:  rdgon  5973
  Copyright terms: Public domain W3C validator