upgrimpthslem2 - Mathbox for Alexander van der Vekens

	Mathbox for Alexander van der Vekens		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > upgrimpthslem2		Structured version Visualization version GIF version

Theorem upgrimpthslem2 48413

Description: Lemma 2 for upgrimpths 48414. (Contributed by AV, 31-Oct-2025.)

**Hypotheses**
Ref	Expression
upgrimwlk.i	⊢ 𝐼 = (iEdg‘𝐺)
upgrimwlk.j	⊢ 𝐽 = (iEdg‘𝐻)
upgrimwlk.g	⊢ (𝜑 → 𝐺 ∈ USPGraph)
upgrimwlk.h	⊢ (𝜑 → 𝐻 ∈ USPGraph)
upgrimwlk.n	⊢ (𝜑 → 𝑁 ∈ (𝐺 GraphIso 𝐻))
upgrimwlk.e	⊢ 𝐸 = (𝑥 ∈ dom 𝐹 ↦ (^◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥)))))
upgrimpths.p	⊢ (𝜑 → 𝐹(Paths‘𝐺)𝑃)

**Assertion**
Ref	Expression
upgrimpthslem2	⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → (¬ ((𝑁 ∘ 𝑃)‘𝑋) = ((𝑁 ∘ 𝑃)‘0) ∧ ¬ ((𝑁 ∘ 𝑃)‘𝑋) = ((𝑁 ∘ 𝑃)‘(♯‘𝐹))))

Distinct variable groups: 𝑥,𝐹 𝑥,𝐺 𝑥,𝐼 𝑥,𝐽 𝑥,𝑃 𝜑,𝑥 Allowed substitution hints: 𝐸(𝑥) 𝐻(𝑥) 𝑁(𝑥) 𝑋(𝑥)

