Theorem uspgr2wlkeq2 16812

Description: Conditions for two walks within the same simple pseudograph to be identical. It is sufficient that the vertices (in the same order) are identical. (Contributed by Alexander van der Vekens, 25-Aug-2018.) (Revised by AV, 14-Apr-2021.)

Assertion

Ref	Expression
uspgr2wlkeq2	|- ( ( ( G e. USPGraph /\ N e. NN0 ) /\ ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) /\ ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) ) -> ( ( 2nd ` A ) = ( 2nd ` B ) -> A = B ) )

Proof of Theorem uspgr2wlkeq2

Dummy variable i is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 110	. . . . . 6 |- ( ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) -> (♯ ` ( 1st ` B ) ) = N )
2	1	eqcomd 2244	. . . . 5 |- ( ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) -> N = (♯ ` ( 1st ` B ) ) )
3	2	3ad2ant3 1051	. . . 4 |- ( ( ( G e. USPGraph /\ N e. NN0 ) /\ ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) /\ ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) ) -> N = (♯ ` ( 1st ` B ) ) )
4	3	adantr 276	. . 3 |- ( ( ( ( G e. USPGraph /\ N e. NN0 ) /\ ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) /\ ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) ) /\ ( 2nd ` A ) = ( 2nd ` B ) ) -> N = (♯ ` ( 1st ` B ) ) )
5		fveq1 5697	. . . . 5 |- ( ( 2nd ` A ) = ( 2nd ` B ) -> ( ( 2nd ` A ) ` i ) = ( ( 2nd ` B ) ` i ) )
6	5	adantl 277	. . . 4 |- ( ( ( ( G e. USPGraph /\ N e. NN0 ) /\ ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) /\ ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) ) /\ ( 2nd ` A ) = ( 2nd ` B ) ) -> ( ( 2nd ` A ) ` i ) = ( ( 2nd ` B ) ` i ) )
7	6	ralrimivw 2624	. . 3 |- ( ( ( ( G e. USPGraph /\ N e. NN0 ) /\ ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) /\ ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) ) /\ ( 2nd ` A ) = ( 2nd ` B ) ) -> A. i e. ( 0 ... N ) ( ( 2nd ` A ) ` i ) = ( ( 2nd ` B ) ` i ) )
8		simpl1l 1079	. . . 4 |- ( ( ( ( G e. USPGraph /\ N e. NN0 ) /\ ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) /\ ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) ) /\ ( 2nd ` A ) = ( 2nd ` B ) ) -> G e. USPGraph )
9		simpl 109	. . . . . . 7 |- ( ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) -> A e. (Walks ` G ) )
10		simpl 109	. . . . . . 7 |- ( ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) -> B e. (Walks ` G ) )
11	9, 10	anim12i 338	. . . . . 6 |- ( ( ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) /\ ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) ) -> ( A e. (Walks ` G ) /\ B e. (Walks ` G ) ) )
12	11	3adant1 1046	. . . . 5 |- ( ( ( G e. USPGraph /\ N e. NN0 ) /\ ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) /\ ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) ) -> ( A e. (Walks ` G ) /\ B e. (Walks ` G ) ) )
13	12	adantr 276	. . . 4 |- ( ( ( ( G e. USPGraph /\ N e. NN0 ) /\ ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) /\ ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) ) /\ ( 2nd ` A ) = ( 2nd ` B ) ) -> ( A e. (Walks ` G ) /\ B e. (Walks ` G ) ) )
14		simpr 110	. . . . . . 7 |- ( ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) -> (♯ ` ( 1st ` A ) ) = N )
15	14	eqcomd 2244	. . . . . 6 |- ( ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) -> N = (♯ ` ( 1st ` A ) ) )
16	15	3ad2ant2 1050	. . . . 5 |- ( ( ( G e. USPGraph /\ N e. NN0 ) /\ ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) /\ ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) ) -> N = (♯ ` ( 1st ` A ) ) )
17	16	adantr 276	. . . 4 |- ( ( ( ( G e. USPGraph /\ N e. NN0 ) /\ ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) /\ ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) ) /\ ( 2nd ` A ) = ( 2nd ` B ) ) -> N = (♯ ` ( 1st ` A ) ) )
18		uspgr2wlkeq 16811	. . . 4 |- ( ( G e. USPGraph /\ ( A e. (Walks ` G ) /\ B e. (Walks ` G ) ) /\ N = (♯ ` ( 1st ` A ) ) ) -> ( A = B <-> ( N = (♯ ` ( 1st ` B ) ) /\ A. i e. ( 0 ... N ) ( ( 2nd ` A ) ` i ) = ( ( 2nd ` B ) ` i ) ) ) )
19	8, 13, 17, 18	syl3anc 1278	. . 3 |- ( ( ( ( G e. USPGraph /\ N e. NN0 ) /\ ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) /\ ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) ) /\ ( 2nd ` A ) = ( 2nd ` B ) ) -> ( A = B <-> ( N = (♯ ` ( 1st ` B ) ) /\ A. i e. ( 0 ... N ) ( ( 2nd ` A ) ` i ) = ( ( 2nd ` B ) ` i ) ) ) )
20	4, 7, 19	mpbir2and 957	. 2 |- ( ( ( ( G e. USPGraph /\ N e. NN0 ) /\ ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) /\ ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) ) /\ ( 2nd ` A ) = ( 2nd ` B ) ) -> A = B )
21	20	ex 115	1 |- ( ( ( G e. USPGraph /\ N e. NN0 ) /\ ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) /\ ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) ) -> ( ( 2nd ` A ) = ( 2nd ` B ) -> A = B ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   A.wral 2528   ` cfv 5380  (class class class)co 6088   1stc1st 6376   2ndc2nd 6377   0cc0 8185   NN0cn0 9574   ...cfz 10428  ♯chash 11236  USPGraphcuspgr 16599  Walkscwlks 16763

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301

This proof depends on definitions:  df-bi 117  df-dc 847  df-ifp 991  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-1o 6691  df-2o 6692  df-er 6811  df-map 6928  df-en 7027  df-dom 7028  df-fin 7029  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-inn 9314  df-2 9372  df-3 9373  df-4 9374  df-5 9375  df-6 9376  df-7 9377  df-8 9378  df-9 9379  df-n0 9575  df-z 9656  df-dec 9789  df-uz 9938  df-fz 10429  df-fzo 10567  df-ihash 11237  df-word 11327  df-ndx 13413  df-slot 13414  df-base 13416  df-edgf 16451  df-vtx 16460  df-iedg 16461  df-edg 16504  df-uhgrm 16515  df-upgren 16539  df-uspgren 16601  df-wlks 16764

This theorem is used by:  uspgr2wlkeqi  16813