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 10309

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 1137	. 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → 𝑈 ∈ Univ)
2		gruiun 10299	. . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈)
3		simp2 1138	. . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → 𝐴 ∈ 𝑈)
4		grumap 10308	. . 3 ⊢ ((𝑈 ∈ Univ ∧ ∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 ∧ 𝐴 ∈ 𝑈) → (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴) ∈ 𝑈)
5	1, 2, 3, 4	syl3anc 1372	. 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴) ∈ 𝑈)
6		ixpssmapg 8538	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → X𝑥 ∈ 𝐴 𝐵 ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴))
7	6	3ad2ant3 1136	. 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → X𝑥 ∈ 𝐴 𝐵 ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴))
8		gruss 10296	. 2 ⊢ ((𝑈 ∈ Univ ∧ (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴) ∈ 𝑈 ∧ X𝑥 ∈ 𝐴 𝐵 ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴)) → X𝑥 ∈ 𝐴 𝐵 ∈ 𝑈)
9	1, 5, 7, 8	syl3anc 1372	1 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → X𝑥 ∈ 𝐴 𝐵 ∈ 𝑈)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1088 ∈ wcel 2114 ∀wral 3053 ⊆ wss 3843 ∪ ciun 4881 (class class class)co 7170 ↑_m cmap 8437 Xcixp 8507 Univcgru 10290

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2710 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5232 ax-pr 5296 ax-un 7479

This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2540 df-eu 2570 df-clab 2717 df-cleq 2730 df-clel 2811 df-nfc 2881 df-ne 2935 df-ral 3058 df-rex 3059 df-reu 3060 df-rab 3062 df-v 3400 df-sbc 3681 df-csb 3791 df-dif 3846 df-un 3848 df-in 3850 df-ss 3860 df-nul 4212 df-if 4415 df-pw 4490 df-sn 4517 df-pr 4519 df-op 4523 df-uni 4797 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5429 df-xp 5531 df-rel 5532 df-cnv 5533 df-co 5534 df-dm 5535 df-rn 5536 df-res 5537 df-ima 5538 df-iota 6297 df-fun 6341 df-fn 6342 df-f 6343 df-f1 6344 df-fo 6345 df-f1o 6346 df-fv 6347 df-ov 7173 df-oprab 7174 df-mpo 7175 df-1st 7714 df-2nd 7715 df-map 8439 df-pm 8440 df-ixp 8508 df-gru 10291

This theorem is referenced by: (None)

W3C validator