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

Theorem 2clwwlkel 27732
 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 27730 . . 3 ((𝑋𝑉𝑁 ∈ (ℤ‘2)) → (𝑋𝐶𝑁) = {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋})
32eleq2d 2891 . 2 ((𝑋𝑉𝑁 ∈ (ℤ‘2)) → (𝑊 ∈ (𝑋𝐶𝑁) ↔ 𝑊 ∈ {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋}))
4 fveq1 6431 . . . 4 (𝑤 = 𝑊 → (𝑤‘(𝑁 − 2)) = (𝑊‘(𝑁 − 2)))
54eqeq1d 2826 . . 3 (𝑤 = 𝑊 → ((𝑤‘(𝑁 − 2)) = 𝑋 ↔ (𝑊‘(𝑁 − 2)) = 𝑋))
65elrab 3584 . 2 (𝑊 ∈ {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋} ↔ (𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∧ (𝑊‘(𝑁 − 2)) = 𝑋))
73, 6syl6bb 279 1 ((𝑋𝑉𝑁 ∈ (ℤ‘2)) → (𝑊 ∈ (𝑋𝐶𝑁) ↔ (𝑊 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∧ (𝑊‘(𝑁 − 2)) = 𝑋)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 198   ∧ wa 386   = wceq 1658   ∈ wcel 2166  {crab 3120  ‘cfv 6122  (class class class)co 6904   ↦ cmpt2 6906   − cmin 10584  2c2 11405  ℤ≥cuz 11967  ClWWalksNOncclwwlknon 27457 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1896  ax-4 1910  ax-5 2011  ax-6 2077  ax-7 2114  ax-9 2175  ax-10 2194  ax-11 2209  ax-12 2222  ax-13 2390  ax-ext 2802  ax-sep 5004  ax-nul 5012  ax-pr 5126 This theorem depends on definitions:  df-bi 199  df-an 387  df-or 881  df-3an 1115  df-tru 1662  df-ex 1881  df-nf 1885  df-sb 2070  df-mo 2604  df-eu 2639  df-clab 2811  df-cleq 2817  df-clel 2820  df-nfc 2957  df-ral 3121  df-rex 3122  df-rab 3125  df-v 3415  df-sbc 3662  df-dif 3800  df-un 3802  df-in 3804  df-ss 3811  df-nul 4144  df-if 4306  df-sn 4397  df-pr 4399  df-op 4403  df-uni 4658  df-br 4873  df-opab 4935  df-id 5249  df-xp 5347  df-rel 5348  df-cnv 5349  df-co 5350  df-dm 5351  df-iota 6085  df-fun 6124  df-fv 6130  df-ov 6907  df-oprab 6908  df-mpt2 6909 This theorem is referenced by:  2clwwlk2clwwlk  27733  2clwwlk2clwwlkOLD  27734  numclwwlk1lem2f1  27747  numclwwlk1lem2f1OLD  27752
 Copyright terms: Public domain W3C validator