Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cotrcltrcl Structured version   Visualization version   GIF version

Theorem cotrcltrcl 44724
Description: The transitive closure is idempotent. (Contributed by RP, 16-Jun-2020.)
Assertion
Ref Expression
cotrcltrcl (t+ ∘ t+) = t+

Proof of Theorem cotrcltrcl
Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑖 𝑗 𝑘 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dftrcl3 44719 . 2 t+ = (𝑎 ∈ V ↦ ∪ 𝑖 ∈ ℕ (𝑎↑𝑟𝑖))
2 dftrcl3 44719 . 2 t+ = (𝑏 ∈ V ↦ ∪ 𝑗 ∈ ℕ (𝑏↑𝑟𝑗))
3 dftrcl3 44719 . 2 t+ = (𝑐 ∈ V ↦ ∪ 𝑘 ∈ ℕ (𝑐↑𝑟𝑘))
4 nnex 12341 . 2 ℕ ∈ V
5 unidm 4104 . . 3 (ℕ ∪ ℕ) = ℕ
65eqcomi 2770 . 2 ℕ = (ℕ ∪ ℕ)
7 1ex 11303 . . . . . 6 1 ∈ V
8 oveq2 7428 . . . . . 6 (𝑖 = 1 → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1))
97, 8iunxsn 5051 . . . . 5 ∪ 𝑖 ∈ {1} (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1)
10 ovex 7453 . . . . . . . 8 (𝑑↑𝑟𝑗) ∈ V
114, 10iunex 7980 . . . . . . 7 ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗) ∈ V
12 relexp1g 15179 . . . . . . 7 (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗) ∈ V → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1) = ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗))
1311, 12ax-mp 5 . . . . . 6 (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1) = ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)
14 oveq2 7428 . . . . . . 7 (𝑗 = 𝑘 → (𝑑↑𝑟𝑗) = (𝑑↑𝑟𝑘))
1514cbviunv 4997 . . . . . 6 ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
1613, 15eqtri 2784 . . . . 5 (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
179, 16eqtri 2784 . . . 4 ∪ 𝑖 ∈ {1} (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
1817eqcomi 2770 . . 3 ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) = ∪ 𝑖 ∈ {1} (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖)
19 1nn 12346 . . . 4 1 ∈ ℕ
20 snssi 4746 . . . 4 (1 ∈ ℕ → {1} ⊆ ℕ)
21 iunss1 4966 . . . 4 ({1} ⊆ ℕ → ∪ 𝑖 ∈ {1} (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖))
2219, 20, 21mp2b 10 . . 3 ∪ 𝑖 ∈ {1} (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖)
2318, 22eqsstri 3977 . 2 ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ⊆ ∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖)
24 iunss 5003 . . . 4 (∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ↔ ∀𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
25 oveq2 7428 . . . . . 6 (𝑥 = 1 → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1))
2625sseq1d 3962 . . . . 5 (𝑥 = 1 → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ↔ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)))
27 oveq2 7428 . . . . . 6 (𝑥 = 𝑦 → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦))
2827sseq1d 3962 . . . . 5 (𝑥 = 𝑦 → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ↔ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)))
29 oveq2 7428 . . . . . 6 (𝑥 = (𝑦 + 1) → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)))
3029sseq1d 3962 . . . . 5 (𝑥 = (𝑦 + 1) → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ↔ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)))
31 oveq2 7428 . . . . . 6 (𝑥 = 𝑖 → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖))
3231sseq1d 3962 . . . . 5 (𝑥 = 𝑖 → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ↔ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)))
3316eqimssi 3991 . . . . 5 (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
34 simpl 488 . . . . . . . 8 ((𝑦 ∈ ℕ ∧ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) → 𝑦 ∈ ℕ)
35 relexpsucnnr 15178 . . . . . . . 8 ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗) ∈ V ∧ 𝑦 ∈ ℕ) → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)) = ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)))
3611, 34, 35sylancr 599 . . . . . . 7 ((𝑦 ∈ ℕ ∧ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)) = ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)))
37 coss1 5833 . . . . . . . . 9 ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)) ⊆ (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)))
3837adantl 487 . . . . . . . 8 ((𝑦 ∈ ℕ ∧ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)) ⊆ (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)))
3915coeq2i 5838 . . . . . . . . 9 (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)) = (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
40 trclfvcotrg 15169 . . . . . . . . . 10 ((t+‘𝑑) ∘ (t+‘𝑑)) ⊆ (t+‘𝑑)
41 oveq1 7427 . . . . . . . . . . . . . 14 (𝑐 = 𝑑 → (𝑐↑𝑟𝑘) = (𝑑↑𝑟𝑘))
4241iuneq2d 4981 . . . . . . . . . . . . 13 (𝑐 = 𝑑 → ∪ 𝑘 ∈ ℕ (𝑐↑𝑟𝑘) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
43 ovex 7453 . . . . . . . . . . . . . 14 (𝑑↑𝑟𝑘) ∈ V
444, 43iunex 7980 . . . . . . . . . . . . 13 ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∈ V
4542, 3, 44fvmpt 6993 . . . . . . . . . . . 12 (𝑑 ∈ V → (t+‘𝑑) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
4645elv 3456 . . . . . . . . . . 11 (t+‘𝑑) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
4746, 46coeq12i 5841 . . . . . . . . . 10 ((t+‘𝑑) ∘ (t+‘𝑑)) = (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
4840, 47, 463sstr3i 3981 . . . . . . . . 9 (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
4939, 48eqsstri 3977 . . . . . . . 8 (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
5038, 49sstrdi 3943 . . . . . . 7 ((𝑦 ∈ ℕ ∧ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
5136, 50eqsstrd 3965 . . . . . 6 ((𝑦 ∈ ℕ ∧ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
5251ex 418 . . . . 5 (𝑦 ∈ ℕ → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)))
5326, 28, 30, 32, 33, 52nnind 12353 . . . 4 (𝑖 ∈ ℕ → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
5424, 53mprgbir 3084 . . 3 ∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
55 iuneq1 4968 . . . 4 (ℕ = (ℕ ∪ ℕ) → ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) = ∪ 𝑘 ∈ (ℕ ∪ ℕ)(𝑑↑𝑟𝑘))
566, 55ax-mp 5 . . 3 ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) = ∪ 𝑘 ∈ (ℕ ∪ ℕ)(𝑑↑𝑟𝑘)
5754, 56sseqtri 3979 . 2 ∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ (ℕ ∪ ℕ)(𝑑↑𝑟𝑘)
581, 2, 3, 4, 4, 6, 23, 23, 57comptiunov2i 44705 1 (t+ ∘ t+) = t+
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∪ cun 3897   ⊆ wss 3899  {csn 4584  ∪ ciun 4951   ∘ ccom 5655  ‘cfv 6538  (class class class)co 7420  1c1 11201   + caddc 11203  ℕcn 12335  t+ctcl 15138  ↑𝑟crelexp 15172
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751  ax-cnex 11256  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-er 8717  df-en 8974  df-dom 8975  df-sdom 8976  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-nn 12336  df-2 12405  df-n0 12607  df-z 12694  df-uz 12966  df-seq 14145  df-trcl 15140  df-relexp 15173
This theorem is used by:  cortrcltrcl  44739  cotrclrtrcl  44743
  Copyright terms: Public domain W3C validator