Theorem cotrcltrcl 44865

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 44860	. 2 ⊢ t+ = (𝑎 ∈ V ↦ ∪ 𝑖 ∈ ℕ (𝑎↑𝑟𝑖))
2		dftrcl3 44860	. 2 ⊢ t+ = (𝑏 ∈ V ↦ ∪ 𝑗 ∈ ℕ (𝑏↑𝑟𝑗))
3		dftrcl3 44860	. 2 ⊢ t+ = (𝑐 ∈ V ↦ ∪ 𝑘 ∈ ℕ (𝑐↑𝑟𝑘))
4		nnex 12351	. 2 ⊢ ℕ ∈ V
5		unidm 4158	. . 3 ⊢ (ℕ ∪ ℕ) = ℕ
6	5	eqcomi 2772	. 2 ⊢ ℕ = (ℕ ∪ ℕ)
7		1ex 11313	. . . . . 6 ⊢ 1 ∈ V
8		oveq2 7435	. . . . . 6 ⊢ (𝑖 = 1 → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1))
9	7, 8	iunxsn 5053	. . . . 5 ⊢ ∪ 𝑖 ∈ {1} (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1)
10		ovex 7460	. . . . . . . 8 ⊢ (𝑑↑𝑟𝑗) ∈ V
11	4, 10	iunex 7987	. . . . . . 7 ⊢ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗) ∈ V
12		relexp1g 15191	. . . . . . 7 ⊢ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗) ∈ V → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1) = ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗))
13	11, 12	ax-mp 5	. . . . . 6 ⊢ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1) = ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)
14		oveq2 7435	. . . . . . 7 ⊢ (𝑗 = 𝑘 → (𝑑↑𝑟𝑗) = (𝑑↑𝑟𝑘))
15	14	cbviunv 4999	. . . . . 6 ⊢ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
16	13, 15	eqtri 2786	. . . . 5 ⊢ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
17	9, 16	eqtri 2786	. . . 4 ⊢ ∪ 𝑖 ∈ {1} (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
18	17	eqcomi 2772	. . 3 ⊢ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) = ∪ 𝑖 ∈ {1} (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖)
19		1nn 12356	. . . 4 ⊢ 1 ∈ ℕ
20		snssi 4745	. . . 4 ⊢ (1 ∈ ℕ → {1} ⊆ ℕ)
21		iunss1 4968	. . . 4 ⊢ ({1} ⊆ ℕ → ∪ 𝑖 ∈ {1} (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖))
22	19, 20, 21	mp2b 10	. . 3 ⊢ ∪ 𝑖 ∈ {1} (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖)
23	18, 22	eqsstri 3958	. 2 ⊢ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ⊆ ∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖)
24		iunss 5005	. . . 4 ⊢ (∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ↔ ∀𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
25		oveq2 7435	. . . . . 6 ⊢ (𝑥 = 1 → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1))
26	25	sseq1d 3943	. . . . 5 ⊢ (𝑥 = 1 → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ↔ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)))
27		oveq2 7435	. . . . . 6 ⊢ (𝑥 = 𝑦 → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦))
28	27	sseq1d 3943	. . . . 5 ⊢ (𝑥 = 𝑦 → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ↔ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)))
29		oveq2 7435	. . . . . 6 ⊢ (𝑥 = (𝑦 + 1) → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)))
30	29	sseq1d 3943	. . . . 5 ⊢ (𝑥 = (𝑦 + 1) → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ↔ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)))
31		oveq2 7435	. . . . . 6 ⊢ (𝑥 = 𝑖 → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) = (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖))
32	31	sseq1d 3943	. . . . 5 ⊢ (𝑥 = 𝑖 → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑥) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ↔ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)))
33	16	eqimssi 3972	. . . . 5 ⊢ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟1) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
34		simpl 488	. . . . . . . 8 ⊢ ((𝑦 ∈ ℕ ∧ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) → 𝑦 ∈ ℕ)
35		relexpsucnnr 15190	. . . . . . . 8 ⊢ ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗) ∈ V ∧ 𝑦 ∈ ℕ) → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)) = ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)))
36	11, 34, 35	sylancr 599	. . . . . . 7 ⊢ ((𝑦 ∈ ℕ ∧ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)) = ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)))
37		coss1 5837	. . . . . . . . 9 ⊢ ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)) ⊆ (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)))
38	37	adantl 487	. . . . . . . 8 ⊢ ((𝑦 ∈ ℕ ∧ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)) ⊆ (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)))
39	15	coeq2i 5842	. . . . . . . . 9 ⊢ (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)) = (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
40		trclfvcotrg 15181	. . . . . . . . . 10 ⊢ ((t+‘𝑑) ∘ (t+‘𝑑)) ⊆ (t+‘𝑑)
41		oveq1 7434	. . . . . . . . . . . . . 14 ⊢ (𝑐 = 𝑑 → (𝑐↑𝑟𝑘) = (𝑑↑𝑟𝑘))
42	41	iuneq2d 4983	. . . . . . . . . . . . 13 ⊢ (𝑐 = 𝑑 → ∪ 𝑘 ∈ ℕ (𝑐↑𝑟𝑘) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
43		ovex 7460	. . . . . . . . . . . . . 14 ⊢ (𝑑↑𝑟𝑘) ∈ V
44	4, 43	iunex 7987	. . . . . . . . . . . . 13 ⊢ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∈ V
45	42, 3, 44	fvmpt 7001	. . . . . . . . . . . 12 ⊢ (𝑑 ∈ V → (t+‘𝑑) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
46	45	elv 3458	. . . . . . . . . . 11 ⊢ (t+‘𝑑) = ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
47	46, 46	coeq12i 5845	. . . . . . . . . 10 ⊢ ((t+‘𝑑) ∘ (t+‘𝑑)) = (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
48	40, 47, 46	3sstr3i 3962	. . . . . . . . 9 ⊢ (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
49	39, 48	eqsstri 3958	. . . . . . . 8 ⊢ (∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
50	38, 49	sstrdi 3924	. . . . . . 7 ⊢ ((𝑦 ∈ ℕ ∧ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ∘ ∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
51	36, 50	eqsstrd 3946	. . . . . 6 ⊢ ((𝑦 ∈ ℕ ∧ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)) → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
52	51	ex 418	. . . . 5 ⊢ (𝑦 ∈ ℕ → ((∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑦) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟(𝑦 + 1)) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)))
53	26, 28, 30, 32, 33, 52	nnind 12363	. . . 4 ⊢ (𝑖 ∈ ℕ → (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘))
54	24, 53	mprgbir 3086	. . 3 ⊢ ∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘)
55		iuneq1 4970	. . . 4 ⊢ (ℕ = (ℕ ∪ ℕ) → ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) = ∪ 𝑘 ∈ (ℕ ∪ ℕ)(𝑑↑𝑟𝑘))
56	6, 55	ax-mp 5	. . 3 ⊢ ∪ 𝑘 ∈ ℕ (𝑑↑𝑟𝑘) = ∪ 𝑘 ∈ (ℕ ∪ ℕ)(𝑑↑𝑟𝑘)
57	54, 56	sseqtri 3960	. 2 ⊢ ∪ 𝑖 ∈ ℕ (∪ 𝑗 ∈ ℕ (𝑑↑𝑟𝑗)↑𝑟𝑖) ⊆ ∪ 𝑘 ∈ (ℕ ∪ ℕ)(𝑑↑𝑟𝑘)
58	1, 2, 3, 4, 4, 6, 23, 23, 57	comptiunov2i 44846	1 ⊢ (t+ ∘ t+) = t+

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1569   ∈ wcel 2146  Vcvv 3453   ⊆ wss 3899   ∪ cun 4151  {csn 4587  ∪ ciun 4953   ∘ ccom 5658  ‘cfv 6546  (class class class)co 7427  1c1 11211   + caddc 11213  ℕcn 12345  t+ctcl 15150  ↑_𝑟crelexp 15184

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5234  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758  ax-cnex 11266  ax-resscn 11267  ax-1cn 11268  ax-icn 11269  ax-addcl 11270  ax-addrcl 11271  ax-mulcl 11272  ax-mulrcl 11273  ax-mulcom 11274  ax-addass 11275  ax-mulass 11276  ax-distr 11277  ax-i2m1 11278  ax-1ne0 11279  ax-1rid 11280  ax-rnegex 11281  ax-rrecex 11282  ax-cnre 11283  ax-pre-lttri 11284  ax-pre-lttrn 11285  ax-pre-ltadd 11286  ax-pre-mulgt0 11287

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-int 4910  df-iun 4955  df-br 5106  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5549  df-eprel 5554  df-po 5562  df-so 5563  df-fr 5607  df-we 5609  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6310  df-ord 6371  df-on 6372  df-lim 6373  df-suc 6374  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-riota 7384  df-ov 7430  df-oprab 7431  df-mpo 7432  df-om 7885  df-2nd 8009  df-frecs 8310  df-wrecs 8341  df-recs 8390  df-rdg 8429  df-er 8728  df-en 8985  df-dom 8986  df-sdom 8987  df-pnf 11355  df-mnf 11356  df-xr 11357  df-ltxr 11358  df-le 11359  df-sub 11553  df-neg 11554  df-nn 12346  df-2 12415  df-n0 12617  df-z 12704  df-uz 12976  df-seq 14155  df-trcl 15152  df-relexp 15185

This theorem is used by:  cortrcltrcl  44880  cotrclrtrcl  44884