|   | 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 30129 | . 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ {𝑋, 𝑌} ∈ 𝐸 ∧ 𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2))) → ((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉) ∈ (𝑁 ClWWalksN 𝐺)) | 
| 4 | isclwwlknon 30111 | . . . . 5 ⊢ (𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2)) ↔ (𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) ∧ (𝑊‘0) = 𝑋)) | |
| 5 | isclwwlkn 30047 | . . . . . . . . . 10 ⊢ (𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) ↔ (𝑊 ∈ (ClWWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 − 2))) | |
| 6 | 1 | clwwlkbp 30005 | . . . . . . . . . . . . 13 ⊢ (𝑊 ∈ (ClWWalks‘𝐺) → (𝐺 ∈ V ∧ 𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅)) | 
| 7 | 6 | simp2d 1143 | . . . . . . . . . . . 12 ⊢ (𝑊 ∈ (ClWWalks‘𝐺) → 𝑊 ∈ Word 𝑉) | 
| 8 | clwwlkgt0 30006 | . . . . . . . . . . . 12 ⊢ (𝑊 ∈ (ClWWalks‘𝐺) → 0 < (♯‘𝑊)) | |
| 9 | 7, 8 | jca 511 | . . . . . . . . . . 11 ⊢ (𝑊 ∈ (ClWWalks‘𝐺) → (𝑊 ∈ Word 𝑉 ∧ 0 < (♯‘𝑊))) | 
| 10 | 9 | adantr 480 | . . . . . . . . . 10 ⊢ ((𝑊 ∈ (ClWWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 − 2)) → (𝑊 ∈ Word 𝑉 ∧ 0 < (♯‘𝑊))) | 
| 11 | 5, 10 | sylbi 217 | . . . . . . . . 9 ⊢ (𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) → (𝑊 ∈ Word 𝑉 ∧ 0 < (♯‘𝑊))) | 
| 12 | 11 | ad2antrl 728 | . . . . . . . 8 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ (𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) ∧ (𝑊‘0) = 𝑋)) → (𝑊 ∈ Word 𝑉 ∧ 0 < (♯‘𝑊))) | 
| 13 | ccat2s1fst 14678 | . . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 0 < (♯‘𝑊)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = (𝑊‘0)) | |
| 14 | 12, 13 | syl 17 | . . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ (𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) ∧ (𝑊‘0) = 𝑋)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = (𝑊‘0)) | 
| 15 | simprr 772 | . . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ (𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) ∧ (𝑊‘0) = 𝑋)) → (𝑊‘0) = 𝑋) | |
| 16 | 14, 15 | eqtrd 2776 | . . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ (𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) ∧ (𝑊‘0) = 𝑋)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = 𝑋) | 
| 17 | 16 | ex 412 | . . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) → ((𝑊 ∈ ((𝑁 − 2) ClWWalksN 𝐺) ∧ (𝑊‘0) = 𝑋) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = 𝑋)) | 
| 18 | 4, 17 | biimtrid 242 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) → (𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = 𝑋)) | 
| 19 | 18 | a1d 25 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) → ({𝑋, 𝑌} ∈ 𝐸 → (𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = 𝑋))) | 
| 20 | 19 | 3imp 1110 | . 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ {𝑋, 𝑌} ∈ 𝐸 ∧ 𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2))) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = 𝑋) | 
| 21 | isclwwlknon 30111 | . 2 ⊢ (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉) ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ↔ (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉) ∈ (𝑁 ClWWalksN 𝐺) ∧ (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘0) = 𝑋)) | |
| 22 | 3, 20, 21 | sylanbrc 583 | 1 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ {𝑋, 𝑌} ∈ 𝐸 ∧ 𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2))) → ((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉) ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁)) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1539 ∈ wcel 2107 ≠ wne 2939 Vcvv 3479 ∅c0 4332 {cpr 4627 class class class wbr 5142 ‘cfv 6560 (class class class)co 7432 0cc0 11156 < clt 11296 − cmin 11493 2c2 12322 3c3 12323 ℤ≥cuz 12879 ♯chash 14370 Word cword 14553 ++ cconcat 14609 〈“cs1 14634 Vtxcvtx 29014 Edgcedg 29065 ClWWalkscclwwlk 30001 ClWWalksN cclwwlkn 30044 ClWWalksNOncclwwlknon 30107 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-rep 5278 ax-sep 5295 ax-nul 5305 ax-pow 5364 ax-pr 5431 ax-un 7756 ax-cnex 11212 ax-resscn 11213 ax-1cn 11214 ax-icn 11215 ax-addcl 11216 ax-addrcl 11217 ax-mulcl 11218 ax-mulrcl 11219 ax-mulcom 11220 ax-addass 11221 ax-mulass 11222 ax-distr 11223 ax-i2m1 11224 ax-1ne0 11225 ax-1rid 11226 ax-rnegex 11227 ax-rrecex 11228 ax-cnre 11229 ax-pre-lttri 11230 ax-pre-lttrn 11231 ax-pre-ltadd 11232 ax-pre-mulgt0 11233 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-reu 3380 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-pss 3970 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-int 4946 df-iun 4992 df-br 5143 df-opab 5205 df-mpt 5225 df-tr 5259 df-id 5577 df-eprel 5583 df-po 5591 df-so 5592 df-fr 5636 df-we 5638 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-pred 6320 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6513 df-fun 6562 df-fn 6563 df-f 6564 df-f1 6565 df-fo 6566 df-f1o 6567 df-fv 6568 df-riota 7389 df-ov 7435 df-oprab 7436 df-mpo 7437 df-om 7889 df-1st 8015 df-2nd 8016 df-frecs 8307 df-wrecs 8338 df-recs 8412 df-rdg 8451 df-1o 8507 df-oadd 8511 df-er 8746 df-map 8869 df-en 8987 df-dom 8988 df-sdom 8989 df-fin 8990 df-card 9980 df-pnf 11298 df-mnf 11299 df-xr 11300 df-ltxr 11301 df-le 11302 df-sub 11495 df-neg 11496 df-nn 12268 df-2 12330 df-3 12331 df-n0 12529 df-xnn0 12602 df-z 12616 df-uz 12880 df-rp 13036 df-fz 13549 df-fzo 13696 df-hash 14371 df-word 14554 df-lsw 14602 df-concat 14610 df-s1 14635 df-clwwlk 30002 df-clwwlkn 30045 df-clwwlknon 30108 | 
| This theorem is referenced by: (None) | 
| Copyright terms: Public domain | W3C validator |