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

Theorem crctcshwlkn0 26694
Description: Cyclically shifting the indices of a circuit 𝐹, 𝑃 results in a walk 𝐻, 𝑄. (Contributed by AV, 10-Mar-2021.)
Hypotheses
Ref Expression
crctcsh.v 𝑉 = (Vtx‘𝐺)
crctcsh.i 𝐼 = (iEdg‘𝐺)
crctcsh.d (𝜑𝐹(Circuits‘𝐺)𝑃)
crctcsh.n 𝑁 = (#‘𝐹)
crctcsh.s (𝜑𝑆 ∈ (0..^𝑁))
crctcsh.h 𝐻 = (𝐹 cyclShift 𝑆)
crctcsh.q 𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))
Assertion
Ref Expression
crctcshwlkn0 ((𝜑𝑆 ≠ 0) → 𝐻(Walks‘𝐺)𝑄)
Distinct variable groups:   𝑥,𝑁   𝑥,𝑃   𝑥,𝑆   𝜑,𝑥   𝑥,𝐹   𝑥,𝐼   𝑥,𝑉
Allowed substitution hints:   𝑄(𝑥)   𝐺(𝑥)   𝐻(𝑥)

Proof of Theorem crctcshwlkn0
Dummy variables 𝑖 𝑗 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 crctcsh.h . . . . 5 𝐻 = (𝐹 cyclShift 𝑆)
2 crctcsh.d . . . . . . 7 (𝜑𝐹(Circuits‘𝐺)𝑃)
3 crctiswlk 26672 . . . . . . 7 (𝐹(Circuits‘𝐺)𝑃𝐹(Walks‘𝐺)𝑃)
4 crctcsh.i . . . . . . . 8 𝐼 = (iEdg‘𝐺)
54wlkf 26491 . . . . . . 7 (𝐹(Walks‘𝐺)𝑃𝐹 ∈ Word dom 𝐼)
62, 3, 53syl 18 . . . . . 6 (𝜑𝐹 ∈ Word dom 𝐼)
7 cshwcl 13525 . . . . . 6 (𝐹 ∈ Word dom 𝐼 → (𝐹 cyclShift 𝑆) ∈ Word dom 𝐼)
86, 7syl 17 . . . . 5 (𝜑 → (𝐹 cyclShift 𝑆) ∈ Word dom 𝐼)
91, 8syl5eqel 2703 . . . 4 (𝜑𝐻 ∈ Word dom 𝐼)
109adantr 481 . . 3 ((𝜑𝑆 ≠ 0) → 𝐻 ∈ Word dom 𝐼)
112, 3syl 17 . . . . . . . 8 (𝜑𝐹(Walks‘𝐺)𝑃)
12 crctcsh.v . . . . . . . . . 10 𝑉 = (Vtx‘𝐺)
1312wlkp 26493 . . . . . . . . 9 (𝐹(Walks‘𝐺)𝑃𝑃:(0...(#‘𝐹))⟶𝑉)
14 simpll 789 . . . . . . . . . . . 12 (((𝑃:(0...(#‘𝐹))⟶𝑉 ∧ (𝜑𝑥 ∈ (0...𝑁))) ∧ 𝑥 ≤ (𝑁𝑆)) → 𝑃:(0...(#‘𝐹))⟶𝑉)
15 crctcsh.s . . . . . . . . . . . . . . 15 (𝜑𝑆 ∈ (0..^𝑁))
16 elfznn0 12417 . . . . . . . . . . . . . . . . . . 19 (𝑥 ∈ (0...𝑁) → 𝑥 ∈ ℕ0)
1716adantl 482 . . . . . . . . . . . . . . . . . 18 ((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) → 𝑥 ∈ ℕ0)
18 elfzonn0 12496 . . . . . . . . . . . . . . . . . . 19 (𝑆 ∈ (0..^𝑁) → 𝑆 ∈ ℕ0)
1918adantr 481 . . . . . . . . . . . . . . . . . 18 ((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) → 𝑆 ∈ ℕ0)
2017, 19nn0addcld 11340 . . . . . . . . . . . . . . . . 17 ((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) → (𝑥 + 𝑆) ∈ ℕ0)
2120adantr 481 . . . . . . . . . . . . . . . 16 (((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) ∧ 𝑥 ≤ (𝑁𝑆)) → (𝑥 + 𝑆) ∈ ℕ0)
22 crctcsh.n . . . . . . . . . . . . . . . . . 18 𝑁 = (#‘𝐹)
23 elfz3nn0 12418 . . . . . . . . . . . . . . . . . 18 (𝑥 ∈ (0...𝑁) → 𝑁 ∈ ℕ0)
2422, 23syl5eqelr 2704 . . . . . . . . . . . . . . . . 17 (𝑥 ∈ (0...𝑁) → (#‘𝐹) ∈ ℕ0)
2524ad2antlr 762 . . . . . . . . . . . . . . . 16 (((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) ∧ 𝑥 ≤ (𝑁𝑆)) → (#‘𝐹) ∈ ℕ0)
26 elfzelz 12327 . . . . . . . . . . . . . . . . . . . . 21 (𝑥 ∈ (0...𝑁) → 𝑥 ∈ ℤ)
2726zred 11467 . . . . . . . . . . . . . . . . . . . 20 (𝑥 ∈ (0...𝑁) → 𝑥 ∈ ℝ)
2827adantl 482 . . . . . . . . . . . . . . . . . . 19 ((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) → 𝑥 ∈ ℝ)
29 elfzoelz 12454 . . . . . . . . . . . . . . . . . . . . 21 (𝑆 ∈ (0..^𝑁) → 𝑆 ∈ ℤ)
3029zred 11467 . . . . . . . . . . . . . . . . . . . 20 (𝑆 ∈ (0..^𝑁) → 𝑆 ∈ ℝ)
3130adantr 481 . . . . . . . . . . . . . . . . . . 19 ((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) → 𝑆 ∈ ℝ)
32 elfzel2 12325 . . . . . . . . . . . . . . . . . . . . 21 (𝑥 ∈ (0...𝑁) → 𝑁 ∈ ℤ)
3332zred 11467 . . . . . . . . . . . . . . . . . . . 20 (𝑥 ∈ (0...𝑁) → 𝑁 ∈ ℝ)
3433adantl 482 . . . . . . . . . . . . . . . . . . 19 ((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) → 𝑁 ∈ ℝ)
35 leaddsub 10489 . . . . . . . . . . . . . . . . . . 19 ((𝑥 ∈ ℝ ∧ 𝑆 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝑥 + 𝑆) ≤ 𝑁𝑥 ≤ (𝑁𝑆)))
3628, 31, 34, 35syl3anc 1324 . . . . . . . . . . . . . . . . . 18 ((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) → ((𝑥 + 𝑆) ≤ 𝑁𝑥 ≤ (𝑁𝑆)))
3736biimpar 502 . . . . . . . . . . . . . . . . 17 (((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) ∧ 𝑥 ≤ (𝑁𝑆)) → (𝑥 + 𝑆) ≤ 𝑁)
3837, 22syl6breq 4685 . . . . . . . . . . . . . . . 16 (((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) ∧ 𝑥 ≤ (𝑁𝑆)) → (𝑥 + 𝑆) ≤ (#‘𝐹))
3921, 25, 383jca 1240 . . . . . . . . . . . . . . 15 (((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) ∧ 𝑥 ≤ (𝑁𝑆)) → ((𝑥 + 𝑆) ∈ ℕ0 ∧ (#‘𝐹) ∈ ℕ0 ∧ (𝑥 + 𝑆) ≤ (#‘𝐹)))
4015, 39sylanl1 681 . . . . . . . . . . . . . 14 (((𝜑𝑥 ∈ (0...𝑁)) ∧ 𝑥 ≤ (𝑁𝑆)) → ((𝑥 + 𝑆) ∈ ℕ0 ∧ (#‘𝐹) ∈ ℕ0 ∧ (𝑥 + 𝑆) ≤ (#‘𝐹)))
41 elfz2nn0 12415 . . . . . . . . . . . . . 14 ((𝑥 + 𝑆) ∈ (0...(#‘𝐹)) ↔ ((𝑥 + 𝑆) ∈ ℕ0 ∧ (#‘𝐹) ∈ ℕ0 ∧ (𝑥 + 𝑆) ≤ (#‘𝐹)))
4240, 41sylibr 224 . . . . . . . . . . . . 13 (((𝜑𝑥 ∈ (0...𝑁)) ∧ 𝑥 ≤ (𝑁𝑆)) → (𝑥 + 𝑆) ∈ (0...(#‘𝐹)))
4342adantll 749 . . . . . . . . . . . 12 (((𝑃:(0...(#‘𝐹))⟶𝑉 ∧ (𝜑𝑥 ∈ (0...𝑁))) ∧ 𝑥 ≤ (𝑁𝑆)) → (𝑥 + 𝑆) ∈ (0...(#‘𝐹)))
4414, 43ffvelrnd 6346 . . . . . . . . . . 11 (((𝑃:(0...(#‘𝐹))⟶𝑉 ∧ (𝜑𝑥 ∈ (0...𝑁))) ∧ 𝑥 ≤ (𝑁𝑆)) → (𝑃‘(𝑥 + 𝑆)) ∈ 𝑉)
45 simpll 789 . . . . . . . . . . . 12 (((𝑃:(0...(#‘𝐹))⟶𝑉 ∧ (𝜑𝑥 ∈ (0...𝑁))) ∧ ¬ 𝑥 ≤ (𝑁𝑆)) → 𝑃:(0...(#‘𝐹))⟶𝑉)
46 elfzoel2 12453 . . . . . . . . . . . . . . . . . . 19 (𝑆 ∈ (0..^𝑁) → 𝑁 ∈ ℤ)
47 zaddcl 11402 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((𝑥 ∈ ℤ ∧ 𝑆 ∈ ℤ) → (𝑥 + 𝑆) ∈ ℤ)
4847adantrr 752 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝑥 + 𝑆) ∈ ℤ)
49 simprr 795 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → 𝑁 ∈ ℤ)
5048, 49zsubcld 11472 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → ((𝑥 + 𝑆) − 𝑁) ∈ ℤ)
5150adantr 481 . . . . . . . . . . . . . . . . . . . . . 22 (((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) ∧ ¬ 𝑥 ≤ (𝑁𝑆)) → ((𝑥 + 𝑆) − 𝑁) ∈ ℤ)
52 zsubcl 11404 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 ((𝑁 ∈ ℤ ∧ 𝑆 ∈ ℤ) → (𝑁𝑆) ∈ ℤ)
5352ancoms 469 . . . . . . . . . . . . . . . . . . . . . . . . . 26 ((𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁𝑆) ∈ ℤ)
5453zred 11467 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁𝑆) ∈ ℝ)
55 zre 11366 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝑥 ∈ ℤ → 𝑥 ∈ ℝ)
56 ltnle 10102 . . . . . . . . . . . . . . . . . . . . . . . . 25 (((𝑁𝑆) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝑁𝑆) < 𝑥 ↔ ¬ 𝑥 ≤ (𝑁𝑆)))
5754, 55, 56syl2anr 495 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → ((𝑁𝑆) < 𝑥 ↔ ¬ 𝑥 ≤ (𝑁𝑆)))
58 zre 11366 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (𝑁 ∈ ℤ → 𝑁 ∈ ℝ)
5958adantl 482 . . . . . . . . . . . . . . . . . . . . . . . . . 26 ((𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℝ)
60 zre 11366 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (𝑆 ∈ ℤ → 𝑆 ∈ ℝ)
6160adantr 481 . . . . . . . . . . . . . . . . . . . . . . . . . 26 ((𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑆 ∈ ℝ)
6255adantr 481 . . . . . . . . . . . . . . . . . . . . . . . . . 26 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → 𝑥 ∈ ℝ)
63 ltsubadd 10483 . . . . . . . . . . . . . . . . . . . . . . . . . 26 ((𝑁 ∈ ℝ ∧ 𝑆 ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝑁𝑆) < 𝑥𝑁 < (𝑥 + 𝑆)))
6459, 61, 62, 63syl2an23an 1385 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → ((𝑁𝑆) < 𝑥𝑁 < (𝑥 + 𝑆)))
6559adantl 482 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → 𝑁 ∈ ℝ)
6648zred 11467 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝑥 + 𝑆) ∈ ℝ)
6765, 66posdifd 10599 . . . . . . . . . . . . . . . . . . . . . . . . . 26 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝑁 < (𝑥 + 𝑆) ↔ 0 < ((𝑥 + 𝑆) − 𝑁)))
68 0red 10026 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → 0 ∈ ℝ)
6950zred 11467 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → ((𝑥 + 𝑆) − 𝑁) ∈ ℝ)
70 ltle 10111 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 ((0 ∈ ℝ ∧ ((𝑥 + 𝑆) − 𝑁) ∈ ℝ) → (0 < ((𝑥 + 𝑆) − 𝑁) → 0 ≤ ((𝑥 + 𝑆) − 𝑁)))
7168, 69, 70syl2anc 692 . . . . . . . . . . . . . . . . . . . . . . . . . 26 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (0 < ((𝑥 + 𝑆) − 𝑁) → 0 ≤ ((𝑥 + 𝑆) − 𝑁)))
7267, 71sylbid 230 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝑁 < (𝑥 + 𝑆) → 0 ≤ ((𝑥 + 𝑆) − 𝑁)))
7364, 72sylbid 230 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → ((𝑁𝑆) < 𝑥 → 0 ≤ ((𝑥 + 𝑆) − 𝑁)))
7457, 73sylbird 250 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (¬ 𝑥 ≤ (𝑁𝑆) → 0 ≤ ((𝑥 + 𝑆) − 𝑁)))
7574imp 445 . . . . . . . . . . . . . . . . . . . . . 22 (((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) ∧ ¬ 𝑥 ≤ (𝑁𝑆)) → 0 ≤ ((𝑥 + 𝑆) − 𝑁))
7651, 75jca 554 . . . . . . . . . . . . . . . . . . . . 21 (((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) ∧ ¬ 𝑥 ≤ (𝑁𝑆)) → (((𝑥 + 𝑆) − 𝑁) ∈ ℤ ∧ 0 ≤ ((𝑥 + 𝑆) − 𝑁)))
7776exp31 629 . . . . . . . . . . . . . . . . . . . 20 (𝑥 ∈ ℤ → ((𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ 𝑥 ≤ (𝑁𝑆) → (((𝑥 + 𝑆) − 𝑁) ∈ ℤ ∧ 0 ≤ ((𝑥 + 𝑆) − 𝑁)))))
7877, 26syl11 33 . . . . . . . . . . . . . . . . . . 19 ((𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑥 ∈ (0...𝑁) → (¬ 𝑥 ≤ (𝑁𝑆) → (((𝑥 + 𝑆) − 𝑁) ∈ ℤ ∧ 0 ≤ ((𝑥 + 𝑆) − 𝑁)))))
7929, 46, 78syl2anc 692 . . . . . . . . . . . . . . . . . 18 (𝑆 ∈ (0..^𝑁) → (𝑥 ∈ (0...𝑁) → (¬ 𝑥 ≤ (𝑁𝑆) → (((𝑥 + 𝑆) − 𝑁) ∈ ℤ ∧ 0 ≤ ((𝑥 + 𝑆) − 𝑁)))))
8079imp31 448 . . . . . . . . . . . . . . . . 17 (((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) ∧ ¬ 𝑥 ≤ (𝑁𝑆)) → (((𝑥 + 𝑆) − 𝑁) ∈ ℤ ∧ 0 ≤ ((𝑥 + 𝑆) − 𝑁)))
81 elnn0z 11375 . . . . . . . . . . . . . . . . 17 (((𝑥 + 𝑆) − 𝑁) ∈ ℕ0 ↔ (((𝑥 + 𝑆) − 𝑁) ∈ ℤ ∧ 0 ≤ ((𝑥 + 𝑆) − 𝑁)))
8280, 81sylibr 224 . . . . . . . . . . . . . . . 16 (((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) ∧ ¬ 𝑥 ≤ (𝑁𝑆)) → ((𝑥 + 𝑆) − 𝑁) ∈ ℕ0)
8324ad2antlr 762 . . . . . . . . . . . . . . . 16 (((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) ∧ ¬ 𝑥 ≤ (𝑁𝑆)) → (#‘𝐹) ∈ ℕ0)
84 elfzo0 12492 . . . . . . . . . . . . . . . . . . . . 21 (𝑆 ∈ (0..^𝑁) ↔ (𝑆 ∈ ℕ0𝑁 ∈ ℕ ∧ 𝑆 < 𝑁))
85 elfz2nn0 12415 . . . . . . . . . . . . . . . . . . . . 21 (𝑥 ∈ (0...𝑁) ↔ (𝑥 ∈ ℕ0𝑁 ∈ ℕ0𝑥𝑁))
86 nn0re 11286 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝑆 ∈ ℕ0𝑆 ∈ ℝ)
87863ad2ant1 1080 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑆 ∈ ℕ0𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) → 𝑆 ∈ ℝ)
88 nn0re 11286 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝑥 ∈ ℕ0𝑥 ∈ ℝ)
89883ad2ant1 1080 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑥 ∈ ℕ0𝑁 ∈ ℕ0𝑥𝑁) → 𝑥 ∈ ℝ)
9087, 89anim12ci 590 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝑆 ∈ ℕ0𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) ∧ (𝑥 ∈ ℕ0𝑁 ∈ ℕ0𝑥𝑁)) → (𝑥 ∈ ℝ ∧ 𝑆 ∈ ℝ))
91 nnre 11012 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑁 ∈ ℕ → 𝑁 ∈ ℝ)
9291, 91jca 554 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝑁 ∈ ℕ → (𝑁 ∈ ℝ ∧ 𝑁 ∈ ℝ))
93923ad2ant2 1081 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑆 ∈ ℕ0𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) → (𝑁 ∈ ℝ ∧ 𝑁 ∈ ℝ))
9493adantr 481 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝑆 ∈ ℕ0𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) ∧ (𝑥 ∈ ℕ0𝑁 ∈ ℕ0𝑥𝑁)) → (𝑁 ∈ ℝ ∧ 𝑁 ∈ ℝ))
9590, 94jca 554 . . . . . . . . . . . . . . . . . . . . . 22 (((𝑆 ∈ ℕ0𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) ∧ (𝑥 ∈ ℕ0𝑁 ∈ ℕ0𝑥𝑁)) → ((𝑥 ∈ ℝ ∧ 𝑆 ∈ ℝ) ∧ (𝑁 ∈ ℝ ∧ 𝑁 ∈ ℝ)))
96 simpr3 1067 . . . . . . . . . . . . . . . . . . . . . 22 (((𝑆 ∈ ℕ0𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) ∧ (𝑥 ∈ ℕ0𝑁 ∈ ℕ0𝑥𝑁)) → 𝑥𝑁)
97 ltle 10111 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((𝑆 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑆 < 𝑁𝑆𝑁))
9886, 91, 97syl2an 494 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑆 ∈ ℕ0𝑁 ∈ ℕ) → (𝑆 < 𝑁𝑆𝑁))
99983impia 1259 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑆 ∈ ℕ0𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) → 𝑆𝑁)
10099adantr 481 . . . . . . . . . . . . . . . . . . . . . 22 (((𝑆 ∈ ℕ0𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) ∧ (𝑥 ∈ ℕ0𝑁 ∈ ℕ0𝑥𝑁)) → 𝑆𝑁)
10195, 96, 100jca32 557 . . . . . . . . . . . . . . . . . . . . 21 (((𝑆 ∈ ℕ0𝑁 ∈ ℕ ∧ 𝑆 < 𝑁) ∧ (𝑥 ∈ ℕ0𝑁 ∈ ℕ0𝑥𝑁)) → (((𝑥 ∈ ℝ ∧ 𝑆 ∈ ℝ) ∧ (𝑁 ∈ ℝ ∧ 𝑁 ∈ ℝ)) ∧ (𝑥𝑁𝑆𝑁)))
10284, 85, 101syl2anb 496 . . . . . . . . . . . . . . . . . . . 20 ((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) → (((𝑥 ∈ ℝ ∧ 𝑆 ∈ ℝ) ∧ (𝑁 ∈ ℝ ∧ 𝑁 ∈ ℝ)) ∧ (𝑥𝑁𝑆𝑁)))
103 le2add 10495 . . . . . . . . . . . . . . . . . . . . 21 (((𝑥 ∈ ℝ ∧ 𝑆 ∈ ℝ) ∧ (𝑁 ∈ ℝ ∧ 𝑁 ∈ ℝ)) → ((𝑥𝑁𝑆𝑁) → (𝑥 + 𝑆) ≤ (𝑁 + 𝑁)))
104103imp 445 . . . . . . . . . . . . . . . . . . . 20 ((((𝑥 ∈ ℝ ∧ 𝑆 ∈ ℝ) ∧ (𝑁 ∈ ℝ ∧ 𝑁 ∈ ℝ)) ∧ (𝑥𝑁𝑆𝑁)) → (𝑥 + 𝑆) ≤ (𝑁 + 𝑁))
105102, 104syl 17 . . . . . . . . . . . . . . . . . . 19 ((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) → (𝑥 + 𝑆) ≤ (𝑁 + 𝑁))
10666, 65, 653jca 1240 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑥 ∈ ℤ ∧ (𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → ((𝑥 + 𝑆) ∈ ℝ ∧ 𝑁 ∈ ℝ ∧ 𝑁 ∈ ℝ))
107106ex 450 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑥 ∈ ℤ → ((𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑥 + 𝑆) ∈ ℝ ∧ 𝑁 ∈ ℝ ∧ 𝑁 ∈ ℝ)))
108107, 26syl11 33 . . . . . . . . . . . . . . . . . . . . . 22 ((𝑆 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑥 ∈ (0...𝑁) → ((𝑥 + 𝑆) ∈ ℝ ∧ 𝑁 ∈ ℝ ∧ 𝑁 ∈ ℝ)))
10929, 46, 108syl2anc 692 . . . . . . . . . . . . . . . . . . . . 21 (𝑆 ∈ (0..^𝑁) → (𝑥 ∈ (0...𝑁) → ((𝑥 + 𝑆) ∈ ℝ ∧ 𝑁 ∈ ℝ ∧ 𝑁 ∈ ℝ)))
110109imp 445 . . . . . . . . . . . . . . . . . . . 20 ((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) → ((𝑥 + 𝑆) ∈ ℝ ∧ 𝑁 ∈ ℝ ∧ 𝑁 ∈ ℝ))
111 lesubadd 10485 . . . . . . . . . . . . . . . . . . . 20 (((𝑥 + 𝑆) ∈ ℝ ∧ 𝑁 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (((𝑥 + 𝑆) − 𝑁) ≤ 𝑁 ↔ (𝑥 + 𝑆) ≤ (𝑁 + 𝑁)))
112110, 111syl 17 . . . . . . . . . . . . . . . . . . 19 ((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) → (((𝑥 + 𝑆) − 𝑁) ≤ 𝑁 ↔ (𝑥 + 𝑆) ≤ (𝑁 + 𝑁)))
113105, 112mpbird 247 . . . . . . . . . . . . . . . . . 18 ((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) → ((𝑥 + 𝑆) − 𝑁) ≤ 𝑁)
114113adantr 481 . . . . . . . . . . . . . . . . 17 (((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) ∧ ¬ 𝑥 ≤ (𝑁𝑆)) → ((𝑥 + 𝑆) − 𝑁) ≤ 𝑁)
115114, 22syl6breq 4685 . . . . . . . . . . . . . . . 16 (((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) ∧ ¬ 𝑥 ≤ (𝑁𝑆)) → ((𝑥 + 𝑆) − 𝑁) ≤ (#‘𝐹))
11682, 83, 1153jca 1240 . . . . . . . . . . . . . . 15 (((𝑆 ∈ (0..^𝑁) ∧ 𝑥 ∈ (0...𝑁)) ∧ ¬ 𝑥 ≤ (𝑁𝑆)) → (((𝑥 + 𝑆) − 𝑁) ∈ ℕ0 ∧ (#‘𝐹) ∈ ℕ0 ∧ ((𝑥 + 𝑆) − 𝑁) ≤ (#‘𝐹)))
11715, 116sylanl1 681 . . . . . . . . . . . . . 14 (((𝜑𝑥 ∈ (0...𝑁)) ∧ ¬ 𝑥 ≤ (𝑁𝑆)) → (((𝑥 + 𝑆) − 𝑁) ∈ ℕ0 ∧ (#‘𝐹) ∈ ℕ0 ∧ ((𝑥 + 𝑆) − 𝑁) ≤ (#‘𝐹)))
118 elfz2nn0 12415 . . . . . . . . . . . . . 14 (((𝑥 + 𝑆) − 𝑁) ∈ (0...(#‘𝐹)) ↔ (((𝑥 + 𝑆) − 𝑁) ∈ ℕ0 ∧ (#‘𝐹) ∈ ℕ0 ∧ ((𝑥 + 𝑆) − 𝑁) ≤ (#‘𝐹)))
119117, 118sylibr 224 . . . . . . . . . . . . 13 (((𝜑𝑥 ∈ (0...𝑁)) ∧ ¬ 𝑥 ≤ (𝑁𝑆)) → ((𝑥 + 𝑆) − 𝑁) ∈ (0...(#‘𝐹)))
120119adantll 749 . . . . . . . . . . . 12 (((𝑃:(0...(#‘𝐹))⟶𝑉 ∧ (𝜑𝑥 ∈ (0...𝑁))) ∧ ¬ 𝑥 ≤ (𝑁𝑆)) → ((𝑥 + 𝑆) − 𝑁) ∈ (0...(#‘𝐹)))
12145, 120ffvelrnd 6346 . . . . . . . . . . 11 (((𝑃:(0...(#‘𝐹))⟶𝑉 ∧ (𝜑𝑥 ∈ (0...𝑁))) ∧ ¬ 𝑥 ≤ (𝑁𝑆)) → (𝑃‘((𝑥 + 𝑆) − 𝑁)) ∈ 𝑉)
12244, 121ifclda 4111 . . . . . . . . . 10 ((𝑃:(0...(#‘𝐹))⟶𝑉 ∧ (𝜑𝑥 ∈ (0...𝑁))) → if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))) ∈ 𝑉)
123122exp32 630 . . . . . . . . 9 (𝑃:(0...(#‘𝐹))⟶𝑉 → (𝜑 → (𝑥 ∈ (0...𝑁) → if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))) ∈ 𝑉)))
12413, 123syl 17 . . . . . . . 8 (𝐹(Walks‘𝐺)𝑃 → (𝜑 → (𝑥 ∈ (0...𝑁) → if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))) ∈ 𝑉)))
12511, 124mpcom 38 . . . . . . 7 (𝜑 → (𝑥 ∈ (0...𝑁) → if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))) ∈ 𝑉))
126125imp 445 . . . . . 6 ((𝜑𝑥 ∈ (0...𝑁)) → if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))) ∈ 𝑉)
127 crctcsh.q . . . . . 6 𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))
128126, 127fmptd 6371 . . . . 5 (𝜑𝑄:(0...𝑁)⟶𝑉)
12912, 4, 2, 22, 15, 1crctcshlem2 26691 . . . . . . 7 (𝜑 → (#‘𝐻) = 𝑁)
130129oveq2d 6651 . . . . . 6 (𝜑 → (0...(#‘𝐻)) = (0...𝑁))
131130feq2d 6018 . . . . 5 (𝜑 → (𝑄:(0...(#‘𝐻))⟶𝑉𝑄:(0...𝑁)⟶𝑉))
132128, 131mpbird 247 . . . 4 (𝜑𝑄:(0...(#‘𝐻))⟶𝑉)
133132adantr 481 . . 3 ((𝜑𝑆 ≠ 0) → 𝑄:(0...(#‘𝐻))⟶𝑉)
13412, 4wlkprop 26488 . . . . . 6 (𝐹(Walks‘𝐺)𝑃 → (𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉 ∧ ∀𝑖 ∈ (0..^(#‘𝐹))if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖)))))
1352, 3, 1343syl 18 . . . . 5 (𝜑 → (𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉 ∧ ∀𝑖 ∈ (0..^(#‘𝐹))if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖)))))
136135adantr 481 . . . 4 ((𝜑𝑆 ≠ 0) → (𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉 ∧ ∀𝑖 ∈ (0..^(#‘𝐹))if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖)))))
13722eqcomi 2629 . . . . . . . . . 10 (#‘𝐹) = 𝑁
138137oveq2i 6646 . . . . . . . . 9 (0..^(#‘𝐹)) = (0..^𝑁)
139138raleqi 3137 . . . . . . . 8 (∀𝑖 ∈ (0..^(#‘𝐹))if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖))) ↔ ∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖))))
140 fzo1fzo0n0 12502 . . . . . . . . . . . . . . 15 (𝑆 ∈ (1..^𝑁) ↔ (𝑆 ∈ (0..^𝑁) ∧ 𝑆 ≠ 0))
141140simplbi2 654 . . . . . . . . . . . . . 14 (𝑆 ∈ (0..^𝑁) → (𝑆 ≠ 0 → 𝑆 ∈ (1..^𝑁)))
14215, 141syl 17 . . . . . . . . . . . . 13 (𝜑 → (𝑆 ≠ 0 → 𝑆 ∈ (1..^𝑁)))
143142imp 445 . . . . . . . . . . . 12 ((𝜑𝑆 ≠ 0) → 𝑆 ∈ (1..^𝑁))
144143ad2antlr 762 . . . . . . . . . . 11 ((((𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉) ∧ (𝜑𝑆 ≠ 0)) ∧ ∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖)))) → 𝑆 ∈ (1..^𝑁))
145 simplll 797 . . . . . . . . . . 11 ((((𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉) ∧ (𝜑𝑆 ≠ 0)) ∧ ∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖)))) → 𝐹 ∈ Word dom 𝐼)
146 wkslem1 26484 . . . . . . . . . . . . . 14 (𝑖 = 𝑘 → (if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖))) ↔ if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))))
147146cbvralv 3166 . . . . . . . . . . . . 13 (∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖))) ↔ ∀𝑘 ∈ (0..^𝑁)if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))))
148147biimpi 206 . . . . . . . . . . . 12 (∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖))) → ∀𝑘 ∈ (0..^𝑁)if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))))
149148adantl 482 . . . . . . . . . . 11 ((((𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉) ∧ (𝜑𝑆 ≠ 0)) ∧ ∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖)))) → ∀𝑘 ∈ (0..^𝑁)if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))))
150 crctprop 26668 . . . . . . . . . . . . . 14 (𝐹(Circuits‘𝐺)𝑃 → (𝐹(Trails‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(#‘𝐹))))
151137fveq2i 6181 . . . . . . . . . . . . . . . . . 18 (𝑃‘(#‘𝐹)) = (𝑃𝑁)
152151eqeq2i 2632 . . . . . . . . . . . . . . . . 17 ((𝑃‘0) = (𝑃‘(#‘𝐹)) ↔ (𝑃‘0) = (𝑃𝑁))
153152biimpi 206 . . . . . . . . . . . . . . . 16 ((𝑃‘0) = (𝑃‘(#‘𝐹)) → (𝑃‘0) = (𝑃𝑁))
154153eqcomd 2626 . . . . . . . . . . . . . . 15 ((𝑃‘0) = (𝑃‘(#‘𝐹)) → (𝑃𝑁) = (𝑃‘0))
155154adantl 482 . . . . . . . . . . . . . 14 ((𝐹(Trails‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(#‘𝐹))) → (𝑃𝑁) = (𝑃‘0))
1562, 150, 1553syl 18 . . . . . . . . . . . . 13 (𝜑 → (𝑃𝑁) = (𝑃‘0))
157156ad2antrl 763 . . . . . . . . . . . 12 (((𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉) ∧ (𝜑𝑆 ≠ 0)) → (𝑃𝑁) = (𝑃‘0))
158157adantr 481 . . . . . . . . . . 11 ((((𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉) ∧ (𝜑𝑆 ≠ 0)) ∧ ∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖)))) → (𝑃𝑁) = (𝑃‘0))
159144, 127, 1, 22, 145, 149, 158crctcshwlkn0lem7 26689 . . . . . . . . . 10 ((((𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉) ∧ (𝜑𝑆 ≠ 0)) ∧ ∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖)))) → ∀𝑗 ∈ (0..^𝑁)if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))
160129oveq2d 6651 . . . . . . . . . . . . 13 (𝜑 → (0..^(#‘𝐻)) = (0..^𝑁))
161160raleqdv 3139 . . . . . . . . . . . 12 (𝜑 → (∀𝑗 ∈ (0..^(#‘𝐻))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))) ↔ ∀𝑗 ∈ (0..^𝑁)if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗)))))
162161ad2antrl 763 . . . . . . . . . . 11 (((𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉) ∧ (𝜑𝑆 ≠ 0)) → (∀𝑗 ∈ (0..^(#‘𝐻))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))) ↔ ∀𝑗 ∈ (0..^𝑁)if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗)))))
163162adantr 481 . . . . . . . . . 10 ((((𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉) ∧ (𝜑𝑆 ≠ 0)) ∧ ∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖)))) → (∀𝑗 ∈ (0..^(#‘𝐻))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))) ↔ ∀𝑗 ∈ (0..^𝑁)if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗)))))
164159, 163mpbird 247 . . . . . . . . 9 ((((𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉) ∧ (𝜑𝑆 ≠ 0)) ∧ ∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖)))) → ∀𝑗 ∈ (0..^(#‘𝐻))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))
165164ex 450 . . . . . . . 8 (((𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉) ∧ (𝜑𝑆 ≠ 0)) → (∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖))) → ∀𝑗 ∈ (0..^(#‘𝐻))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗)))))
166139, 165syl5bi 232 . . . . . . 7 (((𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉) ∧ (𝜑𝑆 ≠ 0)) → (∀𝑖 ∈ (0..^(#‘𝐹))if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖))) → ∀𝑗 ∈ (0..^(#‘𝐻))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗)))))
167166ex 450 . . . . . 6 ((𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉) → ((𝜑𝑆 ≠ 0) → (∀𝑖 ∈ (0..^(#‘𝐹))if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖))) → ∀𝑗 ∈ (0..^(#‘𝐻))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))))
168167com23 86 . . . . 5 ((𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉) → (∀𝑖 ∈ (0..^(#‘𝐹))if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖))) → ((𝜑𝑆 ≠ 0) → ∀𝑗 ∈ (0..^(#‘𝐻))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))))
1691683impia 1259 . . . 4 ((𝐹 ∈ Word dom 𝐼𝑃:(0...(#‘𝐹))⟶𝑉 ∧ ∀𝑖 ∈ (0..^(#‘𝐹))if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖)))) → ((𝜑𝑆 ≠ 0) → ∀𝑗 ∈ (0..^(#‘𝐻))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗)))))
170136, 169mpcom 38 . . 3 ((𝜑𝑆 ≠ 0) → ∀𝑗 ∈ (0..^(#‘𝐻))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))
17110, 133, 1703jca 1240 . 2 ((𝜑𝑆 ≠ 0) → (𝐻 ∈ Word dom 𝐼𝑄:(0...(#‘𝐻))⟶𝑉 ∧ ∀𝑗 ∈ (0..^(#‘𝐻))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗)))))
17212, 4, 2, 22, 15, 1, 127crctcshlem3 26692 . . . 4 (𝜑 → (𝐺 ∈ V ∧ 𝐻 ∈ V ∧ 𝑄 ∈ V))
173172adantr 481 . . 3 ((𝜑𝑆 ≠ 0) → (𝐺 ∈ V ∧ 𝐻 ∈ V ∧ 𝑄 ∈ V))
17412, 4iswlk 26487 . . 3 ((𝐺 ∈ V ∧ 𝐻 ∈ V ∧ 𝑄 ∈ V) → (𝐻(Walks‘𝐺)𝑄 ↔ (𝐻 ∈ Word dom 𝐼𝑄:(0...(#‘𝐻))⟶𝑉 ∧ ∀𝑗 ∈ (0..^(#‘𝐻))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))))
175173, 174syl 17 . 2 ((𝜑𝑆 ≠ 0) → (𝐻(Walks‘𝐺)𝑄 ↔ (𝐻 ∈ Word dom 𝐼𝑄:(0...(#‘𝐻))⟶𝑉 ∧ ∀𝑗 ∈ (0..^(#‘𝐻))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))))
176171, 175mpbird 247 1 ((𝜑𝑆 ≠ 0) → 𝐻(Walks‘𝐺)𝑄)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 384  if-wif 1011  w3a 1036   = wceq 1481  wcel 1988  wne 2791  wral 2909  Vcvv 3195  wss 3567  ifcif 4077  {csn 4168  {cpr 4170   class class class wbr 4644  cmpt 4720  dom cdm 5104  wf 5872  cfv 5876  (class class class)co 6635  cr 9920  0cc0 9921  1c1 9922   + caddc 9924   < clt 10059  cle 10060  cmin 10251  cn 11005  0cn0 11277  cz 11362  ...cfz 12311  ..^cfzo 12449  #chash 13100  Word cword 13274   cyclShift ccsh 13515  Vtxcvtx 25855  iEdgciedg 25856  Walkscwlks 26473  Trailsctrls 26568  Circuitsccrcts 26660
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-8 1990  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600  ax-rep 4762  ax-sep 4772  ax-nul 4780  ax-pow 4834  ax-pr 4897  ax-un 6934  ax-cnex 9977  ax-resscn 9978  ax-1cn 9979  ax-icn 9980  ax-addcl 9981  ax-addrcl 9982  ax-mulcl 9983  ax-mulrcl 9984  ax-mulcom 9985  ax-addass 9986  ax-mulass 9987  ax-distr 9988  ax-i2m1 9989  ax-1ne0 9990  ax-1rid 9991  ax-rnegex 9992  ax-rrecex 9993  ax-cnre 9994  ax-pre-lttri 9995  ax-pre-lttrn 9996  ax-pre-ltadd 9997  ax-pre-mulgt0 9998  ax-pre-sup 9999
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-ifp 1012  df-3or 1037  df-3an 1038  df-tru 1484  df-ex 1703  df-nf 1708  df-sb 1879  df-eu 2472  df-mo 2473  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ne 2792  df-nel 2895  df-ral 2914  df-rex 2915  df-reu 2916  df-rmo 2917  df-rab 2918  df-v 3197  df-sbc 3430  df-csb 3527  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-pss 3583  df-nul 3908  df-if 4078  df-pw 4151  df-sn 4169  df-pr 4171  df-tp 4173  df-op 4175  df-uni 4428  df-int 4467  df-iun 4513  df-br 4645  df-opab 4704  df-mpt 4721  df-tr 4744  df-id 5014  df-eprel 5019  df-po 5025  df-so 5026  df-fr 5063  df-we 5065  df-xp 5110  df-rel 5111  df-cnv 5112  df-co 5113  df-dm 5114  df-rn 5115  df-res 5116  df-ima 5117  df-pred 5668  df-ord 5714  df-on 5715  df-lim 5716  df-suc 5717  df-iota 5839  df-fun 5878  df-fn 5879  df-f 5880  df-f1 5881  df-fo 5882  df-f1o 5883  df-fv 5884  df-riota 6596  df-ov 6638  df-oprab 6639  df-mpt2 6640  df-om 7051  df-1st 7153  df-2nd 7154  df-wrecs 7392  df-recs 7453  df-rdg 7491  df-1o 7545  df-oadd 7549  df-er 7727  df-map 7844  df-pm 7845  df-en 7941  df-dom 7942  df-sdom 7943  df-fin 7944  df-sup 8333  df-inf 8334  df-card 8750  df-pnf 10061  df-mnf 10062  df-xr 10063  df-ltxr 10064  df-le 10065  df-sub 10253  df-neg 10254  df-div 10670  df-nn 11006  df-2 11064  df-n0 11278  df-z 11363  df-uz 11673  df-rp 11818  df-fz 12312  df-fzo 12450  df-fl 12576  df-mod 12652  df-hash 13101  df-word 13282  df-concat 13284  df-substr 13286  df-csh 13516  df-wlks 26476  df-trls 26570  df-crcts 26662
This theorem is referenced by:  crctcshwlk  26695
  Copyright terms: Public domain W3C validator