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 3512 | . 2 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V) | |
2 | relexpsucnnr 14378 | . . . . 5 ⊢ ((𝑅 ∈ V ∧ 𝑛 ∈ ℕ) → (𝑅↑𝑟(𝑛 + 1)) = ((𝑅↑𝑟𝑛) ∘ 𝑅)) | |
3 | relexpsucnnl 14385 | . . . . 5 ⊢ ((𝑅 ∈ V ∧ 𝑛 ∈ ℕ) → (𝑅↑𝑟(𝑛 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑛))) | |
4 | 2, 3 | eqtr3d 2858 | . . . 4 ⊢ ((𝑅 ∈ V ∧ 𝑛 ∈ ℕ) → ((𝑅↑𝑟𝑛) ∘ 𝑅) = (𝑅 ∘ (𝑅↑𝑟𝑛))) |
5 | 4 | iuneq2dv 4935 | . . 3 ⊢ (𝑅 ∈ V → ∪ 𝑛 ∈ ℕ ((𝑅↑𝑟𝑛) ∘ 𝑅) = ∪ 𝑛 ∈ ℕ (𝑅 ∘ (𝑅↑𝑟𝑛))) |
6 | oveq1 7157 | . . . . . . 7 ⊢ (𝑟 = 𝑅 → (𝑟↑𝑟𝑛) = (𝑅↑𝑟𝑛)) | |
7 | 6 | iuneq2d 4940 | . . . . . 6 ⊢ (𝑟 = 𝑅 → ∪ 𝑛 ∈ ℕ (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛)) |
8 | dftrcl3 40058 | . . . . . 6 ⊢ t+ = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ (𝑟↑𝑟𝑛)) | |
9 | nnex 11638 | . . . . . . 7 ⊢ ℕ ∈ V | |
10 | ovex 7183 | . . . . . . 7 ⊢ (𝑅↑𝑟𝑛) ∈ V | |
11 | 9, 10 | iunex 7663 | . . . . . 6 ⊢ ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛) ∈ V |
12 | 7, 8, 11 | fvmpt 6762 | . . . . 5 ⊢ (𝑅 ∈ V → (t+‘𝑅) = ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛)) |
13 | 12 | coeq1d 5726 | . . . 4 ⊢ (𝑅 ∈ V → ((t+‘𝑅) ∘ 𝑅) = (∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛) ∘ 𝑅)) |
14 | coiun1 39990 | . . . 4 ⊢ (∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛) ∘ 𝑅) = ∪ 𝑛 ∈ ℕ ((𝑅↑𝑟𝑛) ∘ 𝑅) | |
15 | 13, 14 | syl6eq 2872 | . . 3 ⊢ (𝑅 ∈ V → ((t+‘𝑅) ∘ 𝑅) = ∪ 𝑛 ∈ ℕ ((𝑅↑𝑟𝑛) ∘ 𝑅)) |
16 | 12 | coeq2d 5727 | . . . 4 ⊢ (𝑅 ∈ V → (𝑅 ∘ (t+‘𝑅)) = (𝑅 ∘ ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛))) |
17 | coiun 6103 | . . . 4 ⊢ (𝑅 ∘ ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛)) = ∪ 𝑛 ∈ ℕ (𝑅 ∘ (𝑅↑𝑟𝑛)) | |
18 | 16, 17 | syl6eq 2872 | . . 3 ⊢ (𝑅 ∈ V → (𝑅 ∘ (t+‘𝑅)) = ∪ 𝑛 ∈ ℕ (𝑅 ∘ (𝑅↑𝑟𝑛))) |
19 | 5, 15, 18 | 3eqtr4d 2866 | . 2 ⊢ (𝑅 ∈ V → ((t+‘𝑅) ∘ 𝑅) = (𝑅 ∘ (t+‘𝑅))) |
20 | 1, 19 | syl 17 | 1 ⊢ (𝑅 ∈ 𝑉 → ((t+‘𝑅) ∘ 𝑅) = (𝑅 ∘ (t+‘𝑅))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 Vcvv 3494 ∪ ciun 4911 ∘ ccom 5553 ‘cfv 6349 (class class class)co 7150 1c1 10532 + caddc 10534 ℕcn 11632 t+ctcl 14339 ↑𝑟crelexp 14373 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-n0 11892 df-z 11976 df-uz 12238 df-seq 13364 df-trcl 14341 df-relexp 14374 |
This theorem is referenced by: trclfvdecoml 40067 |
Copyright terms: Public domain | W3C validator |