![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > sqxpexg | Structured version Visualization version GIF version |
Description: The Cartesian square of a set is a set. (Contributed by AV, 13-Jan-2020.) |
Ref | Expression |
---|---|
sqxpexg | ⊢ (𝐴 ∈ 𝑉 → (𝐴 × 𝐴) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xpexg 7769 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) → (𝐴 × 𝐴) ∈ V) | |
2 | 1 | anidms 566 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 × 𝐴) ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2106 Vcvv 3478 × cxp 5687 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-opab 5211 df-xp 5695 df-rel 5696 |
This theorem is referenced by: resiexg 7935 erex 8768 hartogslem2 9581 harwdom 9629 dfac8b 10069 ac10ct 10072 canthwe 10689 cicer 17854 ssclem 17867 ipolerval 18590 dfrngc2 20645 dfringc2 20674 rngcresringcat 20686 mat0op 22441 matecl 22447 matlmod 22451 mattposvs 22477 ustval 24227 isust 24228 restutopopn 24263 ressuss 24287 ispsmet 24330 ismet 24349 isxmet 24350 satef 35401 satefvfmla0 35403 satefvfmla1 35410 fin2so 37594 rtrclexlem 43606 isclintop 48051 isassintop 48054 rngccofvalALTV 48114 ringccofvalALTV 48148 2arymaptf 48502 |
Copyright terms: Public domain | W3C validator |