Theorem clwwlkf1o 30141

Description: F is a 1-1 onto function, that means that there is a bijection between the set of closed walks of a fixed length represented by walks (as words) and the set of closed walks (as words) of the fixed length. The difference between these two representations is that in the first case the starting vertex is repeated at the end of the word, and in the second case it is not. (Contributed by Alexander van der Vekens, 29-Sep-2018.) (Revised by AV, 26-Apr-2021.) (Revised by AV, 1-Nov-2022.)

Hypotheses

Ref	Expression
clwwlkf1o.d	⊢ 𝐷 = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (lastS‘𝑤) = (𝑤‘0)}
clwwlkf1o.f	⊢ 𝐹 = (𝑡 ∈ 𝐷 ↦ (𝑡 prefix 𝑁))

Assertion

Ref	Expression
clwwlkf1o	⊢ (𝑁 ∈ ℕ → 𝐹:𝐷–1-1-onto→(𝑁 ClWWalksN 𝐺))

Distinct variable groups:   𝑤,𝐺   𝑤,𝑁   𝑡,𝐷   𝑡,𝐺,𝑤   𝑡,𝑁

Allowed substitution hints:   𝐷(𝑤)   𝐹(𝑤,𝑡)

Proof of Theorem clwwlkf1o

Step	Hyp	Ref	Expression
1		clwwlkf1o.d	. . 3 ⊢ 𝐷 = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (lastS‘𝑤) = (𝑤‘0)}
2		clwwlkf1o.f	. . 3 ⊢ 𝐹 = (𝑡 ∈ 𝐷 ↦ (𝑡 prefix 𝑁))
3	1, 2	clwwlkf1 30139	. 2 ⊢ (𝑁 ∈ ℕ → 𝐹:𝐷–1-1→(𝑁 ClWWalksN 𝐺))
4	1, 2	clwwlkfo 30140	. 2 ⊢ (𝑁 ∈ ℕ → 𝐹:𝐷–onto→(𝑁 ClWWalksN 𝐺))
5		df-f1o 6495	. 2 ⊢ (𝐹:𝐷–1-1-onto→(𝑁 ClWWalksN 𝐺) ↔ (𝐹:𝐷–1-1→(𝑁 ClWWalksN 𝐺) ∧ 𝐹:𝐷–onto→(𝑁 ClWWalksN 𝐺)))
6	3, 4, 5	sylanbrc 590	1 ⊢ (𝑁 ∈ ℕ → 𝐹:𝐷–1-1-onto→(𝑁 ClWWalksN 𝐺))

Syntax hints:   → wi 4   = wceq 1548   ∈ wcel 2121  {crab 3393   ↦ cmpt 5155  –1-1→wf1 6485  –onto→wfo 6486  –1-1-onto→wf1o 6487  ‘cfv 6488  (class class class)co 7359  0cc0 11034  ℕcn 12169  lastSclsw 14519   prefix cpfx 14628   WWalksN cwwlksn 29914   ClWWalksN cclwwlkn 30114

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5201  ax-sep 5220  ax-nul 5230  ax-pow 5296  ax-pr 5364  ax-un 7681  ax-cnex 11090  ax-resscn 11091  ax-1cn 11092  ax-icn 11093  ax-addcl 11094  ax-addrcl 11095  ax-mulcl 11096  ax-mulrcl 11097  ax-mulcom 11098  ax-addass 11099  ax-mulass 11100  ax-distr 11101  ax-i2m1 11102  ax-1ne0 11103  ax-1rid 11104  ax-rnegex 11105  ax-rrecex 11106  ax-cnre 11107  ax-pre-lttri 11108  ax-pre-lttrn 11109  ax-pre-ltadd 11110  ax-pre-mulgt0 11111

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-nel 3041  df-ral 3056  df-rex 3066  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3725  df-csb 3833  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-pss 3904  df-nul 4264  df-if 4457  df-pw 4533  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4841  df-int 4880  df-iun 4925  df-br 5075  df-opab 5137  df-mpt 5156  df-tr 5182  df-id 5515  df-eprel 5520  df-po 5528  df-so 5529  df-fr 5573  df-we 5575  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-pred 6255  df-ord 6316  df-on 6317  df-lim 6318  df-suc 6319  df-iota 6444  df-fun 6490  df-fn 6491  df-f 6492  df-f1 6493  df-fo 6494  df-f1o 6495  df-fv 6496  df-riota 7316  df-ov 7362  df-oprab 7363  df-mpo 7364  df-om 7810  df-1st 7933  df-2nd 7934  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8343  df-1o 8399  df-oadd 8403  df-er 8637  df-map 8769  df-en 8888  df-dom 8889  df-sdom 8890  df-fin 8891  df-card 9858  df-pnf 11177  df-mnf 11178  df-xr 11179  df-ltxr 11180  df-le 11181  df-sub 11375  df-neg 11376  df-nn 12170  df-n0 12433  df-xnn0 12506  df-z 12520  df-uz 12784  df-rp 12938  df-fz 13457  df-fzo 13604  df-hash 14288  df-word 14471  df-lsw 14520  df-concat 14528  df-s1 14554  df-substr 14599  df-pfx 14629  df-wwlks 29918  df-wwlksn 29919  df-clwwlk 30072  df-clwwlkn 30115

This theorem is referenced by:  clwwlken  30142  clwwlkvbij  30203