uspgr2wlkeq2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > uspgr2wlkeq2		Structured version Visualization version GIF version

Theorem uspgr2wlkeq2 27916

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	⊢ (((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ₀) ∧ (𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) ∧ (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁)) → ((2^nd ‘𝐴) = (2^nd ‘𝐵) → 𝐴 = 𝐵))

Proof of Theorem uspgr2wlkeq2 Dummy variable 𝑖 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 484	. . . . . 6 ⊢ ((𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁) → (♯‘(1^st ‘𝐵)) = 𝑁)
2	1	eqcomd 2744	. . . . 5 ⊢ ((𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁) → 𝑁 = (♯‘(1^st ‘𝐵)))
3	2	3ad2ant3 1133	. . . 4 ⊢ (((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ₀) ∧ (𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) ∧ (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁)) → 𝑁 = (♯‘(1^st ‘𝐵)))
4	3	adantr 480	. . 3 ⊢ ((((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ₀) ∧ (𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) ∧ (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → 𝑁 = (♯‘(1^st ‘𝐵)))
5		fveq1 6755	. . . . 5 ⊢ ((2^nd ‘𝐴) = (2^nd ‘𝐵) → ((2^nd ‘𝐴)‘𝑖) = ((2^nd ‘𝐵)‘𝑖))
6	5	adantl 481	. . . 4 ⊢ ((((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ₀) ∧ (𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) ∧ (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → ((2^nd ‘𝐴)‘𝑖) = ((2^nd ‘𝐵)‘𝑖))
7	6	ralrimivw 3108	. . 3 ⊢ ((((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ₀) ∧ (𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) ∧ (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → ∀𝑖 ∈ (0...𝑁)((2^nd ‘𝐴)‘𝑖) = ((2^nd ‘𝐵)‘𝑖))
8		simpl1l 1222	. . . 4 ⊢ ((((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ₀) ∧ (𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) ∧ (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → 𝐺 ∈ USPGraph)
9		simpl 482	. . . . . . 7 ⊢ ((𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) → 𝐴 ∈ (Walks‘𝐺))
10		simpl 482	. . . . . . 7 ⊢ ((𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁) → 𝐵 ∈ (Walks‘𝐺))
11	9, 10	anim12i 612	. . . . . 6 ⊢ (((𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) ∧ (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁)) → (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)))
12	11	3adant1 1128	. . . . 5 ⊢ (((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ₀) ∧ (𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) ∧ (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁)) → (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)))
13	12	adantr 480	. . . 4 ⊢ ((((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ₀) ∧ (𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) ∧ (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)))
14		simpr 484	. . . . . . 7 ⊢ ((𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) → (♯‘(1^st ‘𝐴)) = 𝑁)
15	14	eqcomd 2744	. . . . . 6 ⊢ ((𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) → 𝑁 = (♯‘(1^st ‘𝐴)))
16	15	3ad2ant2 1132	. . . . 5 ⊢ (((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ₀) ∧ (𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) ∧ (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁)) → 𝑁 = (♯‘(1^st ‘𝐴)))
17	16	adantr 480	. . . 4 ⊢ ((((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ₀) ∧ (𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) ∧ (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → 𝑁 = (♯‘(1^st ‘𝐴)))
18		uspgr2wlkeq 27915	. . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1^st ‘𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (♯‘(1^st ‘𝐵)) ∧ ∀𝑖 ∈ (0...𝑁)((2^nd ‘𝐴)‘𝑖) = ((2^nd ‘𝐵)‘𝑖))))
19	8, 13, 17, 18	syl3anc 1369	. . 3 ⊢ ((((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ₀) ∧ (𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) ∧ (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → (𝐴 = 𝐵 ↔ (𝑁 = (♯‘(1^st ‘𝐵)) ∧ ∀𝑖 ∈ (0...𝑁)((2^nd ‘𝐴)‘𝑖) = ((2^nd ‘𝐵)‘𝑖))))
20	4, 7, 19	mpbir2and 709	. 2 ⊢ ((((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ₀) ∧ (𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) ∧ (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → 𝐴 = 𝐵)
21	20	ex 412	1 ⊢ (((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ₀) ∧ (𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = 𝑁) ∧ (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = 𝑁)) → ((2^nd ‘𝐴) = (2^nd ‘𝐵) → 𝐴 = 𝐵))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ∀wral 3063 ‘cfv 6418 (class class class)co 7255 1^st c1st 7802 2^nd c2nd 7803 0cc0 10802 ℕ₀cn0 12163 ...cfz 13168 ♯chash 13972 USPGraphcuspgr 27421 Walkscwlks 27866

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-ifp 1060 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-2o 8268 df-oadd 8271 df-er 8456 df-map 8575 df-pm 8576 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-dju 9590 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-n0 12164 df-xnn0 12236 df-z 12250 df-uz 12512 df-fz 13169 df-fzo 13312 df-hash 13973 df-word 14146 df-edg 27321 df-uhgr 27331 df-upgr 27355 df-uspgr 27423 df-wlks 27869

This theorem is referenced by: uspgr2wlkeqi 27917

W3C validator