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

Theorem trlsfval 28472
Description: The set of trails (in an undirected graph). (Contributed by Alexander van der Vekens, 20-Oct-2017.) (Revised by AV, 28-Dec-2020.) (Revised by AV, 29-Oct-2021.)
Assertion
Ref Expression
trlsfval (Trails‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Walks‘𝐺)𝑝 ∧ Fun 𝑓)}
Distinct variable group:   𝑓,𝐺,𝑝

Proof of Theorem trlsfval
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 biidd 262 . 2 (𝑔 = 𝐺 → (Fun 𝑓 ↔ Fun 𝑓))
2 df-trls 28469 . 2 Trails = (𝑔 ∈ V ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Walks‘𝑔)𝑝 ∧ Fun 𝑓)})
31, 2fvmptopab 7406 1 (Trails‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Walks‘𝐺)𝑝 ∧ Fun 𝑓)}
Colors of variables: wff setvar class
Syntax hints:  wa 397   = wceq 1542   class class class wbr 5104  {copab 5166  ccnv 5631  Fun wfun 6488  cfv 6494  Walkscwlks 28373  Trailsctrls 28467
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2709  ax-sep 5255  ax-nul 5262  ax-pr 5383
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2888  df-ne 2943  df-ral 3064  df-rex 3073  df-rab 3407  df-v 3446  df-dif 3912  df-un 3914  df-in 3916  df-ss 3926  df-nul 4282  df-if 4486  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4865  df-br 5105  df-opab 5167  df-mpt 5188  df-id 5530  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-iota 6446  df-fun 6496  df-fv 6502  df-trls 28469
This theorem is referenced by:  istrl  28473  upgrtrls  28478
  Copyright terms: Public domain W3C validator