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

Theorem numclwwlk3lemlem 27572
 Description: Lemma for numclwwlk3lem 27573: The set of closed vertices of a fixed length 𝑁 on a fixed vertex 𝑉 is the union of the set of closed walks of length 𝑁 at 𝑉 with the last but one vertex being 𝑉 and the set of closed walks of length 𝑁 at 𝑉 with the last but one vertex not being 𝑉. (Contributed by AV, 1-May-2022.)
Hypotheses
Ref Expression
numclwwlk3lem.c 𝐶 = (𝑣𝑉, 𝑛 ∈ (ℤ‘2) ↦ {𝑤 ∈ (𝑣(ClWWalksNOn‘𝐺)𝑛) ∣ (𝑤‘(𝑛 − 2)) = 𝑣})
numclwwlk3lem.h 𝐻 = (𝑣𝑉, 𝑛 ∈ (ℤ‘2) ↦ {𝑤 ∈ (𝑣(ClWWalksNOn‘𝐺)𝑛) ∣ (𝑤‘(𝑛 − 2)) ≠ 𝑣})
Assertion
Ref Expression
numclwwlk3lemlem ((𝑋𝑉𝑁 ∈ (ℤ‘2)) → (𝑋(ClWWalksNOn‘𝐺)𝑁) = ((𝑋𝐻𝑁) ∪ (𝑋𝐶𝑁)))
Distinct variable groups:   𝑛,𝐺,𝑣,𝑤   𝑛,𝑁,𝑣,𝑤   𝑛,𝑉,𝑣   𝑛,𝑋,𝑣,𝑤
Allowed substitution hints:   𝐶(𝑤,𝑣,𝑛)   𝐻(𝑤,𝑣,𝑛)   𝑉(𝑤)

Proof of Theorem numclwwlk3lemlem
StepHypRef Expression
1 numclwwlk3lem.h . . . 4 𝐻 = (𝑣𝑉, 𝑛 ∈ (ℤ‘2) ↦ {𝑤 ∈ (𝑣(ClWWalksNOn‘𝐺)𝑛) ∣ (𝑤‘(𝑛 − 2)) ≠ 𝑣})
21numclwwlkovh0 27554 . . 3 ((𝑋𝑉𝑁 ∈ (ℤ‘2)) → (𝑋𝐻𝑁) = {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) ≠ 𝑋})
3 numclwwlk3lem.c . . . 4 𝐶 = (𝑣𝑉, 𝑛 ∈ (ℤ‘2) ↦ {𝑤 ∈ (𝑣(ClWWalksNOn‘𝐺)𝑛) ∣ (𝑤‘(𝑛 − 2)) = 𝑣})
432clwwlk 27525 . . 3 ((𝑋𝑉𝑁 ∈ (ℤ‘2)) → (𝑋𝐶𝑁) = {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋})
52, 4uneq12d 3911 . 2 ((𝑋𝑉𝑁 ∈ (ℤ‘2)) → ((𝑋𝐻𝑁) ∪ (𝑋𝐶𝑁)) = ({𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) ≠ 𝑋} ∪ {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋}))
6 unrab 4041 . . 3 ({𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) ≠ 𝑋} ∪ {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋}) = {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ ((𝑤‘(𝑁 − 2)) ≠ 𝑋 ∨ (𝑤‘(𝑁 − 2)) = 𝑋)}
7 exmidne 2942 . . . . . 6 ((𝑤‘(𝑁 − 2)) = 𝑋 ∨ (𝑤‘(𝑁 − 2)) ≠ 𝑋)
8 orcom 401 . . . . . 6 (((𝑤‘(𝑁 − 2)) ≠ 𝑋 ∨ (𝑤‘(𝑁 − 2)) = 𝑋) ↔ ((𝑤‘(𝑁 − 2)) = 𝑋 ∨ (𝑤‘(𝑁 − 2)) ≠ 𝑋))
97, 8mpbir 221 . . . . 5 ((𝑤‘(𝑁 − 2)) ≠ 𝑋 ∨ (𝑤‘(𝑁 − 2)) = 𝑋)
109a1i 11 . . . 4 (𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) → ((𝑤‘(𝑁 − 2)) ≠ 𝑋 ∨ (𝑤‘(𝑁 − 2)) = 𝑋))
1110rabeqc 3502 . . 3 {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ ((𝑤‘(𝑁 − 2)) ≠ 𝑋 ∨ (𝑤‘(𝑁 − 2)) = 𝑋)} = (𝑋(ClWWalksNOn‘𝐺)𝑁)
126, 11eqtri 2782 . 2 ({𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) ≠ 𝑋} ∪ {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋}) = (𝑋(ClWWalksNOn‘𝐺)𝑁)
135, 12syl6req 2811 1 ((𝑋𝑉𝑁 ∈ (ℤ‘2)) → (𝑋(ClWWalksNOn‘𝐺)𝑁) = ((𝑋𝐻𝑁) ∪ (𝑋𝐶𝑁)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∨ wo 382   ∧ wa 383   = wceq 1632   ∈ wcel 2139   ≠ wne 2932  {crab 3054   ∪ cun 3713  ‘cfv 6049  (class class class)co 6814   ↦ cmpt2 6816   − cmin 10478  2c2 11282  ℤ≥cuz 11899  ClWWalksNOncclwwlknon 27253 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-sep 4933  ax-nul 4941  ax-pr 5055 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-ral 3055  df-rex 3056  df-rab 3059  df-v 3342  df-sbc 3577  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-nul 4059  df-if 4231  df-sn 4322  df-pr 4324  df-op 4328  df-uni 4589  df-br 4805  df-opab 4865  df-id 5174  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-iota 6012  df-fun 6051  df-fv 6057  df-ov 6817  df-oprab 6818  df-mpt2 6819 This theorem is referenced by:  numclwwlk3lem  27573
 Copyright terms: Public domain W3C validator