| 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 29903 | . . 3 ⊢ ((𝜑 ∧ 𝑆 = 0) → (𝐻 = 𝐹 ∧ 𝑄 = 𝑃)) |
| 9 | crctistrl 29878 | . . . . . 6 ⊢ (𝐹(Circuits‘𝐺)𝑃 → 𝐹(Trails‘𝐺)𝑃) | |
| 10 | trliswlk 29779 | . . . . . 6 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 11 | 3, 9, 10 | 3syl 18 | . . . . 5 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃) |
| 12 | breq12 5091 | . . . . 5 ⊢ ((𝐻 = 𝐹 ∧ 𝑄 = 𝑃) → (𝐻(Walks‘𝐺)𝑄 ↔ 𝐹(Walks‘𝐺)𝑃)) | |
| 13 | 11, 12 | syl5ibrcom 247 | . . . 4 ⊢ (𝜑 → ((𝐻 = 𝐹 ∧ 𝑄 = 𝑃) → 𝐻(Walks‘𝐺)𝑄)) |
| 14 | 13 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑆 = 0) → ((𝐻 = 𝐹 ∧ 𝑄 = 𝑃) → 𝐻(Walks‘𝐺)𝑄)) |
| 15 | 8, 14 | mpd 15 | . 2 ⊢ ((𝜑 ∧ 𝑆 = 0) → 𝐻(Walks‘𝐺)𝑄) |
| 16 | 1, 2, 3, 4, 5, 6, 7 | crctcshwlkn0 29904 | . 2 ⊢ ((𝜑 ∧ 𝑆 ≠ 0) → 𝐻(Walks‘𝐺)𝑄) |
| 17 | 15, 16 | pm2.61dane 3020 | 1 ⊢ (𝜑 → 𝐻(Walks‘𝐺)𝑄) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ifcif 4467 class class class wbr 5086 ↦ cmpt 5167 ‘cfv 6492 (class class class)co 7360 0cc0 11029 + caddc 11032 ≤ cle 11171 − cmin 11368 ...cfz 13452 ..^cfzo 13599 ♯chash 14283 cyclShift ccsh 14741 Vtxcvtx 29079 iEdgciedg 29080 Walkscwlks 29680 Trailsctrls 29772 Circuitsccrcts 29867 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-ifp 1064 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-er 8636 df-map 8768 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-sup 9348 df-inf 9349 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-n0 12429 df-z 12516 df-uz 12780 df-rp 12934 df-fz 13453 df-fzo 13600 df-fl 13742 df-mod 13820 df-hash 14284 df-word 14467 df-concat 14524 df-substr 14595 df-pfx 14625 df-csh 14742 df-wlks 29683 df-trls 29774 df-crcts 29869 |
| This theorem is referenced by: crctcshtrl 29906 |
| Copyright terms: Public domain | W3C validator |