Theorem uspgr2wlkeq2 16216

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 2237	. . . . 5 |- ( ( B e. (Walks ` G ) /\ (♯ ` ( 1st ` B ) ) = N ) -> N = (♯ ` ( 1st ` B ) ) )
3	2	3ad2ant3 1046	. . . 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 5638	. . . . 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 2606	. . 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 1074	. . . 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 1041	. . . . 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 2237	. . . . . 6 |- ( ( A e. (Walks ` G ) /\ (♯ ` ( 1st ` A ) ) = N ) -> N = (♯ ` ( 1st ` A ) ) )
16	15	3ad2ant2 1045	. . . . 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 16215	. . . 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 1273	. . 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 952	. 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 ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1004   = wceq 1397   e. wcel 2202   A.wral 2510   ` cfv 5326  (class class class)co 6017   1stc1st 6300   2ndc2nd 6301   0cc0 8031   NN0cn0 9401   ...cfz 10242  ♯chash 11036  USPGraphcuspgr 16003  Walkscwlks 16167

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147

This theorem depends on definitions:  df-bi 117  df-dc 842  df-ifp 986  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-frec 6556  df-1o 6581  df-2o 6582  df-er 6701  df-map 6818  df-en 6909  df-dom 6910  df-fin 6911  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-inn 9143  df-2 9201  df-3 9202  df-4 9203  df-5 9204  df-6 9205  df-7 9206  df-8 9207  df-9 9208  df-n0 9402  df-z 9479  df-dec 9611  df-uz 9755  df-fz 10243  df-fzo 10377  df-ihash 11037  df-word 11113  df-ndx 13084  df-slot 13085  df-base 13087  df-edgf 15855  df-vtx 15864  df-iedg 15865  df-edg 15908  df-uhgrm 15919  df-upgren 15943  df-uspgren 16005  df-wlks 16168

This theorem is referenced by:  uspgr2wlkeqi  16217