| 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 5261 | . 2 ⊢ (𝑆 ∘ 𝑅) ⊆ (dom 𝑅 × ran 𝑆) | |
| 2 | cossxp2.r | . . . 4 ⊢ (𝜑 → 𝑅 ⊆ (𝐴 × 𝐵)) | |
| 3 | dmxpss2 5171 | . . . 4 ⊢ (𝑅 ⊆ (𝐴 × 𝐵) → dom 𝑅 ⊆ 𝐴) | |
| 4 | 2, 3 | syl 14 | . . 3 ⊢ (𝜑 → dom 𝑅 ⊆ 𝐴) |
| 5 | cossxp2.s | . . . 4 ⊢ (𝜑 → 𝑆 ⊆ (𝐵 × 𝐶)) | |
| 6 | rnxpss2 5172 | . . . 4 ⊢ (𝑆 ⊆ (𝐵 × 𝐶) → ran 𝑆 ⊆ 𝐶) | |
| 7 | 5, 6 | syl 14 | . . 3 ⊢ (𝜑 → ran 𝑆 ⊆ 𝐶) |
| 8 | xpss12 4835 | . . 3 ⊢ ((dom 𝑅 ⊆ 𝐴 ∧ ran 𝑆 ⊆ 𝐶) → (dom 𝑅 × ran 𝑆) ⊆ (𝐴 × 𝐶)) | |
| 9 | 4, 7, 8 | syl2anc 411 | . 2 ⊢ (𝜑 → (dom 𝑅 × ran 𝑆) ⊆ (𝐴 × 𝐶)) |
| 10 | 1, 9 | sstrid 3237 | 1 ⊢ (𝜑 → (𝑆 ∘ 𝑅) ⊆ (𝐴 × 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ⊆ wss 3199 × cxp 4725 dom cdm 4727 ran crn 4728 ∘ ccom 4731 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2204 ax-ext 2212 ax-sep 4208 ax-pow 4266 ax-pr 4301 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ral 2514 df-rex 2515 df-v 2803 df-un 3203 df-in 3205 df-ss 3212 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-br 4090 df-opab 4152 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |