| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > crctcshtrl | Structured version Visualization version GIF version | ||
| Description: Cyclically shifting the indices of a circuit 〈𝐹, 𝑃〉 results in a trail 〈𝐻, 𝑄〉. (Contributed by AV, 14-Mar-2021.) (Proof shortened by AV, 30-Oct-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 |
|---|---|
| crctcshtrl | ⊢ (𝜑 → 𝐻(Trails‘𝐺)𝑄) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | crctcsh.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | crctcsh.i | . . 3 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 3 | crctcsh.d | . . 3 ⊢ (𝜑 → 𝐹(Circuits‘𝐺)𝑃) | |
| 4 | crctcsh.n | . . 3 ⊢ 𝑁 = (♯‘𝐹) | |
| 5 | crctcsh.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ (0..^𝑁)) | |
| 6 | crctcsh.h | . . 3 ⊢ 𝐻 = (𝐹 cyclShift 𝑆) | |
| 7 | crctcsh.q | . . 3 ⊢ 𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁 − 𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁)))) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | crctcshwlk 30470 | . 2 ⊢ (𝜑 → 𝐻(Walks‘𝐺)𝑄) |
| 9 | crctistrl 30441 | . . . . 5 ⊢ (𝐹(Circuits‘𝐺)𝑃 → 𝐹(Trails‘𝐺)𝑃) | |
| 10 | 2 | trlf1 30340 | . . . . 5 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))⟶1-1dom 𝐼) |
| 11 | df-f1 6570 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))⟶1-1dom 𝐼 ↔ (𝐹:(0..^(♯‘𝐹))⟶dom 𝐼 ∧ Fun ◡𝐹)) | |
| 12 | iswrdi 14702 | . . . . . . 7 ⊢ (𝐹:(0..^(♯‘𝐹))⟶dom 𝐼 → 𝐹 ∈ Word dom 𝐼) | |
| 13 | 12 | anim1i 627 | . . . . . 6 ⊢ ((𝐹:(0..^(♯‘𝐹))⟶dom 𝐼 ∧ Fun ◡𝐹) → (𝐹 ∈ Word dom 𝐼 ∧ Fun ◡𝐹)) |
| 14 | 11, 13 | sylbi 220 | . . . . 5 ⊢ (𝐹:(0..^(♯‘𝐹))⟶1-1dom 𝐼 → (𝐹 ∈ Word dom 𝐼 ∧ Fun ◡𝐹)) |
| 15 | 3, 9, 10, 14 | 4syl 20 | . . . 4 ⊢ (𝜑 → (𝐹 ∈ Word dom 𝐼 ∧ Fun ◡𝐹)) |
| 16 | elfzoelz 13832 | . . . . 5 ⊢ (𝑆 ∈ (0..^𝑁) → 𝑆 ∈ ℤ) | |
| 17 | 5, 16 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ ℤ) |
| 18 | df-3an 1106 | . . . 4 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ Fun ◡𝐹 ∧ 𝑆 ∈ ℤ) ↔ ((𝐹 ∈ Word dom 𝐼 ∧ Fun ◡𝐹) ∧ 𝑆 ∈ ℤ)) | |
| 19 | 15, 17, 18 | sylanbrc 595 | . . 3 ⊢ (𝜑 → (𝐹 ∈ Word dom 𝐼 ∧ Fun ◡𝐹 ∧ 𝑆 ∈ ℤ)) |
| 20 | cshinj 15003 | . . 3 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ Fun ◡𝐹 ∧ 𝑆 ∈ ℤ) → (𝐻 = (𝐹 cyclShift 𝑆) → Fun ◡𝐻)) | |
| 21 | 19, 6, 20 | mpisyl 22 | . 2 ⊢ (𝜑 → Fun ◡𝐻) |
| 22 | istrl 30338 | . 2 ⊢ (𝐻(Trails‘𝐺)𝑄 ↔ (𝐻(Walks‘𝐺)𝑄 ∧ Fun ◡𝐻)) | |
| 23 | 8, 21, 22 | sylanbrc 595 | 1 ⊢ (𝜑 → 𝐻(Trails‘𝐺)𝑄) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1104 = wceq 1572 ∈ wcel 2150 ifcif 4484 class class class wbr 5107 ↦ cmpt 5191 ◡ccnv 5656 dom cdm 5657 Fun wfun 6559 ⟶wf 6561 ⟶1-1wf1 6562 ‘cfv 6565 (class class class)co 7450 0cc0 11238 + caddc 11241 ≤ cle 11382 − cmin 11579 ℤcz 12732 ...cfz 13678 ..^cfzo 13827 ♯chash 14514 Word cword 14698 cyclShift ccsh 14980 Vtxcvtx 29633 iEdgciedg 29634 Walkscwlks 30236 Trailsctrls 30332 Circuitsccrcts 30430 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 ax-pre-sup 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ifp 1080 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-er 8754 df-map 8886 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-sup 9470 df-inf 9471 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-div 12013 df-nn 12375 df-2 12444 df-n0 12646 df-z 12733 df-uz 13005 df-rp 13160 df-fz 13679 df-fzo 13828 df-fl 13971 df-mod 14049 df-hash 14515 df-word 14699 df-concat 14756 df-substr 14830 df-pfx 14862 df-csh 14981 df-wlks 30239 df-trls 30334 df-crcts 30432 |
| This theorem is used by: crctcsh 30472 eucrctshift 30903 |
| Copyright terms: Public domain | W3C validator |