Theorem iswlk 16318

Description: Properties of a pair of functions to be/represent a walk. (Contributed by AV, 30-Dec-2020.)

Hypotheses

Ref	Expression
wksfval.v	|- V = (Vtx ` G )
wksfval.i	|- I = (iEdg ` G )

Assertion

Ref	Expression
iswlk	|- ( ( G e. W /\ F e. U /\ P e. Z ) -> ( F (Walks ` G ) P <-> ( F e. Word dom I /\ P : ( 0 ... (♯ ` F ) ) --> V /\ A. k e. ( 0..^ (♯ ` F ) )if- ( ( P ` k ) = ( P ` ( k + 1 ) ) , ( I ` ( F ` k ) ) = { ( P ` k ) } , { ( P ` k ) , ( P ` ( k + 1 ) ) } C_ ( I ` ( F ` k ) ) ) ) ) )

Distinct variable groups:   k, G   k, F   P, k

Allowed substitution hints:   U( k)   I( k)   V( k)   W( k)   Z( k)

Proof of Theorem iswlk

Dummy variables f p are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-br 4110	. . 3 |- ( F (Walks ` G ) P <-> <. F , P >. e. (Walks ` G ) )
2		wksfval.v	. . . . . 6 |- V = (Vtx ` G )
3		wksfval.i	. . . . . 6 |- I = (iEdg ` G )
4	2, 3	wksfval 16317	. . . . 5 |- ( G e. W -> (Walks ` G ) = { <. f , p >. | ( f e. Word dom I /\ p : ( 0 ... (♯ ` f ) ) --> V /\ A. k e. ( 0..^ (♯ ` f ) )if- ( ( p ` k ) = ( p ` ( k + 1 ) ) , ( I ` ( f ` k ) ) = { ( p ` k ) } , { ( p ` k ) , ( p ` ( k + 1 ) ) } C_ ( I ` ( f ` k ) ) ) ) } )
5	4	3ad2ant1 1045	. . . 4 |- ( ( G e. W /\ F e. U /\ P e. Z ) -> (Walks ` G ) = { <. f , p >. | ( f e. Word dom I /\ p : ( 0 ... (♯ ` f ) ) --> V /\ A. k e. ( 0..^ (♯ ` f ) )if- ( ( p ` k ) = ( p ` ( k + 1 ) ) , ( I ` ( f ` k ) ) = { ( p ` k ) } , { ( p ` k ) , ( p ` ( k + 1 ) ) } C_ ( I ` ( f ` k ) ) ) ) } )
6	5	eleq2d 2302	. . 3 |- ( ( G e. W /\ F e. U /\ P e. Z ) -> ( <. F , P >. e. (Walks ` G ) <-> <. F , P >. e. { <. f , p >. | ( f e. Word dom I /\ p : ( 0 ... (♯ ` f ) ) --> V /\ A. k e. ( 0..^ (♯ ` f ) )if- ( ( p ` k ) = ( p ` ( k + 1 ) ) , ( I ` ( f ` k ) ) = { ( p ` k ) } , { ( p ` k ) , ( p ` ( k + 1 ) ) } C_ ( I ` ( f ` k ) ) ) ) } ) )
7	1, 6	bitrid 192	. 2 |- ( ( G e. W /\ F e. U /\ P e. Z ) -> ( F (Walks ` G ) P <-> <. F , P >. e. { <. f , p >. | ( f e. Word dom I /\ p : ( 0 ... (♯ ` f ) ) --> V /\ A. k e. ( 0..^ (♯ ` f ) )if- ( ( p ` k ) = ( p ` ( k + 1 ) ) , ( I ` ( f ` k ) ) = { ( p ` k ) } , { ( p ` k ) , ( p ` ( k + 1 ) ) } C_ ( I ` ( f ` k ) ) ) ) } ) )
8		eleq1 2295	. . . . . 6 |- ( f = F -> ( f e. Word dom I <-> F e. Word dom I ) )
9	8	adantr 276	. . . . 5 |- ( ( f = F /\ p = P ) -> ( f e. Word dom I <-> F e. Word dom I ) )
10		simpr 110	. . . . . 6 |- ( ( f = F /\ p = P ) -> p = P )
11		fveq2 5670	. . . . . . . 8 |- ( f = F -> (♯ ` f ) = (♯ ` F ) )
12	11	oveq2d 6066	. . . . . . 7 |- ( f = F -> ( 0 ... (♯ ` f ) ) = ( 0 ... (♯ ` F ) ) )
13	12	adantr 276	. . . . . 6 |- ( ( f = F /\ p = P ) -> ( 0 ... (♯ ` f ) ) = ( 0 ... (♯ ` F ) ) )
14	10, 13	feq12d 5498	. . . . 5 |- ( ( f = F /\ p = P ) -> ( p : ( 0 ... (♯ ` f ) ) --> V <-> P : ( 0 ... (♯ ` F ) ) --> V ) )
15	11	oveq2d 6066	. . . . . . 7 |- ( f = F -> ( 0..^ (♯ ` f ) ) = ( 0..^ (♯ ` F ) ) )
16	15	adantr 276	. . . . . 6 |- ( ( f = F /\ p = P ) -> ( 0..^ (♯ ` f ) ) = ( 0..^ (♯ ` F ) ) )
17		fveq1 5669	. . . . . . . . 9 |- ( p = P -> ( p ` k ) = ( P ` k ) )
18		fveq1 5669	. . . . . . . . 9 |- ( p = P -> ( p ` ( k + 1 ) ) = ( P ` ( k + 1 ) ) )
19	17, 18	eqeq12d 2247	. . . . . . . 8 |- ( p = P -> ( ( p ` k ) = ( p ` ( k + 1 ) ) <-> ( P ` k ) = ( P ` ( k + 1 ) ) ) )
20	19	adantl 277	. . . . . . 7 |- ( ( f = F /\ p = P ) -> ( ( p ` k ) = ( p ` ( k + 1 ) ) <-> ( P ` k ) = ( P ` ( k + 1 ) ) ) )
21		fveq1 5669	. . . . . . . . 9 |- ( f = F -> ( f ` k ) = ( F ` k ) )
22	21	fveq2d 5674	. . . . . . . 8 |- ( f = F -> ( I ` ( f ` k ) ) = ( I ` ( F ` k ) ) )
23	17	sneqd 3702	. . . . . . . 8 |- ( p = P -> { ( p ` k ) } = { ( P ` k ) } )
24	22, 23	eqeqan12d 2248	. . . . . . 7 |- ( ( f = F /\ p = P ) -> ( ( I ` ( f ` k ) ) = { ( p ` k ) } <-> ( I ` ( F ` k ) ) = { ( P ` k ) } ) )
25	17, 18	preq12d 3776	. . . . . . . . 9 |- ( p = P -> { ( p ` k ) , ( p ` ( k + 1 ) ) } = { ( P ` k ) , ( P ` ( k + 1 ) ) } )
26	25	adantl 277	. . . . . . . 8 |- ( ( f = F /\ p = P ) -> { ( p ` k ) , ( p ` ( k + 1 ) ) } = { ( P ` k ) , ( P ` ( k + 1 ) ) } )
27	22	adantr 276	. . . . . . . 8 |- ( ( f = F /\ p = P ) -> ( I ` ( f ` k ) ) = ( I ` ( F ` k ) ) )
28	26, 27	sseq12d 3269	. . . . . . 7 |- ( ( f = F /\ p = P ) -> ( { ( p ` k ) , ( p ` ( k + 1 ) ) } C_ ( I ` ( f ` k ) ) <-> { ( P ` k ) , ( P ` ( k + 1 ) ) } C_ ( I ` ( F ` k ) ) ) )
29	20, 24, 28	ifpbi123d 1001	. . . . . 6 |- ( ( f = F /\ p = P ) -> (if- ( ( p ` k ) = ( p ` ( k + 1 ) ) , ( I ` ( f ` k ) ) = { ( p ` k ) } , { ( p ` k ) , ( p ` ( k + 1 ) ) } C_ ( I ` ( f ` k ) ) ) <-> if- ( ( P ` k ) = ( P ` ( k + 1 ) ) , ( I ` ( F ` k ) ) = { ( P ` k ) } , { ( P ` k ) , ( P ` ( k + 1 ) ) } C_ ( I ` ( F ` k ) ) ) ) )
30	16, 29	raleqbidv 2757	. . . . 5 |- ( ( f = F /\ p = P ) -> ( A. k e. ( 0..^ (♯ ` f ) )if- ( ( p ` k ) = ( p ` ( k + 1 ) ) , ( I ` ( f ` k ) ) = { ( p ` k ) } , { ( p ` k ) , ( p ` ( k + 1 ) ) } C_ ( I ` ( f ` k ) ) ) <-> A. k e. ( 0..^ (♯ ` F ) )if- ( ( P ` k ) = ( P ` ( k + 1 ) ) , ( I ` ( F ` k ) ) = { ( P ` k ) } , { ( P ` k ) , ( P ` ( k + 1 ) ) } C_ ( I ` ( F ` k ) ) ) ) )
31	9, 14, 30	3anbi123d 1349	. . . 4 |- ( ( f = F /\ p = P ) -> ( ( f e. Word dom I /\ p : ( 0 ... (♯ ` f ) ) --> V /\ A. k e. ( 0..^ (♯ ` f ) )if- ( ( p ` k ) = ( p ` ( k + 1 ) ) , ( I ` ( f ` k ) ) = { ( p ` k ) } , { ( p ` k ) , ( p ` ( k + 1 ) ) } C_ ( I ` ( f ` k ) ) ) ) <-> ( F e. Word dom I /\ P : ( 0 ... (♯ ` F ) ) --> V /\ A. k e. ( 0..^ (♯ ` F ) )if- ( ( P ` k ) = ( P ` ( k + 1 ) ) , ( I ` ( F ` k ) ) = { ( P ` k ) } , { ( P ` k ) , ( P ` ( k + 1 ) ) } C_ ( I ` ( F ` k ) ) ) ) ) )
32	31	opelopabga 4381	. . 3 |- ( ( F e. U /\ P e. Z ) -> ( <. F , P >. e. { <. f , p >. | ( f e. Word dom I /\ p : ( 0 ... (♯ ` f ) ) --> V /\ A. k e. ( 0..^ (♯ ` f ) )if- ( ( p ` k ) = ( p ` ( k + 1 ) ) , ( I ` ( f ` k ) ) = { ( p ` k ) } , { ( p ` k ) , ( p ` ( k + 1 ) ) } C_ ( I ` ( f ` k ) ) ) ) } <-> ( F e. Word dom I /\ P : ( 0 ... (♯ ` F ) ) --> V /\ A. k e. ( 0..^ (♯ ` F ) )if- ( ( P ` k ) = ( P ` ( k + 1 ) ) , ( I ` ( F ` k ) ) = { ( P ` k ) } , { ( P ` k ) , ( P ` ( k + 1 ) ) } C_ ( I ` ( F ` k ) ) ) ) ) )
33	32	3adant1 1042	. 2 |- ( ( G e. W /\ F e. U /\ P e. Z ) -> ( <. F , P >. e. { <. f , p >. | ( f e. Word dom I /\ p : ( 0 ... (♯ ` f ) ) --> V /\ A. k e. ( 0..^ (♯ ` f ) )if- ( ( p ` k ) = ( p ` ( k + 1 ) ) , ( I ` ( f ` k ) ) = { ( p ` k ) } , { ( p ` k ) , ( p ` ( k + 1 ) ) } C_ ( I ` ( f ` k ) ) ) ) } <-> ( F e. Word dom I /\ P : ( 0 ... (♯ ` F ) ) --> V /\ A. k e. ( 0..^ (♯ ` F ) )if- ( ( P ` k ) = ( P ` ( k + 1 ) ) , ( I ` ( F ` k ) ) = { ( P ` k ) } , { ( P ` k ) , ( P ` ( k + 1 ) ) } C_ ( I ` ( F ` k ) ) ) ) ) )
34	7, 33	bitrd 188	1 |- ( ( G e. W /\ F e. U /\ P e. Z ) -> ( F (Walks ` G ) P <-> ( F e. Word dom I /\ P : ( 0 ... (♯ ` F ) ) --> V /\ A. k e. ( 0..^ (♯ ` F ) )if- ( ( P ` k ) = ( P ` ( k + 1 ) ) , ( I ` ( F ` k ) ) = { ( P ` k ) } , { ( P ` k ) , ( P ` ( k + 1 ) ) } C_ ( I ` ( F ` k ) ) ) ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105  if-wif 986   /\ w3a 1005   = wceq 1398   e. wcel 2203   A.wral 2520   C_ wss 3211   {csn 3689   {cpr 3690   <.cop 3692   class class class wbr 4109   {copab 4170   dom cdm 4749   -->wf 5348   ` cfv 5352  (class class class)co 6050   0cc0 8127   1c1 8128   + caddc 8130   ...cfz 10342  ..^cfzo 10476  ♯chash 11138  Word cword 11224  Vtxcvtx 16007  iEdgciedg 16008  Walkscwlks 16312

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-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-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243

This theorem depends on definitions:  df-bi 117  df-dc 843  df-ifp 987  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-inn 9238  df-2 9296  df-3 9297  df-4 9298  df-5 9299  df-6 9300  df-7 9301  df-8 9302  df-9 9303  df-n0 9497  df-z 9578  df-dec 9710  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-edgf 16000  df-vtx 16009  df-iedg 16010  df-wlks 16313

This theorem is referenced by:  wlkpropg  16319  iswlkg  16324  wlkvtxeledgg  16339