![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > extwwlkfabel | Structured version Visualization version GIF version |
Description: Characterization of an element of the set (𝑋𝐶𝑁), i.e., a double loop of length 𝑁 on vertex 𝑋 with a construction from the set 𝐹 of closed walks on 𝑋 with length smaller by 2 than the fixed length by appending a neighbor of the last vertex and afterwards the last vertex (which is the first vertex) itself ("walking forth and back" from the last vertex). (Contributed by AV, 22-Feb-2022.) (Revised by AV, 31-Oct-2022.) |
Ref | Expression |
---|---|
extwwlkfab.v | ⊢ 𝑉 = (Vtx‘𝐺) |
extwwlkfab.c | ⊢ 𝐶 = (𝑣 ∈ 𝑉, 𝑛 ∈ (ℤ≥‘2) ↦ {𝑤 ∈ (𝑣(ClWWalksNOn‘𝐺)𝑛) ∣ (𝑤‘(𝑛 − 2)) = 𝑣}) |
extwwlkfab.f | ⊢ 𝐹 = (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2)) |
Ref | Expression |
---|---|
extwwlkfabel | ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) → (𝑊 ∈ (𝑋𝐶𝑁) ↔ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ ((𝑊 prefix (𝑁 − 2)) ∈ 𝐹 ∧ (𝑊‘(𝑁 − 1)) ∈ (𝐺 NeighbVtx 𝑋) ∧ (𝑊‘(𝑁 − 2)) = 𝑋)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | extwwlkfab.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | extwwlkfab.c | . . . 4 ⊢ 𝐶 = (𝑣 ∈ 𝑉, 𝑛 ∈ (ℤ≥‘2) ↦ {𝑤 ∈ (𝑣(ClWWalksNOn‘𝐺)𝑛) ∣ (𝑤‘(𝑛 − 2)) = 𝑣}) | |
3 | extwwlkfab.f | . . . 4 ⊢ 𝐹 = (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2)) | |
4 | 1, 2, 3 | extwwlkfab 28137 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) → (𝑋𝐶𝑁) = {𝑤 ∈ (𝑁 ClWWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 − 2)) ∈ 𝐹 ∧ (𝑤‘(𝑁 − 1)) ∈ (𝐺 NeighbVtx 𝑋) ∧ (𝑤‘(𝑁 − 2)) = 𝑋)}) |
5 | 4 | eleq2d 2875 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) → (𝑊 ∈ (𝑋𝐶𝑁) ↔ 𝑊 ∈ {𝑤 ∈ (𝑁 ClWWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 − 2)) ∈ 𝐹 ∧ (𝑤‘(𝑁 − 1)) ∈ (𝐺 NeighbVtx 𝑋) ∧ (𝑤‘(𝑁 − 2)) = 𝑋)})) |
6 | oveq1 7142 | . . . . 5 ⊢ (𝑤 = 𝑊 → (𝑤 prefix (𝑁 − 2)) = (𝑊 prefix (𝑁 − 2))) | |
7 | 6 | eleq1d 2874 | . . . 4 ⊢ (𝑤 = 𝑊 → ((𝑤 prefix (𝑁 − 2)) ∈ 𝐹 ↔ (𝑊 prefix (𝑁 − 2)) ∈ 𝐹)) |
8 | fveq1 6644 | . . . . 5 ⊢ (𝑤 = 𝑊 → (𝑤‘(𝑁 − 1)) = (𝑊‘(𝑁 − 1))) | |
9 | 8 | eleq1d 2874 | . . . 4 ⊢ (𝑤 = 𝑊 → ((𝑤‘(𝑁 − 1)) ∈ (𝐺 NeighbVtx 𝑋) ↔ (𝑊‘(𝑁 − 1)) ∈ (𝐺 NeighbVtx 𝑋))) |
10 | fveq1 6644 | . . . . 5 ⊢ (𝑤 = 𝑊 → (𝑤‘(𝑁 − 2)) = (𝑊‘(𝑁 − 2))) | |
11 | 10 | eqeq1d 2800 | . . . 4 ⊢ (𝑤 = 𝑊 → ((𝑤‘(𝑁 − 2)) = 𝑋 ↔ (𝑊‘(𝑁 − 2)) = 𝑋)) |
12 | 7, 9, 11 | 3anbi123d 1433 | . . 3 ⊢ (𝑤 = 𝑊 → (((𝑤 prefix (𝑁 − 2)) ∈ 𝐹 ∧ (𝑤‘(𝑁 − 1)) ∈ (𝐺 NeighbVtx 𝑋) ∧ (𝑤‘(𝑁 − 2)) = 𝑋) ↔ ((𝑊 prefix (𝑁 − 2)) ∈ 𝐹 ∧ (𝑊‘(𝑁 − 1)) ∈ (𝐺 NeighbVtx 𝑋) ∧ (𝑊‘(𝑁 − 2)) = 𝑋))) |
13 | 12 | elrab 3628 | . 2 ⊢ (𝑊 ∈ {𝑤 ∈ (𝑁 ClWWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 − 2)) ∈ 𝐹 ∧ (𝑤‘(𝑁 − 1)) ∈ (𝐺 NeighbVtx 𝑋) ∧ (𝑤‘(𝑁 − 2)) = 𝑋)} ↔ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ ((𝑊 prefix (𝑁 − 2)) ∈ 𝐹 ∧ (𝑊‘(𝑁 − 1)) ∈ (𝐺 NeighbVtx 𝑋) ∧ (𝑊‘(𝑁 − 2)) = 𝑋))) |
14 | 5, 13 | syl6bb 290 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) → (𝑊 ∈ (𝑋𝐶𝑁) ↔ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ ((𝑊 prefix (𝑁 − 2)) ∈ 𝐹 ∧ (𝑊‘(𝑁 − 1)) ∈ (𝐺 NeighbVtx 𝑋) ∧ (𝑊‘(𝑁 − 2)) = 𝑋)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 {crab 3110 ‘cfv 6324 (class class class)co 7135 ∈ cmpo 7137 1c1 10527 − cmin 10859 2c2 11680 3c3 11681 ℤ≥cuz 12231 prefix cpfx 14023 Vtxcvtx 26789 USGraphcusgr 26942 NeighbVtx cnbgr 27122 ClWWalksN cclwwlkn 27809 ClWWalksNOncclwwlknon 27872 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-2o 8086 df-oadd 8089 df-er 8272 df-map 8391 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-dju 9314 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-n0 11886 df-xnn0 11956 df-z 11970 df-uz 12232 df-fz 12886 df-fzo 13029 df-hash 13687 df-word 13858 df-lsw 13906 df-substr 13994 df-pfx 14024 df-edg 26841 df-upgr 26875 df-umgr 26876 df-usgr 26944 df-nbgr 27123 df-wwlks 27616 df-wwlksn 27617 df-clwwlk 27767 df-clwwlkn 27810 df-clwwlknon 27873 |
This theorem is referenced by: numclwwlk1lem2foa 28139 numclwwlk1lem2f 28140 |
Copyright terms: Public domain | W3C validator |