Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 3xpexg | Structured version Visualization version GIF version |
Description: The Cartesian product of three sets is a set. (Contributed by Alexander van der Vekens, 21-Feb-2018.) |
Ref | Expression |
---|---|
3xpexg | ⊢ (𝑉 ∈ 𝑊 → ((𝑉 × 𝑉) × 𝑉) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xpexg 6858 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑉 ∈ 𝑊) → (𝑉 × 𝑉) ∈ V) | |
2 | 1 | anidms 675 | . 2 ⊢ (𝑉 ∈ 𝑊 → (𝑉 × 𝑉) ∈ V) |
3 | xpexg 6858 | . 2 ⊢ (((𝑉 × 𝑉) ∈ V ∧ 𝑉 ∈ 𝑊) → ((𝑉 × 𝑉) × 𝑉) ∈ V) | |
4 | 2, 3 | mpancom 700 | 1 ⊢ (𝑉 ∈ 𝑊 → ((𝑉 × 𝑉) × 𝑉) ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 1977 Vcvv 3173 × cxp 5036 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-opab 4644 df-xp 5044 df-rel 5045 |
This theorem is referenced by: 2wlkonot 26392 2spthonot 26393 2wlksot 26394 2spthsot 26395 usg2spot2nb 26592 usgreg2spot 26594 2spotmdisj 26595 |
Copyright terms: Public domain | W3C validator |