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

Theorem reltrls 27470
Description: The set (Trails‘𝐺) of all trails on 𝐺 is a set of pairs by our definition of a trail, and so is a relation. (Contributed by AV, 29-Oct-2021.)
Assertion
Ref Expression
reltrls Rel (Trails‘𝐺)

Proof of Theorem reltrls
Dummy variables 𝑓 𝑔 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-trls 27468 . 2 Trails = (𝑔 ∈ V ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Walks‘𝑔)𝑝 ∧ Fun 𝑓)})
21relmptopab 7389 1 Rel (Trails‘𝐺)
Colors of variables: wff setvar class
Syntax hints:  wa 398  Vcvv 3494   class class class wbr 5058  ccnv 5548  Rel wrel 5554  Fun wfun 6343  cfv 6349  Walkscwlks 27372  Trailsctrls 27466
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-iota 6308  df-fun 6351  df-fv 6357  df-trls 27468
This theorem is referenced by:  ispth  27498  isspth  27499  iscrct  27565  iseupth  27974
  Copyright terms: Public domain W3C validator