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

Theorem 2clwwlkel 28113
Description: Characterization of an element of the value of operation 𝐶, i.e., of a word being a double loop of length 𝑁 on vertex 𝑋. (Contributed by Alexander van der Vekens, 24-Sep-2018.) (Revised by AV, 29-May-2021.) (Revised by AV, 20-Apr-2022.)
Hypothesis
Ref Expression
2clwwlk.c 𝐶 = (𝑣𝑉, 𝑛 ∈ (ℤ‘2) ↦ {𝑤 ∈ (𝑣(ClWWalksNOn‘𝐺)𝑛) ∣ (𝑤‘(𝑛 − 2)) = 𝑣})
Assertion
Ref Expression
2clwwlkel ((𝑋𝑉𝑁 ∈ (ℤ‘2)) → (𝑊 ∈ (𝑋𝐶𝑁) ↔ (𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∧ (𝑊‘(𝑁 − 2)) = 𝑋)))
Distinct variable groups:   𝑛,𝐺,𝑣,𝑤   𝑛,𝑁,𝑣,𝑤   𝑛,𝑉,𝑣   𝑛,𝑋,𝑣,𝑤   𝑤,𝑊
Allowed substitution hints:   𝐶(𝑤,𝑣,𝑛)   𝑉(𝑤)   𝑊(𝑣,𝑛)

Proof of Theorem 2clwwlkel
StepHypRef Expression
1 2clwwlk.c . . . 4 𝐶 = (𝑣𝑉, 𝑛 ∈ (ℤ‘2) ↦ {𝑤 ∈ (𝑣(ClWWalksNOn‘𝐺)𝑛) ∣ (𝑤‘(𝑛 − 2)) = 𝑣})
212clwwlk 28111 . . 3 ((𝑋𝑉𝑁 ∈ (ℤ‘2)) → (𝑋𝐶𝑁) = {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋})
32eleq2d 2897 . 2 ((𝑋𝑉𝑁 ∈ (ℤ‘2)) → (𝑊 ∈ (𝑋𝐶𝑁) ↔ 𝑊 ∈ {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋}))
4 fveq1 6642 . . . 4 (𝑤 = 𝑊 → (𝑤‘(𝑁 − 2)) = (𝑊‘(𝑁 − 2)))
54eqeq1d 2823 . . 3 (𝑤 = 𝑊 → ((𝑤‘(𝑁 − 2)) = 𝑋 ↔ (𝑊‘(𝑁 − 2)) = 𝑋))
65elrab 3657 . 2 (𝑊 ∈ {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋} ↔ (𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∧ (𝑊‘(𝑁 − 2)) = 𝑋))
73, 6syl6bb 290 1 ((𝑋𝑉𝑁 ∈ (ℤ‘2)) → (𝑊 ∈ (𝑋𝐶𝑁) ↔ (𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∧ (𝑊‘(𝑁 − 2)) = 𝑋)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2115  {crab 3130  cfv 6328  (class class class)co 7130  cmpo 7132  cmin 10847  2c2 11670  cuz 12221  ClWWalksNOncclwwlknon 27851
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 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-sep 5176  ax-nul 5183  ax-pr 5303
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2623  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-ral 3131  df-rex 3132  df-rab 3135  df-v 3473  df-sbc 3750  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4267  df-if 4441  df-sn 4541  df-pr 4543  df-op 4547  df-uni 4812  df-br 5040  df-opab 5102  df-id 5433  df-xp 5534  df-rel 5535  df-cnv 5536  df-co 5537  df-dm 5538  df-iota 6287  df-fun 6330  df-fv 6336  df-ov 7133  df-oprab 7134  df-mpo 7135
This theorem is referenced by:  2clwwlk2clwwlk  28114  numclwwlk1lem2f1  28121
  Copyright terms: Public domain W3C validator