| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cnvxp | GIF version | ||
| Description: The converse of a cross product. Exercise 11 of [Suppes] p. 67. (Contributed by NM, 14-Aug-1999.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) |
| Ref | Expression |
|---|---|
| cnvxp | ⊢ ◡(𝐴 × 𝐵) = (𝐵 × 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnvopab 5071 | . . 3 ⊢ ◡{〈𝑦, 𝑥〉 ∣ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)} = {〈𝑥, 𝑦〉 ∣ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)} | |
| 2 | ancom 266 | . . . 4 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐴)) | |
| 3 | 2 | opabbii 4100 | . . 3 ⊢ {〈𝑥, 𝑦〉 ∣ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)} = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐴)} |
| 4 | 1, 3 | eqtri 2217 | . 2 ⊢ ◡{〈𝑦, 𝑥〉 ∣ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)} = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐴)} |
| 5 | df-xp 4669 | . . 3 ⊢ (𝐴 × 𝐵) = {〈𝑦, 𝑥〉 ∣ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)} | |
| 6 | 5 | cnveqi 4841 | . 2 ⊢ ◡(𝐴 × 𝐵) = ◡{〈𝑦, 𝑥〉 ∣ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)} |
| 7 | df-xp 4669 | . 2 ⊢ (𝐵 × 𝐴) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐴)} | |
| 8 | 4, 6, 7 | 3eqtr4i 2227 | 1 ⊢ ◡(𝐴 × 𝐵) = (𝐵 × 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 = wceq 1364 ∈ wcel 2167 {copab 4093 × cxp 4661 ◡ccnv 4662 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-14 2170 ax-ext 2178 ax-sep 4151 ax-pow 4207 ax-pr 4242 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ral 2480 df-rex 2481 df-v 2765 df-un 3161 df-in 3163 df-ss 3170 df-pw 3607 df-sn 3628 df-pr 3629 df-op 3631 df-br 4034 df-opab 4095 df-xp 4669 df-rel 4670 df-cnv 4671 |
| This theorem is referenced by: xp0 5089 rnxpm 5099 rnxpss 5101 dminxp 5114 imainrect 5115 tposfo 6329 tposf 6330 xpider 6665 xpcomf1o 6884 pw1nct 15647 |
| Copyright terms: Public domain | W3C validator |