gruixp - Metamath Proof Explorer

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

Theorem gruixp 10703

Description: A Grothendieck universe contains indexed cartesian products of its elements. (Contributed by Mario Carneiro, 9-Jun-2013.)

**Assertion**
Ref	Expression
gruixp	⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → X𝑥 ∈ 𝐴 𝐵 ∈ 𝑈)

Distinct variable groups: 𝑥,𝑈 𝑥,𝐴 Allowed substitution hint: 𝐵(𝑥)

**Proof of Theorem gruixp**
Step	Hyp	Ref	Expression
1		simp1 1136	. 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → 𝑈 ∈ Univ)
2		gruiun 10693	. . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈)
3		simp2 1137	. . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → 𝐴 ∈ 𝑈)
4		grumap 10702	. . 3 ⊢ ((𝑈 ∈ Univ ∧ ∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 ∧ 𝐴 ∈ 𝑈) → (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴) ∈ 𝑈)
5	1, 2, 3, 4	syl3anc 1373	. 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴) ∈ 𝑈)
6		ixpssmapg 8855	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → X𝑥 ∈ 𝐴 𝐵 ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴))
7	6	3ad2ant3 1135	. 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → X𝑥 ∈ 𝐴 𝐵 ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴))
8		gruss 10690	. 2 ⊢ ((𝑈 ∈ Univ ∧ (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴) ∈ 𝑈 ∧ X𝑥 ∈ 𝐴 𝐵 ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴)) → X𝑥 ∈ 𝐴 𝐵 ∈ 𝑈)
9	1, 5, 7, 8	syl3anc 1373	1 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → X𝑥 ∈ 𝐴 𝐵 ∈ 𝑈)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1086 ∈ wcel 2109 ∀wral 3044 ⊆ wss 3903 ∪ ciun 4941 (class class class)co 7349 ↑_m cmap 8753 Xcixp 8824 Univcgru 10684

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5218 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-fv 6490 df-ov 7352 df-oprab 7353 df-mpo 7354 df-1st 7924 df-2nd 7925 df-map 8755 df-pm 8756 df-ixp 8825 df-gru 10685

This theorem is referenced by: (None)

W3C validator