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

Theorem trlsegvdeglem2 30296
Description: Lemma for trlsegvdeg 30302. (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
StepHypRef Expression
1 trlsegvdeg.f . . 3 (𝜑 → Fun 𝐼)
21funresd 6535 . 2 (𝜑 → Fun (𝐼 ↾ (𝐹 “ (0..^𝑁))))
3 trlsegvdeg.ix . . 3 (𝜑 → (iEdg‘𝑋) = (𝐼 ↾ (𝐹 “ (0..^𝑁))))
43funeqd 6514 . 2 (𝜑 → (Fun (iEdg‘𝑋) ↔ Fun (𝐼 ↾ (𝐹 “ (0..^𝑁)))))
52, 4mpbird 257 1 (𝜑 → Fun (iEdg‘𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2113  {csn 4580  cop 4586   class class class wbr 5098  cres 5626  cima 5627  Fun wfun 6486  cfv 6492  (class class class)co 7358  0cc0 11026  ...cfz 13423  ..^cfzo 13570  chash 14253  Vtxcvtx 29069  iEdgciedg 29070  Trailsctrls 29762
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-v 3442  df-in 3908  df-ss 3918  df-br 5099  df-opab 5161  df-rel 5631  df-cnv 5632  df-co 5633  df-res 5636  df-fun 6494
This theorem is referenced by:  trlsegvdeg  30302
  Copyright terms: Public domain W3C validator