clwwlknonclwlknonen - Metamath Proof Explorer

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

Theorem clwwlknonclwlknonen 28776

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

**Assertion**
Ref	Expression
clwwlknonclwlknonen	⊢ ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ ℕ) → {𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋)} ≈ (𝑋(ClWWalksNOn‘𝐺)𝑁))

Distinct variable groups: 𝑤,𝐺 𝑤,𝑁 𝑤,𝑋

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

Step	Hyp	Ref	Expression
1		fvex 6817	. . 3 ⊢ (ClWalks‘𝐺) ∈ V
2	1	rabex 5265	. 2 ⊢ {𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋)} ∈ V
3		ovex 7340	. 2 ⊢ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∈ V
4		eqid 2736	. . 3 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
5		eqid 2736	. . 3 ⊢ {𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋)} = {𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋)}
6		eqid 2736	. . 3 ⊢ (𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋)} ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))) = (𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋)} ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐))))
7	4, 5, 6	clwwlknonclwlknonf1o 28775	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ ℕ) → (𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋)} ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))):{𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋)}–1-1-onto→(𝑋(ClWWalksNOn‘𝐺)𝑁))
8		f1oen2g 8789	. 2 ⊢ (({𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋)} ∈ V ∧ (𝑋(ClWWalksNOn‘𝐺)𝑁) ∈ V ∧ (𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋)} ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))):{𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋)}–1-1-onto→(𝑋(ClWWalksNOn‘𝐺)𝑁)) → {𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋)} ≈ (𝑋(ClWWalksNOn‘𝐺)𝑁))
9	2, 3, 7, 8	mp3an12i 1465	1 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ ℕ) → {𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋)} ≈ (𝑋(ClWWalksNOn‘𝐺)𝑁))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1087 = wceq 1539 ∈ wcel 2104 {crab 3330 Vcvv 3437 class class class wbr 5081 ↦ cmpt 5164 –1-1-onto→wf1o 6457 ‘cfv 6458 (class class class)co 7307 1^st c1st 7861 2^nd c2nd 7862 ≈ cen 8761 0cc0 10921 ℕcn 12023 ♯chash 14094 prefix cpfx 14432 Vtxcvtx 27415 USPGraphcuspgr 27567 ClWalkscclwlks 28187 ClWWalksNOncclwwlknon 28500

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-rep 5218 ax-sep 5232 ax-nul 5239 ax-pow 5297 ax-pr 5361 ax-un 7620 ax-cnex 10977 ax-resscn 10978 ax-1cn 10979 ax-icn 10980 ax-addcl 10981 ax-addrcl 10982 ax-mulcl 10983 ax-mulrcl 10984 ax-mulcom 10985 ax-addass 10986 ax-mulass 10987 ax-distr 10988 ax-i2m1 10989 ax-1ne0 10990 ax-1rid 10991 ax-rnegex 10992 ax-rrecex 10993 ax-cnre 10994 ax-pre-lttri 10995 ax-pre-lttrn 10996 ax-pre-ltadd 10997 ax-pre-mulgt0 10998

This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-ifp 1062 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3332 df-rab 3333 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-int 4887 df-iun 4933 df-br 5082 df-opab 5144 df-mpt 5165 df-tr 5199 df-id 5500 df-eprel 5506 df-po 5514 df-so 5515 df-fr 5555 df-we 5557 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-pred 6217 df-ord 6284 df-on 6285 df-lim 6286 df-suc 6287 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-riota 7264 df-ov 7310 df-oprab 7311 df-mpo 7312 df-om 7745 df-1st 7863 df-2nd 7864 df-frecs 8128 df-wrecs 8159 df-recs 8233 df-rdg 8272 df-1o 8328 df-2o 8329 df-oadd 8332 df-er 8529 df-map 8648 df-pm 8649 df-en 8765 df-dom 8766 df-sdom 8767 df-fin 8768 df-dju 9707 df-card 9745 df-pnf 11061 df-mnf 11062 df-xr 11063 df-ltxr 11064 df-le 11065 df-sub 11257 df-neg 11258 df-nn 12024 df-2 12086 df-n0 12284 df-xnn0 12356 df-z 12370 df-uz 12633 df-rp 12781 df-fz 13290 df-fzo 13433 df-hash 14095 df-word 14267 df-lsw 14315 df-concat 14323 df-s1 14350 df-substr 14403 df-pfx 14433 df-edg 27467 df-uhgr 27477 df-upgr 27501 df-uspgr 27569 df-wlks 28015 df-clwlks 28188 df-clwwlk 28395 df-clwwlkn 28438 df-clwwlknon 28501

This theorem is referenced by: clwlknon2num 28781 numclwlk1lem2 28783

W3C validator