| Mathbox for Andrew Salmon |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > xpexb | Structured version Visualization version GIF version | ||
| Description: A Cartesian product exists iff its converse does. Corollary 6.9(1) in [TakeutiZaring] p. 26. (Contributed by Andrew Salmon, 13-Nov-2011.) |
| Ref | Expression |
|---|---|
| xpexb | ⊢ ((𝐴 × 𝐵) ∈ V ↔ (𝐵 × 𝐴) ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnvxp 6154 | . . 3 ⊢ ◡(𝐴 × 𝐵) = (𝐵 × 𝐴) | |
| 2 | cnvexg 7917 | . . 3 ⊢ ((𝐴 × 𝐵) ∈ V → ◡(𝐴 × 𝐵) ∈ V) | |
| 3 | 1, 2 | eqeltrrid 2868 | . 2 ⊢ ((𝐴 × 𝐵) ∈ V → (𝐵 × 𝐴) ∈ V) |
| 4 | cnvxp 6154 | . . 3 ⊢ ◡(𝐵 × 𝐴) = (𝐴 × 𝐵) | |
| 5 | cnvexg 7917 | . . 3 ⊢ ((𝐵 × 𝐴) ∈ V → ◡(𝐵 × 𝐴) ∈ V) | |
| 6 | 4, 5 | eqeltrrid 2868 | . 2 ⊢ ((𝐵 × 𝐴) ∈ V → (𝐴 × 𝐵) ∈ V) |
| 7 | 3, 6 | impbii 212 | 1 ⊢ ((𝐴 × 𝐵) ∈ V ↔ (𝐵 × 𝐴) ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∈ wcel 2143 Vcvv 3455 × cxp 5659 ◡ccnv 5660 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-11 2192 ax-ext 2735 ax-sep 5257 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-xp 5667 df-rel 5668 df-cnv 5669 df-dm 5671 df-rn 5672 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |