| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wwlknbp | Structured version Visualization version GIF version | ||
| Description: Basic properties of a walk of a fixed length (in an undirected graph) as word. (Contributed by Alexander van der Vekens, 16-Jul-2018.) (Revised by AV, 9-Apr-2021.) (Proof shortened by AV, 20-May-2021.) |
| Ref | Expression |
|---|---|
| wwlkbp.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| wwlknbp | ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝐺 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-wwlksn 29853 | . . 3 ⊢ WWalksN = (𝑛 ∈ ℕ0, 𝑔 ∈ V ↦ {𝑤 ∈ (WWalks‘𝑔) ∣ (♯‘𝑤) = (𝑛 + 1)}) | |
| 2 | 1 | elmpocl 7597 | . 2 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V)) |
| 3 | simpl 482 | . . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WWalksN 𝐺)) → (𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V)) | |
| 4 | 3 | ancomd 461 | . . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WWalksN 𝐺)) → (𝐺 ∈ V ∧ 𝑁 ∈ ℕ0)) |
| 5 | iswwlksn 29860 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) ↔ (𝑊 ∈ (WWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 + 1)))) | |
| 6 | 5 | adantr 480 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) → (𝑊 ∈ (𝑁 WWalksN 𝐺) ↔ (𝑊 ∈ (WWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 + 1)))) |
| 7 | wwlkbp.v | . . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 8 | 7 | wwlkbp 29863 | . . . . . . 7 ⊢ (𝑊 ∈ (WWalks‘𝐺) → (𝐺 ∈ V ∧ 𝑊 ∈ Word 𝑉)) |
| 9 | 8 | simprd 495 | . . . . . 6 ⊢ (𝑊 ∈ (WWalks‘𝐺) → 𝑊 ∈ Word 𝑉) |
| 10 | 9 | adantr 480 | . . . . 5 ⊢ ((𝑊 ∈ (WWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 + 1)) → 𝑊 ∈ Word 𝑉) |
| 11 | 6, 10 | biimtrdi 253 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) → (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝑊 ∈ Word 𝑉)) |
| 12 | 11 | imp 406 | . . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WWalksN 𝐺)) → 𝑊 ∈ Word 𝑉) |
| 13 | df-3an 1088 | . . 3 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) ↔ ((𝐺 ∈ V ∧ 𝑁 ∈ ℕ0) ∧ 𝑊 ∈ Word 𝑉)) | |
| 14 | 4, 12, 13 | sylanbrc 583 | . 2 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WWalksN 𝐺)) → (𝐺 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉)) |
| 15 | 2, 14 | mpancom 688 | 1 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝐺 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 {crab 3397 Vcvv 3438 ‘cfv 6490 (class class class)co 7356 1c1 11025 + caddc 11027 ℕ0cn0 12399 ♯chash 14251 Word cword 14434 Vtxcvtx 29018 WWalkscwwlks 29847 WWalksN cwwlksn 29848 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-int 4901 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-er 8633 df-map 8763 df-en 8882 df-dom 8883 df-sdom 8884 df-fin 8885 df-card 9849 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-n0 12400 df-z 12487 df-uz 12750 df-fz 13422 df-fzo 13569 df-hash 14252 df-word 14435 df-wwlks 29852 df-wwlksn 29853 |
| This theorem is referenced by: wwlknp 29865 wwlknbp1 29866 wwlkswwlksn 29887 wlklnwwlkln2lem 29904 wwlksnext 29915 wwlksnextwrd 29919 wwlksnextsurj 29922 wwlksnextbij0 29923 wwlksnndef 29927 numclwwlk2lem1 30400 |
| Copyright terms: Public domain | W3C validator |