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

Theorem gruiun 10908
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 2763 . . . . . . 7 (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
21fnmpt 6698 . . . . . 6 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
31rnmptss 7144 . . . . . 6 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑈)
4 df-f 6559 . . . . . 6 ((𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶𝑈 ↔ ((𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 ∧ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑈))
52, 3, 4sylanbrc 595 . . . . 5 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶𝑈)
6 gruurn 10907 . . . . . 6 ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶𝑈) → ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑈)
763expia 1139 . . . . 5 ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → ((𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶𝑈 → ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑈))
85, 7syl5com 32 . . . 4 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑈))
9 dfiun3g 5956 . . . . 5 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
109eleq1d 2849 . . . 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 2147  ∀wral 3080   ⊆ wss 3900  ∪ cuni 4870  ∪ ciun 4954   ↦ cmpt 5189  ran crn 5656   Fn wfn 6550  ⟶wf 6551  Univcgru 10899
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-sep 5252  ax-pow 5331  ax-pr 5395  ax-un 7772
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  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-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-map 8874  df-gru 10900
This theorem is used by:  gruuni  10909  gruun  10915  gruixp  10918  grur1a  10928  grur1cld  45420  grucollcld  45434
  Copyright terms: Public domain W3C validator