Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > clwwlknonex2e | Structured version Visualization version GIF version |
Description: Extending a closed walk 𝑊 on vertex 𝑋 by an additional edge (forth and back) results in a closed walk on vertex 𝑋. (Contributed by AV, 17-Apr-2022.) |
Ref | Expression |
---|---|
clwwlknonex2.v | ⊢ 𝑉 = (Vtx‘𝐺) |
clwwlknonex2.e | ⊢ 𝐸 = (Edg‘𝐺) |
Ref | Expression |
---|---|
clwwlknonex2e | ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ {𝑋, 𝑌} ∈ 𝐸 ∧ 𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2))) → ((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉) ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | clwwlknonex2.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | clwwlknonex2.e | . . 3 ⊢ 𝐸 = (Edg‘𝐺) | |
3 | 1, 2 | clwwlknonex2 27888 | . 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ {𝑋, 𝑌} ∈ 𝐸 ∧ 𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2))) → ((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉) ∈ (𝑁 ClWWalksN 𝐺)) |
4 | isclwwlknon 27870 | . . . . 5 ⊢ (𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2)) ↔ (𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) ∧ (𝑊‘0) = 𝑋)) | |
5 | isclwwlkn 27805 | . . . . . . . . . 10 ⊢ (𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) ↔ (𝑊 ∈ (ClWWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 − 2))) | |
6 | 1 | clwwlkbp 27763 | . . . . . . . . . . . . 13 ⊢ (𝑊 ∈ (ClWWalks‘𝐺) → (𝐺 ∈ V ∧ 𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅)) |
7 | 6 | simp2d 1139 | . . . . . . . . . . . 12 ⊢ (𝑊 ∈ (ClWWalks‘𝐺) → 𝑊 ∈ Word 𝑉) |
8 | clwwlkgt0 27764 | . . . . . . . . . . . 12 ⊢ (𝑊 ∈ (ClWWalks‘𝐺) → 0 < (♯‘𝑊)) | |
9 | 7, 8 | jca 514 | . . . . . . . . . . 11 ⊢ (𝑊 ∈ (ClWWalks‘𝐺) → (𝑊 ∈ Word 𝑉 ∧ 0 < (♯‘𝑊))) |
10 | 9 | adantr 483 | . . . . . . . . . 10 ⊢ ((𝑊 ∈ (ClWWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 − 2)) → (𝑊 ∈ Word 𝑉 ∧ 0 < (♯‘𝑊))) |
11 | 5, 10 | sylbi 219 | . . . . . . . . 9 ⊢ (𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) → (𝑊 ∈ Word 𝑉 ∧ 0 < (♯‘𝑊))) |
12 | 11 | ad2antrl 726 | . . . . . . . 8 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ (𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) ∧ (𝑊‘0) = 𝑋)) → (𝑊 ∈ Word 𝑉 ∧ 0 < (♯‘𝑊))) |
13 | ccat2s1fst 14000 | . . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 0 < (♯‘𝑊)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = (𝑊‘0)) | |
14 | 12, 13 | syl 17 | . . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ (𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) ∧ (𝑊‘0) = 𝑋)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = (𝑊‘0)) |
15 | simprr 771 | . . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ (𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) ∧ (𝑊‘0) = 𝑋)) → (𝑊‘0) = 𝑋) | |
16 | 14, 15 | eqtrd 2856 | . . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ (𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) ∧ (𝑊‘0) = 𝑋)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = 𝑋) |
17 | 16 | ex 415 | . . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) → ((𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) ∧ (𝑊‘0) = 𝑋) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = 𝑋)) |
18 | 4, 17 | syl5bi 244 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) → (𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = 𝑋)) |
19 | 18 | a1d 25 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) → ({𝑋, 𝑌} ∈ 𝐸 → (𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = 𝑋))) |
20 | 19 | 3imp 1107 | . 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ {𝑋, 𝑌} ∈ 𝐸 ∧ 𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2))) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = 𝑋) |
21 | isclwwlknon 27870 | . 2 ⊢ (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉) ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ↔ (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉) ∈ (𝑁 ClWWalksN 𝐺) ∧ (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = 𝑋)) | |
22 | 3, 20, 21 | sylanbrc 585 | 1 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ {𝑋, 𝑌} ∈ 𝐸 ∧ 𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2))) → ((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉) ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ≠ wne 3016 Vcvv 3494 ∅c0 4291 {cpr 4569 class class class wbr 5066 ‘cfv 6355 (class class class)co 7156 0cc0 10537 < clt 10675 − cmin 10870 2c2 11693 3c3 11694 ℤ≥cuz 12244 ♯chash 13691 Word cword 13862 ++ cconcat 13922 〈“cs1 13949 Vtxcvtx 26781 Edgcedg 26832 ClWWalkscclwwlk 27759 ClWWalksN cclwwlkn 27802 ClWWalksNOncclwwlknon 27866 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-oadd 8106 df-er 8289 df-map 8408 df-en 8510 df-dom 8511 df-sdom 8512 df-fin 8513 df-card 9368 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-2 11701 df-3 11702 df-n0 11899 df-xnn0 11969 df-z 11983 df-uz 12245 df-rp 12391 df-fz 12894 df-fzo 13035 df-hash 13692 df-word 13863 df-lsw 13915 df-concat 13923 df-s1 13950 df-clwwlk 27760 df-clwwlkn 27803 df-clwwlknon 27867 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |