Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  clwwlk Structured version   Visualization version   GIF version

Theorem clwwlk 26294
 Description: The set of closed walks (in an undirected graph) as words over the set of vertices. (Contributed by Alexander van der Vekens, 20-Mar-2018.)
Assertion
Ref Expression
clwwlk ((𝑉𝑋𝐸𝑌) → (𝑉 ClWWalks 𝐸) = {𝑤 ∈ Word 𝑉 ∣ (∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝐸 ∧ {( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝐸)})
Distinct variable groups:   𝑖,𝐸,𝑤   𝑖,𝑉,𝑤
Allowed substitution hints:   𝑋(𝑤,𝑖)   𝑌(𝑤,𝑖)

Proof of Theorem clwwlk
Dummy variables 𝑒 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 3185 . 2 (𝑉𝑋𝑉 ∈ V)
2 elex 3185 . 2 (𝐸𝑌𝐸 ∈ V)
3 df-clwwlk 26279 . . . 4 ClWWalks = (𝑣 ∈ V, 𝑒 ∈ V ↦ {𝑤 ∈ Word 𝑣 ∣ (∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝑒 ∧ {( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝑒)})
43a1i 11 . . 3 ((𝑉 ∈ V ∧ 𝐸 ∈ V) → ClWWalks = (𝑣 ∈ V, 𝑒 ∈ V ↦ {𝑤 ∈ Word 𝑣 ∣ (∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝑒 ∧ {( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝑒)}))
5 wrdeq 13182 . . . . . 6 (𝑣 = 𝑉 → Word 𝑣 = Word 𝑉)
65adantr 480 . . . . 5 ((𝑣 = 𝑉𝑒 = 𝐸) → Word 𝑣 = Word 𝑉)
7 rneq 5272 . . . . . . . . 9 (𝑒 = 𝐸 → ran 𝑒 = ran 𝐸)
87adantl 481 . . . . . . . 8 ((𝑣 = 𝑉𝑒 = 𝐸) → ran 𝑒 = ran 𝐸)
98eleq2d 2673 . . . . . . 7 ((𝑣 = 𝑉𝑒 = 𝐸) → ({(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝑒 ↔ {(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝐸))
109ralbidv 2969 . . . . . 6 ((𝑣 = 𝑉𝑒 = 𝐸) → (∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝑒 ↔ ∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝐸))
117eleq2d 2673 . . . . . . 7 (𝑒 = 𝐸 → ({( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝑒 ↔ {( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝐸))
1211adantl 481 . . . . . 6 ((𝑣 = 𝑉𝑒 = 𝐸) → ({( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝑒 ↔ {( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝐸))
1310, 12anbi12d 743 . . . . 5 ((𝑣 = 𝑉𝑒 = 𝐸) → ((∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝑒 ∧ {( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝑒) ↔ (∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝐸 ∧ {( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝐸)))
146, 13rabeqbidv 3168 . . . 4 ((𝑣 = 𝑉𝑒 = 𝐸) → {𝑤 ∈ Word 𝑣 ∣ (∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝑒 ∧ {( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝑒)} = {𝑤 ∈ Word 𝑉 ∣ (∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝐸 ∧ {( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝐸)})
1514adantl 481 . . 3 (((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ (𝑣 = 𝑉𝑒 = 𝐸)) → {𝑤 ∈ Word 𝑣 ∣ (∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝑒 ∧ {( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝑒)} = {𝑤 ∈ Word 𝑉 ∣ (∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝐸 ∧ {( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝐸)})
16 simpl 472 . . 3 ((𝑉 ∈ V ∧ 𝐸 ∈ V) → 𝑉 ∈ V)
17 simpr 476 . . 3 ((𝑉 ∈ V ∧ 𝐸 ∈ V) → 𝐸 ∈ V)
18 wrdexg 13170 . . . . 5 (𝑉 ∈ V → Word 𝑉 ∈ V)
1918adantr 480 . . . 4 ((𝑉 ∈ V ∧ 𝐸 ∈ V) → Word 𝑉 ∈ V)
20 rabexg 4739 . . . 4 (Word 𝑉 ∈ V → {𝑤 ∈ Word 𝑉 ∣ (∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝐸 ∧ {( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝐸)} ∈ V)
2119, 20syl 17 . . 3 ((𝑉 ∈ V ∧ 𝐸 ∈ V) → {𝑤 ∈ Word 𝑉 ∣ (∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝐸 ∧ {( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝐸)} ∈ V)
224, 15, 16, 17, 21ovmpt2d 6686 . 2 ((𝑉 ∈ V ∧ 𝐸 ∈ V) → (𝑉 ClWWalks 𝐸) = {𝑤 ∈ Word 𝑉 ∣ (∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝐸 ∧ {( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝐸)})
231, 2, 22syl2an 493 1 ((𝑉𝑋𝐸𝑌) → (𝑉 ClWWalks 𝐸) = {𝑤 ∈ Word 𝑉 ∣ (∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝐸 ∧ {( lastS ‘𝑤), (𝑤‘0)} ∈ ran 𝐸)})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∀wral 2896  {crab 2900  Vcvv 3173  {cpr 4127  ran crn 5039  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551  0cc0 9815  1c1 9816   + caddc 9818   − cmin 10145  ..^cfzo 12334  #chash 12979  Word cword 13146   lastS clsw 13147   ClWWalks cclwwlk 26276 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-er 7629  df-map 7746  df-pm 7747  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-card 8648  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-n0 11170  df-z 11255  df-uz 11564  df-fz 12198  df-fzo 12335  df-hash 12980  df-word 13154  df-clwwlk 26279 This theorem is referenced by:  isclwwlk  26296  clwwlkprop  26298  clwwlksswrd  26305
 Copyright terms: Public domain W3C validator