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

Theorem iunon 6337
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 4919 . . 3 (∀𝑥𝐴 𝐵 ∈ On → 𝑥𝐴 𝐵 = ran (𝑥𝐴𝐵))
21adantl 277 . 2 ((𝐴𝑉 ∧ ∀𝑥𝐴 𝐵 ∈ On) → 𝑥𝐴 𝐵 = ran (𝑥𝐴𝐵))
3 mptexg 5783 . . . 4 (𝐴𝑉 → (𝑥𝐴𝐵) ∈ V)
4 rnexg 4927 . . . 4 ((𝑥𝐴𝐵) ∈ V → ran (𝑥𝐴𝐵) ∈ V)
53, 4syl 14 . . 3 (𝐴𝑉 → ran (𝑥𝐴𝐵) ∈ V)
6 eqid 2193 . . . . 5 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
76fmpt 5708 . . . 4 (∀𝑥𝐴 𝐵 ∈ On ↔ (𝑥𝐴𝐵):𝐴⟶On)
8 frn 5412 . . . 4 ((𝑥𝐴𝐵):𝐴⟶On → ran (𝑥𝐴𝐵) ⊆ On)
97, 8sylbi 121 . . 3 (∀𝑥𝐴 𝐵 ∈ On → ran (𝑥𝐴𝐵) ⊆ On)
10 ssonuni 4520 . . . 4 (ran (𝑥𝐴𝐵) ∈ V → (ran (𝑥𝐴𝐵) ⊆ On → ran (𝑥𝐴𝐵) ∈ On))
1110imp 124 . . 3 ((ran (𝑥𝐴𝐵) ∈ V ∧ ran (𝑥𝐴𝐵) ⊆ On) → ran (𝑥𝐴𝐵) ∈ On)
125, 9, 11syl2an 289 . 2 ((𝐴𝑉 ∧ ∀𝑥𝐴 𝐵 ∈ On) → ran (𝑥𝐴𝐵) ∈ On)
132, 12eqeltrd 2270 1 ((𝐴𝑉 ∧ ∀𝑥𝐴 𝐵 ∈ On) → 𝑥𝐴 𝐵 ∈ On)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1364  wcel 2164  wral 2472  Vcvv 2760  wss 3153   cuni 3835   ciun 3912  cmpt 4090  Oncon0 4394  ran crn 4660  wf 5250
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-id 4324  df-iord 4397  df-on 4399  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262
This theorem is referenced by:  rdgon  6439
  Copyright terms: Public domain W3C validator