Theorem trlsegvdeglem2 30255

Description: Lemma for trlsegvdeg 30261. (Contributed by AV, 20-Feb-2021.)

Hypotheses

Ref	Expression
trlsegvdeg.v	⊢ 𝑉 = (Vtx‘𝐺)
trlsegvdeg.i	⊢ 𝐼 = (iEdg‘𝐺)
trlsegvdeg.f	⊢ (𝜑 → Fun 𝐼)
trlsegvdeg.n	⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹)))
trlsegvdeg.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)
trlsegvdeg.w	⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃)
trlsegvdeg.vx	⊢ (𝜑 → (Vtx‘𝑋) = 𝑉)
trlsegvdeg.vy	⊢ (𝜑 → (Vtx‘𝑌) = 𝑉)
trlsegvdeg.vz	⊢ (𝜑 → (Vtx‘𝑍) = 𝑉)
trlsegvdeg.ix	⊢ (𝜑 → (iEdg‘𝑋) = (𝐼 ↾ (𝐹 “ (0..^𝑁))))
trlsegvdeg.iy	⊢ (𝜑 → (iEdg‘𝑌) = {⟨(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))⟩})
trlsegvdeg.iz	⊢ (𝜑 → (iEdg‘𝑍) = (𝐼 ↾ (𝐹 “ (0...𝑁))))

Assertion

Ref	Expression
trlsegvdeglem2	⊢ (𝜑 → Fun (iEdg‘𝑋))

Proof of Theorem trlsegvdeglem2

Step	Hyp	Ref	Expression
1		trlsegvdeg.f	. . 3 ⊢ (𝜑 → Fun 𝐼)
2	1	funresd 6623	. 2 ⊢ (𝜑 → Fun (𝐼 ↾ (𝐹 “ (0..^𝑁))))
3		trlsegvdeg.ix	. . 3 ⊢ (𝜑 → (iEdg‘𝑋) = (𝐼 ↾ (𝐹 “ (0..^𝑁))))
4	3	funeqd 6602	. 2 ⊢ (𝜑 → (Fun (iEdg‘𝑋) ↔ Fun (𝐼 ↾ (𝐹 “ (0..^𝑁)))))
5	2, 4	mpbird 257	1 ⊢ (𝜑 → Fun (iEdg‘𝑋))

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2108  {csn 4648  ⟨cop 4654   class class class wbr 5166   ↾ cres 5702   “ cima 5703  Fun wfun 6569  ‘cfv 6575  (class class class)co 7450  0cc0 11186  ...cfz 13569  ..^cfzo 13713  ♯chash 14381  Vtxcvtx 29033  iEdgciedg 29034  Trailsctrls 29728

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-v 3490  df-in 3983  df-ss 3993  df-br 5167  df-opab 5229  df-rel 5707  df-cnv 5708  df-co 5709  df-res 5712  df-fun 6577

This theorem is referenced by:  trlsegvdeg  30261