Theorem isclwwlk 16318

Description: Properties of a word to represent a closed walk (in an undirected graph). (Contributed by Alexander van der Vekens, 20-Mar-2018.) (Revised by AV, 24-Apr-2021.)

Hypotheses

Ref	Expression
clwwlk.v	|- V = (Vtx ` G )
clwwlk.e	|- E = (Edg ` G )

Assertion

Ref	Expression
isclwwlk	|- ( W e. (ClWWalks ` G ) <-> ( ( W e. Word V /\ W =/= (/) ) /\ A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) )

Distinct variable groups:   i, G   i, W

Allowed substitution hints:   E( i)   V( i)

Proof of Theorem isclwwlk

Dummy variables g w are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-clwwlk 16316	. . . 4 |- ClWWalks = ( g e. _V |-> { w e. Word (Vtx ` g ) | ( w =/= (/) /\ A. i e. ( 0..^ ( (♯ ` w ) - 1 ) ) { ( w ` i ) , ( w ` ( i + 1 ) ) } e. (Edg ` g ) /\ { (lastS ` w ) , ( w ` 0 ) } e. (Edg ` g ) ) } )
2	1	mptrcl 5738	. . 3 |- ( W e. (ClWWalks ` G ) -> G e. _V )
3		fstwrdne 11201	. . . . 5 |- ( ( W e. Word V /\ W =/= (/) ) -> ( W ` 0 ) e. V )
4		clwwlk.v	. . . . . 6 |- V = (Vtx ` G )
5	4	1vgrex 15944	. . . . 5 |- ( ( W ` 0 ) e. V -> G e. _V )
6	3, 5	syl 14	. . . 4 |- ( ( W e. Word V /\ W =/= (/) ) -> G e. _V )
7	6	3ad2antr1 1189	. . 3 |- ( ( W e. Word V /\ ( W =/= (/) /\ A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) ) -> G e. _V )
8		clwwlk.e	. . . . . 6 |- E = (Edg ` G )
9	4, 8	clwwlkg 16317	. . . . 5 |- ( G e. _V -> (ClWWalks ` G ) = { w e. Word V | ( w =/= (/) /\ A. i e. ( 0..^ ( (♯ ` w ) - 1 ) ) { ( w ` i ) , ( w ` ( i + 1 ) ) } e. E /\ { (lastS ` w ) , ( w ` 0 ) } e. E ) } )
10	9	eleq2d 2301	. . . 4 |- ( G e. _V -> ( W e. (ClWWalks ` G ) <-> W e. { w e. Word V | ( w =/= (/) /\ A. i e. ( 0..^ ( (♯ ` w ) - 1 ) ) { ( w ` i ) , ( w ` ( i + 1 ) ) } e. E /\ { (lastS ` w ) , ( w ` 0 ) } e. E ) } ) )
11		neeq1 2416	. . . . . 6 |- ( w = W -> ( w =/= (/) <-> W =/= (/) ) )
12		fveq2 5648	. . . . . . . . 9 |- ( w = W -> (♯ ` w ) = (♯ ` W ) )
13	12	oveq1d 6043	. . . . . . . 8 |- ( w = W -> ( (♯ ` w ) - 1 ) = ( (♯ ` W ) - 1 ) )
14	13	oveq2d 6044	. . . . . . 7 |- ( w = W -> ( 0..^ ( (♯ ` w ) - 1 ) ) = ( 0..^ ( (♯ ` W ) - 1 ) ) )
15		fveq1 5647	. . . . . . . . 9 |- ( w = W -> ( w ` i ) = ( W ` i ) )
16		fveq1 5647	. . . . . . . . 9 |- ( w = W -> ( w ` ( i + 1 ) ) = ( W ` ( i + 1 ) ) )
17	15, 16	preq12d 3760	. . . . . . . 8 |- ( w = W -> { ( w ` i ) , ( w ` ( i + 1 ) ) } = { ( W ` i ) , ( W ` ( i + 1 ) ) } )
18	17	eleq1d 2300	. . . . . . 7 |- ( w = W -> ( { ( w ` i ) , ( w ` ( i + 1 ) ) } e. E <-> { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E ) )
19	14, 18	raleqbidv 2747	. . . . . 6 |- ( w = W -> ( A. i e. ( 0..^ ( (♯ ` w ) - 1 ) ) { ( w ` i ) , ( w ` ( i + 1 ) ) } e. E <-> A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E ) )
20		fveq2 5648	. . . . . . . 8 |- ( w = W -> (lastS ` w ) = (lastS ` W ) )
21		fveq1 5647	. . . . . . . 8 |- ( w = W -> ( w ` 0 ) = ( W ` 0 ) )
22	20, 21	preq12d 3760	. . . . . . 7 |- ( w = W -> { (lastS ` w ) , ( w ` 0 ) } = { (lastS ` W ) , ( W ` 0 ) } )
23	22	eleq1d 2300	. . . . . 6 |- ( w = W -> ( { (lastS ` w ) , ( w ` 0 ) } e. E <-> { (lastS ` W ) , ( W ` 0 ) } e. E ) )
24	11, 19, 23	3anbi123d 1349	. . . . 5 |- ( w = W -> ( ( w =/= (/) /\ A. i e. ( 0..^ ( (♯ ` w ) - 1 ) ) { ( w ` i ) , ( w ` ( i + 1 ) ) } e. E /\ { (lastS ` w ) , ( w ` 0 ) } e. E ) <-> ( W =/= (/) /\ A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) ) )
25	24	elrab 2963	. . . 4 |- ( W e. { w e. Word V | ( w =/= (/) /\ A. i e. ( 0..^ ( (♯ ` w ) - 1 ) ) { ( w ` i ) , ( w ` ( i + 1 ) ) } e. E /\ { (lastS ` w ) , ( w ` 0 ) } e. E ) } <-> ( W e. Word V /\ ( W =/= (/) /\ A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) ) )
26	10, 25	bitrdi 196	. . 3 |- ( G e. _V -> ( W e. (ClWWalks ` G ) <-> ( W e. Word V /\ ( W =/= (/) /\ A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) ) ) )
27	2, 7, 26	pm5.21nii 712	. 2 |- ( W e. (ClWWalks ` G ) <-> ( W e. Word V /\ ( W =/= (/) /\ A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) ) )
28		3anass 1009	. . 3 |- ( ( ( W e. Word V /\ W =/= (/) ) /\ A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) <-> ( ( W e. Word V /\ W =/= (/) ) /\ ( A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) ) )
29		anass 401	. . 3 |- ( ( ( W e. Word V /\ W =/= (/) ) /\ ( A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) ) <-> ( W e. Word V /\ ( W =/= (/) /\ ( A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) ) ) )
30		3anass 1009	. . . . 5 |- ( ( W =/= (/) /\ A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) <-> ( W =/= (/) /\ ( A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) ) )
31	30	bicomi 132	. . . 4 |- ( ( W =/= (/) /\ ( A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) ) <-> ( W =/= (/) /\ A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) )
32	31	anbi2i 457	. . 3 |- ( ( W e. Word V /\ ( W =/= (/) /\ ( A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) ) ) <-> ( W e. Word V /\ ( W =/= (/) /\ A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) ) )
33	28, 29, 32	3bitri 206	. 2 |- ( ( ( W e. Word V /\ W =/= (/) ) /\ A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) <-> ( W e. Word V /\ ( W =/= (/) /\ A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) ) )
34	27, 33	bitr4i 187	1 |- ( W e. (ClWWalks ` G ) <-> ( ( W e. Word V /\ W =/= (/) ) /\ A. i e. ( 0..^ ( (♯ ` W ) - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. E /\ { (lastS ` W ) , ( W ` 0 ) } e. E ) )

Syntax hints:   /\ wa 104   <-> wb 105   /\ w3a 1005   = wceq 1398   e. wcel 2202   =/= wne 2403   A.wral 2511   {crab 2515   _Vcvv 2803   (/)c0 3496   {cpr 3674   ` cfv 5333  (class class class)co 6028   0cc0 8075   1c1 8076   + caddc 8078   - cmin 8392  ..^cfzo 10422  ♯chash 11083  Word cword 11162  lastSclsw 11207  Vtxcvtx 15936  Edgcedg 15981  ClWWalkscclwwlk 16315

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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-mulrcl 8174  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-i2m1 8180  ax-0lt1 8181  ax-1rid 8182  ax-0id 8183  ax-rnegex 8184  ax-precex 8185  ax-cnre 8186  ax-pre-ltirr 8187  ax-pre-ltwlin 8188  ax-pre-lttrn 8189  ax-pre-apti 8190  ax-pre-ltadd 8191  ax-pre-mulgt0 8192

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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-1o 6625  df-er 6745  df-map 6862  df-en 6953  df-dom 6954  df-fin 6955  df-pnf 8258  df-mnf 8259  df-xr 8260  df-ltxr 8261  df-le 8262  df-sub 8394  df-neg 8395  df-reap 8797  df-ap 8804  df-inn 9186  df-n0 9445  df-z 9524  df-uz 9800  df-fz 10289  df-fzo 10423  df-ihash 11084  df-word 11163  df-ndx 13148  df-slot 13149  df-base 13151  df-vtx 15938  df-clwwlk 16316

This theorem is referenced by:  clwwlkbp  16319  clwwlksswrd  16321  clwwlk1loop  16323  clwwlkccat  16325  isclwwlknx  16340  clwwlknonel  16356