Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > gruxp | Structured version Visualization version GIF version |
Description: A Grothendieck universe contains binary cartesian products of its elements. (Contributed by Mario Carneiro, 9-Jun-2013.) |
Ref | Expression |
---|---|
gruxp | ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → (𝐴 × 𝐵) ∈ 𝑈) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | gruun 10228 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → (𝐴 ∪ 𝐵) ∈ 𝑈) | |
2 | grupw 10217 | . . . 4 ⊢ ((𝑈 ∈ Univ ∧ (𝐴 ∪ 𝐵) ∈ 𝑈) → 𝒫 (𝐴 ∪ 𝐵) ∈ 𝑈) | |
3 | grupw 10217 | . . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝒫 (𝐴 ∪ 𝐵) ∈ 𝑈) → 𝒫 𝒫 (𝐴 ∪ 𝐵) ∈ 𝑈) | |
4 | xpsspw 5682 | . . . . . 6 ⊢ (𝐴 × 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝐵) | |
5 | gruss 10218 | . . . . . 6 ⊢ ((𝑈 ∈ Univ ∧ 𝒫 𝒫 (𝐴 ∪ 𝐵) ∈ 𝑈 ∧ (𝐴 × 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝐵)) → (𝐴 × 𝐵) ∈ 𝑈) | |
6 | 4, 5 | mp3an3 1446 | . . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝒫 𝒫 (𝐴 ∪ 𝐵) ∈ 𝑈) → (𝐴 × 𝐵) ∈ 𝑈) |
7 | 3, 6 | syldan 593 | . . . 4 ⊢ ((𝑈 ∈ Univ ∧ 𝒫 (𝐴 ∪ 𝐵) ∈ 𝑈) → (𝐴 × 𝐵) ∈ 𝑈) |
8 | 2, 7 | syldan 593 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ (𝐴 ∪ 𝐵) ∈ 𝑈) → (𝐴 × 𝐵) ∈ 𝑈) |
9 | 8 | 3ad2antl1 1181 | . 2 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) ∧ (𝐴 ∪ 𝐵) ∈ 𝑈) → (𝐴 × 𝐵) ∈ 𝑈) |
10 | 1, 9 | mpdan 685 | 1 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → (𝐴 × 𝐵) ∈ 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1083 ∈ wcel 2114 ∪ cun 3934 ⊆ wss 3936 𝒫 cpw 4539 × cxp 5553 Univcgru 10212 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-fv 6363 df-ov 7159 df-oprab 7160 df-mpo 7161 df-map 8408 df-gru 10213 |
This theorem is referenced by: grumap 10230 |
Copyright terms: Public domain | W3C validator |