Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  crctcshwlkn0lem7 Structured version   Visualization version   GIF version

Theorem crctcshwlkn0lem7 26919
 Description: Lemma for crctcshwlkn0 26924. (Contributed by AV, 12-Mar-2021.)
Hypotheses
Ref Expression
crctcshwlkn0lem.s (𝜑𝑆 ∈ (1..^𝑁))
crctcshwlkn0lem.q 𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))
crctcshwlkn0lem.h 𝐻 = (𝐹 cyclShift 𝑆)
crctcshwlkn0lem.n 𝑁 = (♯‘𝐹)
crctcshwlkn0lem.f (𝜑𝐹 ∈ Word 𝐴)
crctcshwlkn0lem.p (𝜑 → ∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖))))
crctcshwlkn0lem.e (𝜑 → (𝑃𝑁) = (𝑃‘0))
Assertion
Ref Expression
crctcshwlkn0lem7 (𝜑 → ∀𝑗 ∈ (0..^𝑁)if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))
Distinct variable groups:   𝑥,𝑁   𝑥,𝑃   𝑥,𝑆   𝜑,𝑥   𝑖,𝐹   𝑖,𝐼   𝑖,𝑁   𝑃,𝑖   𝑆,𝑖   𝜑,𝑖,𝑗   𝑥,𝑗   𝑗,𝐼   𝑗,𝐻   𝑗,𝑁   𝑄,𝑗   𝑆,𝑗
Allowed substitution hints:   𝐴(𝑥,𝑖,𝑗)   𝑃(𝑗)   𝑄(𝑥,𝑖)   𝐹(𝑥,𝑗)   𝐻(𝑥,𝑖)   𝐼(𝑥)

