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 28139

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 6678	. . 3 ⊢ (ClWalks‘𝐺) ∈ V
3	1, 2	rabex2 5230	. 2 ⊢ 𝑊 ∈ V
4		dlwwlknondlwlknonbij.d	. . 3 ⊢ 𝐷 = {𝑤 ∈ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∣ (𝑤‘(𝑁 − 2)) = 𝑋}
5		ovex 7183	. . 3 ⊢ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∈ V
6	4, 5	rabex2 5230	. 2 ⊢ 𝐷 ∈ V
7		dlwwlknondlwlknonbij.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
8		eqid 2821	. . 3 ⊢ (𝑐 ∈ 𝑊 ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))) = (𝑐 ∈ 𝑊 ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐))))
9	7, 1, 4, 8	dlwwlknondlwlknonf1o 28138	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ_≥‘2)) → (𝑐 ∈ 𝑊 ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))):𝑊–1-1-onto→𝐷)
10		f1oen2g 8520	. 2 ⊢ ((𝑊 ∈ V ∧ 𝐷 ∈ V ∧ (𝑐 ∈ 𝑊 ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))):𝑊–1-1-onto→𝐷) → 𝑊 ≈ 𝐷)
11	3, 6, 9, 10	mp3an12i 1461	1 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ_≥‘2)) → 𝑊 ≈ 𝐷)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 {crab 3142 Vcvv 3495 class class class wbr 5059 ↦ cmpt 5139 –1-1-onto→wf1o 6349 ‘cfv 6350 (class class class)co 7150 1^st c1st 7681 2^nd c2nd 7682 ≈ cen 8500 0cc0 10531 − cmin 10864 2c2 11686 ℤ_≥cuz 12237 ♯chash 13684 prefix cpfx 14026 Vtxcvtx 26775 USPGraphcuspgr 26927 ClWalkscclwlks 27545 ClWWalksNOncclwwlknon 27860

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-ifp 1058 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-int 4870 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-ord 6189 df-on 6190 df-lim 6191 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-2o 8097 df-oadd 8100 df-er 8283 df-map 8402 df-pm 8403 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-dju 9324 df-card 9362 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-n0 11892 df-xnn0 11962 df-z 11976 df-uz 12238 df-rp 12384 df-fz 12887 df-fzo 13028 df-hash 13685 df-word 13856 df-lsw 13909 df-concat 13917 df-s1 13944 df-substr 13997 df-pfx 14027 df-edg 26827 df-uhgr 26837 df-upgr 26861 df-uspgr 26929 df-wlks 27375 df-clwlks 27546 df-clwwlk 27754 df-clwwlkn 27797 df-clwwlknon 27861

This theorem is referenced by: numclwlk1lem2 28143

W3C validator