**Proof of Theorem upgrimpthslem2**
Step	Hyp	Ref	Expression
1		upgrimwlk.n	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (𝐺 GraphIso 𝐻))
2		eqid 2741	. . . . . . 7 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
3		eqid 2741	. . . . . . 7 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻)
4	2, 3	grimf1o 48389	. . . . . 6 ⊢ (𝑁 ∈ (𝐺 GraphIso 𝐻) → 𝑁:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻))
5		f1of1 6770	. . . . . 6 ⊢ (𝑁:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) → 𝑁:(Vtx‘𝐺)–1-1→(Vtx‘𝐻))
6	1, 4, 5	3syl 18	. . . . 5 ⊢ (𝜑 → 𝑁:(Vtx‘𝐺)–1-1→(Vtx‘𝐻))
7	6	adantr 482	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → 𝑁:(Vtx‘𝐺)–1-1→(Vtx‘𝐻))
8		upgrimpths.p	. . . . . 6 ⊢ (𝜑 → 𝐹(Paths‘𝐺)𝑃)
9		pthiswlk 29815	. . . . . 6 ⊢ (𝐹(Paths‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃)
10	2	wlkp 29707	. . . . . . . . 9 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))
11	10	adantr 482	. . . . . . . 8 ⊢ ((𝐹(Walks‘𝐺)𝑃 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))
12		fzo0ss1 13639	. . . . . . . . . . 11 ⊢ (1..^(♯‘𝐹)) ⊆ (0..^(♯‘𝐹))
13		fzossfz 13628	. . . . . . . . . . 11 ⊢ (0..^(♯‘𝐹)) ⊆ (0...(♯‘𝐹))
14	12, 13	sstri 3926	. . . . . . . . . 10 ⊢ (1..^(♯‘𝐹)) ⊆ (0...(♯‘𝐹))
15	14	sseli 3913	. . . . . . . . 9 ⊢ (𝑋 ∈ (1..^(♯‘𝐹)) → 𝑋 ∈ (0...(♯‘𝐹)))
16	15	adantl 483	. . . . . . . 8 ⊢ ((𝐹(Walks‘𝐺)𝑃 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → 𝑋 ∈ (0...(♯‘𝐹)))
17	11, 16	ffvelcdmd 7030	. . . . . . 7 ⊢ ((𝐹(Walks‘𝐺)𝑃 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → (𝑃‘𝑋) ∈ (Vtx‘𝐺))
18	17	ex 414	. . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → (𝑋 ∈ (1..^(♯‘𝐹)) → (𝑃‘𝑋) ∈ (Vtx‘𝐺)))
19	8, 9, 18	3syl 18	. . . . 5 ⊢ (𝜑 → (𝑋 ∈ (1..^(♯‘𝐹)) → (𝑃‘𝑋) ∈ (Vtx‘𝐺)))
20	19	imp 408	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → (𝑃‘𝑋) ∈ (Vtx‘𝐺))
21		wlkcl 29706	. . . . . . . 8 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝐹) ∈ ℕ₀)
22		0elfz 13573	. . . . . . . 8 ⊢ ((♯‘𝐹) ∈ ℕ₀ → 0 ∈ (0...(♯‘𝐹)))
23	21, 22	syl 17	. . . . . . 7 ⊢ (𝐹(Walks‘𝐺)𝑃 → 0 ∈ (0...(♯‘𝐹)))
24	10, 23	ffvelcdmd 7030	. . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → (𝑃‘0) ∈ (Vtx‘𝐺))
25	8, 9, 24	3syl 18	. . . . 5 ⊢ (𝜑 → (𝑃‘0) ∈ (Vtx‘𝐺))
26	25	adantr 482	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → (𝑃‘0) ∈ (Vtx‘𝐺))
27	8	adantr 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → 𝐹(Paths‘𝐺)𝑃)
28		simpr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → 𝑋 ∈ (1..^(♯‘𝐹)))
29	8, 9, 21	3syl 18	. . . . . . 7 ⊢ (𝜑 → (♯‘𝐹) ∈ ℕ₀)
30	29, 22	syl 17	. . . . . 6 ⊢ (𝜑 → 0 ∈ (0...(♯‘𝐹)))
31	30	adantr 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → 0 ∈ (0...(♯‘𝐹)))
32		elfzole1 13617	. . . . . . 7 ⊢ (𝑋 ∈ (1..^(♯‘𝐹)) → 1 ≤ 𝑋)
33		elfzoelz 13608	. . . . . . . . 9 ⊢ (𝑋 ∈ (1..^(♯‘𝐹)) → 𝑋 ∈ ℤ)
34		zgt0ge1 12578	. . . . . . . . 9 ⊢ (𝑋 ∈ ℤ → (0 < 𝑋 ↔ 1 ≤ 𝑋))
35	33, 34	syl 17	. . . . . . . 8 ⊢ (𝑋 ∈ (1..^(♯‘𝐹)) → (0 < 𝑋 ↔ 1 ≤ 𝑋))
36		simpr 486	. . . . . . . . . 10 ⊢ ((𝑋 ∈ (1..^(♯‘𝐹)) ∧ 0 < 𝑋) → 0 < 𝑋)
37	36	gt0ne0d 11709	. . . . . . . . 9 ⊢ ((𝑋 ∈ (1..^(♯‘𝐹)) ∧ 0 < 𝑋) → 𝑋 ≠ 0)
38	37	ex 414	. . . . . . . 8 ⊢ (𝑋 ∈ (1..^(♯‘𝐹)) → (0 < 𝑋 → 𝑋 ≠ 0))
39	35, 38	sylbird 262	. . . . . . 7 ⊢ (𝑋 ∈ (1..^(♯‘𝐹)) → (1 ≤ 𝑋 → 𝑋 ≠ 0))
40	32, 39	mpd 15	. . . . . 6 ⊢ (𝑋 ∈ (1..^(♯‘𝐹)) → 𝑋 ≠ 0)
41	40	adantl 483	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → 𝑋 ≠ 0)
42		pthdivtx 29817	. . . . 5 ⊢ ((𝐹(Paths‘𝐺)𝑃 ∧ (𝑋 ∈ (1..^(♯‘𝐹)) ∧ 0 ∈ (0...(♯‘𝐹)) ∧ 𝑋 ≠ 0)) → (𝑃‘𝑋) ≠ (𝑃‘0))
43	27, 28, 31, 41, 42	syl13anc 1381	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → (𝑃‘𝑋) ≠ (𝑃‘0))
44		dff14i 7207	. . . 4 ⊢ ((𝑁:(Vtx‘𝐺)–1-1→(Vtx‘𝐻) ∧ ((𝑃‘𝑋) ∈ (Vtx‘𝐺) ∧ (𝑃‘0) ∈ (Vtx‘𝐺) ∧ (𝑃‘𝑋) ≠ (𝑃‘0))) → (𝑁‘(𝑃‘𝑋)) ≠ (𝑁‘(𝑃‘0)))
45	7, 20, 26, 43, 44	syl13anc 1381	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → (𝑁‘(𝑃‘𝑋)) ≠ (𝑁‘(𝑃‘0)))
46		nn0fz0 13574	. . . . . . . 8 ⊢ ((♯‘𝐹) ∈ ℕ₀ ↔ (♯‘𝐹) ∈ (0...(♯‘𝐹)))
47	21, 46	sylib 220	. . . . . . 7 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝐹) ∈ (0...(♯‘𝐹)))
48	10, 47	ffvelcdmd 7030	. . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → (𝑃‘(♯‘𝐹)) ∈ (Vtx‘𝐺))
49	8, 9, 48	3syl 18	. . . . 5 ⊢ (𝜑 → (𝑃‘(♯‘𝐹)) ∈ (Vtx‘𝐺))
50	49	adantr 482	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → (𝑃‘(♯‘𝐹)) ∈ (Vtx‘𝐺))
51	29, 46	sylib 220	. . . . . 6 ⊢ (𝜑 → (♯‘𝐹) ∈ (0...(♯‘𝐹)))
52	51	adantr 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → (♯‘𝐹) ∈ (0...(♯‘𝐹)))
53	33	zred 12628	. . . . . . 7 ⊢ (𝑋 ∈ (1..^(♯‘𝐹)) → 𝑋 ∈ ℝ)
54		elfzolt2 13618	. . . . . . 7 ⊢ (𝑋 ∈ (1..^(♯‘𝐹)) → 𝑋 < (♯‘𝐹))
55	53, 54	ltned 11277	. . . . . 6 ⊢ (𝑋 ∈ (1..^(♯‘𝐹)) → 𝑋 ≠ (♯‘𝐹))
56	55	adantl 483	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → 𝑋 ≠ (♯‘𝐹))
57		pthdivtx 29817	. . . . 5 ⊢ ((𝐹(Paths‘𝐺)𝑃 ∧ (𝑋 ∈ (1..^(♯‘𝐹)) ∧ (♯‘𝐹) ∈ (0...(♯‘𝐹)) ∧ 𝑋 ≠ (♯‘𝐹))) → (𝑃‘𝑋) ≠ (𝑃‘(♯‘𝐹)))
58	27, 28, 52, 56, 57	syl13anc 1381	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → (𝑃‘𝑋) ≠ (𝑃‘(♯‘𝐹)))
59		dff14i 7207	. . . 4 ⊢ ((𝑁:(Vtx‘𝐺)–1-1→(Vtx‘𝐻) ∧ ((𝑃‘𝑋) ∈ (Vtx‘𝐺) ∧ (𝑃‘(♯‘𝐹)) ∈ (Vtx‘𝐺) ∧ (𝑃‘𝑋) ≠ (𝑃‘(♯‘𝐹)))) → (𝑁‘(𝑃‘𝑋)) ≠ (𝑁‘(𝑃‘(♯‘𝐹))))
60	7, 20, 50, 58, 59	syl13anc 1381	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → (𝑁‘(𝑃‘𝑋)) ≠ (𝑁‘(𝑃‘(♯‘𝐹))))
61	8, 9, 10	3syl 18	. . . . . . 7 ⊢ (𝜑 → 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))
62	61	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))
63	15	adantl 483	. . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → 𝑋 ∈ (0...(♯‘𝐹)))
64	62, 63	fvco3d 6932	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → ((𝑁 ∘ 𝑃)‘𝑋) = (𝑁‘(𝑃‘𝑋)))
65	62, 31	fvco3d 6932	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → ((𝑁 ∘ 𝑃)‘0) = (𝑁‘(𝑃‘0)))
66	64, 65	neeq12d 2997	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → (((𝑁 ∘ 𝑃)‘𝑋) ≠ ((𝑁 ∘ 𝑃)‘0) ↔ (𝑁‘(𝑃‘𝑋)) ≠ (𝑁‘(𝑃‘0))))
67	62, 52	fvco3d 6932	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → ((𝑁 ∘ 𝑃)‘(♯‘𝐹)) = (𝑁‘(𝑃‘(♯‘𝐹))))
68	64, 67	neeq12d 2997	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → (((𝑁 ∘ 𝑃)‘𝑋) ≠ ((𝑁 ∘ 𝑃)‘(♯‘𝐹)) ↔ (𝑁‘(𝑃‘𝑋)) ≠ (𝑁‘(𝑃‘(♯‘𝐹)))))
69	66, 68	anbi12d 639	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → ((((𝑁 ∘ 𝑃)‘𝑋) ≠ ((𝑁 ∘ 𝑃)‘0) ∧ ((𝑁 ∘ 𝑃)‘𝑋) ≠ ((𝑁 ∘ 𝑃)‘(♯‘𝐹))) ↔ ((𝑁‘(𝑃‘𝑋)) ≠ (𝑁‘(𝑃‘0)) ∧ (𝑁‘(𝑃‘𝑋)) ≠ (𝑁‘(𝑃‘(♯‘𝐹))))))
70	45, 60, 69	mpbir2and 720	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → (((𝑁 ∘ 𝑃)‘𝑋) ≠ ((𝑁 ∘ 𝑃)‘0) ∧ ((𝑁 ∘ 𝑃)‘𝑋) ≠ ((𝑁 ∘ 𝑃)‘(♯‘𝐹))))
71		df-ne 2937	. . 3 ⊢ (((𝑁 ∘ 𝑃)‘𝑋) ≠ ((𝑁 ∘ 𝑃)‘0) ↔ ¬ ((𝑁 ∘ 𝑃)‘𝑋) = ((𝑁 ∘ 𝑃)‘0))
72		df-ne 2937	. . 3 ⊢ (((𝑁 ∘ 𝑃)‘𝑋) ≠ ((𝑁 ∘ 𝑃)‘(♯‘𝐹)) ↔ ¬ ((𝑁 ∘ 𝑃)‘𝑋) = ((𝑁 ∘ 𝑃)‘(♯‘𝐹)))
73	71, 72	anbi12i 635	. 2 ⊢ ((((𝑁 ∘ 𝑃)‘𝑋) ≠ ((𝑁 ∘ 𝑃)‘0) ∧ ((𝑁 ∘ 𝑃)‘𝑋) ≠ ((𝑁 ∘ 𝑃)‘(♯‘𝐹))) ↔ (¬ ((𝑁 ∘ 𝑃)‘𝑋) = ((𝑁 ∘ 𝑃)‘0) ∧ ¬ ((𝑁 ∘ 𝑃)‘𝑋) = ((𝑁 ∘ 𝑃)‘(♯‘𝐹))))
74	70, 73	sylib 220	1 ⊢ ((𝜑 ∧ 𝑋 ∈ (1..^(♯‘𝐹))) → (¬ ((𝑁 ∘ 𝑃)‘𝑋) = ((𝑁 ∘ 𝑃)‘0) ∧ ¬ ((𝑁 ∘ 𝑃)‘𝑋) = ((𝑁 ∘ 𝑃)‘(♯‘𝐹))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 397 = wceq 1548 ∈ wcel 2121 ≠ wne 2936 class class class wbr 5075 ↦ cmpt 5156 ^◡ccnv 5620 dom cdm 5621 “ cima 5624 ∘ ccom 5625 ⟶wf 6485 –1-1→wf1 6486 –1-1-onto→wf1o 6488 ‘cfv 6489 (class class class)co 7360 0cc0 11033 1c1 11034 < clt 11174 ≤ cle 11175 ℕ₀cn0 12432 ℤcz 12519 ...cfz 13456 ..^cfzo 13603 ♯chash 14287 Vtxcvtx 29087 iEdgciedg 29088 USPGraphcuspgr 29239 Walkscwlks 29687 Pathscpths 29800 GraphIso cgrim 48380

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5202 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110

This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-ifp 1070 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-int 4881 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-map 8769 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-card 9858 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-nn 12170 df-n0 12433 df-z 12520 df-uz 12784 df-fz 13457 df-fzo 13604 df-hash 14288 df-word 14471 df-wlks 29690 df-trls 29781 df-pths 29804 df-grim 48383

This theorem is referenced by: upgrimpths 48414

W3C validator