| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cossxp2 | GIF version | ||
| Description: The composition of two relations is a relation, with bounds on its domain and codomain. (Contributed by BJ, 10-Jul-2022.) |
| Ref | Expression |
|---|---|
| cossxp2.r | ⊢ (𝜑 → 𝑅 ⊆ (𝐴 × 𝐵)) |
| cossxp2.s | ⊢ (𝜑 → 𝑆 ⊆ (𝐵 × 𝐶)) |
| Ref | Expression |
|---|---|
| cossxp2 | ⊢ (𝜑 → (𝑆 ∘ 𝑅) ⊆ (𝐴 × 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cossxp 5227 | . 2 ⊢ (𝑆 ∘ 𝑅) ⊆ (dom 𝑅 × ran 𝑆) | |
| 2 | cossxp2.r | . . . 4 ⊢ (𝜑 → 𝑅 ⊆ (𝐴 × 𝐵)) | |
| 3 | dmxpss2 5137 | . . . 4 ⊢ (𝑅 ⊆ (𝐴 × 𝐵) → dom 𝑅 ⊆ 𝐴) | |
| 4 | 2, 3 | syl 14 | . . 3 ⊢ (𝜑 → dom 𝑅 ⊆ 𝐴) |
| 5 | cossxp2.s | . . . 4 ⊢ (𝜑 → 𝑆 ⊆ (𝐵 × 𝐶)) | |
| 6 | rnxpss2 5138 | . . . 4 ⊢ (𝑆 ⊆ (𝐵 × 𝐶) → ran 𝑆 ⊆ 𝐶) | |
| 7 | 5, 6 | syl 14 | . . 3 ⊢ (𝜑 → ran 𝑆 ⊆ 𝐶) |
| 8 | xpss12 4803 | . . 3 ⊢ ((dom 𝑅 ⊆ 𝐴 ∧ ran 𝑆 ⊆ 𝐶) → (dom 𝑅 × ran 𝑆) ⊆ (𝐴 × 𝐶)) | |
| 9 | 4, 7, 8 | syl2anc 411 | . 2 ⊢ (𝜑 → (dom 𝑅 × ran 𝑆) ⊆ (𝐴 × 𝐶)) |
| 10 | 1, 9 | sstrid 3215 | 1 ⊢ (𝜑 → (𝑆 ∘ 𝑅) ⊆ (𝐴 × 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ⊆ wss 3177 × cxp 4694 dom cdm 4696 ran crn 4697 ∘ ccom 4700 |
| 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 713 ax-5 1473 ax-7 1474 ax-gen 1475 ax-ie1 1519 ax-ie2 1520 ax-8 1530 ax-10 1531 ax-11 1532 ax-i12 1533 ax-bndl 1535 ax-4 1536 ax-17 1552 ax-i9 1556 ax-ial 1560 ax-i5r 1561 ax-14 2183 ax-ext 2191 ax-sep 4181 ax-pow 4237 ax-pr 4272 |
| This theorem depends on definitions: df-bi 117 df-3an 985 df-tru 1378 df-nf 1487 df-sb 1789 df-eu 2060 df-mo 2061 df-clab 2196 df-cleq 2202 df-clel 2205 df-nfc 2341 df-ral 2493 df-rex 2494 df-v 2781 df-un 3181 df-in 3183 df-ss 3190 df-pw 3631 df-sn 3652 df-pr 3653 df-op 3655 df-br 4063 df-opab 4125 df-xp 4702 df-rel 4703 df-cnv 4704 df-co 4705 df-dm 4706 df-rn 4707 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |