| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xptrrel | Structured version Visualization version GIF version | ||
| Description: The cross product is always a transitive relation. (Contributed by RP, 24-Dec-2019.) |
| Ref | Expression |
|---|---|
| xptrrel | ⊢ ((𝐴 × 𝐵) ∘ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | inss1 4185 | . . . . . . . 8 ⊢ (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) ⊆ dom (𝐴 × 𝐵) | |
| 2 | dmxpss 6168 | . . . . . . . 8 ⊢ dom (𝐴 × 𝐵) ⊆ 𝐴 | |
| 3 | 1, 2 | sstri 3943 | . . . . . . 7 ⊢ (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) ⊆ 𝐴 |
| 4 | inss2 4186 | . . . . . . . 8 ⊢ (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) ⊆ ran (𝐴 × 𝐵) | |
| 5 | rnxpss 6169 | . . . . . . . 8 ⊢ ran (𝐴 × 𝐵) ⊆ 𝐵 | |
| 6 | 4, 5 | sstri 3943 | . . . . . . 7 ⊢ (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) ⊆ 𝐵 |
| 7 | 3, 6 | ssini 4188 | . . . . . 6 ⊢ (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) ⊆ (𝐴 ∩ 𝐵) |
| 8 | eqimss 3992 | . . . . . 6 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐴 ∩ 𝐵) ⊆ ∅) | |
| 9 | 7, 8 | sstrid 3945 | . . . . 5 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) ⊆ ∅) |
| 10 | ss0 4355 | . . . . 5 ⊢ ((dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) ⊆ ∅ → (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) = ∅) | |
| 11 | 9, 10 | syl 18 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) = ∅) |
| 12 | 11 | coemptyd 15056 | . . 3 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 × 𝐵) ∘ (𝐴 × 𝐵)) = ∅) |
| 13 | 0ss 4353 | . . 3 ⊢ ∅ ⊆ (𝐴 × 𝐵) | |
| 14 | 12, 13 | eqsstrdi 3978 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 × 𝐵) ∘ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵)) |
| 15 | neqne 2965 | . . . 4 ⊢ (¬ (𝐴 ∩ 𝐵) = ∅ → (𝐴 ∩ 𝐵) ≠ ∅) | |
| 16 | 15 | xpcoidgend 15052 | . . 3 ⊢ (¬ (𝐴 ∩ 𝐵) = ∅ → ((𝐴 × 𝐵) ∘ (𝐴 × 𝐵)) = (𝐴 × 𝐵)) |
| 17 | ssid 3956 | . . 3 ⊢ (𝐴 × 𝐵) ⊆ (𝐴 × 𝐵) | |
| 18 | 16, 17 | eqsstrdi 3978 | . 2 ⊢ (¬ (𝐴 ∩ 𝐵) = ∅ → ((𝐴 × 𝐵) ∘ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵)) |
| 19 | 14, 18 | pm2.61i 184 | 1 ⊢ ((𝐴 × 𝐵) ∘ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1570 ∩ cin 3901 ⊆ wss 3902 ∅c0 4282 × cxp 5657 dom cdm 5659 ran crn 5660 ∘ ccom 5663 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2734 ax-sep 5255 ax-pr 5402 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 |
| This theorem is used by: trclublem 15072 trclubgNEW 44466 trclexi 44468 cnvtrcl0 44474 xpintrreld 44514 trrelsuperreldg 44516 trrelsuperrel2dg 44519 |
| Copyright terms: Public domain | W3C validator |