Theorem upgrimtrlslem2 49206

Description: Lemma 2 for upgrimtrls 49207. (Contributed by AV, 29-Oct-2025.)

Hypotheses

Ref	Expression
upgrimwlk.i	⊢ 𝐼 = (iEdg‘𝐺)
upgrimwlk.j	⊢ 𝐽 = (iEdg‘𝐻)
upgrimwlk.g	⊢ (𝜑 → 𝐺 ∈ USPGraph)
upgrimwlk.h	⊢ (𝜑 → 𝐻 ∈ USPGraph)
upgrimwlk.n	⊢ (𝜑 → 𝑁 ∈ (𝐺 GraphIso 𝐻))
upgrimwlk.e	⊢ 𝐸 = (𝑥 ∈ dom 𝐹 ↦ (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥)))))
upgrimtrls.t	⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃)

Assertion

Ref	Expression
upgrimtrlslem2	⊢ ((𝜑 ∧ (𝑥 ∈ dom 𝐹 ∧ 𝑦 ∈ dom 𝐹)) → ((◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥)))) = (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑦)))) → 𝑥 = 𝑦))

Distinct variable groups:   𝑥,𝐹   𝑥,𝐺   𝑥,𝐼   𝑥,𝐽   𝑥,𝑃   𝜑,𝑥

Allowed substitution hints:   𝜑(𝑦)   𝑃(𝑦)   𝐸(𝑥, 𝑦)   𝐹(𝑦)   𝐺(𝑦)   𝐻(𝑥, 𝑦)   𝐼(𝑦)   𝐽(𝑦)   𝑁(𝑥, 𝑦)

Proof of Theorem upgrimtrlslem2

