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

Theorem istrl 29949
Description: Conditions for a pair of classes/functions to be a trail (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
istrl (𝐹(Trails‘𝐺)𝑃 ↔ (𝐹(Walks‘𝐺)𝑃 ∧ Fun 𝐹))

Proof of Theorem istrl
Dummy variables 𝑓 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 trlsfval 29948 . 2 (Trails‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Walks‘𝐺)𝑝 ∧ Fun 𝑓)}
2 cnveq 5849 . . . 4 (𝑓 = 𝐹𝑓 = 𝐹)
32funeqd 6547 . . 3 (𝑓 = 𝐹 → (Fun 𝑓 ↔ Fun 𝐹))
43adantr 485 . 2 ((𝑓 = 𝐹𝑝 = 𝑃) → (Fun 𝑓 ↔ Fun 𝐹))
5 relwlk 29880 . 2 Rel (Walks‘𝐺)
61, 4, 5brfvopabrbr 6976 1 (𝐹(Trails‘𝐺)𝑃 ↔ (𝐹(Walks‘𝐺)𝑃 ∧ Fun 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400   = wceq 1563   class class class wbr 5104  ccnv 5650  Fun wfun 6519  cfv 6525  Walkscwlks 29851  Trailsctrls 29943
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5250  ax-nul 5260  ax-pr 5394
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-br 5105  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6481  df-fun 6527  df-fv 6533  df-wlks 29854  df-trls 29945
This theorem is referenced by:  trliswlk  29950  trlf1  29951  trlres  29953  upgristrl  29955  dfpth2  29983  2pthnloop  29985  upgrspthswlk  29992  uhgrwkspth  30009  usgr2wlkspth  30013  uspgrn2crct  30062  crctcshtrl  30077  2trld  30192  0trl  30378  1trld  30398  ntrl2v2e  30414  3trld  30428  iseupthf1o  30458  subgrtrl  35491  upgrimtrls  48527  gpgprismgr4cycllem11  48726
  Copyright terms: Public domain W3C validator