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

Theorem trlsonfval 29797
Description: The set of trails between two vertices. (Contributed by Alexander van der Vekens, 4-Nov-2017.) (Revised by AV, 7-Jan-2021.) (Proof shortened by AV, 15-Jan-2021.) (Revised by AV, 21-Mar-2021.)
Hypothesis
Ref Expression
trlsonfval.v 𝑉 = (Vtx‘𝐺)
Assertion
Ref Expression
trlsonfval ((𝐴𝑉𝐵𝑉) → (𝐴(TrailsOn‘𝐺)𝐵) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(𝐴(WalksOn‘𝐺)𝐵)𝑝𝑓(Trails‘𝐺)𝑝)})
Distinct variable groups:   𝐴,𝑓,𝑝   𝐵,𝑓,𝑝   𝑓,𝐺,𝑝   𝑓,𝑉,𝑝

Proof of Theorem trlsonfval
Dummy variables 𝑎 𝑏 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 trlsonfval.v . . . 4 𝑉 = (Vtx‘𝐺)
211vgrex 29096 . . 3 (𝐴𝑉𝐺 ∈ V)
32adantr 481 . 2 ((𝐴𝑉𝐵𝑉) → 𝐺 ∈ V)
4 simpl 483 . . 3 ((𝐴𝑉𝐵𝑉) → 𝐴𝑉)
54, 1eleqtrdi 2850 . 2 ((𝐴𝑉𝐵𝑉) → 𝐴 ∈ (Vtx‘𝐺))
6 simpr 485 . . 3 ((𝐴𝑉𝐵𝑉) → 𝐵𝑉)
76, 1eleqtrdi 2850 . 2 ((𝐴𝑉𝐵𝑉) → 𝐵 ∈ (Vtx‘𝐺))
8 df-trlson 29785 . 2 TrailsOn = (𝑔 ∈ V ↦ (𝑎 ∈ (Vtx‘𝑔), 𝑏 ∈ (Vtx‘𝑔) ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(𝑎(WalksOn‘𝑔)𝑏)𝑝𝑓(Trails‘𝑔)𝑝)}))
93, 5, 7, 8mptmpoopabovd 8030 1 ((𝐴𝑉𝐵𝑉) → (𝐴(TrailsOn‘𝐺)𝐵) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(𝐴(WalksOn‘𝐺)𝐵)𝑝𝑓(Trails‘𝐺)𝑝)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1547  wcel 2119  Vcvv 3432   class class class wbr 5079  {copab 5141  cfv 6492  (class class class)co 7363  Vtxcvtx 29090  WalksOncwlkson 29691  Trailsctrls 29782  TrailsOnctrlson 29783
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-ov 7366  df-oprab 7367  df-mpo 7368  df-1st 7938  df-2nd 7939  df-trlson 29785
This theorem is referenced by:  istrlson  29798
  Copyright terms: Public domain W3C validator