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

Theorem istrl 29851
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 29850 . 2 (Trails‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Walks‘𝐺)𝑝 ∧ Fun 𝑓)}
2 cnveq 5841 . . . 4 (𝑓 = 𝐹𝑓 = 𝐹)
32funeqd 6537 . . 3 (𝑓 = 𝐹 → (Fun 𝑓 ↔ Fun 𝐹))
43adantr 484 . 2 ((𝑓 = 𝐹𝑝 = 𝑃) → (Fun 𝑓 ↔ Fun 𝐹))
5 relwlk 29782 . 2 Rel (Walks‘𝐺)
61, 4, 5brfvopabrbr 6966 1 (𝐹(Trails‘𝐺)𝑃 ↔ (𝐹(Walks‘𝐺)𝑃 ∧ Fun 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 399   = wceq 1559   class class class wbr 5097  ccnv 5642  Fun wfun 6509  cfv 6515  Walkscwlks 29753  Trailsctrls 29845
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pr 5387
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-iota 6471  df-fun 6517  df-fv 6523  df-wlks 29756  df-trls 29847
This theorem is referenced by:  trliswlk  29852  trlf1  29853  trlres  29855  upgristrl  29857  dfpth2  29885  2pthnloop  29887  upgrspthswlk  29894  uhgrwkspth  29911  usgr2wlkspth  29915  uspgrn2crct  29964  crctcshtrl  29979  2trld  30094  0trl  30280  1trld  30300  ntrl2v2e  30316  3trld  30330  iseupthf1o  30360  subgrtrl  35443  upgrimtrls  48488  gpgprismgr4cycllem11  48687
  Copyright terms: Public domain W3C validator