clwlknf1oclwwlknlem1 - Metamath Proof Explorer

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

Theorem clwlknf1oclwwlknlem1 29599

Description: Lemma 1 for clwlknf1oclwwlkn 29602. (Contributed by AV, 26-May-2022.) (Revised by AV, 1-Nov-2022.)

**Assertion**
Ref	Expression
clwlknf1oclwwlknlem1	⊢ ((𝐶 ∈ (ClWalks‘𝐺) ∧ 1 ≤ (♯‘(1^st ‘𝐶))) → (♯‘((2^nd ‘𝐶) prefix ((♯‘(2^nd ‘𝐶)) − 1))) = (♯‘(1^st ‘𝐶)))

**Proof of Theorem clwlknf1oclwwlknlem1**
Step	Hyp	Ref	Expression
1		clwlkwlk 29297	. . 3 ⊢ (𝐶 ∈ (ClWalks‘𝐺) → 𝐶 ∈ (Walks‘𝐺))
2		wlkcpr 29151	. . . 4 ⊢ (𝐶 ∈ (Walks‘𝐺) ↔ (1^st ‘𝐶)(Walks‘𝐺)(2^nd ‘𝐶))
3		eqid 2730	. . . . . . . 8 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
4	3	wlkpwrd 29139	. . . . . . 7 ⊢ ((1^st ‘𝐶)(Walks‘𝐺)(2^nd ‘𝐶) → (2^nd ‘𝐶) ∈ Word (Vtx‘𝐺))
5		lencl 14489	. . . . . . . . 9 ⊢ ((2^nd ‘𝐶) ∈ Word (Vtx‘𝐺) → (♯‘(2^nd ‘𝐶)) ∈ ℕ₀)
6	4, 5	syl 17	. . . . . . . 8 ⊢ ((1^st ‘𝐶)(Walks‘𝐺)(2^nd ‘𝐶) → (♯‘(2^nd ‘𝐶)) ∈ ℕ₀)
7		wlklenvm1 29144	. . . . . . . . . . 11 ⊢ ((1^st ‘𝐶)(Walks‘𝐺)(2^nd ‘𝐶) → (♯‘(1^st ‘𝐶)) = ((♯‘(2^nd ‘𝐶)) − 1))
8	7	breq2d 5161	. . . . . . . . . 10 ⊢ ((1^st ‘𝐶)(Walks‘𝐺)(2^nd ‘𝐶) → (1 ≤ (♯‘(1^st ‘𝐶)) ↔ 1 ≤ ((♯‘(2^nd ‘𝐶)) − 1)))
9		1red 11221	. . . . . . . . . . . . 13 ⊢ ((♯‘(2^nd ‘𝐶)) ∈ ℕ₀ → 1 ∈ ℝ)
10		nn0re 12487	. . . . . . . . . . . . 13 ⊢ ((♯‘(2^nd ‘𝐶)) ∈ ℕ₀ → (♯‘(2^nd ‘𝐶)) ∈ ℝ)
11	9, 9, 10	leaddsub2d 11822	. . . . . . . . . . . 12 ⊢ ((♯‘(2^nd ‘𝐶)) ∈ ℕ₀ → ((1 + 1) ≤ (♯‘(2^nd ‘𝐶)) ↔ 1 ≤ ((♯‘(2^nd ‘𝐶)) − 1)))
12		1p1e2 12343	. . . . . . . . . . . . . 14 ⊢ (1 + 1) = 2
13	12	breq1i 5156	. . . . . . . . . . . . 13 ⊢ ((1 + 1) ≤ (♯‘(2^nd ‘𝐶)) ↔ 2 ≤ (♯‘(2^nd ‘𝐶)))
14	13	biimpi 215	. . . . . . . . . . . 12 ⊢ ((1 + 1) ≤ (♯‘(2^nd ‘𝐶)) → 2 ≤ (♯‘(2^nd ‘𝐶)))
15	11, 14	syl6bir 253	. . . . . . . . . . 11 ⊢ ((♯‘(2^nd ‘𝐶)) ∈ ℕ₀ → (1 ≤ ((♯‘(2^nd ‘𝐶)) − 1) → 2 ≤ (♯‘(2^nd ‘𝐶))))
16	4, 5, 15	3syl 18	. . . . . . . . . 10 ⊢ ((1^st ‘𝐶)(Walks‘𝐺)(2^nd ‘𝐶) → (1 ≤ ((♯‘(2^nd ‘𝐶)) − 1) → 2 ≤ (♯‘(2^nd ‘𝐶))))
17	8, 16	sylbid 239	. . . . . . . . 9 ⊢ ((1^st ‘𝐶)(Walks‘𝐺)(2^nd ‘𝐶) → (1 ≤ (♯‘(1^st ‘𝐶)) → 2 ≤ (♯‘(2^nd ‘𝐶))))
18	17	imp 405	. . . . . . . 8 ⊢ (((1^st ‘𝐶)(Walks‘𝐺)(2^nd ‘𝐶) ∧ 1 ≤ (♯‘(1^st ‘𝐶))) → 2 ≤ (♯‘(2^nd ‘𝐶)))
19		ige2m1fz 13597	. . . . . . . 8 ⊢ (((♯‘(2^nd ‘𝐶)) ∈ ℕ₀ ∧ 2 ≤ (♯‘(2^nd ‘𝐶))) → ((♯‘(2^nd ‘𝐶)) − 1) ∈ (0...(♯‘(2^nd ‘𝐶))))
20	6, 18, 19	syl2an2r 681	. . . . . . 7 ⊢ (((1^st ‘𝐶)(Walks‘𝐺)(2^nd ‘𝐶) ∧ 1 ≤ (♯‘(1^st ‘𝐶))) → ((♯‘(2^nd ‘𝐶)) − 1) ∈ (0...(♯‘(2^nd ‘𝐶))))
21		pfxlen 14639	. . . . . . 7 ⊢ (((2^nd ‘𝐶) ∈ Word (Vtx‘𝐺) ∧ ((♯‘(2^nd ‘𝐶)) − 1) ∈ (0...(♯‘(2^nd ‘𝐶)))) → (♯‘((2^nd ‘𝐶) prefix ((♯‘(2^nd ‘𝐶)) − 1))) = ((♯‘(2^nd ‘𝐶)) − 1))
22	4, 20, 21	syl2an2r 681	. . . . . 6 ⊢ (((1^st ‘𝐶)(Walks‘𝐺)(2^nd ‘𝐶) ∧ 1 ≤ (♯‘(1^st ‘𝐶))) → (♯‘((2^nd ‘𝐶) prefix ((♯‘(2^nd ‘𝐶)) − 1))) = ((♯‘(2^nd ‘𝐶)) − 1))
23	7	eqcomd 2736	. . . . . . 7 ⊢ ((1^st ‘𝐶)(Walks‘𝐺)(2^nd ‘𝐶) → ((♯‘(2^nd ‘𝐶)) − 1) = (♯‘(1^st ‘𝐶)))
24	23	adantr 479	. . . . . 6 ⊢ (((1^st ‘𝐶)(Walks‘𝐺)(2^nd ‘𝐶) ∧ 1 ≤ (♯‘(1^st ‘𝐶))) → ((♯‘(2^nd ‘𝐶)) − 1) = (♯‘(1^st ‘𝐶)))
25	22, 24	eqtrd 2770	. . . . 5 ⊢ (((1^st ‘𝐶)(Walks‘𝐺)(2^nd ‘𝐶) ∧ 1 ≤ (♯‘(1^st ‘𝐶))) → (♯‘((2^nd ‘𝐶) prefix ((♯‘(2^nd ‘𝐶)) − 1))) = (♯‘(1^st ‘𝐶)))
26	25	ex 411	. . . 4 ⊢ ((1^st ‘𝐶)(Walks‘𝐺)(2^nd ‘𝐶) → (1 ≤ (♯‘(1^st ‘𝐶)) → (♯‘((2^nd ‘𝐶) prefix ((♯‘(2^nd ‘𝐶)) − 1))) = (♯‘(1^st ‘𝐶))))
27	2, 26	sylbi 216	. . 3 ⊢ (𝐶 ∈ (Walks‘𝐺) → (1 ≤ (♯‘(1^st ‘𝐶)) → (♯‘((2^nd ‘𝐶) prefix ((♯‘(2^nd ‘𝐶)) − 1))) = (♯‘(1^st ‘𝐶))))
28	1, 27	syl 17	. 2 ⊢ (𝐶 ∈ (ClWalks‘𝐺) → (1 ≤ (♯‘(1^st ‘𝐶)) → (♯‘((2^nd ‘𝐶) prefix ((♯‘(2^nd ‘𝐶)) − 1))) = (♯‘(1^st ‘𝐶))))
29	28	imp 405	1 ⊢ ((𝐶 ∈ (ClWalks‘𝐺) ∧ 1 ≤ (♯‘(1^st ‘𝐶))) → (♯‘((2^nd ‘𝐶) prefix ((♯‘(2^nd ‘𝐶)) − 1))) = (♯‘(1^st ‘𝐶)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 394 = wceq 1539 ∈ wcel 2104 class class class wbr 5149 ‘cfv 6544 (class class class)co 7413 1^st c1st 7977 2^nd c2nd 7978 0cc0 11114 1c1 11115 + caddc 11117 ≤ cle 11255 − cmin 11450 2c2 12273 ℕ₀cn0 12478 ...cfz 13490 ♯chash 14296 Word cword 14470 prefix cpfx 14626 Vtxcvtx 28521 Walkscwlks 29118 ClWalkscclwlks 29292

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7729 ax-cnex 11170 ax-resscn 11171 ax-1cn 11172 ax-icn 11173 ax-addcl 11174 ax-addrcl 11175 ax-mulcl 11176 ax-mulrcl 11177 ax-mulcom 11178 ax-addass 11179 ax-mulass 11180 ax-distr 11181 ax-i2m1 11182 ax-1ne0 11183 ax-1rid 11184 ax-rnegex 11185 ax-rrecex 11186 ax-cnre 11187 ax-pre-lttri 11188 ax-pre-lttrn 11189 ax-pre-ltadd 11190 ax-pre-mulgt0 11191

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-ifp 1060 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7369 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7860 df-1st 7979 df-2nd 7980 df-frecs 8270 df-wrecs 8301 df-recs 8375 df-rdg 8414 df-1o 8470 df-er 8707 df-map 8826 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-card 9938 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11452 df-neg 11453 df-nn 12219 df-2 12281 df-n0 12479 df-z 12565 df-uz 12829 df-fz 13491 df-fzo 13634 df-hash 14297 df-word 14471 df-substr 14597 df-pfx 14627 df-wlks 29121 df-clwlks 29293

This theorem is referenced by: clwlknf1oclwwlkn 29602

W3C validator