Proof of Theorem crctcshwlkn0lem7
StepHypRef Expression
1 crctcshwlkn0lem.s . . . . . 6 (𝜑𝑆 ∈ (1..^𝑁))
2 crctcshwlkn0lem.q . . . . . 6 𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))
3 crctcshwlkn0lem.h . . . . . 6 𝐻 = (𝐹 cyclShift 𝑆)
4 crctcshwlkn0lem.n . . . . . 6 𝑁 = (♯‘𝐹)
5 crctcshwlkn0lem.f . . . . . 6 (𝜑𝐹 ∈ Word 𝐴)
6 crctcshwlkn0lem.p . . . . . 6 (𝜑 → ∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖))))
71, 2, 3, 4, 5, 6crctcshwlkn0lem4 26916 . . . . 5 (𝜑 → ∀𝑗 ∈ (0..^(𝑁𝑆))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))
8 eqidd 2761 . . . . . . 7 (𝜑 → (𝑁𝑆) = (𝑁𝑆))
9 crctcshwlkn0lem.e . . . . . . . 8 (𝜑 → (𝑃𝑁) = (𝑃‘0))
101, 2, 3, 4, 5, 6, 9crctcshwlkn0lem6 26918 . . . . . . 7 ((𝜑 ∧ (𝑁𝑆) = (𝑁𝑆)) → if-((𝑄‘(𝑁𝑆)) = (𝑄‘((𝑁𝑆) + 1)), (𝐼‘(𝐻‘(𝑁𝑆))) = {(𝑄‘(𝑁𝑆))}, {(𝑄‘(𝑁𝑆)), (𝑄‘((𝑁𝑆) + 1))} ⊆ (𝐼‘(𝐻‘(𝑁𝑆)))))
118, 10mpdan 705 . . . . . 6 (𝜑 → if-((𝑄‘(𝑁𝑆)) = (𝑄‘((𝑁𝑆) + 1)), (𝐼‘(𝐻‘(𝑁𝑆))) = {(𝑄‘(𝑁𝑆))}, {(𝑄‘(𝑁𝑆)), (𝑄‘((𝑁𝑆) + 1))} ⊆ (𝐼‘(𝐻‘(𝑁𝑆)))))
12 ovex 6841 . . . . . . 7 (𝑁𝑆) ∈ V
13 wkslem1 26713 . . . . . . 7 (𝑗 = (𝑁𝑆) → (if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))) ↔ if-((𝑄‘(𝑁𝑆)) = (𝑄‘((𝑁𝑆) + 1)), (𝐼‘(𝐻‘(𝑁𝑆))) = {(𝑄‘(𝑁𝑆))}, {(𝑄‘(𝑁𝑆)), (𝑄‘((𝑁𝑆) + 1))} ⊆ (𝐼‘(𝐻‘(𝑁𝑆))))))
1412, 13ralsn 4366 . . . . . 6 (∀𝑗 ∈ {(𝑁𝑆)}if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))) ↔ if-((𝑄‘(𝑁𝑆)) = (𝑄‘((𝑁𝑆) + 1)), (𝐼‘(𝐻‘(𝑁𝑆))) = {(𝑄‘(𝑁𝑆))}, {(𝑄‘(𝑁𝑆)), (𝑄‘((𝑁𝑆) + 1))} ⊆ (𝐼‘(𝐻‘(𝑁𝑆)))))
1511, 14sylibr 224 . . . . 5 (𝜑 → ∀𝑗 ∈ {(𝑁𝑆)}if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))
16 ralunb 3937 . . . . 5 (∀𝑗 ∈ ((0..^(𝑁𝑆)) ∪ {(𝑁𝑆)})if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))) ↔ (∀𝑗 ∈ (0..^(𝑁𝑆))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))) ∧ ∀𝑗 ∈ {(𝑁𝑆)}if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗)))))
177, 15, 16sylanbrc 701 . . . 4 (𝜑 → ∀𝑗 ∈ ((0..^(𝑁𝑆)) ∪ {(𝑁𝑆)})if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))
18 elfzo1 12712 . . . . . . 7 (𝑆 ∈ (1..^𝑁) ↔ (𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑆 < 𝑁))
19 nnz 11591 . . . . . . . . . . . 12 (𝑁 ∈ ℕ → 𝑁 ∈ ℤ)
20 nnz 11591 . . . . . . . . . . . 12 (𝑆 ∈ ℕ → 𝑆 ∈ ℤ)
21 zsubcl 11611 . . . . . . . . . . . 12 ((𝑁 ∈ ℤ ∧ 𝑆 ∈ ℤ) → (𝑁𝑆) ∈ ℤ)
2219, 20, 21syl2anr 496 . . . . . . . . . . 11 ((𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑁𝑆) ∈ ℤ)
23223adant3 1127 . . . . . . . . . 10 ((𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) → (𝑁𝑆) ∈ ℤ)
24 nnre 11219 . . . . . . . . . . . 12 (𝑆 ∈ ℕ → 𝑆 ∈ ℝ)
25 nnre 11219 . . . . . . . . . . . 12 (𝑁 ∈ ℕ → 𝑁 ∈ ℝ)
26 posdif 10713 . . . . . . . . . . . . 13 ((𝑆 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑆 < 𝑁 ↔ 0 < (𝑁𝑆)))
27 0re 10232 . . . . . . . . . . . . . 14 0 ∈ ℝ
28 resubcl 10537 . . . . . . . . . . . . . . 15 ((𝑁 ∈ ℝ ∧ 𝑆 ∈ ℝ) → (𝑁𝑆) ∈ ℝ)
2928ancoms 468 . . . . . . . . . . . . . 14 ((𝑆 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑁𝑆) ∈ ℝ)
30 ltle 10318 . . . . . . . . . . . . . 14 ((0 ∈ ℝ ∧ (𝑁𝑆) ∈ ℝ) → (0 < (𝑁𝑆) → 0 ≤ (𝑁𝑆)))
3127, 29, 30sylancr 698 . . . . . . . . . . . . 13 ((𝑆 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (0 < (𝑁𝑆) → 0 ≤ (𝑁𝑆)))
3226, 31sylbid 230 . . . . . . . . . . . 12 ((𝑆 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑆 < 𝑁 → 0 ≤ (𝑁𝑆)))
3324, 25, 32syl2an 495 . . . . . . . . . . 11 ((𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑆 < 𝑁 → 0 ≤ (𝑁𝑆)))
34333impia 1110 . . . . . . . . . 10 ((𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) → 0 ≤ (𝑁𝑆))
35 elnn0z 11582 . . . . . . . . . 10 ((𝑁𝑆) ∈ ℕ0 ↔ ((𝑁𝑆) ∈ ℤ ∧ 0 ≤ (𝑁𝑆)))
3623, 34, 35sylanbrc 701 . . . . . . . . 9 ((𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) → (𝑁𝑆) ∈ ℕ0)
37 elnn0uz 11918 . . . . . . . . 9 ((𝑁𝑆) ∈ ℕ0 ↔ (𝑁𝑆) ∈ (ℤ‘0))
3836, 37sylib 208 . . . . . . . 8 ((𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) → (𝑁𝑆) ∈ (ℤ‘0))
39 fzosplitsn 12770 . . . . . . . 8 ((𝑁𝑆) ∈ (ℤ‘0) → (0..^((𝑁𝑆) + 1)) = ((0..^(𝑁𝑆)) ∪ {(𝑁𝑆)}))
4038, 39syl 17 . . . . . . 7 ((𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) → (0..^((𝑁𝑆) + 1)) = ((0..^(𝑁𝑆)) ∪ {(𝑁𝑆)}))
4118, 40sylbi 207 . . . . . 6 (𝑆 ∈ (1..^𝑁) → (0..^((𝑁𝑆) + 1)) = ((0..^(𝑁𝑆)) ∪ {(𝑁𝑆)}))
421, 41syl 17 . . . . 5 (𝜑 → (0..^((𝑁𝑆) + 1)) = ((0..^(𝑁𝑆)) ∪ {(𝑁𝑆)}))
4342raleqdv 3283 . . . 4 (𝜑 → (∀𝑗 ∈ (0..^((𝑁𝑆) + 1))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))) ↔ ∀𝑗 ∈ ((0..^(𝑁𝑆)) ∪ {(𝑁𝑆)})if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗)))))
4417, 43mpbird 247 . . 3 (𝜑 → ∀𝑗 ∈ (0..^((𝑁𝑆) + 1))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))
451, 2, 3, 4, 5, 6crctcshwlkn0lem5 26917 . . 3 (𝜑 → ∀𝑗 ∈ (((𝑁𝑆) + 1)..^𝑁)if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))
46 ralunb 3937 . . 3 (∀𝑗 ∈ ((0..^((𝑁𝑆) + 1)) ∪ (((𝑁𝑆) + 1)..^𝑁))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))) ↔ (∀𝑗 ∈ (0..^((𝑁𝑆) + 1))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))) ∧ ∀𝑗 ∈ (((𝑁𝑆) + 1)..^𝑁)if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗)))))
4744, 45, 46sylanbrc 701 . 2 (𝜑 → ∀𝑗 ∈ ((0..^((𝑁𝑆) + 1)) ∪ (((𝑁𝑆) + 1)..^𝑁))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))
48 nnsub 11251 . . . . . . . 8 ((𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑆 < 𝑁 ↔ (𝑁𝑆) ∈ ℕ))
4948biimp3a 1581 . . . . . . 7 ((𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) → (𝑁𝑆) ∈ ℕ)
50 nnnn0 11491 . . . . . . 7 ((𝑁𝑆) ∈ ℕ → (𝑁𝑆) ∈ ℕ0)
51 peano2nn0 11525 . . . . . . 7 ((𝑁𝑆) ∈ ℕ0 → ((𝑁𝑆) + 1) ∈ ℕ0)
5249, 50, 513syl 18 . . . . . 6 ((𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) → ((𝑁𝑆) + 1) ∈ ℕ0)
53 nnnn0 11491 . . . . . . 7 (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0)
54533ad2ant2 1129 . . . . . 6 ((𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) → 𝑁 ∈ ℕ0)
5525anim1i 593 . . . . . . . . 9 ((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℕ) → (𝑁 ∈ ℝ ∧ 𝑆 ∈ ℕ))
5655ancoms 468 . . . . . . . 8 ((𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑁 ∈ ℝ ∧ 𝑆 ∈ ℕ))
57 crctcshwlkn0lem1 26913 . . . . . . . 8 ((𝑁 ∈ ℝ ∧ 𝑆 ∈ ℕ) → ((𝑁𝑆) + 1) ≤ 𝑁)
5856, 57syl 17 . . . . . . 7 ((𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝑁𝑆) + 1) ≤ 𝑁)
59583adant3 1127 . . . . . 6 ((𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) → ((𝑁𝑆) + 1) ≤ 𝑁)
60 elfz2nn0 12624 . . . . . 6 (((𝑁𝑆) + 1) ∈ (0...𝑁) ↔ (((𝑁𝑆) + 1) ∈ ℕ0𝑁 ∈ ℕ0 ∧ ((𝑁𝑆) + 1) ≤ 𝑁))
6152, 54, 59, 60syl3anbrc 1429 . . . . 5 ((𝑆 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) → ((𝑁𝑆) + 1) ∈ (0...𝑁))
6218, 61sylbi 207 . . . 4 (𝑆 ∈ (1..^𝑁) → ((𝑁𝑆) + 1) ∈ (0...𝑁))
63 fzosplit 12695 . . . 4 (((𝑁𝑆) + 1) ∈ (0...𝑁) → (0..^𝑁) = ((0..^((𝑁𝑆) + 1)) ∪ (((𝑁𝑆) + 1)..^𝑁)))
641, 62, 633syl 18 . . 3 (𝜑 → (0..^𝑁) = ((0..^((𝑁𝑆) + 1)) ∪ (((𝑁𝑆) + 1)..^𝑁)))
6564raleqdv 3283 . 2 (𝜑 → (∀𝑗 ∈ (0..^𝑁)if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))) ↔ ∀𝑗 ∈ ((0..^((𝑁𝑆) + 1)) ∪ (((𝑁𝑆) + 1)..^𝑁))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗)))))
6647, 65mpbird 247 1 (𝜑 → ∀𝑗 ∈ (0..^𝑁)if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383  if-wif 1050   ∧ w3a 1072   = wceq 1632   ∈ wcel 2139  ∀wral 3050   ∪ cun 3713   ⊆ wss 3715  ifcif 4230  {csn 4321  {cpr 4323   class class class wbr 4804   ↦ cmpt 4881  ‘cfv 6049  (class class class)co 6813  ℝcr 10127  0cc0 10128  1c1 10129   + caddc 10131   < clt 10266   ≤ cle 10267   − cmin 10458  ℕcn 11212  ℕ0cn0 11484  ℤcz 11569  ℤ≥cuz 11879  ...cfz 12519  ..^cfzo 12659  ♯chash 13311  Word cword 13477   cyclShift ccsh 13734 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7114  ax-cnex 10184  ax-resscn 10185  ax-1cn 10186  ax-icn 10187  ax-addcl 10188  ax-addrcl 10189  ax-mulcl 10190  ax-mulrcl 10191  ax-mulcom 10192  ax-addass 10193  ax-mulass 10194  ax-distr 10195  ax-i2m1 10196  ax-1ne0 10197  ax-1rid 10198  ax-rnegex 10199  ax-rrecex 10200  ax-cnre 10201  ax-pre-lttri 10202  ax-pre-lttrn 10203  ax-pre-ltadd 10204  ax-pre-mulgt0 10205  ax-pre-sup 10206 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-ifp 1051  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-nel 3036  df-ral 3055  df-rex 3056  df-reu 3057  df-rmo 3058  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-int 4628  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-tr 4905  df-id 5174  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-we 5227  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-pred 5841  df-ord 5887  df-on 5888  df-lim 5889  df-suc 5890  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-riota 6774  df-ov 6816  df-oprab 6817  df-mpt2 6818  df-om 7231  df-1st 7333  df-2nd 7334  df-wrecs 7576  df-recs 7637  df-rdg 7675  df-1o 7729  df-oadd 7733  df-er 7911  df-en 8122  df-dom 8123  df-sdom 8124  df-fin 8125  df-sup 8513  df-inf 8514  df-card 8955  df-pnf 10268  df-mnf 10269  df-xr 10270  df-ltxr 10271  df-le 10272  df-sub 10460  df-neg 10461  df-div 10877  df-nn 11213  df-2 11271  df-n0 11485  df-z 11570  df-uz 11880  df-rp 12026  df-fz 12520  df-fzo 12660  df-fl 12787  df-mod 12863  df-hash 13312  df-word 13485  df-concat 13487  df-substr 13489  df-csh 13735 This theorem is referenced by:  crctcshwlkn0  26924
 Copyright terms: Public domain W3C validator