![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > erclwwlkref | Structured version Visualization version GIF version |
Description: ∼ is a reflexive relation over the set of closed walks (defined as words). (Contributed by Alexander van der Vekens, 25-Mar-2018.) (Revised by AV, 29-Apr-2021.) |
Ref | Expression |
---|---|
erclwwlk.r | ⊢ ∼ = {〈𝑢, 𝑤〉 ∣ (𝑢 ∈ (ClWWalks‘𝐺) ∧ 𝑤 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑤))𝑢 = (𝑤 cyclShift 𝑛))} |
Ref | Expression |
---|---|
erclwwlkref | ⊢ (𝑥 ∈ (ClWWalks‘𝐺) ↔ 𝑥 ∼ 𝑥) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | anidm 568 | . . . 4 ⊢ ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑥 ∈ (ClWWalks‘𝐺)) ↔ 𝑥 ∈ (ClWWalks‘𝐺)) | |
2 | 1 | anbi1i 626 | . . 3 ⊢ (((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑥 ∈ (ClWWalks‘𝐺)) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛)) ↔ (𝑥 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛))) |
3 | df-3an 1086 | . . 3 ⊢ ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑥 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛)) ↔ ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑥 ∈ (ClWWalks‘𝐺)) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛))) | |
4 | eqid 2798 | . . . . . 6 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
5 | 4 | clwwlkbp 27770 | . . . . 5 ⊢ (𝑥 ∈ (ClWWalks‘𝐺) → (𝐺 ∈ V ∧ 𝑥 ∈ Word (Vtx‘𝐺) ∧ 𝑥 ≠ ∅)) |
6 | cshw0 14147 | . . . . . . 7 ⊢ (𝑥 ∈ Word (Vtx‘𝐺) → (𝑥 cyclShift 0) = 𝑥) | |
7 | 0nn0 11900 | . . . . . . . . . 10 ⊢ 0 ∈ ℕ0 | |
8 | 7 | a1i 11 | . . . . . . . . 9 ⊢ (𝑥 ∈ Word (Vtx‘𝐺) → 0 ∈ ℕ0) |
9 | lencl 13876 | . . . . . . . . 9 ⊢ (𝑥 ∈ Word (Vtx‘𝐺) → (♯‘𝑥) ∈ ℕ0) | |
10 | hashge0 13744 | . . . . . . . . 9 ⊢ (𝑥 ∈ Word (Vtx‘𝐺) → 0 ≤ (♯‘𝑥)) | |
11 | elfz2nn0 12993 | . . . . . . . . 9 ⊢ (0 ∈ (0...(♯‘𝑥)) ↔ (0 ∈ ℕ0 ∧ (♯‘𝑥) ∈ ℕ0 ∧ 0 ≤ (♯‘𝑥))) | |
12 | 8, 9, 10, 11 | syl3anbrc 1340 | . . . . . . . 8 ⊢ (𝑥 ∈ Word (Vtx‘𝐺) → 0 ∈ (0...(♯‘𝑥))) |
13 | eqcom 2805 | . . . . . . . . 9 ⊢ ((𝑥 cyclShift 0) = 𝑥 ↔ 𝑥 = (𝑥 cyclShift 0)) | |
14 | 13 | biimpi 219 | . . . . . . . 8 ⊢ ((𝑥 cyclShift 0) = 𝑥 → 𝑥 = (𝑥 cyclShift 0)) |
15 | oveq2 7143 | . . . . . . . . 9 ⊢ (𝑛 = 0 → (𝑥 cyclShift 𝑛) = (𝑥 cyclShift 0)) | |
16 | 15 | rspceeqv 3586 | . . . . . . . 8 ⊢ ((0 ∈ (0...(♯‘𝑥)) ∧ 𝑥 = (𝑥 cyclShift 0)) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛)) |
17 | 12, 14, 16 | syl2an 598 | . . . . . . 7 ⊢ ((𝑥 ∈ Word (Vtx‘𝐺) ∧ (𝑥 cyclShift 0) = 𝑥) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛)) |
18 | 6, 17 | mpdan 686 | . . . . . 6 ⊢ (𝑥 ∈ Word (Vtx‘𝐺) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛)) |
19 | 18 | 3ad2ant2 1131 | . . . . 5 ⊢ ((𝐺 ∈ V ∧ 𝑥 ∈ Word (Vtx‘𝐺) ∧ 𝑥 ≠ ∅) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛)) |
20 | 5, 19 | syl 17 | . . . 4 ⊢ (𝑥 ∈ (ClWWalks‘𝐺) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛)) |
21 | 20 | pm4.71i 563 | . . 3 ⊢ (𝑥 ∈ (ClWWalks‘𝐺) ↔ (𝑥 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛))) |
22 | 2, 3, 21 | 3bitr4ri 307 | . 2 ⊢ (𝑥 ∈ (ClWWalks‘𝐺) ↔ (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑥 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛))) |
23 | erclwwlk.r | . . . 4 ⊢ ∼ = {〈𝑢, 𝑤〉 ∣ (𝑢 ∈ (ClWWalks‘𝐺) ∧ 𝑤 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑤))𝑢 = (𝑤 cyclShift 𝑛))} | |
24 | 23 | erclwwlkeq 27803 | . . 3 ⊢ ((𝑥 ∈ V ∧ 𝑥 ∈ V) → (𝑥 ∼ 𝑥 ↔ (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑥 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛)))) |
25 | 24 | el2v 3448 | . 2 ⊢ (𝑥 ∼ 𝑥 ↔ (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑥 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛))) |
26 | 22, 25 | bitr4i 281 | 1 ⊢ (𝑥 ∈ (ClWWalks‘𝐺) ↔ 𝑥 ∼ 𝑥) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∃wrex 3107 Vcvv 3441 ∅c0 4243 class class class wbr 5030 {copab 5092 ‘cfv 6324 (class class class)co 7135 0cc0 10526 ≤ cle 10665 ℕ0cn0 11885 ...cfz 12885 ♯chash 13686 Word cword 13857 cyclShift ccsh 14141 Vtxcvtx 26789 ClWWalkscclwwlk 27766 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-map 8391 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-sup 8890 df-inf 8891 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-n0 11886 df-xnn0 11956 df-z 11970 df-uz 12232 df-rp 12378 df-fz 12886 df-fzo 13029 df-fl 13157 df-mod 13233 df-hash 13687 df-word 13858 df-concat 13914 df-substr 13994 df-pfx 14024 df-csh 14142 df-clwwlk 27767 |
This theorem is referenced by: erclwwlk 27808 |
Copyright terms: Public domain | W3C validator |