Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iswwlksnx | Structured version Visualization version GIF version |
Description: Properties of a word to represent a walk of a fixed length, definition of WWalks expanded. (Contributed by AV, 28-Apr-2021.) |
Ref | Expression |
---|---|
iswwlksnx.v | ⊢ 𝑉 = (Vtx‘𝐺) |
iswwlksnx.e | ⊢ 𝐸 = (Edg‘𝐺) |
Ref | Expression |
---|---|
iswwlksnx | ⊢ (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) ↔ (𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸 ∧ (#‘𝑊) = (𝑁 + 1)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iswwlksn 26730 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) ↔ (𝑊 ∈ (WWalks‘𝐺) ∧ (#‘𝑊) = (𝑁 + 1)))) | |
2 | iswwlksnx.v | . . . . . . 7 ⊢ 𝑉 = (Vtx‘𝐺) | |
3 | iswwlksnx.e | . . . . . . 7 ⊢ 𝐸 = (Edg‘𝐺) | |
4 | 2, 3 | iswwlks 26728 | . . . . . 6 ⊢ (𝑊 ∈ (WWalks‘𝐺) ↔ (𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸)) |
5 | df-3an 1039 | . . . . . . 7 ⊢ ((𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) ↔ ((𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉) ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸)) | |
6 | nn0p1gt0 11322 | . . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ ℕ0 → 0 < (𝑁 + 1)) | |
7 | 6 | gt0ne0d 10592 | . . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ≠ 0) |
8 | 7 | adantr 481 | . . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℕ0 ∧ (#‘𝑊) = (𝑁 + 1)) → (𝑁 + 1) ≠ 0) |
9 | neeq1 2856 | . . . . . . . . . . . . 13 ⊢ ((#‘𝑊) = (𝑁 + 1) → ((#‘𝑊) ≠ 0 ↔ (𝑁 + 1) ≠ 0)) | |
10 | 9 | adantl 482 | . . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℕ0 ∧ (#‘𝑊) = (𝑁 + 1)) → ((#‘𝑊) ≠ 0 ↔ (𝑁 + 1) ≠ 0)) |
11 | 8, 10 | mpbird 247 | . . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ0 ∧ (#‘𝑊) = (𝑁 + 1)) → (#‘𝑊) ≠ 0) |
12 | hasheq0 13154 | . . . . . . . . . . . 12 ⊢ (𝑊 ∈ Word 𝑉 → ((#‘𝑊) = 0 ↔ 𝑊 = ∅)) | |
13 | 12 | necon3bid 2838 | . . . . . . . . . . 11 ⊢ (𝑊 ∈ Word 𝑉 → ((#‘𝑊) ≠ 0 ↔ 𝑊 ≠ ∅)) |
14 | 11, 13 | syl5ibcom 235 | . . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ0 ∧ (#‘𝑊) = (𝑁 + 1)) → (𝑊 ∈ Word 𝑉 → 𝑊 ≠ ∅)) |
15 | 14 | pm4.71rd 667 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ (#‘𝑊) = (𝑁 + 1)) → (𝑊 ∈ Word 𝑉 ↔ (𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉))) |
16 | 15 | bicomd 213 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ (#‘𝑊) = (𝑁 + 1)) → ((𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉) ↔ 𝑊 ∈ Word 𝑉)) |
17 | 16 | anbi1d 741 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ (#‘𝑊) = (𝑁 + 1)) → (((𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉) ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) ↔ (𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))) |
18 | 5, 17 | syl5bb 272 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ (#‘𝑊) = (𝑁 + 1)) → ((𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) ↔ (𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))) |
19 | 4, 18 | syl5bb 272 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ (#‘𝑊) = (𝑁 + 1)) → (𝑊 ∈ (WWalks‘𝐺) ↔ (𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))) |
20 | 19 | ex 450 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → ((#‘𝑊) = (𝑁 + 1) → (𝑊 ∈ (WWalks‘𝐺) ↔ (𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸)))) |
21 | 20 | pm5.32rd 672 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((𝑊 ∈ (WWalks‘𝐺) ∧ (#‘𝑊) = (𝑁 + 1)) ↔ ((𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) ∧ (#‘𝑊) = (𝑁 + 1)))) |
22 | df-3an 1039 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸 ∧ (#‘𝑊) = (𝑁 + 1)) ↔ ((𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) ∧ (#‘𝑊) = (𝑁 + 1))) | |
23 | 21, 22 | syl6bbr 278 | . 2 ⊢ (𝑁 ∈ ℕ0 → ((𝑊 ∈ (WWalks‘𝐺) ∧ (#‘𝑊) = (𝑁 + 1)) ↔ (𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸 ∧ (#‘𝑊) = (𝑁 + 1)))) |
24 | 1, 23 | bitrd 268 | 1 ⊢ (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) ↔ (𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸 ∧ (#‘𝑊) = (𝑁 + 1)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∀wral 2912 ∅c0 3915 {cpr 4179 ‘cfv 5888 (class class class)co 6650 0cc0 9936 1c1 9937 + caddc 9939 − cmin 10266 ℕ0cn0 11292 ..^cfzo 12465 #chash 13117 Word cword 13291 Vtxcvtx 25874 Edgcedg 25939 WWalkscwwlks 26717 WWalksN cwwlksn 26718 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-er 7742 df-map 7859 df-pm 7860 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-card 8765 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-n0 11293 df-z 11378 df-uz 11688 df-fz 12327 df-fzo 12466 df-hash 13118 df-word 13299 df-wwlks 26722 df-wwlksn 26723 |
This theorem is referenced by: wwlksubclwwlks 26925 clwwlksnwwlksn 27209 |
Copyright terms: Public domain | W3C validator |