dlwwlknondlwlknonen - Metamath Proof Explorer

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

Theorem dlwwlknondlwlknonen 30455

Description: The sets of the two representations of double loops of a fixed length on a fixed vertex are equinumerous. (Contributed by AV, 30-May-2022.) (Proof shortened by AV, 3-Nov-2022.)

**Hypotheses**
Ref	Expression
dlwwlknondlwlknonbij.v	⊢ 𝑉 = (Vtx‘𝐺)
dlwwlknondlwlknonbij.w	⊢ 𝑊 = {𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋 ∧ ((2^nd ‘𝑤)‘(𝑁 − 2)) = 𝑋)}
dlwwlknondlwlknonbij.d	⊢ 𝐷 = {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋}

**Assertion**
Ref	Expression
dlwwlknondlwlknonen	⊢ ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ_≥‘2)) → 𝑊 ≈ 𝐷)

Distinct variable groups: 𝑤,𝐺 𝑤,𝑁 𝑤,𝑋 Allowed substitution hints: 𝐷(𝑤) 𝑉(𝑤) 𝑊(𝑤)

Proof of Theorem dlwwlknondlwlknonen Dummy variable 𝑐 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dlwwlknondlwlknonbij.w	. . 3 ⊢ 𝑊 = {𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋 ∧ ((2^nd ‘𝑤)‘(𝑁 − 2)) = 𝑋)}
2		fvex 6841	. . 3 ⊢ (ClWalks‘𝐺) ∈ V
3	1, 2	rabex2 5270	. 2 ⊢ 𝑊 ∈ V
4		dlwwlknondlwlknonbij.d	. . 3 ⊢ 𝐷 = {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋}
5		ovex 7390	. . 3 ⊢ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∈ V
6	4, 5	rabex2 5270	. 2 ⊢ 𝐷 ∈ V
7		dlwwlknondlwlknonbij.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
8		eqid 2739	. . 3 ⊢ (𝑐 ∈ 𝑊 ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))) = (𝑐 ∈ 𝑊 ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐))))
9	7, 1, 4, 8	dlwwlknondlwlknonf1o 30454	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ_≥‘2)) → (𝑐 ∈ 𝑊 ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))):𝑊–1-1-onto→𝐷)
10		f1oen2g 8906	. 2 ⊢ ((𝑊 ∈ V ∧ 𝐷 ∈ V ∧ (𝑐 ∈ 𝑊 ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))):𝑊–1-1-onto→𝐷) → 𝑊 ≈ 𝐷)
11	3, 6, 9, 10	mp3an12i 1473	1 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ_≥‘2)) → 𝑊 ≈ 𝐷)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 {crab 3391 Vcvv 3431 class class class wbr 5073 ↦ cmpt 5154 –1-1-onto→wf1o 6485 ‘cfv 6486 (class class class)co 7357 1^st c1st 7930 2^nd c2nd 7931 ≈ cen 8881 0cc0 11030 − cmin 11369 2c2 12228 ℤ_≥cuz 12780 ♯chash 14284 prefix cpfx 14625 Vtxcvtx 29084 USPGraphcuspgr 29236 ClWalkscclwlks 29857 ClWWalksNOncclwwlknon 30176

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5200 ax-sep 5219 ax-nul 5229 ax-pow 5295 ax-pr 5363 ax-un 7679 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-ifp 1069 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4263 df-if 4456 df-pw 4532 df-sn 4557 df-pr 4559 df-op 4563 df-uni 4840 df-int 4879 df-iun 4924 df-br 5074 df-opab 5136 df-mpt 5155 df-tr 5181 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7314 df-ov 7360 df-oprab 7361 df-mpo 7362 df-om 7808 df-1st 7932 df-2nd 7933 df-frecs 8222 df-wrecs 8253 df-recs 8302 df-rdg 8340 df-1o 8396 df-2o 8397 df-oadd 8400 df-er 8634 df-map 8766 df-pm 8767 df-en 8885 df-dom 8886 df-sdom 8887 df-fin 8888 df-dju 9817 df-card 9855 df-pnf 11173 df-mnf 11174 df-xr 11175 df-ltxr 11176 df-le 11177 df-sub 11371 df-neg 11372 df-nn 12167 df-2 12236 df-n0 12430 df-xnn0 12503 df-z 12517 df-uz 12781 df-rp 12935 df-fz 13454 df-fzo 13601 df-hash 14285 df-word 14468 df-lsw 14517 df-concat 14525 df-s1 14551 df-substr 14596 df-pfx 14626 df-edg 29136 df-uhgr 29146 df-upgr 29170 df-uspgr 29238 df-wlks 29687 df-clwlks 29858 df-clwwlk 30071 df-clwwlkn 30114 df-clwwlknon 30177

This theorem is referenced by: numclwlk1lem2 30459

W3C validator