![]() |
Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > cnvtrclfv | Structured version Visualization version GIF version |
Description: The converse of the transitive closure is equal to the transitive closure of the converse relation. (Contributed by RP, 19-Jul-2020.) |
Ref | Expression |
---|---|
cnvtrclfv | ⊢ (𝑅 ∈ 𝑉 → ◡(t+‘𝑅) = (t+‘◡𝑅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3502 | . 2 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V) | |
2 | nnnn0 12540 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ0) | |
3 | relexpcnv 15080 | . . . . . . 7 ⊢ ((𝑛 ∈ ℕ0 ∧ 𝑅 ∈ V) → ◡(𝑅↑𝑟𝑛) = (◡𝑅↑𝑟𝑛)) | |
4 | 2, 3 | sylan 580 | . . . . . 6 ⊢ ((𝑛 ∈ ℕ ∧ 𝑅 ∈ V) → ◡(𝑅↑𝑟𝑛) = (◡𝑅↑𝑟𝑛)) |
5 | 4 | expcom 413 | . . . . 5 ⊢ (𝑅 ∈ V → (𝑛 ∈ ℕ → ◡(𝑅↑𝑟𝑛) = (◡𝑅↑𝑟𝑛))) |
6 | 5 | ralrimiv 3145 | . . . 4 ⊢ (𝑅 ∈ V → ∀𝑛 ∈ ℕ ◡(𝑅↑𝑟𝑛) = (◡𝑅↑𝑟𝑛)) |
7 | iuneq2 5019 | . . . 4 ⊢ (∀𝑛 ∈ ℕ ◡(𝑅↑𝑟𝑛) = (◡𝑅↑𝑟𝑛) → ∪ 𝑛 ∈ ℕ ◡(𝑅↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ (◡𝑅↑𝑟𝑛)) | |
8 | 6, 7 | syl 17 | . . 3 ⊢ (𝑅 ∈ V → ∪ 𝑛 ∈ ℕ ◡(𝑅↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ (◡𝑅↑𝑟𝑛)) |
9 | oveq1 7445 | . . . . . . 7 ⊢ (𝑟 = 𝑅 → (𝑟↑𝑟𝑛) = (𝑅↑𝑟𝑛)) | |
10 | 9 | iuneq2d 5030 | . . . . . 6 ⊢ (𝑟 = 𝑅 → ∪ 𝑛 ∈ ℕ (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛)) |
11 | dftrcl3 43726 | . . . . . 6 ⊢ t+ = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ (𝑟↑𝑟𝑛)) | |
12 | nnex 12279 | . . . . . . 7 ⊢ ℕ ∈ V | |
13 | ovex 7471 | . . . . . . 7 ⊢ (𝑅↑𝑟𝑛) ∈ V | |
14 | 12, 13 | iunex 8001 | . . . . . 6 ⊢ ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛) ∈ V |
15 | 10, 11, 14 | fvmpt 7023 | . . . . 5 ⊢ (𝑅 ∈ V → (t+‘𝑅) = ∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛)) |
16 | 15 | cnveqd 5893 | . . . 4 ⊢ (𝑅 ∈ V → ◡(t+‘𝑅) = ◡∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛)) |
17 | cnviun 43656 | . . . 4 ⊢ ◡∪ 𝑛 ∈ ℕ (𝑅↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ ◡(𝑅↑𝑟𝑛) | |
18 | 16, 17 | eqtrdi 2793 | . . 3 ⊢ (𝑅 ∈ V → ◡(t+‘𝑅) = ∪ 𝑛 ∈ ℕ ◡(𝑅↑𝑟𝑛)) |
19 | cnvexg 7954 | . . . 4 ⊢ (𝑅 ∈ V → ◡𝑅 ∈ V) | |
20 | oveq1 7445 | . . . . . 6 ⊢ (𝑠 = ◡𝑅 → (𝑠↑𝑟𝑛) = (◡𝑅↑𝑟𝑛)) | |
21 | 20 | iuneq2d 5030 | . . . . 5 ⊢ (𝑠 = ◡𝑅 → ∪ 𝑛 ∈ ℕ (𝑠↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ (◡𝑅↑𝑟𝑛)) |
22 | dftrcl3 43726 | . . . . 5 ⊢ t+ = (𝑠 ∈ V ↦ ∪ 𝑛 ∈ ℕ (𝑠↑𝑟𝑛)) | |
23 | ovex 7471 | . . . . . 6 ⊢ (◡𝑅↑𝑟𝑛) ∈ V | |
24 | 12, 23 | iunex 8001 | . . . . 5 ⊢ ∪ 𝑛 ∈ ℕ (◡𝑅↑𝑟𝑛) ∈ V |
25 | 21, 22, 24 | fvmpt 7023 | . . . 4 ⊢ (◡𝑅 ∈ V → (t+‘◡𝑅) = ∪ 𝑛 ∈ ℕ (◡𝑅↑𝑟𝑛)) |
26 | 19, 25 | syl 17 | . . 3 ⊢ (𝑅 ∈ V → (t+‘◡𝑅) = ∪ 𝑛 ∈ ℕ (◡𝑅↑𝑟𝑛)) |
27 | 8, 18, 26 | 3eqtr4d 2787 | . 2 ⊢ (𝑅 ∈ V → ◡(t+‘𝑅) = (t+‘◡𝑅)) |
28 | 1, 27 | syl 17 | 1 ⊢ (𝑅 ∈ 𝑉 → ◡(t+‘𝑅) = (t+‘◡𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2108 ∀wral 3061 Vcvv 3481 ∪ ciun 4999 ◡ccnv 5692 ‘cfv 6569 (class class class)co 7438 ℕcn 12273 ℕ0cn0 12533 t+ctcl 15030 ↑𝑟crelexp 15064 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5288 ax-sep 5305 ax-nul 5315 ax-pow 5374 ax-pr 5441 ax-un 7761 ax-cnex 11218 ax-resscn 11219 ax-1cn 11220 ax-icn 11221 ax-addcl 11222 ax-addrcl 11223 ax-mulcl 11224 ax-mulrcl 11225 ax-mulcom 11226 ax-addass 11227 ax-mulass 11228 ax-distr 11229 ax-i2m1 11230 ax-1ne0 11231 ax-1rid 11232 ax-rnegex 11233 ax-rrecex 11234 ax-cnre 11235 ax-pre-lttri 11236 ax-pre-lttrn 11237 ax-pre-ltadd 11238 ax-pre-mulgt0 11239 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3483 df-sbc 3795 df-csb 3912 df-dif 3969 df-un 3971 df-in 3973 df-ss 3983 df-pss 3986 df-nul 4343 df-if 4535 df-pw 4610 df-sn 4635 df-pr 4637 df-op 4641 df-uni 4916 df-int 4955 df-iun 5001 df-br 5152 df-opab 5214 df-mpt 5235 df-tr 5269 df-id 5587 df-eprel 5593 df-po 5601 df-so 5602 df-fr 5645 df-we 5647 df-xp 5699 df-rel 5700 df-cnv 5701 df-co 5702 df-dm 5703 df-rn 5704 df-res 5705 df-ima 5706 df-pred 6329 df-ord 6395 df-on 6396 df-lim 6397 df-suc 6398 df-iota 6522 df-fun 6571 df-fn 6572 df-f 6573 df-f1 6574 df-fo 6575 df-f1o 6576 df-fv 6577 df-riota 7395 df-ov 7441 df-oprab 7442 df-mpo 7443 df-om 7895 df-2nd 8023 df-frecs 8314 df-wrecs 8345 df-recs 8419 df-rdg 8458 df-er 8753 df-en 8994 df-dom 8995 df-sdom 8996 df-pnf 11304 df-mnf 11305 df-xr 11306 df-ltxr 11307 df-le 11308 df-sub 11501 df-neg 11502 df-nn 12274 df-2 12336 df-n0 12534 df-z 12621 df-uz 12886 df-seq 14049 df-trcl 15032 df-relexp 15065 |
This theorem is referenced by: rntrclfvRP 43737 |
Copyright terms: Public domain | W3C validator |