Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wwlknp | Structured version Visualization version GIF version |
Description: Properties of a set being a walk of length n (represented by a word). (Contributed by Alexander van der Vekens, 17-Jun-2018.) (Revised by AV, 9-Apr-2021.) |
Ref | Expression |
---|---|
wwlkbp.v | ⊢ 𝑉 = (Vtx‘𝐺) |
wwlknp.e | ⊢ 𝐸 = (Edg‘𝐺) |
Ref | Expression |
---|---|
wwlknp | ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wwlkbp.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | 1 | wwlknbp 27622 | . 2 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝐺 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉)) |
3 | iswwlksn 27618 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) ↔ (𝑊 ∈ (WWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 + 1)))) | |
4 | wwlknp.e | . . . . . . . 8 ⊢ 𝐸 = (Edg‘𝐺) | |
5 | 1, 4 | iswwlks 27616 | . . . . . . 7 ⊢ (𝑊 ∈ (WWalks‘𝐺) ↔ (𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((♯‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸)) |
6 | simpl2 1188 | . . . . . . . . 9 ⊢ (((𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((♯‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) ∧ ((♯‘𝑊) = (𝑁 + 1) ∧ 𝑁 ∈ ℕ0)) → 𝑊 ∈ Word 𝑉) | |
7 | simprl 769 | . . . . . . . . 9 ⊢ (((𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((♯‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) ∧ ((♯‘𝑊) = (𝑁 + 1) ∧ 𝑁 ∈ ℕ0)) → (♯‘𝑊) = (𝑁 + 1)) | |
8 | oveq1 7165 | . . . . . . . . . . . . . . 15 ⊢ ((♯‘𝑊) = (𝑁 + 1) → ((♯‘𝑊) − 1) = ((𝑁 + 1) − 1)) | |
9 | nn0cn 11910 | . . . . . . . . . . . . . . . 16 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ) | |
10 | pncan1 11066 | . . . . . . . . . . . . . . . 16 ⊢ (𝑁 ∈ ℂ → ((𝑁 + 1) − 1) = 𝑁) | |
11 | 9, 10 | syl 17 | . . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 + 1) − 1) = 𝑁) |
12 | 8, 11 | sylan9eq 2878 | . . . . . . . . . . . . . 14 ⊢ (((♯‘𝑊) = (𝑁 + 1) ∧ 𝑁 ∈ ℕ0) → ((♯‘𝑊) − 1) = 𝑁) |
13 | 12 | oveq2d 7174 | . . . . . . . . . . . . 13 ⊢ (((♯‘𝑊) = (𝑁 + 1) ∧ 𝑁 ∈ ℕ0) → (0..^((♯‘𝑊) − 1)) = (0..^𝑁)) |
14 | 13 | raleqdv 3417 | . . . . . . . . . . . 12 ⊢ (((♯‘𝑊) = (𝑁 + 1) ∧ 𝑁 ∈ ℕ0) → (∀𝑖 ∈ (0..^((♯‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸 ↔ ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸)) |
15 | 14 | biimpcd 251 | . . . . . . . . . . 11 ⊢ (∀𝑖 ∈ (0..^((♯‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸 → (((♯‘𝑊) = (𝑁 + 1) ∧ 𝑁 ∈ ℕ0) → ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸)) |
16 | 15 | 3ad2ant3 1131 | . . . . . . . . . 10 ⊢ ((𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((♯‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) → (((♯‘𝑊) = (𝑁 + 1) ∧ 𝑁 ∈ ℕ0) → ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸)) |
17 | 16 | imp 409 | . . . . . . . . 9 ⊢ (((𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((♯‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) ∧ ((♯‘𝑊) = (𝑁 + 1) ∧ 𝑁 ∈ ℕ0)) → ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) |
18 | 6, 7, 17 | 3jca 1124 | . . . . . . . 8 ⊢ (((𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((♯‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) ∧ ((♯‘𝑊) = (𝑁 + 1) ∧ 𝑁 ∈ ℕ0)) → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸)) |
19 | 18 | ex 415 | . . . . . . 7 ⊢ ((𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((♯‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) → (((♯‘𝑊) = (𝑁 + 1) ∧ 𝑁 ∈ ℕ0) → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))) |
20 | 5, 19 | sylbi 219 | . . . . . 6 ⊢ (𝑊 ∈ (WWalks‘𝐺) → (((♯‘𝑊) = (𝑁 + 1) ∧ 𝑁 ∈ ℕ0) → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))) |
21 | 20 | expdimp 455 | . . . . 5 ⊢ ((𝑊 ∈ (WWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 + 1)) → (𝑁 ∈ ℕ0 → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))) |
22 | 21 | com12 32 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → ((𝑊 ∈ (WWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 + 1)) → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))) |
23 | 3, 22 | sylbid 242 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))) |
24 | 23 | 3ad2ant2 1130 | . 2 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))) |
25 | 2, 24 | mpcom 38 | 1 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ≠ wne 3018 ∀wral 3140 Vcvv 3496 ∅c0 4293 {cpr 4571 ‘cfv 6357 (class class class)co 7158 ℂcc 10537 0cc0 10539 1c1 10540 + caddc 10542 − cmin 10872 ℕ0cn0 11900 ..^cfzo 13036 ♯chash 13693 Word cword 13864 Vtxcvtx 26783 Edgcedg 26834 WWalkscwwlks 27605 WWalksN cwwlksn 27606 |
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 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 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 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-er 8291 df-map 8410 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-card 9370 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-nn 11641 df-n0 11901 df-z 11985 df-uz 12247 df-fz 12896 df-fzo 13037 df-hash 13694 df-word 13865 df-wwlks 27610 df-wwlksn 27611 |
This theorem is referenced by: wwlknbp1 27624 wwlksnext 27673 wwlksnextbi 27674 wwlksnredwwlkn 27675 wwlksnredwwlkn0 27676 wwlksnextwrd 27677 wwlksnextsurj 27680 wwlksnextproplem2 27691 wwlksnextproplem3 27692 rusgrnumwwlks 27755 clwwlkinwwlk 27820 clwwlkf1 27830 wwlksext2clwwlk 27838 clwwlknonwwlknonb 27887 clwwlkvbij 27894 numclwwlk2lem1 28157 |
Copyright terms: Public domain | W3C validator |