| 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 29800 | . . 3 ⊢ ((𝜑 ∧ 𝑆 = 0) → (𝐻 = 𝐹 ∧ 𝑄 = 𝑃)) |
| 9 | crctistrl 29775 | . . . . . 6 ⊢ (𝐹(Circuits‘𝐺)𝑃 → 𝐹(Trails‘𝐺)𝑃) | |
| 10 | trliswlk 29676 | . . . . . 6 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 11 | 3, 9, 10 | 3syl 18 | . . . . 5 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃) |
| 12 | breq12 5098 | . . . . 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 29801 | . 2 ⊢ ((𝜑 ∧ 𝑆 ≠ 0) → 𝐻(Walks‘𝐺)𝑄) |
| 17 | 15, 16 | pm2.61dane 3016 | 1 ⊢ (𝜑 → 𝐻(Walks‘𝐺)𝑄) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ifcif 4474 class class class wbr 5093 ↦ cmpt 5174 ‘cfv 6486 (class class class)co 7352 0cc0 11013 + caddc 11016 ≤ cle 11154 − cmin 11351 ...cfz 13409 ..^cfzo 13556 ♯chash 14239 cyclShift ccsh 14697 Vtxcvtx 28976 iEdgciedg 28977 Walkscwlks 29577 Trailsctrls 29669 Circuitsccrcts 29764 |
| 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 2705 ax-rep 5219 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-cnex 11069 ax-resscn 11070 ax-1cn 11071 ax-icn 11072 ax-addcl 11073 ax-addrcl 11074 ax-mulcl 11075 ax-mulrcl 11076 ax-mulcom 11077 ax-addass 11078 ax-mulass 11079 ax-distr 11080 ax-i2m1 11081 ax-1ne0 11082 ax-1rid 11083 ax-rnegex 11084 ax-rrecex 11085 ax-cnre 11086 ax-pre-lttri 11087 ax-pre-lttrn 11088 ax-pre-ltadd 11089 ax-pre-mulgt0 11090 ax-pre-sup 11091 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-ifp 1063 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 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-int 4898 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7803 df-1st 7927 df-2nd 7928 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-1o 8391 df-er 8628 df-map 8758 df-en 8876 df-dom 8877 df-sdom 8878 df-fin 8879 df-sup 9333 df-inf 9334 df-card 9839 df-pnf 11155 df-mnf 11156 df-xr 11157 df-ltxr 11158 df-le 11159 df-sub 11353 df-neg 11354 df-div 11782 df-nn 12133 df-2 12195 df-n0 12389 df-z 12476 df-uz 12739 df-rp 12893 df-fz 13410 df-fzo 13557 df-fl 13698 df-mod 13776 df-hash 14240 df-word 14423 df-concat 14480 df-substr 14551 df-pfx 14581 df-csh 14698 df-wlks 29580 df-trls 29671 df-crcts 29766 |
| This theorem is referenced by: crctcshtrl 29803 |
| Copyright terms: Public domain | W3C validator |