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

Theorem gruiun 10884
Description: If 𝐵(𝑥) is a family of elements of 𝑈 and the index set 𝐴 is an element of 𝑈, then the indexed union ∪ 𝑥 ∈ 𝐴𝐵 is also an element of 𝑈, where 𝑈 is a Grothendieck universe. (Contributed by Mario Carneiro, 9-Jun-2013.)
Assertion
Ref Expression
gruiun ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈)
Distinct variable groups:   𝑥,𝑈   𝑥,𝐴
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem gruiun
StepHypRef Expression
1 eqid 2760 . . . . . . 7 (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
21fnmpt 6679 . . . . . 6 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
31rnmptss 7123 . . . . . 6 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑈)
4 df-f 6542 . . . . . 6 ((𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶𝑈 ↔ ((𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 ∧ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑈))
52, 3, 4sylanbrc 595 . . . . 5 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶𝑈)
6 gruurn 10883 . . . . . 6 ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶𝑈) → ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑈)
763expia 1139 . . . . 5 ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → ((𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶𝑈 → ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑈))
85, 7syl5com 32 . . . 4 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑈))
9 dfiun3g 5949 . . . . 5 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
109eleq1d 2845 . . . 4 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → (∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 ↔ ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑈))
118, 10sylibrd 262 . . 3 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈))
1211com12 33 . 2 ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈))
13123impia 1135 1 ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2144  ∀wral 3076   ⊆ wss 3895  ∪ cuni 4866  ∪ ciun 4950   ↦ cmpt 5185  ran crn 5651   Fn wfn 6533  ⟶wf 6534  Univcgru 10875
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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-map 8849  df-gru 10876
This theorem is used by:  gruuni  10885  gruun  10891  gruixp  10894  grur1a  10904  grur1cld  45230  grucollcld  45244
  Copyright terms: Public domain W3C validator