Step	Hyp	Ref	Expression
1		upgrimwlk.h	. . . 4 ⊢ (𝜑 → 𝐻 ∈ USPGraph)
2		upgrimwlk.j	. . . . 5 ⊢ 𝐽 = (iEdg‘𝐻)
3	2	uspgrf1oedg 29781	. . . 4 ⊢ (𝐻 ∈ USPGraph → 𝐽:dom 𝐽⟶1-1onto(Edg‘𝐻))
4		f1of1 6842	. . . 4 ⊢ (𝐽:dom 𝐽⟶1-1onto(Edg‘𝐻) → 𝐽:dom 𝐽⟶1-1(Edg‘𝐻))
5	1, 3, 4	3syl 19	. . 3 ⊢ (𝜑 → 𝐽:dom 𝐽⟶1-1(Edg‘𝐻))
6		upgrimwlk.i	. . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺)
7		upgrimwlk.g	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ USPGraph)
8		upgrimwlk.n	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (𝐺 GraphIso 𝐻))
9		upgrimwlk.e	. . . . . 6 ⊢ 𝐸 = (𝑥 ∈ dom 𝐹 ↦ (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥)))))
10		upgrimtrls.t	. . . . . 6 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃)
11	6, 2, 7, 1, 8, 9, 10	upgrimtrlslem1 49205	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ dom 𝐹) → (𝑁 “ (𝐼‘(𝐹‘𝑥))) ∈ (Edg‘𝐻))
12		edgval 29654	. . . . . 6 ⊢ (Edg‘𝐻) = ran (iEdg‘𝐻)
13	2	eqcomi 2772	. . . . . . 7 ⊢ (iEdg‘𝐻) = 𝐽
14	13	rneqi 5925	. . . . . 6 ⊢ ran (iEdg‘𝐻) = ran 𝐽
15	12, 14	eqtri 2786	. . . . 5 ⊢ (Edg‘𝐻) = ran 𝐽
16	11, 15	eleqtrdi 2874	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ dom 𝐹) → (𝑁 “ (𝐼‘(𝐹‘𝑥))) ∈ ran 𝐽)
17	6, 2, 7, 1, 8, 9, 10	upgrimtrlslem1 49205	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ dom 𝐹) → (𝑁 “ (𝐼‘(𝐹‘𝑦))) ∈ (Edg‘𝐻))
18	17, 15	eleqtrdi 2874	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ dom 𝐹) → (𝑁 “ (𝐼‘(𝐹‘𝑦))) ∈ ran 𝐽)
19	16, 18	anim12dan 631	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ dom 𝐹 ∧ 𝑦 ∈ dom 𝐹)) → ((𝑁 “ (𝐼‘(𝐹‘𝑥))) ∈ ran 𝐽 ∧ (𝑁 “ (𝐼‘(𝐹‘𝑦))) ∈ ran 𝐽))
20		f1ocnvfvrneq 7314	. . 3 ⊢ ((𝐽:dom 𝐽⟶1-1(Edg‘𝐻) ∧ ((𝑁 “ (𝐼‘(𝐹‘𝑥))) ∈ ran 𝐽 ∧ (𝑁 “ (𝐼‘(𝐹‘𝑦))) ∈ ran 𝐽)) → ((◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥)))) = (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑦)))) → (𝑁 “ (𝐼‘(𝐹‘𝑥))) = (𝑁 “ (𝐼‘(𝐹‘𝑦)))))
21	5, 19, 20	syl2an2r 698	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ dom 𝐹 ∧ 𝑦 ∈ dom 𝐹)) → ((◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥)))) = (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑦)))) → (𝑁 “ (𝐼‘(𝐹‘𝑥))) = (𝑁 “ (𝐼‘(𝐹‘𝑦)))))
22		eqid 2763	. . . . . 6 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
23		eqid 2763	. . . . . 6 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻)
24	22, 23	grimf1o 49185	. . . . 5 ⊢ (𝑁 ∈ (𝐺 GraphIso 𝐻) → 𝑁:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻))
25		f1of1 6842	. . . . 5 ⊢ (𝑁:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) → 𝑁:(Vtx‘𝐺)⟶1-1(Vtx‘𝐻))
26	8, 24, 25	3syl 19	. . . 4 ⊢ (𝜑 → 𝑁:(Vtx‘𝐺)⟶1-1(Vtx‘𝐻))
27		uspgruhgr 29792	. . . . . . 7 ⊢ (𝐺 ∈ USPGraph → 𝐺 ∈ UHGraph)
28	7, 27	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ UHGraph)
29		trliswlk 30307	. . . . . . . 8 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃)
30	6	wlkf 30222	. . . . . . . . 9 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼)
31		wrdf 14687	. . . . . . . . 9 ⊢ (𝐹 ∈ Word dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼)
32		id 23	. . . . . . . . . 10 ⊢ (𝐹:(0..^(♯‘𝐹))⟶dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼)
33	32	ffdmd 6759	. . . . . . . . 9 ⊢ (𝐹:(0..^(♯‘𝐹))⟶dom 𝐼 → 𝐹:dom 𝐹⟶dom 𝐼)
34	30, 31, 33	3syl 19	. . . . . . . 8 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹:dom 𝐹⟶dom 𝐼)
35	10, 29, 34	3syl 19	. . . . . . 7 ⊢ (𝜑 → 𝐹:dom 𝐹⟶dom 𝐼)
36	35	ffvelcdmda 7105	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ dom 𝐼)
37	22, 6	uhgrss 29669	. . . . . 6 ⊢ ((𝐺 ∈ UHGraph ∧ (𝐹‘𝑥) ∈ dom 𝐼) → (𝐼‘(𝐹‘𝑥)) ⊆ (Vtx‘𝐺))
38	28, 36, 37	syl2an2r 698	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ dom 𝐹) → (𝐼‘(𝐹‘𝑥)) ⊆ (Vtx‘𝐺))
39	35	ffvelcdmda 7105	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ dom 𝐹) → (𝐹‘𝑦) ∈ dom 𝐼)
40	22, 6	uhgrss 29669	. . . . . 6 ⊢ ((𝐺 ∈ UHGraph ∧ (𝐹‘𝑦) ∈ dom 𝐼) → (𝐼‘(𝐹‘𝑦)) ⊆ (Vtx‘𝐺))
41	28, 39, 40	syl2an2r 698	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ dom 𝐹) → (𝐼‘(𝐹‘𝑦)) ⊆ (Vtx‘𝐺))
42	38, 41	anim12dan 631	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ dom 𝐹 ∧ 𝑦 ∈ dom 𝐹)) → ((𝐼‘(𝐹‘𝑥)) ⊆ (Vtx‘𝐺) ∧ (𝐼‘(𝐹‘𝑦)) ⊆ (Vtx‘𝐺)))
43		f1imaeq 7289	. . . 4 ⊢ ((𝑁:(Vtx‘𝐺)⟶1-1(Vtx‘𝐻) ∧ ((𝐼‘(𝐹‘𝑥)) ⊆ (Vtx‘𝐺) ∧ (𝐼‘(𝐹‘𝑦)) ⊆ (Vtx‘𝐺))) → ((𝑁 “ (𝐼‘(𝐹‘𝑥))) = (𝑁 “ (𝐼‘(𝐹‘𝑦))) ↔ (𝐼‘(𝐹‘𝑥)) = (𝐼‘(𝐹‘𝑦))))
44	26, 42, 43	syl2an2r 698	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ dom 𝐹 ∧ 𝑦 ∈ dom 𝐹)) → ((𝑁 “ (𝐼‘(𝐹‘𝑥))) = (𝑁 “ (𝐼‘(𝐹‘𝑦))) ↔ (𝐼‘(𝐹‘𝑥)) = (𝐼‘(𝐹‘𝑦))))
45	6	uspgrf1oedg 29781	. . . . . 6 ⊢ (𝐺 ∈ USPGraph → 𝐼:dom 𝐼⟶1-1onto(Edg‘𝐺))
46		f1of1 6842	. . . . . 6 ⊢ (𝐼:dom 𝐼⟶1-1onto(Edg‘𝐺) → 𝐼:dom 𝐼⟶1-1(Edg‘𝐺))
47	7, 45, 46	3syl 19	. . . . 5 ⊢ (𝜑 → 𝐼:dom 𝐼⟶1-1(Edg‘𝐺))
48	6	trlf1 30308	. . . . . 6 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))⟶1-1dom 𝐼)
49		f1f 6797	. . . . . . . 8 ⊢ (𝐹:(0..^(♯‘𝐹))⟶1-1dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼)
50		fdm 6738	. . . . . . . . 9 ⊢ (𝐹:(0..^(♯‘𝐹))⟶dom 𝐼 → dom 𝐹 = (0..^(♯‘𝐹)))
51	50	eqcomd 2769	. . . . . . . 8 ⊢ (𝐹:(0..^(♯‘𝐹))⟶dom 𝐼 → (0..^(♯‘𝐹)) = dom 𝐹)
52	49, 51	syl 18	. . . . . . 7 ⊢ (𝐹:(0..^(♯‘𝐹))⟶1-1dom 𝐼 → (0..^(♯‘𝐹)) = dom 𝐹)
53		f1eq2 6793	. . . . . . . 8 ⊢ ((0..^(♯‘𝐹)) = dom 𝐹 → (𝐹:(0..^(♯‘𝐹))⟶1-1dom 𝐼 ↔ 𝐹:dom 𝐹⟶1-1dom 𝐼))
54	53	biimpcd 252	. . . . . . 7 ⊢ (𝐹:(0..^(♯‘𝐹))⟶1-1dom 𝐼 → ((0..^(♯‘𝐹)) = dom 𝐹 → 𝐹:dom 𝐹⟶1-1dom 𝐼))
55	52, 54	mpd 16	. . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))⟶1-1dom 𝐼 → 𝐹:dom 𝐹⟶1-1dom 𝐼)
56	10, 48, 55	3syl 19	. . . . 5 ⊢ (𝜑 → 𝐹:dom 𝐹⟶1-1dom 𝐼)
57	47, 56	jca 521	. . . 4 ⊢ (𝜑 → (𝐼:dom 𝐼⟶1-1(Edg‘𝐺) ∧ 𝐹:dom 𝐹⟶1-1dom 𝐼))
58		f1cofveqaeq 7281	. . . 4 ⊢ (((𝐼:dom 𝐼⟶1-1(Edg‘𝐺) ∧ 𝐹:dom 𝐹⟶1-1dom 𝐼) ∧ (𝑥 ∈ dom 𝐹 ∧ 𝑦 ∈ dom 𝐹)) → ((𝐼‘(𝐹‘𝑥)) = (𝐼‘(𝐹‘𝑦)) → 𝑥 = 𝑦))
59	57, 58	sylan 592	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ dom 𝐹 ∧ 𝑦 ∈ dom 𝐹)) → ((𝐼‘(𝐹‘𝑥)) = (𝐼‘(𝐹‘𝑦)) → 𝑥 = 𝑦))
60	44, 59	sylbid 243	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ dom 𝐹 ∧ 𝑦 ∈ dom 𝐹)) → ((𝑁 “ (𝐼‘(𝐹‘𝑥))) = (𝑁 “ (𝐼‘(𝐹‘𝑦))) → 𝑥 = 𝑦))
61	21, 60	syld 48	1 ⊢ ((𝜑 ∧ (𝑥 ∈ dom 𝐹 ∧ 𝑦 ∈ dom 𝐹)) → ((◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥)))) = (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑦)))) → 𝑥 = 𝑦))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   class class class wbr 5106   ↦ cmpt 5189  ^◡ccnv 5654  dom cdm 5655  ran crn 5656   “ cima 5658  ⟶wf 6551  ⟶1-1wf1 6552  ⟶1-1ontowf1o 6554  ‘cfv 6555  (class class class)co 7440  0cc0 11224  ..^cfzo 13812  ♯chash 14498  Word cword 14682  Vtxcvtx 29601  iEdgciedg 29602  Edgcedg 29652  UHGraphcuhgr 29661  USPGraphcuspgr 29756  Walkscwlks 30204  Trailsctrls 30300   GraphIso cgrim 49176

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-cnex 11280  ax-resscn 11281  ax-1cn 11282  ax-icn 11283  ax-addcl 11284  ax-addrcl 11285  ax-mulcl 11286  ax-mulrcl 11287  ax-mulcom 11288  ax-addass 11289  ax-mulass 11290  ax-distr 11291  ax-i2m1 11292  ax-1ne0 11293  ax-1rid 11294  ax-rnegex 11295  ax-rrecex 11296  ax-cnre 11297  ax-pre-lttri 11298  ax-pre-lttrn 11299  ax-pre-ltadd 11300  ax-pre-mulgt0 11301

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ifp 1079  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-om 7899  df-1st 8022  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-1o 8501  df-er 8742  df-map 8874  df-en 8999  df-dom 9000  df-sdom 9001  df-fin 9002  df-card 10044  df-pnf 11369  df-mnf 11370  df-xr 11371  df-ltxr 11372  df-le 11373  df-sub 11567  df-neg 11568  df-nn 12360  df-n0 12631  df-z 12718  df-uz 12990  df-fz 13664  df-fzo 13813  df-hash 14499  df-word 14683  df-edg 29653  df-uhgr 29663  df-upgr 29687  df-uspgr 29758  df-wlks 30207  df-trls 30302  df-grim 49179

This theorem is used by:  upgrimtrls  49207