| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > txswaphmeolem | GIF version | ||
| Description: Show inverse for the "swap components" operation on a Cartesian product. (Contributed by Mario Carneiro, 21-Mar-2015.) |
| Ref | Expression |
|---|---|
| txswaphmeolem | ⊢ ((𝑦 ∈ 𝑌, 𝑥 ∈ 𝑋 ↦ 〈𝑥, 𝑦〉) ∘ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 〈𝑦, 𝑥〉)) = ( I ↾ (𝑋 × 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 19 | . . 3 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → 𝑧 = 〈𝑥, 𝑦〉) | |
| 2 | 1 | mpompt 6180 | . 2 ⊢ (𝑧 ∈ (𝑋 × 𝑌) ↦ 𝑧) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 〈𝑥, 𝑦〉) |
| 3 | mptresid 5117 | . 2 ⊢ ( I ↾ (𝑋 × 𝑌)) = (𝑧 ∈ (𝑋 × 𝑌) ↦ 𝑧) | |
| 4 | opelxpi 4806 | . . . . . 6 ⊢ ((𝑦 ∈ 𝑌 ∧ 𝑥 ∈ 𝑋) → 〈𝑦, 𝑥〉 ∈ (𝑌 × 𝑋)) | |
| 5 | 4 | ancoms 268 | . . . . 5 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑌) → 〈𝑦, 𝑥〉 ∈ (𝑌 × 𝑋)) |
| 6 | 5 | adantl 277 | . . . 4 ⊢ ((⊤ ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑌)) → 〈𝑦, 𝑥〉 ∈ (𝑌 × 𝑋)) |
| 7 | eqidd 2239 | . . . 4 ⊢ (⊤ → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 〈𝑦, 𝑥〉) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 〈𝑦, 𝑥〉)) | |
| 8 | sneq 3720 | . . . . . . . . . 10 ⊢ (𝑧 = 〈𝑦, 𝑥〉 → {𝑧} = {〈𝑦, 𝑥〉}) | |
| 9 | 8 | cnveqd 4956 | . . . . . . . . 9 ⊢ (𝑧 = 〈𝑦, 𝑥〉 → ◡{𝑧} = ◡{〈𝑦, 𝑥〉}) |
| 10 | 9 | unieqd 3946 | . . . . . . . 8 ⊢ (𝑧 = 〈𝑦, 𝑥〉 → ∪ ◡{𝑧} = ∪ ◡{〈𝑦, 𝑥〉}) |
| 11 | vex 2824 | . . . . . . . . 9 ⊢ 𝑦 ∈ V | |
| 12 | vex 2824 | . . . . . . . . 9 ⊢ 𝑥 ∈ V | |
| 13 | opswapg 5274 | . . . . . . . . 9 ⊢ ((𝑦 ∈ V ∧ 𝑥 ∈ V) → ∪ ◡{〈𝑦, 𝑥〉} = 〈𝑥, 𝑦〉) | |
| 14 | 11, 12, 13 | mp2an 430 | . . . . . . . 8 ⊢ ∪ ◡{〈𝑦, 𝑥〉} = 〈𝑥, 𝑦〉 |
| 15 | 10, 14 | eqtrdi 2287 | . . . . . . 7 ⊢ (𝑧 = 〈𝑦, 𝑥〉 → ∪ ◡{𝑧} = 〈𝑥, 𝑦〉) |
| 16 | 15 | mpompt 6180 | . . . . . 6 ⊢ (𝑧 ∈ (𝑌 × 𝑋) ↦ ∪ ◡{𝑧}) = (𝑦 ∈ 𝑌, 𝑥 ∈ 𝑋 ↦ 〈𝑥, 𝑦〉) |
| 17 | 16 | eqcomi 2242 | . . . . 5 ⊢ (𝑦 ∈ 𝑌, 𝑥 ∈ 𝑋 ↦ 〈𝑥, 𝑦〉) = (𝑧 ∈ (𝑌 × 𝑋) ↦ ∪ ◡{𝑧}) |
| 18 | 17 | a1i 9 | . . . 4 ⊢ (⊤ → (𝑦 ∈ 𝑌, 𝑥 ∈ 𝑋 ↦ 〈𝑥, 𝑦〉) = (𝑧 ∈ (𝑌 × 𝑋) ↦ ∪ ◡{𝑧})) |
| 19 | 6, 7, 18, 15 | fmpoco 6452 | . . 3 ⊢ (⊤ → ((𝑦 ∈ 𝑌, 𝑥 ∈ 𝑋 ↦ 〈𝑥, 𝑦〉) ∘ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 〈𝑦, 𝑥〉)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 〈𝑥, 𝑦〉)) |
| 20 | 19 | mptru 1411 | . 2 ⊢ ((𝑦 ∈ 𝑌, 𝑥 ∈ 𝑋 ↦ 〈𝑥, 𝑦〉) ∘ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 〈𝑦, 𝑥〉)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 〈𝑥, 𝑦〉) |
| 21 | 2, 3, 20 | 3eqtr4ri 2270 | 1 ⊢ ((𝑦 ∈ 𝑌, 𝑥 ∈ 𝑋 ↦ 〈𝑥, 𝑦〉) ∘ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 〈𝑦, 𝑥〉)) = ( I ↾ (𝑋 × 𝑌)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ∧ wa 104 = wceq 1402 ⊤wtru 1403 ∈ wcel 2209 Vcvv 2821 {csn 3709 〈cop 3712 ∪ cuni 3935 ↦ cmpt 4192 I cid 4433 × cxp 4772 ◡ccnv 4773 ↾ cres 4776 ∘ ccom 4778 ∈ cmpo 6087 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-fv 5385 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 |
| This theorem is used by: txswaphmeo 15422 |
| Copyright terms: Public domain | W3C validator |