![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > crctcshlem2 | Structured version Visualization version GIF version |
Description: Lemma for crctcsh 28655. (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 28630 | . . . 4 ⊢ (𝐹(Circuits‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
3 | crctcsh.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
4 | 3 | wlkf 28448 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼) |
5 | 1, 2, 4 | 3syl 18 | . . 3 ⊢ (𝜑 → 𝐹 ∈ Word dom 𝐼) |
6 | crctcsh.s | . . . 4 ⊢ (𝜑 → 𝑆 ∈ (0..^𝑁)) | |
7 | elfzoelz 13564 | . . . 4 ⊢ (𝑆 ∈ (0..^𝑁) → 𝑆 ∈ ℤ) | |
8 | 6, 7 | syl 17 | . . 3 ⊢ (𝜑 → 𝑆 ∈ ℤ) |
9 | cshwlen 14679 | . . 3 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑆 ∈ ℤ) → (♯‘(𝐹 cyclShift 𝑆)) = (♯‘𝐹)) | |
10 | 5, 8, 9 | syl2anc 584 | . 2 ⊢ (𝜑 → (♯‘(𝐹 cyclShift 𝑆)) = (♯‘𝐹)) |
11 | crctcsh.h | . . 3 ⊢ 𝐻 = (𝐹 cyclShift 𝑆) | |
12 | 11 | fveq2i 6842 | . 2 ⊢ (♯‘𝐻) = (♯‘(𝐹 cyclShift 𝑆)) |
13 | crctcsh.n | . 2 ⊢ 𝑁 = (♯‘𝐹) | |
14 | 10, 12, 13 | 3eqtr4g 2801 | 1 ⊢ (𝜑 → (♯‘𝐻) = 𝑁) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2106 class class class wbr 5103 dom cdm 5631 ‘cfv 6493 (class class class)co 7353 0cc0 11047 ℤcz 12495 ..^cfzo 13559 ♯chash 14222 Word cword 14394 cyclShift ccsh 14668 Vtxcvtx 27833 iEdgciedg 27834 Walkscwlks 28430 Circuitsccrcts 28618 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5240 ax-sep 5254 ax-nul 5261 ax-pow 5318 ax-pr 5382 ax-un 7668 ax-cnex 11103 ax-resscn 11104 ax-1cn 11105 ax-icn 11106 ax-addcl 11107 ax-addrcl 11108 ax-mulcl 11109 ax-mulrcl 11110 ax-mulcom 11111 ax-addass 11112 ax-mulass 11113 ax-distr 11114 ax-i2m1 11115 ax-1ne0 11116 ax-1rid 11117 ax-rnegex 11118 ax-rrecex 11119 ax-cnre 11120 ax-pre-lttri 11121 ax-pre-lttrn 11122 ax-pre-ltadd 11123 ax-pre-mulgt0 11124 ax-pre-sup 11125 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-ifp 1062 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3351 df-reu 3352 df-rab 3406 df-v 3445 df-sbc 3738 df-csb 3854 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3927 df-nul 4281 df-if 4485 df-pw 4560 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-int 4906 df-iun 4954 df-br 5104 df-opab 5166 df-mpt 5187 df-tr 5221 df-id 5529 df-eprel 5535 df-po 5543 df-so 5544 df-fr 5586 df-we 5588 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6251 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6445 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7309 df-ov 7356 df-oprab 7357 df-mpo 7358 df-om 7799 df-1st 7917 df-2nd 7918 df-frecs 8208 df-wrecs 8239 df-recs 8313 df-rdg 8352 df-1o 8408 df-er 8644 df-map 8763 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-sup 9374 df-inf 9375 df-card 9871 df-pnf 11187 df-mnf 11188 df-xr 11189 df-ltxr 11190 df-le 11191 df-sub 11383 df-neg 11384 df-div 11809 df-nn 12150 df-n0 12410 df-z 12496 df-uz 12760 df-rp 12908 df-fz 13417 df-fzo 13560 df-fl 13689 df-mod 13767 df-hash 14223 df-word 14395 df-concat 14451 df-substr 14521 df-pfx 14551 df-csh 14669 df-wlks 28433 df-trls 28526 df-crcts 28620 |
This theorem is referenced by: crctcshwlkn0 28652 crctcsh 28655 eucrctshift 29073 |
Copyright terms: Public domain | W3C validator |