![]() |
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 3463 | . 2 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V) | |
2 | relexpsucnnr 14910 | . . . . 5 ⊢ ((𝑅 ∈ V ∧ 𝑛 ∈ ℕ) → (𝑅↑𝑟(𝑛 + 1)) = ((𝑅↑𝑟𝑛) ∘ 𝑅)) | |
3 | relexpsucnnl 14915 | . . . . 5 ⊢ ((𝑅 ∈ V ∧ 𝑛 ∈ ℕ) → (𝑅↑𝑟(𝑛 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑛))) | |
4 | 2, 3 | eqtr3d 2778 | . . . 4 ⊢ ((𝑅 ∈ V ∧ 𝑛 ∈ ℕ) → ((𝑅↑𝑟𝑛) ∘ 𝑅) = (𝑅 ∘ (𝑅↑𝑟𝑛))) |
5 | 4 | iuneq2dv 4978 | . . 3 ⊢ (𝑅 ∈ V → ∪ 𝑛 ∈ ℕ ((𝑅↑𝑟𝑛) ∘ 𝑅) = ∪ 𝑛 ∈ ℕ (𝑅 ∘ (𝑅↑𝑟𝑛))) |
6 | oveq1 7364 | . . . . . . 7 ⊢ (𝑟 = 𝑅 → (𝑟↑𝑟𝑛) = (𝑅↑𝑟𝑛)) | |
7 | 6 | iuneq2d 4983 | . . . . . 6 ⊢ (𝑟 = 𝑅 → ∪ 𝑛 ∈ ℕ (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛)) |
8 | dftrcl3 41982 | . . . . . 6 ⊢ t+ = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ (𝑟↑𝑟𝑛)) | |
9 | nnex 12159 | . . . . . . 7 ⊢ ℕ ∈ V | |
10 | ovex 7390 | . . . . . . 7 ⊢ (𝑅↑𝑟𝑛) ∈ V | |
11 | 9, 10 | iunex 7901 | . . . . . 6 ⊢ ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛) ∈ V |
12 | 7, 8, 11 | fvmpt 6948 | . . . . 5 ⊢ (𝑅 ∈ V → (t+‘𝑅) = ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛)) |
13 | 12 | coeq1d 5817 | . . . 4 ⊢ (𝑅 ∈ V → ((t+‘𝑅) ∘ 𝑅) = (∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛) ∘ 𝑅)) |
14 | coiun1 41914 | . . . 4 ⊢ (∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛) ∘ 𝑅) = ∪ 𝑛 ∈ ℕ ((𝑅↑𝑟𝑛) ∘ 𝑅) | |
15 | 13, 14 | eqtrdi 2792 | . . 3 ⊢ (𝑅 ∈ V → ((t+‘𝑅) ∘ 𝑅) = ∪ 𝑛 ∈ ℕ ((𝑅↑𝑟𝑛) ∘ 𝑅)) |
16 | 12 | coeq2d 5818 | . . . 4 ⊢ (𝑅 ∈ V → (𝑅 ∘ (t+‘𝑅)) = (𝑅 ∘ ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛))) |
17 | coiun 6208 | . . . 4 ⊢ (𝑅 ∘ ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛)) = ∪ 𝑛 ∈ ℕ (𝑅 ∘ (𝑅↑𝑟𝑛)) | |
18 | 16, 17 | eqtrdi 2792 | . . 3 ⊢ (𝑅 ∈ V → (𝑅 ∘ (t+‘𝑅)) = ∪ 𝑛 ∈ ℕ (𝑅 ∘ (𝑅↑𝑟𝑛))) |
19 | 5, 15, 18 | 3eqtr4d 2786 | . 2 ⊢ (𝑅 ∈ V → ((t+‘𝑅) ∘ 𝑅) = (𝑅 ∘ (t+‘𝑅))) |
20 | 1, 19 | syl 17 | 1 ⊢ (𝑅 ∈ 𝑉 → ((t+‘𝑅) ∘ 𝑅) = (𝑅 ∘ (t+‘𝑅))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 Vcvv 3445 ∪ ciun 4954 ∘ ccom 5637 ‘cfv 6496 (class class class)co 7357 1c1 11052 + caddc 11054 ℕcn 12153 t+ctcl 14870 ↑𝑟crelexp 14904 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-cnex 11107 ax-resscn 11108 ax-1cn 11109 ax-icn 11110 ax-addcl 11111 ax-addrcl 11112 ax-mulcl 11113 ax-mulrcl 11114 ax-mulcom 11115 ax-addass 11116 ax-mulass 11117 ax-distr 11118 ax-i2m1 11119 ax-1ne0 11120 ax-1rid 11121 ax-rnegex 11122 ax-rrecex 11123 ax-cnre 11124 ax-pre-lttri 11125 ax-pre-lttrn 11126 ax-pre-ltadd 11127 ax-pre-mulgt0 11128 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-int 4908 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-om 7803 df-2nd 7922 df-frecs 8212 df-wrecs 8243 df-recs 8317 df-rdg 8356 df-er 8648 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11191 df-mnf 11192 df-xr 11193 df-ltxr 11194 df-le 11195 df-sub 11387 df-neg 11388 df-nn 12154 df-2 12216 df-n0 12414 df-z 12500 df-uz 12764 df-seq 13907 df-trcl 14872 df-relexp 14905 |
This theorem is referenced by: trclfvdecoml 41991 |
Copyright terms: Public domain | W3C validator |