Metamath Proof Explorer


Theorem trclfvdecomr

Description: The transitive closure of a relation may be decomposed into a union of the relation and the composition of the relation with its transitive closure. (Contributed by RP, 18-Jul-2020)

Ref Expression
Assertion trclfvdecomr ⊢ R ∈ V → t+ ⁡ R = R ∪ t+ ⁡ R ∘ R

Proof

Step Hyp Ref Expression
1 elex ⊢ R ∈ V → R ∈ V
2 oveq1 ⊢ r = R → r ↑ r n = R ↑ r n
3 2 iuneq2d ⊢ r = R → ⋃ n ∈ ℕ r ↑ r n = ⋃ n ∈ ℕ R ↑ r n
4 dftrcl3 ⊢ t+ = r ∈ V ⟼ ⋃ n ∈ ℕ r ↑ r n
5 nnex ⊢ ℕ ∈ V
6 ovex ⊢ R ↑ r n ∈ V
7 5 6 iunex ⊢ ⋃ n ∈ ℕ R ↑ r n ∈ V
8 3 4 7 fvmpt ⊢ R ∈ V → t+ ⁡ R = ⋃ n ∈ ℕ R ↑ r n
9 1 8 syl ⊢ R ∈ V → t+ ⁡ R = ⋃ n ∈ ℕ R ↑ r n
10 nnuz ⊢ ℕ = ℤ ≥ 1
11 2eluzge1 ⊢ 2 ∈ ℤ ≥ 1
12 uzsplit ⊢ 2 ∈ ℤ ≥ 1 → ℤ ≥ 1 = 1 … 2 − 1 ∪ ℤ ≥ 2
13 11 12 ax-mp ⊢ ℤ ≥ 1 = 1 … 2 − 1 ∪ ℤ ≥ 2
14 2m1e1 ⊢ 2 − 1 = 1
15 14 oveq2i ⊢ 1 … 2 − 1 = 1 … 1
16 1z ⊢ 1 ∈ ℤ
17 fzsn ⊢ 1 ∈ ℤ → 1 … 1 = 1
18 16 17 ax-mp ⊢ 1 … 1 = 1
19 15 18 eqtri ⊢ 1 … 2 − 1 = 1
20 19 uneq1i ⊢ 1 … 2 − 1 ∪ ℤ ≥ 2 = 1 ∪ ℤ ≥ 2
21 10 13 20 3eqtri ⊢ ℕ = 1 ∪ ℤ ≥ 2
22 iuneq1 ⊢ ℕ = 1 ∪ ℤ ≥ 2 → ⋃ n ∈ ℕ R ↑ r n = ⋃ n ∈ 1 ∪ ℤ ≥ 2 R ↑ r n
23 21 22 ax-mp ⊢ ⋃ n ∈ ℕ R ↑ r n = ⋃ n ∈ 1 ∪ ℤ ≥ 2 R ↑ r n
24 iunxun ⊢ ⋃ n ∈ 1 ∪ ℤ ≥ 2 R ↑ r n = ⋃ n ∈ 1 R ↑ r n ∪ ⋃ n ∈ ℤ ≥ 2 R ↑ r n
25 1ex ⊢ 1 ∈ V
26 oveq2 ⊢ n = 1 → R ↑ r n = R ↑ r 1
27 25 26 iunxsn ⊢ ⋃ n ∈ 1 R ↑ r n = R ↑ r 1
28 27 uneq1i ⊢ ⋃ n ∈ 1 R ↑ r n ∪ ⋃ n ∈ ℤ ≥ 2 R ↑ r n = R ↑ r 1 ∪ ⋃ n ∈ ℤ ≥ 2 R ↑ r n
29 23 24 28 3eqtri ⊢ ⋃ n ∈ ℕ R ↑ r n = R ↑ r 1 ∪ ⋃ n ∈ ℤ ≥ 2 R ↑ r n
30 relexp1g ⊢ R ∈ V → R ↑ r 1 = R
31 oveq1 ⊢ r = R → r ↑ r m = R ↑ r m
32 31 iuneq2d ⊢ r = R → ⋃ m ∈ ℕ r ↑ r m = ⋃ m ∈ ℕ R ↑ r m
33 dftrcl3 ⊢ t+ = r ∈ V ⟼ ⋃ m ∈ ℕ r ↑ r m
34 ovex ⊢ R ↑ r m ∈ V
35 5 34 iunex ⊢ ⋃ m ∈ ℕ R ↑ r m ∈ V
36 32 33 35 fvmpt ⊢ R ∈ V → t+ ⁡ R = ⋃ m ∈ ℕ R ↑ r m
37 1 36 syl ⊢ R ∈ V → t+ ⁡ R = ⋃ m ∈ ℕ R ↑ r m
38 37 coeq1d ⊢ R ∈ V → t+ ⁡ R ∘ R = ⋃ m ∈ ℕ R ↑ r m ∘ R
39 coiun1 ⊢ ⋃ m ∈ ℕ R ↑ r m ∘ R = ⋃ m ∈ ℕ R ↑ r m ∘ R
40 uz2m1nn ⊢ n ∈ ℤ ≥ 2 → n − 1 ∈ ℕ
41 40 adantl ⊢ R ∈ V ∧ n ∈ ℤ ≥ 2 → n − 1 ∈ ℕ
42 eluzp1p1 ⊢ m ∈ ℤ ≥ 1 → m + 1 ∈ ℤ ≥ 1 + 1
43 42 10 eleq2s ⊢ m ∈ ℕ → m + 1 ∈ ℤ ≥ 1 + 1
44 1p1e2 ⊢ 1 + 1 = 2
45 44 fveq2i ⊢ ℤ ≥ 1 + 1 = ℤ ≥ 2
46 43 45 eleqtrdi ⊢ m ∈ ℕ → m + 1 ∈ ℤ ≥ 2
47 46 adantl ⊢ R ∈ V ∧ m ∈ ℕ → m + 1 ∈ ℤ ≥ 2
48 oveq2 ⊢ m = n − 1 → R ↑ r m = R ↑ r n − 1
49 48 coeq1d ⊢ m = n − 1 → R ↑ r m ∘ R = R ↑ r n − 1 ∘ R
50 49 3ad2ant3 ⊢ R ∈ V ∧ n ∈ ℤ ≥ 2 ∧ m = n − 1 → R ↑ r m ∘ R = R ↑ r n − 1 ∘ R
51 oveq2 ⊢ n = m + 1 → R ↑ r n = R ↑ r m + 1
52 51 3ad2ant3 ⊢ R ∈ V ∧ m ∈ ℕ ∧ n = m + 1 → R ↑ r n = R ↑ r m + 1
53 relexpsucnnr ⊢ R ∈ V ∧ m ∈ ℕ → R ↑ r m + 1 = R ↑ r m ∘ R
54 53 eqcomd ⊢ R ∈ V ∧ m ∈ ℕ → R ↑ r m ∘ R = R ↑ r m + 1
55 relexpsucnnr ⊢ R ∈ V ∧ n − 1 ∈ ℕ → R ↑ r n - 1 + 1 = R ↑ r n − 1 ∘ R
56 40 55 sylan2 ⊢ R ∈ V ∧ n ∈ ℤ ≥ 2 → R ↑ r n - 1 + 1 = R ↑ r n − 1 ∘ R
57 eluzelcn ⊢ n ∈ ℤ ≥ 2 → n ∈ ℂ
58 npcan1 ⊢ n ∈ ℂ → n - 1 + 1 = n
59 oveq2 ⊢ n - 1 + 1 = n → R ↑ r n - 1 + 1 = R ↑ r n
60 57 58 59 3syl ⊢ n ∈ ℤ ≥ 2 → R ↑ r n - 1 + 1 = R ↑ r n
61 60 eqeq1d ⊢ n ∈ ℤ ≥ 2 → R ↑ r n - 1 + 1 = R ↑ r n − 1 ∘ R ↔ R ↑ r n = R ↑ r n − 1 ∘ R
62 61 adantl ⊢ R ∈ V ∧ n ∈ ℤ ≥ 2 → R ↑ r n - 1 + 1 = R ↑ r n − 1 ∘ R ↔ R ↑ r n = R ↑ r n − 1 ∘ R
63 56 62 mpbid ⊢ R ∈ V ∧ n ∈ ℤ ≥ 2 → R ↑ r n = R ↑ r n − 1 ∘ R
64 41 47 50 52 54 63 cbviuneq12dv ⊢ R ∈ V → ⋃ m ∈ ℕ R ↑ r m ∘ R = ⋃ n ∈ ℤ ≥ 2 R ↑ r n
65 39 64 eqtrid ⊢ R ∈ V → ⋃ m ∈ ℕ R ↑ r m ∘ R = ⋃ n ∈ ℤ ≥ 2 R ↑ r n
66 38 65 eqtrd ⊢ R ∈ V → t+ ⁡ R ∘ R = ⋃ n ∈ ℤ ≥ 2 R ↑ r n
67 66 eqcomd ⊢ R ∈ V → ⋃ n ∈ ℤ ≥ 2 R ↑ r n = t+ ⁡ R ∘ R
68 30 67 uneq12d ⊢ R ∈ V → R ↑ r 1 ∪ ⋃ n ∈ ℤ ≥ 2 R ↑ r n = R ∪ t+ ⁡ R ∘ R
69 29 68 eqtrid ⊢ R ∈ V → ⋃ n ∈ ℕ R ↑ r n = R ∪ t+ ⁡ R ∘ R
70 9 69 eqtrd ⊢ R ∈ V → t+ ⁡ R = R ∪ t+ ⁡ R ∘ R