Theorem clwwlknon 16424

Description: The set of closed walks on vertex X of length N in a graph G as words over the set of vertices. (Contributed by Alexander van der Vekens, 14-Sep-2018.) (Revised by AV, 28-May-2021.) (Revised by AV, 24-Mar-2022.)

Assertion

Ref	Expression
clwwlknon	|- ( X (ClWWalksNOn ` G ) N ) = { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X }

Distinct variable groups:   w, G   w, N   w, X

Proof of Theorem clwwlknon

Dummy variables n v x g are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		clwwlknonmpo 16423	. . . 4 |- (ClWWalksNOn ` G ) = ( v e. (Vtx ` G ) , n e. NN0 |-> { w e. ( n ClWWalksN G ) | ( w ` 0 ) = v } )
2	1	elmpocl 6249	. . 3 |- ( x e. ( X (ClWWalksNOn ` G ) N ) -> ( X e. (Vtx ` G ) /\ N e. NN0 ) )
3		fveq1 5669	. . . . . . . 8 |- ( w = x -> ( w ` 0 ) = ( x ` 0 ) )
4	3	eqeq1d 2241	. . . . . . 7 |- ( w = x -> ( ( w ` 0 ) = X <-> ( x ` 0 ) = X ) )
5	4	elrab 2973	. . . . . 6 |- ( x e. { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } <-> ( x e. ( N ClWWalksN G ) /\ ( x ` 0 ) = X ) )
6	5	simprbi 275	. . . . 5 |- ( x e. { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } -> ( x ` 0 ) = X )
7		elrabi 2970	. . . . . . . 8 |- ( x e. { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } -> x e. ( N ClWWalksN G ) )
8		clwwlkclwwlkn 16404	. . . . . . . 8 |- ( x e. ( N ClWWalksN G ) -> x e. (ClWWalks ` G ) )
9		eqid 2232	. . . . . . . . 9 |- (Vtx ` G ) = (Vtx ` G )
10	9	clwwlkbp 16390	. . . . . . . 8 |- ( x e. (ClWWalks ` G ) -> ( G e. _V /\ x e. Word (Vtx ` G ) /\ x =/= (/) ) )
11	7, 8, 10	3syl 17	. . . . . . 7 |- ( x e. { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } -> ( G e. _V /\ x e. Word (Vtx ` G ) /\ x =/= (/) ) )
12	11	simp2d 1037	. . . . . 6 |- ( x e. { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } -> x e. Word (Vtx ` G ) )
13	11	simp3d 1038	. . . . . 6 |- ( x e. { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } -> x =/= (/) )
14		fstwrdne 11263	. . . . . 6 |- ( ( x e. Word (Vtx ` G ) /\ x =/= (/) ) -> ( x ` 0 ) e. (Vtx ` G ) )
15	12, 13, 14	syl2anc 411	. . . . 5 |- ( x e. { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } -> ( x ` 0 ) e. (Vtx ` G ) )
16	6, 15	eqeltrrd 2310	. . . 4 |- ( x e. { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } -> X e. (Vtx ` G ) )
17		clwwlknnn 16407	. . . . . 6 |- ( x e. ( N ClWWalksN G ) -> N e. NN )
18	7, 17	syl 14	. . . . 5 |- ( x e. { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } -> N e. NN )
19	18	nnnn0d 9553	. . . 4 |- ( x e. { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } -> N e. NN0 )
20	16, 19	jca 306	. . 3 |- ( x e. { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } -> ( X e. (Vtx ` G ) /\ N e. NN0 ) )
21		clwwlkex 16393	. . . . . . . . . 10 |- ( g e. _V -> (ClWWalks ` g ) e. _V )
22	21	elv 2817	. . . . . . . . 9 |- (ClWWalks ` g ) e. _V
23	22	rabex 4256	. . . . . . . 8 |- { w e. (ClWWalks ` g ) | (♯ ` w ) = n } e. _V
24	23	gen2 1499	. . . . . . 7 |- A. n A. g { w e. (ClWWalks ` g ) | (♯ ` w ) = n } e. _V
25		simpr 110	. . . . . . 7 |- ( ( X e. (Vtx ` G ) /\ N e. NN0 ) -> N e. NN0 )
26	9	1vgrex 16015	. . . . . . . 8 |- ( X e. (Vtx ` G ) -> G e. _V )
27	26	adantr 276	. . . . . . 7 |- ( ( X e. (Vtx ` G ) /\ N e. NN0 ) -> G e. _V )
28		df-clwwlkn 16399	. . . . . . . 8 |- ClWWalksN = ( n e. NN0 , g e. _V |-> { w e. (ClWWalks ` g ) | (♯ ` w ) = n } )
29	28	mpofvex 6401	. . . . . . 7 |- ( ( A. n A. g { w e. (ClWWalks ` g ) | (♯ ` w ) = n } e. _V /\ N e. NN0 /\ G e. _V ) -> ( N ClWWalksN G ) e. _V )
30	24, 25, 27, 29	mp3an2i 1379	. . . . . 6 |- ( ( X e. (Vtx ` G ) /\ N e. NN0 ) -> ( N ClWWalksN G ) e. _V )
31		rabexg 4255	. . . . . 6 |- ( ( N ClWWalksN G ) e. _V -> { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } e. _V )
32	30, 31	syl 14	. . . . 5 |- ( ( X e. (Vtx ` G ) /\ N e. NN0 ) -> { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } e. _V )
33		eqeq2 2242	. . . . . . 7 |- ( v = X -> ( ( w ` 0 ) = v <-> ( w ` 0 ) = X ) )
34	33	rabbidv 2802	. . . . . 6 |- ( v = X -> { w e. ( n ClWWalksN G ) | ( w ` 0 ) = v } = { w e. ( n ClWWalksN G ) | ( w ` 0 ) = X } )
35		oveq1 6057	. . . . . . 7 |- ( n = N -> ( n ClWWalksN G ) = ( N ClWWalksN G ) )
36	35	rabeqdv 2807	. . . . . 6 |- ( n = N -> { w e. ( n ClWWalksN G ) | ( w ` 0 ) = X } = { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } )
37	34, 36, 1	ovmpog 6188	. . . . 5 |- ( ( X e. (Vtx ` G ) /\ N e. NN0 /\ { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } e. _V ) -> ( X (ClWWalksNOn ` G ) N ) = { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } )
38	32, 37	mpd3an3 1375	. . . 4 |- ( ( X e. (Vtx ` G ) /\ N e. NN0 ) -> ( X (ClWWalksNOn ` G ) N ) = { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } )
39	38	eleq2d 2302	. . 3 |- ( ( X e. (Vtx ` G ) /\ N e. NN0 ) -> ( x e. ( X (ClWWalksNOn ` G ) N ) <-> x e. { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } ) )
40	2, 20, 39	pm5.21nii 712	. 2 |- ( x e. ( X (ClWWalksNOn ` G ) N ) <-> x e. { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X } )
41	40	eqriv 2229	1 |- ( X (ClWWalksNOn ` G ) N ) = { w e. ( N ClWWalksN G ) | ( w ` 0 ) = X }

Syntax hints:   /\ wa 104   /\ w3a 1005   A.wal 1396   = wceq 1398   e. wcel 2203   =/= wne 2412   {crab 2524   _Vcvv 2813   (/)c0 3508   ` cfv 5352  (class class class)co 6050   0cc0 8127   NNcn 9237   NN0cn0 9496  ♯chash 11138  Word cword 11224  Vtxcvtx 16007  ClWWalkscclwwlk 16386   ClWWalksN cclwwlkn 16398  ClWWalksNOncclwwlknon 16421

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-mulrcl 8226  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-precex 8237  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243  ax-pre-mulgt0 8244

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-ilim 4490  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-recs 6536  df-frec 6622  df-1o 6647  df-er 6767  df-map 6884  df-en 6976  df-dom 6977  df-fin 6978  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-reap 8849  df-ap 8856  df-inn 9238  df-n0 9497  df-z 9578  df-uz 9854  df-fz 10343  df-fzo 10477  df-ihash 11139  df-word 11225  df-ndx 13215  df-slot 13216  df-base 13218  df-vtx 16009  df-clwwlk 16387  df-clwwlkn 16399  df-clwwlknon 16422

This theorem is referenced by:  isclwwlknon  16425  clwwlknon2  16429