| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > crctcshwlk | Structured version Visualization version GIF version | ||
| Description: Cyclically shifting the indices of a circuit 〈𝐹, 𝑃〉 results in a walk 〈𝐻, 𝑄〉. (Contributed by AV, 10-Mar-2021.) |
| Ref | Expression |
|---|---|
| crctcsh.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| crctcsh.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| crctcsh.d | ⊢ (𝜑 → 𝐹(Circuits‘𝐺)𝑃) |
| crctcsh.n | ⊢ 𝑁 = (♯‘𝐹) |
| crctcsh.s | ⊢ (𝜑 → 𝑆 ∈ (0..^𝑁)) |
| crctcsh.h | ⊢ 𝐻 = (𝐹 cyclShift 𝑆) |
| crctcsh.q | ⊢ 𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁 − 𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁)))) |
| Ref | Expression |
|---|---|
| crctcshwlk | ⊢ (𝜑 → 𝐻(Walks‘𝐺)𝑄) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | crctcsh.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | crctcsh.i | . . . 4 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 3 | crctcsh.d | . . . 4 ⊢ (𝜑 → 𝐹(Circuits‘𝐺)𝑃) | |
| 4 | crctcsh.n | . . . 4 ⊢ 𝑁 = (♯‘𝐹) | |
| 5 | crctcsh.s | . . . 4 ⊢ (𝜑 → 𝑆 ∈ (0..^𝑁)) | |
| 6 | crctcsh.h | . . . 4 ⊢ 𝐻 = (𝐹 cyclShift 𝑆) | |
| 7 | crctcsh.q | . . . 4 ⊢ 𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁 − 𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁)))) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | crctcshlem4 30078 | . . 3 ⊢ ((𝜑 ∧ 𝑆 = 0) → (𝐻 = 𝐹 ∧ 𝑄 = 𝑃)) |
| 9 | crctistrl 30053 | . . . . . 6 ⊢ (𝐹(Circuits‘𝐺)𝑃 → 𝐹(Trails‘𝐺)𝑃) | |
| 10 | trliswlk 29954 | . . . . . 6 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 11 | 3, 9, 10 | 3syl 19 | . . . . 5 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃) |
| 12 | breq12 5110 | . . . . 5 ⊢ ((𝐻 = 𝐹 ∧ 𝑄 = 𝑃) → (𝐻(Walks‘𝐺)𝑄 ↔ 𝐹(Walks‘𝐺)𝑃)) | |
| 13 | 11, 12 | syl5ibrcom 250 | . . . 4 ⊢ (𝜑 → ((𝐻 = 𝐹 ∧ 𝑄 = 𝑃) → 𝐻(Walks‘𝐺)𝑄)) |
| 14 | 13 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ 𝑆 = 0) → ((𝐻 = 𝐹 ∧ 𝑄 = 𝑃) → 𝐻(Walks‘𝐺)𝑄)) |
| 15 | 8, 14 | mpd 16 | . 2 ⊢ ((𝜑 ∧ 𝑆 = 0) → 𝐻(Walks‘𝐺)𝑄) |
| 16 | 1, 2, 3, 4, 5, 6, 7 | crctcshwlkn0 30079 | . 2 ⊢ ((𝜑 ∧ 𝑆 ≠ 0) → 𝐻(Walks‘𝐺)𝑄) |
| 17 | 15, 16 | pm2.61dane 3047 | 1 ⊢ (𝜑 → 𝐻(Walks‘𝐺)𝑄) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 ifcif 4483 class class class wbr 5105 ↦ cmpt 5186 ‘cfv 6525 (class class class)co 7400 0cc0 11088 + caddc 11091 ≤ cle 11232 − cmin 11429 ...cfz 13526 ..^cfzo 13673 ♯chash 14357 cyclShift ccsh 14815 Vtxcvtx 29255 iEdgciedg 29256 Walkscwlks 29855 Trailsctrls 29947 Circuitsccrcts 30042 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-ifp 1077 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-map 8814 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-sup 9390 df-inf 9391 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12225 df-2 12294 df-n0 12496 df-z 12583 df-uz 12854 df-rp 13008 df-fz 13527 df-fzo 13674 df-fl 13816 df-mod 13894 df-hash 14358 df-word 14541 df-concat 14598 df-substr 14669 df-pfx 14699 df-csh 14816 df-wlks 29858 df-trls 29949 df-crcts 30044 |
| This theorem is referenced by: crctcshtrl 30081 |
| Copyright terms: Public domain | W3C validator |