Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > clwwlknccat | Structured version Visualization version GIF version |
Description: The concatenation of two words representing closed walks anchored at the same vertex represents a closed walk with a length which is the sum of the lengths of the two walks. The resulting walk is a "double loop", starting at the common vertex, coming back to the common vertex by the first walk, following the second walk and finally coming back to the common vertex again. (Contributed by AV, 24-Apr-2022.) |
Ref | Expression |
---|---|
clwwlknccat | ⊢ ((𝐴 ∈ (𝑀 ClWWalksN 𝐺) ∧ 𝐵 ∈ (𝑁 ClWWalksN 𝐺) ∧ (𝐴‘0) = (𝐵‘0)) → (𝐴 ++ 𝐵) ∈ ((𝑀 + 𝑁) ClWWalksN 𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isclwwlkn 28082 | . . 3 ⊢ (𝐴 ∈ (𝑀 ClWWalksN 𝐺) ↔ (𝐴 ∈ (ClWWalks‘𝐺) ∧ (♯‘𝐴) = 𝑀)) | |
2 | isclwwlkn 28082 | . . 3 ⊢ (𝐵 ∈ (𝑁 ClWWalksN 𝐺) ↔ (𝐵 ∈ (ClWWalks‘𝐺) ∧ (♯‘𝐵) = 𝑁)) | |
3 | biid 264 | . . 3 ⊢ ((𝐴‘0) = (𝐵‘0) ↔ (𝐴‘0) = (𝐵‘0)) | |
4 | simpl 486 | . . . 4 ⊢ ((𝐴 ∈ (ClWWalks‘𝐺) ∧ (♯‘𝐴) = 𝑀) → 𝐴 ∈ (ClWWalks‘𝐺)) | |
5 | simpl 486 | . . . 4 ⊢ ((𝐵 ∈ (ClWWalks‘𝐺) ∧ (♯‘𝐵) = 𝑁) → 𝐵 ∈ (ClWWalks‘𝐺)) | |
6 | id 22 | . . . 4 ⊢ ((𝐴‘0) = (𝐵‘0) → (𝐴‘0) = (𝐵‘0)) | |
7 | clwwlkccat 28045 | . . . 4 ⊢ ((𝐴 ∈ (ClWWalks‘𝐺) ∧ 𝐵 ∈ (ClWWalks‘𝐺) ∧ (𝐴‘0) = (𝐵‘0)) → (𝐴 ++ 𝐵) ∈ (ClWWalks‘𝐺)) | |
8 | 4, 5, 6, 7 | syl3an 1162 | . . 3 ⊢ (((𝐴 ∈ (ClWWalks‘𝐺) ∧ (♯‘𝐴) = 𝑀) ∧ (𝐵 ∈ (ClWWalks‘𝐺) ∧ (♯‘𝐵) = 𝑁) ∧ (𝐴‘0) = (𝐵‘0)) → (𝐴 ++ 𝐵) ∈ (ClWWalks‘𝐺)) |
9 | 1, 2, 3, 8 | syl3anb 1163 | . 2 ⊢ ((𝐴 ∈ (𝑀 ClWWalksN 𝐺) ∧ 𝐵 ∈ (𝑁 ClWWalksN 𝐺) ∧ (𝐴‘0) = (𝐵‘0)) → (𝐴 ++ 𝐵) ∈ (ClWWalks‘𝐺)) |
10 | eqid 2734 | . . . . . 6 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
11 | 10 | clwwlknwrd 28089 | . . . . 5 ⊢ (𝐴 ∈ (𝑀 ClWWalksN 𝐺) → 𝐴 ∈ Word (Vtx‘𝐺)) |
12 | 10 | clwwlknwrd 28089 | . . . . 5 ⊢ (𝐵 ∈ (𝑁 ClWWalksN 𝐺) → 𝐵 ∈ Word (Vtx‘𝐺)) |
13 | ccatlen 14113 | . . . . 5 ⊢ ((𝐴 ∈ Word (Vtx‘𝐺) ∧ 𝐵 ∈ Word (Vtx‘𝐺)) → (♯‘(𝐴 ++ 𝐵)) = ((♯‘𝐴) + (♯‘𝐵))) | |
14 | 11, 12, 13 | syl2an 599 | . . . 4 ⊢ ((𝐴 ∈ (𝑀 ClWWalksN 𝐺) ∧ 𝐵 ∈ (𝑁 ClWWalksN 𝐺)) → (♯‘(𝐴 ++ 𝐵)) = ((♯‘𝐴) + (♯‘𝐵))) |
15 | clwwlknlen 28087 | . . . . 5 ⊢ (𝐴 ∈ (𝑀 ClWWalksN 𝐺) → (♯‘𝐴) = 𝑀) | |
16 | clwwlknlen 28087 | . . . . 5 ⊢ (𝐵 ∈ (𝑁 ClWWalksN 𝐺) → (♯‘𝐵) = 𝑁) | |
17 | 15, 16 | oveqan12d 7221 | . . . 4 ⊢ ((𝐴 ∈ (𝑀 ClWWalksN 𝐺) ∧ 𝐵 ∈ (𝑁 ClWWalksN 𝐺)) → ((♯‘𝐴) + (♯‘𝐵)) = (𝑀 + 𝑁)) |
18 | 14, 17 | eqtrd 2774 | . . 3 ⊢ ((𝐴 ∈ (𝑀 ClWWalksN 𝐺) ∧ 𝐵 ∈ (𝑁 ClWWalksN 𝐺)) → (♯‘(𝐴 ++ 𝐵)) = (𝑀 + 𝑁)) |
19 | 18 | 3adant3 1134 | . 2 ⊢ ((𝐴 ∈ (𝑀 ClWWalksN 𝐺) ∧ 𝐵 ∈ (𝑁 ClWWalksN 𝐺) ∧ (𝐴‘0) = (𝐵‘0)) → (♯‘(𝐴 ++ 𝐵)) = (𝑀 + 𝑁)) |
20 | isclwwlkn 28082 | . 2 ⊢ ((𝐴 ++ 𝐵) ∈ ((𝑀 + 𝑁) ClWWalksN 𝐺) ↔ ((𝐴 ++ 𝐵) ∈ (ClWWalks‘𝐺) ∧ (♯‘(𝐴 ++ 𝐵)) = (𝑀 + 𝑁))) | |
21 | 9, 19, 20 | sylanbrc 586 | 1 ⊢ ((𝐴 ∈ (𝑀 ClWWalksN 𝐺) ∧ 𝐵 ∈ (𝑁 ClWWalksN 𝐺) ∧ (𝐴‘0) = (𝐵‘0)) → (𝐴 ++ 𝐵) ∈ ((𝑀 + 𝑁) ClWWalksN 𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1089 = wceq 1543 ∈ wcel 2110 ‘cfv 6369 (class class class)co 7202 0cc0 10712 + caddc 10715 ♯chash 13879 Word cword 14052 ++ cconcat 14108 Vtxcvtx 27059 ClWWalkscclwwlk 28036 ClWWalksN cclwwlkn 28079 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2706 ax-rep 5168 ax-sep 5181 ax-nul 5188 ax-pow 5247 ax-pr 5311 ax-un 7512 ax-cnex 10768 ax-resscn 10769 ax-1cn 10770 ax-icn 10771 ax-addcl 10772 ax-addrcl 10773 ax-mulcl 10774 ax-mulrcl 10775 ax-mulcom 10776 ax-addass 10777 ax-mulass 10778 ax-distr 10779 ax-i2m1 10780 ax-1ne0 10781 ax-1rid 10782 ax-rnegex 10783 ax-rrecex 10784 ax-cnre 10785 ax-pre-lttri 10786 ax-pre-lttrn 10787 ax-pre-ltadd 10788 ax-pre-mulgt0 10789 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2537 df-eu 2566 df-clab 2713 df-cleq 2726 df-clel 2812 df-nfc 2882 df-ne 2936 df-nel 3040 df-ral 3059 df-rex 3060 df-reu 3061 df-rab 3063 df-v 3403 df-sbc 3688 df-csb 3803 df-dif 3860 df-un 3862 df-in 3864 df-ss 3874 df-pss 3876 df-nul 4228 df-if 4430 df-pw 4505 df-sn 4532 df-pr 4534 df-tp 4536 df-op 4538 df-uni 4810 df-int 4850 df-iun 4896 df-br 5044 df-opab 5106 df-mpt 5125 df-tr 5151 df-id 5444 df-eprel 5449 df-po 5457 df-so 5458 df-fr 5498 df-we 5500 df-xp 5546 df-rel 5547 df-cnv 5548 df-co 5549 df-dm 5550 df-rn 5551 df-res 5552 df-ima 5553 df-pred 6149 df-ord 6205 df-on 6206 df-lim 6207 df-suc 6208 df-iota 6327 df-fun 6371 df-fn 6372 df-f 6373 df-f1 6374 df-fo 6375 df-f1o 6376 df-fv 6377 df-riota 7159 df-ov 7205 df-oprab 7206 df-mpo 7207 df-om 7634 df-1st 7750 df-2nd 7751 df-wrecs 8036 df-recs 8097 df-rdg 8135 df-1o 8191 df-oadd 8195 df-er 8380 df-map 8499 df-en 8616 df-dom 8617 df-sdom 8618 df-fin 8619 df-card 9538 df-pnf 10852 df-mnf 10853 df-xr 10854 df-ltxr 10855 df-le 10856 df-sub 11047 df-neg 11048 df-nn 11814 df-n0 12074 df-xnn0 12146 df-z 12160 df-uz 12422 df-rp 12570 df-fz 13079 df-fzo 13222 df-hash 13880 df-word 14053 df-lsw 14101 df-concat 14109 df-clwwlk 28037 df-clwwlkn 28080 |
This theorem is referenced by: clwwlknonccat 28151 |
Copyright terms: Public domain | W3C validator |