| 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 4133 | . . . . . . . 8 ⊢ (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) ⊆ dom (𝐴 × 𝐵) | |
| 2 | dmxpss 6162 | . . . . . . . 8 ⊢ dom (𝐴 × 𝐵) ⊆ 𝐴 | |
| 3 | 1, 2 | sstri 3917 | . . . . . . 7 ⊢ (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) ⊆ 𝐴 |
| 4 | inss2 4134 | . . . . . . . 8 ⊢ (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) ⊆ ran (𝐴 × 𝐵) | |
| 5 | rnxpss 6163 | . . . . . . . 8 ⊢ ran (𝐴 × 𝐵) ⊆ 𝐵 | |
| 6 | 4, 5 | sstri 3917 | . . . . . . 7 ⊢ (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) ⊆ 𝐵 |
| 7 | 3, 6 | ssini 4136 | . . . . . 6 ⊢ (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) ⊆ (𝐴 ∩ 𝐵) |
| 8 | eqimss 3966 | . . . . . 6 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐴 ∩ 𝐵) ⊆ ∅) | |
| 9 | 7, 8 | sstrid 3919 | . . . . 5 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) ⊆ ∅) |
| 10 | ss0 4351 | . . . . 5 ⊢ ((dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) ⊆ ∅ → (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) = ∅) | |
| 11 | 9, 10 | syl 18 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (dom (𝐴 × 𝐵) ∩ ran (𝐴 × 𝐵)) = ∅) |
| 12 | 11 | coemptyd 15137 | . . 3 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 × 𝐵) ∘ (𝐴 × 𝐵)) = ∅) |
| 13 | 0ss 4349 | . . 3 ⊢ ∅ ⊆ (𝐴 × 𝐵) | |
| 14 | 12, 13 | eqsstrdi 3952 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 × 𝐵) ∘ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵)) |
| 15 | neqne 2963 | . . . 4 ⊢ (¬ (𝐴 ∩ 𝐵) = ∅ → (𝐴 ∩ 𝐵) ≠ ∅) | |
| 16 | 15 | xpcoidgend 15133 | . . 3 ⊢ (¬ (𝐴 ∩ 𝐵) = ∅ → ((𝐴 × 𝐵) ∘ (𝐴 × 𝐵)) = (𝐴 × 𝐵)) |
| 17 | ssid 3930 | . . 3 ⊢ (𝐴 × 𝐵) ⊆ (𝐴 × 𝐵) | |
| 18 | 16, 17 | eqsstrdi 3952 | . 2 ⊢ (¬ (𝐴 ∩ 𝐵) = ∅ → ((𝐴 × 𝐵) ∘ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵)) |
| 19 | 14, 18 | pm2.61i 184 | 1 ⊢ ((𝐴 × 𝐵) ∘ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1569 ⊆ wss 3895 ∩ cin 4089 ∅c0 4278 × cxp 5648 dom cdm 5650 ran crn 5651 ∘ ccom 5654 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-br 5103 df-opab 5167 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 |
| This theorem is used by: trclublem 15153 trclubgNEW 44711 trclexi 44713 cnvtrcl0 44719 xpintrreld 44759 trrelsuperreldg 44761 trrelsuperrel2dg 44764 |
| Copyright terms: Public domain | W3C validator |