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

Theorem 2clwwlkel 30407
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 30405 . . 3 ((𝑋𝑉𝑁 ∈ (ℤ‘2)) → (𝑋𝐶𝑁) = {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋})
32eleq2d 2823 . 2 ((𝑋𝑉𝑁 ∈ (ℤ‘2)) → (𝑊 ∈ (𝑋𝐶𝑁) ↔ 𝑊 ∈ {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋}))
4 fveq1 6834 . . . 4 (𝑤 = 𝑊 → (𝑤‘(𝑁 − 2)) = (𝑊‘(𝑁 − 2)))
54eqeq1d 2739 . . 3 (𝑤 = 𝑊 → ((𝑤‘(𝑁 − 2)) = 𝑋 ↔ (𝑊‘(𝑁 − 2)) = 𝑋))
65elrab 3647 . 2 (𝑊 ∈ {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋} ↔ (𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∧ (𝑊‘(𝑁 − 2)) = 𝑋))
73, 6bitrdi 287 1 ((𝑋𝑉𝑁 ∈ (ℤ‘2)) → (𝑊 ∈ (𝑋𝐶𝑁) ↔ (𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∧ (𝑊‘(𝑁 − 2)) = 𝑋)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  {crab 3400  cfv 6493  (class class class)co 7360  cmpo 7362  cmin 11368  2c2 12204  cuz 12755  ClWWalksNOncclwwlknon 30145
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 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pr 5378
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3401  df-v 3443  df-sbc 3742  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-iota 6449  df-fun 6495  df-fv 6501  df-ov 7363  df-oprab 7364  df-mpo 7365
This theorem is referenced by:  2clwwlk2clwwlk  30408  numclwwlk1lem2f1  30415
  Copyright terms: Public domain W3C validator