![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cottrcl | Structured version Visualization version GIF version |
Description: Composition law for the transitive closure of a relation. (Contributed by Scott Fenton, 20-Oct-2024.) |
Ref | Expression |
---|---|
cottrcl | ⊢ (𝑅 ∘ t++𝑅) ⊆ t++𝑅 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | relres 6025 | . . . . 5 ⊢ Rel (𝑅 ↾ V) | |
2 | ssttrcl 9752 | . . . . 5 ⊢ (Rel (𝑅 ↾ V) → (𝑅 ↾ V) ⊆ t++(𝑅 ↾ V)) | |
3 | 1, 2 | ax-mp 5 | . . . 4 ⊢ (𝑅 ↾ V) ⊆ t++(𝑅 ↾ V) |
4 | coss1 5868 | . . . 4 ⊢ ((𝑅 ↾ V) ⊆ t++(𝑅 ↾ V) → ((𝑅 ↾ V) ∘ t++(𝑅 ↾ V)) ⊆ (t++(𝑅 ↾ V) ∘ t++(𝑅 ↾ V))) | |
5 | 3, 4 | ax-mp 5 | . . 3 ⊢ ((𝑅 ↾ V) ∘ t++(𝑅 ↾ V)) ⊆ (t++(𝑅 ↾ V) ∘ t++(𝑅 ↾ V)) |
6 | ttrcltr 9753 | . . 3 ⊢ (t++(𝑅 ↾ V) ∘ t++(𝑅 ↾ V)) ⊆ t++(𝑅 ↾ V) | |
7 | 5, 6 | sstri 4004 | . 2 ⊢ ((𝑅 ↾ V) ∘ t++(𝑅 ↾ V)) ⊆ t++(𝑅 ↾ V) |
8 | ssv 4019 | . . . 4 ⊢ ran t++(𝑅 ↾ V) ⊆ V | |
9 | cores 6270 | . . . 4 ⊢ (ran t++(𝑅 ↾ V) ⊆ V → ((𝑅 ↾ V) ∘ t++(𝑅 ↾ V)) = (𝑅 ∘ t++(𝑅 ↾ V))) | |
10 | 8, 9 | ax-mp 5 | . . 3 ⊢ ((𝑅 ↾ V) ∘ t++(𝑅 ↾ V)) = (𝑅 ∘ t++(𝑅 ↾ V)) |
11 | ttrclresv 9754 | . . . 4 ⊢ t++(𝑅 ↾ V) = t++𝑅 | |
12 | 11 | coeq2i 5873 | . . 3 ⊢ (𝑅 ∘ t++(𝑅 ↾ V)) = (𝑅 ∘ t++𝑅) |
13 | 10, 12 | eqtri 2762 | . 2 ⊢ ((𝑅 ↾ V) ∘ t++(𝑅 ↾ V)) = (𝑅 ∘ t++𝑅) |
14 | 7, 13, 11 | 3sstr3i 4037 | 1 ⊢ (𝑅 ∘ t++𝑅) ⊆ t++𝑅 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1536 Vcvv 3477 ⊆ wss 3962 ran crn 5689 ↾ cres 5690 ∘ ccom 5692 Rel wrel 5693 t++cttrcl 9744 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-rep 5284 ax-sep 5301 ax-nul 5311 ax-pr 5437 ax-un 7753 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-ral 3059 df-rex 3068 df-rmo 3377 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-int 4951 df-iun 4997 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5582 df-eprel 5588 df-po 5596 df-so 5597 df-fr 5640 df-we 5642 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-pred 6322 df-ord 6388 df-on 6389 df-lim 6390 df-suc 6391 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7887 df-2nd 8013 df-frecs 8304 df-wrecs 8335 df-recs 8409 df-rdg 8448 df-1o 8504 df-oadd 8508 df-ttrcl 9745 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |