Theorem cotrcltrcl 44986

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.

Step	Hyp	Ref	Expression
1		dftrcl3 44981	. 2 ⊢ t+ = (𝑎 ∈ V ↦ ∪ 𝑖 ∈ ℕ (𝑎↑𝑟𝑖))
2		dftrcl3 44981	. 2 ⊢ t+ = (𝑏 ∈ V ↦ ∪ 𝑗 ∈ ℕ (𝑏↑𝑟𝑗))
3		dftrcl3 44981	. 2 ⊢ t+ = (𝑐 ∈ V ↦ ∪ 𝑘 ∈ ℕ (𝑐↑𝑟𝑘))
4		nnex 12381	. 2 ⊢ ℕ ∈ V
5		unidm 4159	. . 3 ⊢ (ℕ ∪ ℕ) = ℕ
6	5	eqcomi 2772	. 2 ⊢ ℕ = (ℕ ∪ ℕ)
7		1ex 11342	. . . . . 6 ⊢ 1 ∈ V
8		oveq2 7459	. . . . . 6 ⊢ (𝑖 = 1 → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1))
9	7, 8	iunxsn 5056	. . . . 5 ⊢ ∪ 𝑖 ∈ {1} (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1)
10		ovex 7484	. . . . . . . 8 ⊢ (𝑑↑𝑟𝑗) ∈ V
11	4, 10	iunex 8014	. . . . . . 7 ⊢ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗) ∈ V
12		relexp1g 15222	. . . . . . 7 ⊢ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗) ∈ V → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1) = ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗))
13	11, 12	ax-mp 5	. . . . . 6 ⊢ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1) = ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)
14		oveq2 7459	. . . . . . 7 ⊢ (𝑗 = 𝑘 → (𝑑↑𝑟𝑗) = (𝑑↑𝑟𝑘))
15	14	cbviunv 5002	. . . . . 6 ⊢ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
16	13, 15	eqtri 2786	. . . . 5 ⊢ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
17	9, 16	eqtri 2786	. . . 4 ⊢ ∪ 𝑖 ∈ {1} (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
18	17	eqcomi 2772	. . 3 ⊢ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) = ∪ 𝑖 ∈ {1} (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖)
19		1nn 12386	. . . 4 ⊢ 1 ∈ ℕ
20		snssi 4748	. . . 4 ⊢ (1 ∈ ℕ → {1} ⊆ ℕ)
21		iunss1 4971	. . . 4 ⊢ ({1} ⊆ ℕ → ∪ 𝑖 ∈ {1} (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖))
22	19, 20, 21	mp2b 10	. . 3 ⊢ ∪ 𝑖 ∈ {1} (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖)
23	18, 22	eqsstri 3959	. 2 ⊢ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ⊆ ∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖)
24		iunss 5008	. . . 4 ⊢ (∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ↔ ∀𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
25		oveq2 7459	. . . . . 6 ⊢ (𝑥 = 1 → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1))
26	25	sseq1d 3944	. . . . 5 ⊢ (𝑥 = 1 → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ↔ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)))
27		oveq2 7459	. . . . . 6 ⊢ (𝑥 = 𝑦 → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦))
28	27	sseq1d 3944	. . . . 5 ⊢ (𝑥 = 𝑦 → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ↔ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)))
29		oveq2 7459	. . . . . 6 ⊢ (𝑥 = (𝑦 + 1) → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)))
30	29	sseq1d 3944	. . . . 5 ⊢ (𝑥 = (𝑦 + 1) → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ↔ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)))
31		oveq2 7459	. . . . . 6 ⊢ (𝑥 = 𝑖 → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖))
32	31	sseq1d 3944	. . . . 5 ⊢ (𝑥 = 𝑖 → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ↔ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)))
33	16	eqimssi 3973	. . . . 5 ⊢ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
34		simpl 488	. . . . . . . 8 ⊢ ((𝑦 ∈ ℕ ∧ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) → 𝑦 ∈ ℕ)
35		relexpsucnnr 15221	. . . . . . . 8 ⊢ ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗) ∈ V ∧ 𝑦 ∈ ℕ) → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)) = ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)))
36	11, 34, 35	sylancr 599	. . . . . . 7 ⊢ ((𝑦 ∈ ℕ ∧ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)) = ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)))
37		coss1 5843	. . . . . . . . 9 ⊢ ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)) ⊆ (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)))
38	37	adantl 487	. . . . . . . 8 ⊢ ((𝑦 ∈ ℕ ∧ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)) ⊆ (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)))
39	15	coeq2i 5849	. . . . . . . . 9 ⊢ (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)) = (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
40		trclfvcotrg 15212	. . . . . . . . . 10 ⊢ ((t+‘𝑑) ∘ (t+‘𝑑)) ⊆ (t+‘𝑑)
41		oveq1 7458	. . . . . . . . . . . . . 14 ⊢ (𝑐 = 𝑑 → (𝑐↑𝑟𝑘) = (𝑑↑𝑟𝑘))
42	41	iuneq2d 4986	. . . . . . . . . . . . 13 ⊢ (𝑐 = 𝑑 → ∪ 𝑘 ∈ ℕ (𝑐↑𝑟𝑘) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
43		ovex 7484	. . . . . . . . . . . . . 14 ⊢ (𝑑↑𝑟𝑘) ∈ V
44	4, 43	iunex 8014	. . . . . . . . . . . . 13 ⊢ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∈ V
45	42, 3, 44	fvmpt 7024	. . . . . . . . . . . 12 ⊢ (𝑑 ∈ V → (t+‘𝑑) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
46	45	elv 3459	. . . . . . . . . . 11 ⊢ (t+‘𝑑) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
47	46, 46	coeq12i 5852	. . . . . . . . . 10 ⊢ ((t+‘𝑑) ∘ (t+‘𝑑)) = (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
48	40, 47, 46	3sstr3i 3963	. . . . . . . . 9 ⊢ (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
49	39, 48	eqsstri 3959	. . . . . . . 8 ⊢ (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
50	38, 49	sstrdi 3925	. . . . . . 7 ⊢ ((𝑦 ∈ ℕ ∧ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
51	36, 50	eqsstrd 3947	. . . . . 6 ⊢ ((𝑦 ∈ ℕ ∧ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
52	51	ex 418	. . . . 5 ⊢ (𝑦 ∈ ℕ → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)))
53	26, 28, 30, 32, 33, 52	nnind 12393	. . . 4 ⊢ (𝑖 ∈ ℕ → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
54	24, 53	mprgbir 3087	. . 3 ⊢ ∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
55		iuneq1 4973	. . . 4 ⊢ (ℕ = (ℕ ∪ ℕ) → ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) = ∪ 𝑘 ∈ (ℕ ∪ ℕ)(𝑑↑𝑟𝑘))
56	6, 55	ax-mp 5	. . 3 ⊢ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) = ∪ 𝑘 ∈ (ℕ ∪ ℕ)(𝑑↑𝑟𝑘)
57	54, 56	sseqtri 3961	. 2 ⊢ ∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ (ℕ ∪ ℕ)(𝑑↑𝑟𝑘)
58	1, 2, 3, 4, 4, 6, 23, 23, 57	comptiunov2i 44967	1 ⊢ (t+ ∘ t+) = t+

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ∪ cun 4152  {csn 4588  ∪ ciun 4956   ∘ ccom 5662  ‘cfv 6566  (class class class)co 7451  1c1 11240   + caddc 11242  ℕcn 12375  t+ctcl 15181  ↑_𝑟crelexp 15215

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-n0 12647  df-z 12734  df-uz 13006  df-seq 14185  df-trcl 15183  df-relexp 15216

This theorem is used by:  cortrcltrcl  45001  cotrclrtrcl  45005