![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > crctcshlem2 | Structured version Visualization version GIF version |
Description: Lemma for crctcsh 27694. (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 𝑆) |
Ref | Expression |
---|---|
crctcshlem2 | ⊢ (𝜑 → (♯‘𝐻) = 𝑁) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | crctcsh.d | . . . 4 ⊢ (𝜑 → 𝐹(Circuits‘𝐺)𝑃) | |
2 | crctiswlk 27669 | . . . 4 ⊢ (𝐹(Circuits‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
3 | crctcsh.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
4 | 3 | wlkf 27488 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼) |
5 | 1, 2, 4 | 3syl 18 | . . 3 ⊢ (𝜑 → 𝐹 ∈ Word dom 𝐼) |
6 | crctcsh.s | . . . 4 ⊢ (𝜑 → 𝑆 ∈ (0..^𝑁)) | |
7 | elfzoelz 13072 | . . . 4 ⊢ (𝑆 ∈ (0..^𝑁) → 𝑆 ∈ ℤ) | |
8 | 6, 7 | syl 17 | . . 3 ⊢ (𝜑 → 𝑆 ∈ ℤ) |
9 | cshwlen 14193 | . . 3 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑆 ∈ ℤ) → (♯‘(𝐹 cyclShift 𝑆)) = (♯‘𝐹)) | |
10 | 5, 8, 9 | syl2anc 588 | . 2 ⊢ (𝜑 → (♯‘(𝐹 cyclShift 𝑆)) = (♯‘𝐹)) |
11 | crctcsh.h | . . 3 ⊢ 𝐻 = (𝐹 cyclShift 𝑆) | |
12 | 11 | fveq2i 6654 | . 2 ⊢ (♯‘𝐻) = (♯‘(𝐹 cyclShift 𝑆)) |
13 | crctcsh.n | . 2 ⊢ 𝑁 = (♯‘𝐹) | |
14 | 10, 12, 13 | 3eqtr4g 2819 | 1 ⊢ (𝜑 → (♯‘𝐻) = 𝑁) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2112 class class class wbr 5025 dom cdm 5517 ‘cfv 6328 (class class class)co 7143 0cc0 10560 ℤcz 12005 ..^cfzo 13067 ♯chash 13725 Word cword 13898 cyclShift ccsh 14182 Vtxcvtx 26873 iEdgciedg 26874 Walkscwlks 27470 Circuitsccrcts 27657 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1912 ax-6 1971 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2159 ax-12 2176 ax-ext 2730 ax-rep 5149 ax-sep 5162 ax-nul 5169 ax-pow 5227 ax-pr 5291 ax-un 7452 ax-cnex 10616 ax-resscn 10617 ax-1cn 10618 ax-icn 10619 ax-addcl 10620 ax-addrcl 10621 ax-mulcl 10622 ax-mulrcl 10623 ax-mulcom 10624 ax-addass 10625 ax-mulass 10626 ax-distr 10627 ax-i2m1 10628 ax-1ne0 10629 ax-1rid 10630 ax-rnegex 10631 ax-rrecex 10632 ax-cnre 10633 ax-pre-lttri 10634 ax-pre-lttrn 10635 ax-pre-ltadd 10636 ax-pre-mulgt0 10637 ax-pre-sup 10638 |
This theorem depends on definitions: df-bi 210 df-an 401 df-or 846 df-ifp 1060 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2071 df-mo 2558 df-eu 2589 df-clab 2737 df-cleq 2751 df-clel 2831 df-nfc 2899 df-ne 2950 df-nel 3054 df-ral 3073 df-rex 3074 df-reu 3075 df-rmo 3076 df-rab 3077 df-v 3409 df-sbc 3694 df-csb 3802 df-dif 3857 df-un 3859 df-in 3861 df-ss 3871 df-pss 3873 df-nul 4222 df-if 4414 df-pw 4489 df-sn 4516 df-pr 4518 df-tp 4520 df-op 4522 df-uni 4792 df-int 4832 df-iun 4878 df-br 5026 df-opab 5088 df-mpt 5106 df-tr 5132 df-id 5423 df-eprel 5428 df-po 5436 df-so 5437 df-fr 5476 df-we 5478 df-xp 5523 df-rel 5524 df-cnv 5525 df-co 5526 df-dm 5527 df-rn 5528 df-res 5529 df-ima 5530 df-pred 6119 df-ord 6165 df-on 6166 df-lim 6167 df-suc 6168 df-iota 6287 df-fun 6330 df-fn 6331 df-f 6332 df-f1 6333 df-fo 6334 df-f1o 6335 df-fv 6336 df-riota 7101 df-ov 7146 df-oprab 7147 df-mpo 7148 df-om 7573 df-1st 7686 df-2nd 7687 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-1o 8105 df-oadd 8109 df-er 8292 df-map 8411 df-en 8521 df-dom 8522 df-sdom 8523 df-fin 8524 df-sup 8924 df-inf 8925 df-card 9386 df-pnf 10700 df-mnf 10701 df-xr 10702 df-ltxr 10703 df-le 10704 df-sub 10895 df-neg 10896 df-div 11321 df-nn 11660 df-n0 11920 df-z 12006 df-uz 12268 df-rp 12416 df-fz 12925 df-fzo 13068 df-fl 13196 df-mod 13272 df-hash 13726 df-word 13899 df-concat 13955 df-substr 14035 df-pfx 14065 df-csh 14183 df-wlks 27473 df-trls 27566 df-crcts 27659 |
This theorem is referenced by: crctcshwlkn0 27691 crctcsh 27694 eucrctshift 28112 |
Copyright terms: Public domain | W3C validator |