Theorem gruiun 10811

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

Step	Hyp	Ref	Expression
1		eqid 2762	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
2	1	fnmpt 6676	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
3	1	rnmptss 7119	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑈)
4		df-f 6541	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶𝑈 ↔ ((𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 ∧ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑈))
5	2, 3, 4	sylanbrc 595	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶𝑈)
6		gruurn 10810	. . . . . 6 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶𝑈) → ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑈)
7	6	3expia 1139	. . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → ((𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶𝑈 → ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑈))
8	5, 7	syl5com 32	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑈))
9		dfiun3g 5956	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
10	9	eleq1d 2847	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → (∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 ↔ ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑈))
11	8, 10	sylibrd 262	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈))
12	11	com12 33	. 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈))
13	12	3impia 1135	1 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2145  ∀wral 3078   ⊆ wss 3902  ∪ cuni 4870  ∪ ciun 4954   ↦ cmpt 5190  ran crn 5660   Fn wfn 6532  ⟶wf 6533  Univcgru 10802

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-pow 5334  ax-pr 5402  ax-un 7739

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-map 8831  df-gru 10803

This theorem is used by:  gruuni  10812  gruun  10818  gruixp  10821  grur1a  10831  grur1cld  45057  grucollcld  45071