| 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 7764 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑉 ∈ 𝑊) → (𝑉 × 𝑉) ∈ V) | |
| 2 | 1 | anidms 577 | . 2 ⊢ (𝑉 ∈ 𝑊 → (𝑉 × 𝑉) ∈ V) |
| 3 | xpexg 7764 | . 2 ⊢ (((𝑉 × 𝑉) ∈ V ∧ 𝑉 ∈ 𝑊) → ((𝑉 × 𝑉) × 𝑉) ∈ V) | |
| 4 | 2, 3 | mpancom 701 | 1 ⊢ (𝑉 ∈ 𝑊 → ((𝑉 × 𝑉) × 𝑉) ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2144 Vcvv 3450 × cxp 5648 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-opab 5167 df-xp 5656 df-rel 5657 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |