Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wlkonwlk1l | Structured version Visualization version GIF version |
Description: A walk is a walk from its first vertex to its last vertex. (Contributed by AV, 7-Feb-2021.) (Revised by AV, 22-Mar-2021.) |
Ref | Expression |
---|---|
wlkonwlk1l.w | ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃) |
Ref | Expression |
---|---|
wlkonwlk1l | ⊢ (𝜑 → 𝐹((𝑃‘0)(WalksOn‘𝐺)(lastS‘𝑃))𝑃) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wlkonwlk1l.w | . 2 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃) | |
2 | eqidd 2822 | . 2 ⊢ (𝜑 → (𝑃‘0) = (𝑃‘0)) | |
3 | wlklenvm1 27389 | . . . . 5 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝐹) = ((♯‘𝑃) − 1)) | |
4 | 3 | fveq2d 6660 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → (𝑃‘(♯‘𝐹)) = (𝑃‘((♯‘𝑃) − 1))) |
5 | eqid 2821 | . . . . . 6 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
6 | 5 | wlkpwrd 27385 | . . . . 5 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝑃 ∈ Word (Vtx‘𝐺)) |
7 | lsw 13901 | . . . . 5 ⊢ (𝑃 ∈ Word (Vtx‘𝐺) → (lastS‘𝑃) = (𝑃‘((♯‘𝑃) − 1))) | |
8 | 6, 7 | syl 17 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → (lastS‘𝑃) = (𝑃‘((♯‘𝑃) − 1))) |
9 | 4, 8 | eqtr4d 2859 | . . 3 ⊢ (𝐹(Walks‘𝐺)𝑃 → (𝑃‘(♯‘𝐹)) = (lastS‘𝑃)) |
10 | 1, 9 | syl 17 | . 2 ⊢ (𝜑 → (𝑃‘(♯‘𝐹)) = (lastS‘𝑃)) |
11 | wlkcl 27383 | . . . . . . . 8 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝐹) ∈ ℕ0) | |
12 | nn0p1nn 11923 | . . . . . . . 8 ⊢ ((♯‘𝐹) ∈ ℕ0 → ((♯‘𝐹) + 1) ∈ ℕ) | |
13 | 11, 12 | syl 17 | . . . . . . 7 ⊢ (𝐹(Walks‘𝐺)𝑃 → ((♯‘𝐹) + 1) ∈ ℕ) |
14 | wlklenvp1 27386 | . . . . . . 7 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝑃) = ((♯‘𝐹) + 1)) | |
15 | 13, 6, 14 | jca32 518 | . . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → (((♯‘𝐹) + 1) ∈ ℕ ∧ (𝑃 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑃) = ((♯‘𝐹) + 1)))) |
16 | fstwrdne0 13893 | . . . . . . 7 ⊢ ((((♯‘𝐹) + 1) ∈ ℕ ∧ (𝑃 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑃) = ((♯‘𝐹) + 1))) → (𝑃‘0) ∈ (Vtx‘𝐺)) | |
17 | lswlgt0cl 13906 | . . . . . . 7 ⊢ ((((♯‘𝐹) + 1) ∈ ℕ ∧ (𝑃 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑃) = ((♯‘𝐹) + 1))) → (lastS‘𝑃) ∈ (Vtx‘𝐺)) | |
18 | 16, 17 | jca 514 | . . . . . 6 ⊢ ((((♯‘𝐹) + 1) ∈ ℕ ∧ (𝑃 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑃) = ((♯‘𝐹) + 1))) → ((𝑃‘0) ∈ (Vtx‘𝐺) ∧ (lastS‘𝑃) ∈ (Vtx‘𝐺))) |
19 | 15, 18 | syl 17 | . . . . 5 ⊢ (𝐹(Walks‘𝐺)𝑃 → ((𝑃‘0) ∈ (Vtx‘𝐺) ∧ (lastS‘𝑃) ∈ (Vtx‘𝐺))) |
20 | eqid 2821 | . . . . . . 7 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
21 | 20 | wlkf 27382 | . . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom (iEdg‘𝐺)) |
22 | wrdv 13866 | . . . . . 6 ⊢ (𝐹 ∈ Word dom (iEdg‘𝐺) → 𝐹 ∈ Word V) | |
23 | 21, 22 | syl 17 | . . . . 5 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word V) |
24 | 19, 23, 6 | jca32 518 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → (((𝑃‘0) ∈ (Vtx‘𝐺) ∧ (lastS‘𝑃) ∈ (Vtx‘𝐺)) ∧ (𝐹 ∈ Word V ∧ 𝑃 ∈ Word (Vtx‘𝐺)))) |
25 | 1, 24 | syl 17 | . . 3 ⊢ (𝜑 → (((𝑃‘0) ∈ (Vtx‘𝐺) ∧ (lastS‘𝑃) ∈ (Vtx‘𝐺)) ∧ (𝐹 ∈ Word V ∧ 𝑃 ∈ Word (Vtx‘𝐺)))) |
26 | 5 | iswlkon 27425 | . . 3 ⊢ ((((𝑃‘0) ∈ (Vtx‘𝐺) ∧ (lastS‘𝑃) ∈ (Vtx‘𝐺)) ∧ (𝐹 ∈ Word V ∧ 𝑃 ∈ Word (Vtx‘𝐺))) → (𝐹((𝑃‘0)(WalksOn‘𝐺)(lastS‘𝑃))𝑃 ↔ (𝐹(Walks‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘0) ∧ (𝑃‘(♯‘𝐹)) = (lastS‘𝑃)))) |
27 | 25, 26 | syl 17 | . 2 ⊢ (𝜑 → (𝐹((𝑃‘0)(WalksOn‘𝐺)(lastS‘𝑃))𝑃 ↔ (𝐹(Walks‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘0) ∧ (𝑃‘(♯‘𝐹)) = (lastS‘𝑃)))) |
28 | 1, 2, 10, 27 | mpbir3and 1338 | 1 ⊢ (𝜑 → 𝐹((𝑃‘0)(WalksOn‘𝐺)(lastS‘𝑃))𝑃) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 Vcvv 3486 class class class wbr 5052 dom cdm 5541 ‘cfv 6341 (class class class)co 7142 0cc0 10523 1c1 10524 + caddc 10526 − cmin 10856 ℕcn 11624 ℕ0cn0 11884 ♯chash 13680 Word cword 13851 lastSclsw 13899 Vtxcvtx 26767 iEdgciedg 26768 Walkscwlks 27364 WalksOncwlkson 27365 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5176 ax-sep 5189 ax-nul 5196 ax-pow 5252 ax-pr 5316 ax-un 7447 ax-cnex 10579 ax-resscn 10580 ax-1cn 10581 ax-icn 10582 ax-addcl 10583 ax-addrcl 10584 ax-mulcl 10585 ax-mulrcl 10586 ax-mulcom 10587 ax-addass 10588 ax-mulass 10589 ax-distr 10590 ax-i2m1 10591 ax-1ne0 10592 ax-1rid 10593 ax-rnegex 10594 ax-rrecex 10595 ax-cnre 10596 ax-pre-lttri 10597 ax-pre-lttrn 10598 ax-pre-ltadd 10599 ax-pre-mulgt0 10600 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-ifp 1058 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3488 df-sbc 3764 df-csb 3872 df-dif 3927 df-un 3929 df-in 3931 df-ss 3940 df-pss 3942 df-nul 4280 df-if 4454 df-pw 4527 df-sn 4554 df-pr 4556 df-tp 4558 df-op 4560 df-uni 4825 df-int 4863 df-iun 4907 df-br 5053 df-opab 5115 df-mpt 5133 df-tr 5159 df-id 5446 df-eprel 5451 df-po 5460 df-so 5461 df-fr 5500 df-we 5502 df-xp 5547 df-rel 5548 df-cnv 5549 df-co 5550 df-dm 5551 df-rn 5552 df-res 5553 df-ima 5554 df-pred 6134 df-ord 6180 df-on 6181 df-lim 6182 df-suc 6183 df-iota 6300 df-fun 6343 df-fn 6344 df-f 6345 df-f1 6346 df-fo 6347 df-f1o 6348 df-fv 6349 df-riota 7100 df-ov 7145 df-oprab 7146 df-mpo 7147 df-om 7567 df-1st 7675 df-2nd 7676 df-wrecs 7933 df-recs 7994 df-rdg 8032 df-1o 8088 df-oadd 8092 df-er 8275 df-map 8394 df-en 8496 df-dom 8497 df-sdom 8498 df-fin 8499 df-card 9354 df-pnf 10663 df-mnf 10664 df-xr 10665 df-ltxr 10666 df-le 10667 df-sub 10858 df-neg 10859 df-nn 11625 df-n0 11885 df-z 11969 df-uz 12231 df-fz 12883 df-fzo 13024 df-hash 13681 df-word 13852 df-lsw 13900 df-wlks 27367 df-wlkson 27368 |
This theorem is referenced by: 3wlkond 27934 |
Copyright terms: Public domain | W3C validator |