uspgr2wlkeqi - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > uspgr2wlkeqi		GIF version

Theorem uspgr2wlkeqi 16608

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 AV, 6-May-2021.)

**Assertion**
Ref	Expression
uspgr2wlkeqi	⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → 𝐴 = 𝐵)

**Proof of Theorem uspgr2wlkeqi**
Step	Hyp	Ref	Expression
1		wlkcprim 16591	. . . . 5 ⊢ (𝐴 ∈ (Walks‘𝐺) → (1^st ‘𝐴)(Walks‘𝐺)(2^nd ‘𝐴))
2		wlkcprim 16591	. . . . 5 ⊢ (𝐵 ∈ (Walks‘𝐺) → (1^st ‘𝐵)(Walks‘𝐺)(2^nd ‘𝐵))
3		wlkcl 16573	. . . . . 6 ⊢ ((1^st ‘𝐴)(Walks‘𝐺)(2^nd ‘𝐴) → (♯‘(1^st ‘𝐴)) ∈ ℕ₀)
4		fveq2 5695	. . . . . . . . . . . 12 ⊢ ((2^nd ‘𝐴) = (2^nd ‘𝐵) → (♯‘(2^nd ‘𝐴)) = (♯‘(2^nd ‘𝐵)))
5	4	oveq1d 6100	. . . . . . . . . . 11 ⊢ ((2^nd ‘𝐴) = (2^nd ‘𝐵) → ((♯‘(2^nd ‘𝐴)) − 1) = ((♯‘(2^nd ‘𝐵)) − 1))
6	5	eqcomd 2244	. . . . . . . . . 10 ⊢ ((2^nd ‘𝐴) = (2^nd ‘𝐵) → ((♯‘(2^nd ‘𝐵)) − 1) = ((♯‘(2^nd ‘𝐴)) − 1))
7	6	adantl 277	. . . . . . . . 9 ⊢ ((((1^st ‘𝐴)(Walks‘𝐺)(2^nd ‘𝐴) ∧ (1^st ‘𝐵)(Walks‘𝐺)(2^nd ‘𝐵)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → ((♯‘(2^nd ‘𝐵)) − 1) = ((♯‘(2^nd ‘𝐴)) − 1))
8		wlklenvm1 16582	. . . . . . . . . . 11 ⊢ ((1^st ‘𝐵)(Walks‘𝐺)(2^nd ‘𝐵) → (♯‘(1^st ‘𝐵)) = ((♯‘(2^nd ‘𝐵)) − 1))
9		wlklenvm1 16582	. . . . . . . . . . 11 ⊢ ((1^st ‘𝐴)(Walks‘𝐺)(2^nd ‘𝐴) → (♯‘(1^st ‘𝐴)) = ((♯‘(2^nd ‘𝐴)) − 1))
10	8, 9	eqeqan12rd 2255	. . . . . . . . . 10 ⊢ (((1^st ‘𝐴)(Walks‘𝐺)(2^nd ‘𝐴) ∧ (1^st ‘𝐵)(Walks‘𝐺)(2^nd ‘𝐵)) → ((♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴)) ↔ ((♯‘(2^nd ‘𝐵)) − 1) = ((♯‘(2^nd ‘𝐴)) − 1)))
11	10	adantr 276	. . . . . . . . 9 ⊢ ((((1^st ‘𝐴)(Walks‘𝐺)(2^nd ‘𝐴) ∧ (1^st ‘𝐵)(Walks‘𝐺)(2^nd ‘𝐵)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → ((♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴)) ↔ ((♯‘(2^nd ‘𝐵)) − 1) = ((♯‘(2^nd ‘𝐴)) − 1)))
12	7, 11	mpbird 167	. . . . . . . 8 ⊢ ((((1^st ‘𝐴)(Walks‘𝐺)(2^nd ‘𝐴) ∧ (1^st ‘𝐵)(Walks‘𝐺)(2^nd ‘𝐵)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴)))
13	12	anim2i 342	. . . . . . 7 ⊢ (((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (((1^st ‘𝐴)(Walks‘𝐺)(2^nd ‘𝐴) ∧ (1^st ‘𝐵)(Walks‘𝐺)(2^nd ‘𝐵)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵))) → ((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴))))
14	13	exp44 373	. . . . . 6 ⊢ ((♯‘(1^st ‘𝐴)) ∈ ℕ₀ → ((1^st ‘𝐴)(Walks‘𝐺)(2^nd ‘𝐴) → ((1^st ‘𝐵)(Walks‘𝐺)(2^nd ‘𝐵) → ((2^nd ‘𝐴) = (2^nd ‘𝐵) → ((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴)))))))
15	3, 14	mpcom 36	. . . . 5 ⊢ ((1^st ‘𝐴)(Walks‘𝐺)(2^nd ‘𝐴) → ((1^st ‘𝐵)(Walks‘𝐺)(2^nd ‘𝐵) → ((2^nd ‘𝐴) = (2^nd ‘𝐵) → ((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴))))))
16	1, 2, 15	syl2im 38	. . . 4 ⊢ (𝐴 ∈ (Walks‘𝐺) → (𝐵 ∈ (Walks‘𝐺) → ((2^nd ‘𝐴) = (2^nd ‘𝐵) → ((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴))))))
17	16	imp31 256	. . 3 ⊢ (((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → ((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴))))
18	17	3adant1 1046	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → ((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴))))
19		simpl 109	. . . . . . 7 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺))) → 𝐺 ∈ USPGraph)
20		simpl 109	. . . . . . 7 ⊢ (((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴))) → (♯‘(1^st ‘𝐴)) ∈ ℕ₀)
21	19, 20	anim12i 338	. . . . . 6 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺))) ∧ ((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴)))) → (𝐺 ∈ USPGraph ∧ (♯‘(1^st ‘𝐴)) ∈ ℕ₀))
22		simpl 109	. . . . . . . 8 ⊢ ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → 𝐴 ∈ (Walks‘𝐺))
23	22	adantl 277	. . . . . . 7 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺))) → 𝐴 ∈ (Walks‘𝐺))
24		eqidd 2239	. . . . . . 7 ⊢ (((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴))) → (♯‘(1^st ‘𝐴)) = (♯‘(1^st ‘𝐴)))
25	23, 24	anim12i 338	. . . . . 6 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺))) ∧ ((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴)))) → (𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = (♯‘(1^st ‘𝐴))))
26		simpr 110	. . . . . . . 8 ⊢ ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → 𝐵 ∈ (Walks‘𝐺))
27	26	adantl 277	. . . . . . 7 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺))) → 𝐵 ∈ (Walks‘𝐺))
28		simpr 110	. . . . . . 7 ⊢ (((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴))) → (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴)))
29	27, 28	anim12i 338	. . . . . 6 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺))) ∧ ((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴)))) → (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴))))
30		uspgr2wlkeq2 16607	. . . . . 6 ⊢ (((𝐺 ∈ USPGraph ∧ (♯‘(1^st ‘𝐴)) ∈ ℕ₀) ∧ (𝐴 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐴)) = (♯‘(1^st ‘𝐴))) ∧ (𝐵 ∈ (Walks‘𝐺) ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴)))) → ((2^nd ‘𝐴) = (2^nd ‘𝐵) → 𝐴 = 𝐵))
31	21, 25, 29, 30	syl3anc 1278	. . . . 5 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺))) ∧ ((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴)))) → ((2^nd ‘𝐴) = (2^nd ‘𝐵) → 𝐴 = 𝐵))
32	31	ex 115	. . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺))) → (((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴))) → ((2^nd ‘𝐴) = (2^nd ‘𝐵) → 𝐴 = 𝐵)))
33	32	com23 78	. . 3 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺))) → ((2^nd ‘𝐴) = (2^nd ‘𝐵) → (((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴))) → 𝐴 = 𝐵)))
34	33	3impia 1231	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → (((♯‘(1^st ‘𝐴)) ∈ ℕ₀ ∧ (♯‘(1^st ‘𝐵)) = (♯‘(1^st ‘𝐴))) → 𝐴 = 𝐵))
35	18, 34	mpd 13	1 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) → 𝐴 = 𝐵)

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 class class class wbr 4130 ‘cfv 5377 (class class class)co 6085 1^st c1st 6372 2^nd c2nd 6373 1c1 8180 − cmin 8497 ℕ₀cn0 9563 ♯chash 11214 USPGraphcuspgr 16394 Walkscwlks 16558

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 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295

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 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-frec 6662 df-1o 6687 df-2o 6688 df-er 6807 df-map 6924 df-en 7023 df-dom 7024 df-fin 7025 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-inn 9305 df-2 9363 df-3 9364 df-4 9365 df-5 9366 df-6 9367 df-7 9368 df-8 9369 df-9 9370 df-n0 9564 df-z 9645 df-dec 9778 df-uz 9922 df-fz 10412 df-fzo 10550 df-ihash 11215 df-word 11305 df-ndx 13355 df-slot 13356 df-base 13358 df-edgf 16246 df-vtx 16255 df-iedg 16256 df-edg 16299 df-uhgrm 16310 df-upgren 16334 df-uspgren 16396 df-wlks 16559

This theorem is used by: (None)

W3C validator