Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > trclfvcom | Structured version Visualization version GIF version |
Description: The transitive closure of a relation commutes with the relation. (Contributed by RP, 18-Jul-2020.) |
Ref | Expression |
---|---|
trclfvcom | ⊢ (𝑅 ∈ 𝑉 → ((t+‘𝑅) ∘ 𝑅) = (𝑅 ∘ (t+‘𝑅))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3440 | . 2 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V) | |
2 | relexpsucnnr 14664 | . . . . 5 ⊢ ((𝑅 ∈ V ∧ 𝑛 ∈ ℕ) → (𝑅↑𝑟(𝑛 + 1)) = ((𝑅↑𝑟𝑛) ∘ 𝑅)) | |
3 | relexpsucnnl 14669 | . . . . 5 ⊢ ((𝑅 ∈ V ∧ 𝑛 ∈ ℕ) → (𝑅↑𝑟(𝑛 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑛))) | |
4 | 2, 3 | eqtr3d 2780 | . . . 4 ⊢ ((𝑅 ∈ V ∧ 𝑛 ∈ ℕ) → ((𝑅↑𝑟𝑛) ∘ 𝑅) = (𝑅 ∘ (𝑅↑𝑟𝑛))) |
5 | 4 | iuneq2dv 4945 | . . 3 ⊢ (𝑅 ∈ V → ∪ 𝑛 ∈ ℕ ((𝑅↑𝑟𝑛) ∘ 𝑅) = ∪ 𝑛 ∈ ℕ (𝑅 ∘ (𝑅↑𝑟𝑛))) |
6 | oveq1 7262 | . . . . . . 7 ⊢ (𝑟 = 𝑅 → (𝑟↑𝑟𝑛) = (𝑅↑𝑟𝑛)) | |
7 | 6 | iuneq2d 4950 | . . . . . 6 ⊢ (𝑟 = 𝑅 → ∪ 𝑛 ∈ ℕ (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛)) |
8 | dftrcl3 41217 | . . . . . 6 ⊢ t+ = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ (𝑟↑𝑟𝑛)) | |
9 | nnex 11909 | . . . . . . 7 ⊢ ℕ ∈ V | |
10 | ovex 7288 | . . . . . . 7 ⊢ (𝑅↑𝑟𝑛) ∈ V | |
11 | 9, 10 | iunex 7784 | . . . . . 6 ⊢ ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛) ∈ V |
12 | 7, 8, 11 | fvmpt 6857 | . . . . 5 ⊢ (𝑅 ∈ V → (t+‘𝑅) = ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛)) |
13 | 12 | coeq1d 5759 | . . . 4 ⊢ (𝑅 ∈ V → ((t+‘𝑅) ∘ 𝑅) = (∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛) ∘ 𝑅)) |
14 | coiun1 41149 | . . . 4 ⊢ (∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛) ∘ 𝑅) = ∪ 𝑛 ∈ ℕ ((𝑅↑𝑟𝑛) ∘ 𝑅) | |
15 | 13, 14 | eqtrdi 2795 | . . 3 ⊢ (𝑅 ∈ V → ((t+‘𝑅) ∘ 𝑅) = ∪ 𝑛 ∈ ℕ ((𝑅↑𝑟𝑛) ∘ 𝑅)) |
16 | 12 | coeq2d 5760 | . . . 4 ⊢ (𝑅 ∈ V → (𝑅 ∘ (t+‘𝑅)) = (𝑅 ∘ ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛))) |
17 | coiun 6149 | . . . 4 ⊢ (𝑅 ∘ ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛)) = ∪ 𝑛 ∈ ℕ (𝑅 ∘ (𝑅↑𝑟𝑛)) | |
18 | 16, 17 | eqtrdi 2795 | . . 3 ⊢ (𝑅 ∈ V → (𝑅 ∘ (t+‘𝑅)) = ∪ 𝑛 ∈ ℕ (𝑅 ∘ (𝑅↑𝑟𝑛))) |
19 | 5, 15, 18 | 3eqtr4d 2788 | . 2 ⊢ (𝑅 ∈ V → ((t+‘𝑅) ∘ 𝑅) = (𝑅 ∘ (t+‘𝑅))) |
20 | 1, 19 | syl 17 | 1 ⊢ (𝑅 ∈ 𝑉 → ((t+‘𝑅) ∘ 𝑅) = (𝑅 ∘ (t+‘𝑅))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 Vcvv 3422 ∪ ciun 4921 ∘ ccom 5584 ‘cfv 6418 (class class class)co 7255 1c1 10803 + caddc 10805 ℕcn 11903 t+ctcl 14624 ↑𝑟crelexp 14658 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-n0 12164 df-z 12250 df-uz 12512 df-seq 13650 df-trcl 14626 df-relexp 14659 |
This theorem is referenced by: trclfvdecoml 41226 |
Copyright terms: Public domain | W3C validator |