Theorem umgr2cwwk2dif 16545

Description: If a word represents a closed walk of length at least 2 in a multigraph, the first two symbols of the word must be different. (Contributed by Alexander van der Vekens, 17-Jun-2018.) (Revised by AV, 30-Apr-2021.)

Assertion

Ref	Expression
umgr2cwwk2dif	|- ( ( G e. UMGraph /\ N e. ( ZZ>= ` 2 ) /\ W e. ( N ClWWalksN G ) ) -> ( W ` 1 ) =/= ( W ` 0 ) )

Proof of Theorem umgr2cwwk2dif

Dummy variable i is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2234	. . . 4 |- (Vtx ` G ) = (Vtx ` G )
2		eqid 2234	. . . 4 |- (Edg ` G ) = (Edg ` G )
3	1, 2	clwwlknp 16538	. . 3 |- ( W e. ( N ClWWalksN G ) -> ( ( W e. Word (Vtx ` G ) /\ (♯ ` W ) = N ) /\ A. i e. ( 0..^ ( N - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. (Edg ` G ) /\ { (lastS ` W ) , ( W ` 0 ) } e. (Edg ` G ) ) )
4		simpr 110	. . . . 5 |- ( ( ( ( ( W e. Word (Vtx ` G ) /\ (♯ ` W ) = N ) /\ A. i e. ( 0..^ ( N - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. (Edg ` G ) /\ { (lastS ` W ) , ( W ` 0 ) } e. (Edg ` G ) ) /\ N e. ( ZZ>= ` 2 ) ) /\ G e. UMGraph ) -> G e. UMGraph )
5		uz2m1nn 9955	. . . . . . . . . . 11 |- ( N e. ( ZZ>= ` 2 ) -> ( N - 1 ) e. NN )
6		lbfzo0 10541	. . . . . . . . . . 11 |- ( 0 e. ( 0..^ ( N - 1 ) ) <-> ( N - 1 ) e. NN )
7	5, 6	sylibr 134	. . . . . . . . . 10 |- ( N e. ( ZZ>= ` 2 ) -> 0 e. ( 0..^ ( N - 1 ) ) )
8		fveq2 5675	. . . . . . . . . . . . 13 |- ( i = 0 -> ( W ` i ) = ( W ` 0 ) )
9	8	adantl 277	. . . . . . . . . . . 12 |- ( ( N e. ( ZZ>= ` 2 ) /\ i = 0 ) -> ( W ` i ) = ( W ` 0 ) )
10		oveq1 6065	. . . . . . . . . . . . . . 15 |- ( i = 0 -> ( i + 1 ) = ( 0 + 1 ) )
11	10	adantl 277	. . . . . . . . . . . . . 14 |- ( ( N e. ( ZZ>= ` 2 ) /\ i = 0 ) -> ( i + 1 ) = ( 0 + 1 ) )
12		0p1e1 9368	. . . . . . . . . . . . . 14 |- ( 0 + 1 ) = 1
13	11, 12	eqtrdi 2283	. . . . . . . . . . . . 13 |- ( ( N e. ( ZZ>= ` 2 ) /\ i = 0 ) -> ( i + 1 ) = 1 )
14	13	fveq2d 5679	. . . . . . . . . . . 12 |- ( ( N e. ( ZZ>= ` 2 ) /\ i = 0 ) -> ( W ` ( i + 1 ) ) = ( W ` 1 ) )
15	9, 14	preq12d 3781	. . . . . . . . . . 11 |- ( ( N e. ( ZZ>= ` 2 ) /\ i = 0 ) -> { ( W ` i ) , ( W ` ( i + 1 ) ) } = { ( W ` 0 ) , ( W ` 1 ) } )
16	15	eleq1d 2303	. . . . . . . . . 10 |- ( ( N e. ( ZZ>= ` 2 ) /\ i = 0 ) -> ( { ( W ` i ) , ( W ` ( i + 1 ) ) } e. (Edg ` G ) <-> { ( W ` 0 ) , ( W ` 1 ) } e. (Edg ` G ) ) )
17	7, 16	rspcdv 2926	. . . . . . . . 9 |- ( N e. ( ZZ>= ` 2 ) -> ( A. i e. ( 0..^ ( N - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. (Edg ` G ) -> { ( W ` 0 ) , ( W ` 1 ) } e. (Edg ` G ) ) )
18	17	com12 30	. . . . . . . 8 |- ( A. i e. ( 0..^ ( N - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. (Edg ` G ) -> ( N e. ( ZZ>= ` 2 ) -> { ( W ` 0 ) , ( W ` 1 ) } e. (Edg ` G ) ) )
19	18	3ad2ant2 1046	. . . . . . 7 |- ( ( ( W e. Word (Vtx ` G ) /\ (♯ ` W ) = N ) /\ A. i e. ( 0..^ ( N - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. (Edg ` G ) /\ { (lastS ` W ) , ( W ` 0 ) } e. (Edg ` G ) ) -> ( N e. ( ZZ>= ` 2 ) -> { ( W ` 0 ) , ( W ` 1 ) } e. (Edg ` G ) ) )
20	19	imp 124	. . . . . 6 |- ( ( ( ( W e. Word (Vtx ` G ) /\ (♯ ` W ) = N ) /\ A. i e. ( 0..^ ( N - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. (Edg ` G ) /\ { (lastS ` W ) , ( W ` 0 ) } e. (Edg ` G ) ) /\ N e. ( ZZ>= ` 2 ) ) -> { ( W ` 0 ) , ( W ` 1 ) } e. (Edg ` G ) )
21	20	adantr 276	. . . . 5 |- ( ( ( ( ( W e. Word (Vtx ` G ) /\ (♯ ` W ) = N ) /\ A. i e. ( 0..^ ( N - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. (Edg ` G ) /\ { (lastS ` W ) , ( W ` 0 ) } e. (Edg ` G ) ) /\ N e. ( ZZ>= ` 2 ) ) /\ G e. UMGraph ) -> { ( W ` 0 ) , ( W ` 1 ) } e. (Edg ` G ) )
22	2	umgredgne 16271	. . . . . 6 |- ( ( G e. UMGraph /\ { ( W ` 0 ) , ( W ` 1 ) } e. (Edg ` G ) ) -> ( W ` 0 ) =/= ( W ` 1 ) )
23	22	necomd 2500	. . . . 5 |- ( ( G e. UMGraph /\ { ( W ` 0 ) , ( W ` 1 ) } e. (Edg ` G ) ) -> ( W ` 1 ) =/= ( W ` 0 ) )
24	4, 21, 23	syl2anc 411	. . . 4 |- ( ( ( ( ( W e. Word (Vtx ` G ) /\ (♯ ` W ) = N ) /\ A. i e. ( 0..^ ( N - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. (Edg ` G ) /\ { (lastS ` W ) , ( W ` 0 ) } e. (Edg ` G ) ) /\ N e. ( ZZ>= ` 2 ) ) /\ G e. UMGraph ) -> ( W ` 1 ) =/= ( W ` 0 ) )
25	24	exp31 364	. . 3 |- ( ( ( W e. Word (Vtx ` G ) /\ (♯ ` W ) = N ) /\ A. i e. ( 0..^ ( N - 1 ) ) { ( W ` i ) , ( W ` ( i + 1 ) ) } e. (Edg ` G ) /\ { (lastS ` W ) , ( W ` 0 ) } e. (Edg ` G ) ) -> ( N e. ( ZZ>= ` 2 ) -> ( G e. UMGraph -> ( W ` 1 ) =/= ( W ` 0 ) ) ) )
26	3, 25	syl 14	. 2 |- ( W e. ( N ClWWalksN G ) -> ( N e. ( ZZ>= ` 2 ) -> ( G e. UMGraph -> ( W ` 1 ) =/= ( W ` 0 ) ) ) )
27	26	3imp31 1223	1 |- ( ( G e. UMGraph /\ N e. ( ZZ>= ` 2 ) /\ W e. ( N ClWWalksN G ) ) -> ( W ` 1 ) =/= ( W ` 0 ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1005   = wceq 1398   e. wcel 2205   =/= wne 2414   A.wral 2522   {cpr 3695   ` cfv 5357  (class class class)co 6058   0cc0 8143   1c1 8144   + caddc 8146   - cmin 8460   NNcn 9254   2c2 9305   ZZ>=cuz 9871  ..^cfzo 10498  ♯chash 11163  Word cword 11249  lastSclsw 11294  Vtxcvtx 16133  Edgcedg 16178  UMGraphcumgr 16213   ClWWalksN cclwwlkn 16524

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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260

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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-1o 6660  df-2o 6661  df-er 6780  df-map 6897  df-en 6989  df-dom 6990  df-fin 6991  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-reap 8866  df-ap 8873  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-5 9316  df-6 9317  df-7 9318  df-8 9319  df-9 9320  df-n0 9514  df-z 9595  df-dec 9728  df-uz 9872  df-fz 10362  df-fzo 10499  df-ihash 11164  df-word 11250  df-ndx 13299  df-slot 13300  df-base 13302  df-edgf 16126  df-vtx 16135  df-iedg 16136  df-edg 16179  df-umgren 16215  df-clwwlk 16513  df-clwwlkn 16525

This theorem is referenced by:  umgr2cwwkdifex  16546