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

Theorem dlwwlknondlwlknonf1olem1 31022
Description: Lemma 1 for dlwwlknondlwlknonf1o 31023. (Contributed by AV, 29-May-2022.) (Revised by AV, 1-Nov-2022.)
Assertion
Ref Expression
dlwwlknondlwlknonf1olem1 (((♯‘(1st ‘𝑐)) = 𝑁 ∧ 𝑐 ∈ (ClWalks‘𝐺) ∧ 𝑁 ∈ (ℤ≥‘2)) → (((2nd ‘𝑐) prefix (♯‘(1st ‘𝑐)))‘(𝑁 − 2)) = ((2nd ‘𝑐)‘(𝑁 − 2)))

Proof of Theorem dlwwlknondlwlknonf1olem1
StepHypRef Expression
1 clwlkwlk 30419 . . . . 5 (𝑐 ∈ (ClWalks‘𝐺) → 𝑐 ∈ (Walks‘𝐺))
2 wlkcpr 30266 . . . . 5 (𝑐 ∈ (Walks‘𝐺) ↔ (1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐))
31, 2sylib 221 . . . 4 (𝑐 ∈ (ClWalks‘𝐺) → (1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐))
4 eqid 2763 . . . . 5 (Vtx‘𝐺) = (Vtx‘𝐺)
54wlkpwrd 30255 . . . 4 ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) → (2nd ‘𝑐) ∈ Word (Vtx‘𝐺))
63, 5syl 18 . . 3 (𝑐 ∈ (ClWalks‘𝐺) → (2nd ‘𝑐) ∈ Word (Vtx‘𝐺))
763ad2ant2 1152 . 2 (((♯‘(1st ‘𝑐)) = 𝑁 ∧ 𝑐 ∈ (ClWalks‘𝐺) ∧ 𝑁 ∈ (ℤ≥‘2)) → (2nd ‘𝑐) ∈ Word (Vtx‘𝐺))
8 eluzge2nn0 13059 . . . . . . 7 (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℕ0)
983ad2ant3 1153 . . . . . 6 (((♯‘(1st ‘𝑐)) = 𝑁 ∧ 𝑐 ∈ (ClWalks‘𝐺) ∧ 𝑁 ∈ (ℤ≥‘2)) → 𝑁 ∈ ℕ0)
10 eleq1 2852 . . . . . . 7 ((♯‘(1st ‘𝑐)) = 𝑁 → ((♯‘(1st ‘𝑐)) ∈ ℕ0 ↔ 𝑁 ∈ ℕ0))
11103ad2ant1 1151 . . . . . 6 (((♯‘(1st ‘𝑐)) = 𝑁 ∧ 𝑐 ∈ (ClWalks‘𝐺) ∧ 𝑁 ∈ (ℤ≥‘2)) → ((♯‘(1st ‘𝑐)) ∈ ℕ0 ↔ 𝑁 ∈ ℕ0))
129, 11mpbird 260 . . . . 5 (((♯‘(1st ‘𝑐)) = 𝑁 ∧ 𝑐 ∈ (ClWalks‘𝐺) ∧ 𝑁 ∈ (ℤ≥‘2)) → (♯‘(1st ‘𝑐)) ∈ ℕ0)
13 nn0fz0 13799 . . . . 5 ((♯‘(1st ‘𝑐)) ∈ ℕ0 ↔ (♯‘(1st ‘𝑐)) ∈ (0...(♯‘(1st ‘𝑐))))
1412, 13sylib 221 . . . 4 (((♯‘(1st ‘𝑐)) = 𝑁 ∧ 𝑐 ∈ (ClWalks‘𝐺) ∧ 𝑁 ∈ (ℤ≥‘2)) → (♯‘(1st ‘𝑐)) ∈ (0...(♯‘(1st ‘𝑐))))
15 fzelp1 13750 . . . 4 ((♯‘(1st ‘𝑐)) ∈ (0...(♯‘(1st ‘𝑐))) → (♯‘(1st ‘𝑐)) ∈ (0...((♯‘(1st ‘𝑐)) + 1)))
1614, 15syl 18 . . 3 (((♯‘(1st ‘𝑐)) = 𝑁 ∧ 𝑐 ∈ (ClWalks‘𝐺) ∧ 𝑁 ∈ (ℤ≥‘2)) → (♯‘(1st ‘𝑐)) ∈ (0...((♯‘(1st ‘𝑐)) + 1)))
17 wlklenvp1 30256 . . . . . . . 8 ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) → (♯‘(2nd ‘𝑐)) = ((♯‘(1st ‘𝑐)) + 1))
1817eqcomd 2769 . . . . . . 7 ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) → ((♯‘(1st ‘𝑐)) + 1) = (♯‘(2nd ‘𝑐)))
193, 18syl 18 . . . . . 6 (𝑐 ∈ (ClWalks‘𝐺) → ((♯‘(1st ‘𝑐)) + 1) = (♯‘(2nd ‘𝑐)))
2019oveq2d 7467 . . . . 5 (𝑐 ∈ (ClWalks‘𝐺) → (0...((♯‘(1st ‘𝑐)) + 1)) = (0...(♯‘(2nd ‘𝑐))))
2120eleq2d 2850 . . . 4 (𝑐 ∈ (ClWalks‘𝐺) → ((♯‘(1st ‘𝑐)) ∈ (0...((♯‘(1st ‘𝑐)) + 1)) ↔ (♯‘(1st ‘𝑐)) ∈ (0...(♯‘(2nd ‘𝑐)))))
22213ad2ant2 1152 . . 3 (((♯‘(1st ‘𝑐)) = 𝑁 ∧ 𝑐 ∈ (ClWalks‘𝐺) ∧ 𝑁 ∈ (ℤ≥‘2)) → ((♯‘(1st ‘𝑐)) ∈ (0...((♯‘(1st ‘𝑐)) + 1)) ↔ (♯‘(1st ‘𝑐)) ∈ (0...(♯‘(2nd ‘𝑐)))))
2316, 22mpbid 235 . 2 (((♯‘(1st ‘𝑐)) = 𝑁 ∧ 𝑐 ∈ (ClWalks‘𝐺) ∧ 𝑁 ∈ (ℤ≥‘2)) → (♯‘(1st ‘𝑐)) ∈ (0...(♯‘(2nd ‘𝑐))))
24 2nn 12456 . . . . . . 7 2 ∈ ℕ
2524a1i 11 . . . . . 6 (𝑁 ∈ (ℤ≥‘2) → 2 ∈ ℕ)
26 eluz2nn 13055 . . . . . 6 (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℕ)
27 eluzle 13018 . . . . . 6 (𝑁 ∈ (ℤ≥‘2) → 2 ≤ 𝑁)
28 elfz1b 13767 . . . . . 6 (2 ∈ (1...𝑁) ↔ (2 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 2 ≤ 𝑁))
2925, 26, 27, 28syl3anbrc 1362 . . . . 5 (𝑁 ∈ (ℤ≥‘2) → 2 ∈ (1...𝑁))
30 ubmelfzo 13905 . . . . 5 (2 ∈ (1...𝑁) → (𝑁 − 2) ∈ (0..^𝑁))
3129, 30syl 18 . . . 4 (𝑁 ∈ (ℤ≥‘2) → (𝑁 − 2) ∈ (0..^𝑁))
32313ad2ant3 1153 . . 3 (((♯‘(1st ‘𝑐)) = 𝑁 ∧ 𝑐 ∈ (ClWalks‘𝐺) ∧ 𝑁 ∈ (ℤ≥‘2)) → (𝑁 − 2) ∈ (0..^𝑁))
33 oveq2 7459 . . . . 5 ((♯‘(1st ‘𝑐)) = 𝑁 → (0..^(♯‘(1st ‘𝑐))) = (0..^𝑁))
3433eleq2d 2850 . . . 4 ((♯‘(1st ‘𝑐)) = 𝑁 → ((𝑁 − 2) ∈ (0..^(♯‘(1st ‘𝑐))) ↔ (𝑁 − 2) ∈ (0..^𝑁)))
35343ad2ant1 1151 . . 3 (((♯‘(1st ‘𝑐)) = 𝑁 ∧ 𝑐 ∈ (ClWalks‘𝐺) ∧ 𝑁 ∈ (ℤ≥‘2)) → ((𝑁 − 2) ∈ (0..^(♯‘(1st ‘𝑐))) ↔ (𝑁 − 2) ∈ (0..^𝑁)))
3632, 35mpbird 260 . 2 (((♯‘(1st ‘𝑐)) = 𝑁 ∧ 𝑐 ∈ (ClWalks‘𝐺) ∧ 𝑁 ∈ (ℤ≥‘2)) → (𝑁 − 2) ∈ (0..^(♯‘(1st ‘𝑐))))
37 pfxfv 14874 . 2 (((2nd ‘𝑐) ∈ Word (Vtx‘𝐺) ∧ (♯‘(1st ‘𝑐)) ∈ (0...(♯‘(2nd ‘𝑐))) ∧ (𝑁 − 2) ∈ (0..^(♯‘(1st ‘𝑐)))) → (((2nd ‘𝑐) prefix (♯‘(1st ‘𝑐)))‘(𝑁 − 2)) = ((2nd ‘𝑐)‘(𝑁 − 2)))
387, 23, 36, 37syl3anc 1399 1 (((♯‘(1st ‘𝑐)) = 𝑁 ∧ 𝑐 ∈ (ClWalks‘𝐺) ∧ 𝑁 ∈ (ℤ≥‘2)) → (((2nd ‘𝑐) prefix (♯‘(1st ‘𝑐)))‘(𝑁 − 2)) = ((2nd ‘𝑐)‘(𝑁 − 2)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   class class class wbr 5108  ‘cfv 6566  (class class class)co 7451  1st c1st 8033  2nd c2nd 8034  0cc0 11239  1c1 11240   + caddc 11242   ≤ cle 11383   − cmin 11580  ℕcn 12375  2c2 12437  ℕ0cn0 12646  ℤ≥cuz 13005  ...cfz 13679  ..^cfzo 13828  ♯chash 14515  Word cword 14699   prefix cpfx 14862  Vtxcvtx 29631  Walkscwlks 30234  ClWalkscclwlks 30414
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-ifp 1079  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-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-card 10057  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-fz 13680  df-fzo 13829  df-hash 14516  df-word 14700  df-substr 14831  df-pfx 14863  df-wlks 30237  df-clwlks 30415
This theorem is used by:  dlwwlknondlwlknonf1o  31023
  Copyright terms: Public domain W3C validator