MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  spths Structured version   Unicode version

Theorem spths 23613
Description: The set of simple paths (in an undirected graph). (Contributed by Alexander van der Vekens, 21-Oct-2017.)
Assertion
Ref Expression
spths  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  ( V SPaths  E )  =  { <. f ,  p >.  |  (
f ( V Trails  E
) p  /\  Fun  `' p ) } )
Distinct variable groups:    f, E, p    f, V, p
Allowed substitution hints:    X( f, p)    Y( f, p)

Proof of Theorem spths
Dummy variables  e 
v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 3081 . 2  |-  ( V  e.  X  ->  V  e.  _V )
2 elex 3081 . 2  |-  ( E  e.  Y  ->  E  e.  _V )
3 df-spth 23565 . . . 4  |- SPaths  =  ( v  e.  _V , 
e  e.  _V  |->  {
<. f ,  p >.  |  ( f ( v Trails 
e ) p  /\  Fun  `' p ) } )
43a1i 11 . . 3  |-  ( ( V  e.  _V  /\  E  e.  _V )  -> SPaths 
=  ( v  e. 
_V ,  e  e. 
_V  |->  { <. f ,  p >.  |  (
f ( v Trails  e
) p  /\  Fun  `' p ) } ) )
5 oveq12 6204 . . . . . . 7  |-  ( ( v  =  V  /\  e  =  E )  ->  ( v Trails  e )  =  ( V Trails  E
) )
65adantl 466 . . . . . 6  |-  ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( v  =  V  /\  e  =  E ) )  ->  (
v Trails  e )  =  ( V Trails  E ) )
76breqd 4406 . . . . 5  |-  ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( v  =  V  /\  e  =  E ) )  ->  (
f ( v Trails  e
) p  <->  f ( V Trails  E ) p ) )
87anbi1d 704 . . . 4  |-  ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( v  =  V  /\  e  =  E ) )  ->  (
( f ( v Trails 
e ) p  /\  Fun  `' p )  <->  ( f
( V Trails  E )
p  /\  Fun  `' p
) ) )
98opabbidv 4458 . . 3  |-  ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( v  =  V  /\  e  =  E ) )  ->  { <. f ,  p >.  |  ( f ( v Trails  e
) p  /\  Fun  `' p ) }  =  { <. f ,  p >.  |  ( f ( V Trails  E ) p  /\  Fun  `' p
) } )
10 simpl 457 . . 3  |-  ( ( V  e.  _V  /\  E  e.  _V )  ->  V  e.  _V )
11 simpr 461 . . 3  |-  ( ( V  e.  _V  /\  E  e.  _V )  ->  E  e.  _V )
12 trliswlk 23585 . . . 4  |-  ( f ( V Trails  E ) p  ->  f ( V Walks  E ) p )
1312wlkres 23575 . . 3  |-  ( ( V  e.  _V  /\  E  e.  _V )  ->  { <. f ,  p >.  |  ( f ( V Trails  E ) p  /\  Fun  `' p
) }  e.  _V )
144, 9, 10, 11, 13ovmpt2d 6323 . 2  |-  ( ( V  e.  _V  /\  E  e.  _V )  ->  ( V SPaths  E )  =  { <. f ,  p >.  |  (
f ( V Trails  E
) p  /\  Fun  `' p ) } )
151, 2, 14syl2an 477 1  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  ( V SPaths  E )  =  { <. f ,  p >.  |  (
f ( V Trails  E
) p  /\  Fun  `' p ) } )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1370    e. wcel 1758   _Vcvv 3072   class class class wbr 4395   {copab 4452   `'ccnv 4942   Fun wfun 5515  (class class class)co 6195    |-> cmpt2 6197   Trails ctrail 23553   SPaths cspath 23555
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-8 1760  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1954  ax-ext 2431  ax-rep 4506  ax-sep 4516  ax-nul 4524  ax-pow 4573  ax-pr 4634  ax-un 6477  ax-cnex 9444  ax-resscn 9445  ax-1cn 9446  ax-icn 9447  ax-addcl 9448  ax-addrcl 9449  ax-mulcl 9450  ax-mulrcl 9451  ax-mulcom 9452  ax-addass 9453  ax-mulass 9454  ax-distr 9455  ax-i2m1 9456  ax-1ne0 9457  ax-1rid 9458  ax-rnegex 9459  ax-rrecex 9460  ax-cnre 9461  ax-pre-lttri 9462  ax-pre-lttrn 9463  ax-pre-ltadd 9464  ax-pre-mulgt0 9465
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-eu 2265  df-mo 2266  df-clab 2438  df-cleq 2444  df-clel 2447  df-nfc 2602  df-ne 2647  df-nel 2648  df-ral 2801  df-rex 2802  df-reu 2803  df-rab 2805  df-v 3074  df-sbc 3289  df-csb 3391  df-dif 3434  df-un 3436  df-in 3438  df-ss 3445  df-pss 3447  df-nul 3741  df-if 3895  df-pw 3965  df-sn 3981  df-pr 3983  df-tp 3985  df-op 3987  df-uni 4195  df-int 4232  df-iun 4276  df-br 4396  df-opab 4454  df-mpt 4455  df-tr 4489  df-eprel 4735  df-id 4739  df-po 4744  df-so 4745  df-fr 4782  df-we 4784  df-ord 4825  df-on 4826  df-lim 4827  df-suc 4828  df-xp 4949  df-rel 4950  df-cnv 4951  df-co 4952  df-dm 4953  df-rn 4954  df-res 4955  df-ima 4956  df-iota 5484  df-fun 5523  df-fn 5524  df-f 5525  df-f1 5526  df-fo 5527  df-f1o 5528  df-fv 5529  df-riota 6156  df-ov 6198  df-oprab 6199  df-mpt2 6200  df-om 6582  df-1st 6682  df-2nd 6683  df-recs 6937  df-rdg 6971  df-1o 7025  df-oadd 7029  df-er 7206  df-map 7321  df-pm 7322  df-en 7416  df-dom 7417  df-sdom 7418  df-fin 7419  df-pnf 9526  df-mnf 9527  df-xr 9528  df-ltxr 9529  df-le 9530  df-sub 9703  df-neg 9704  df-nn 10429  df-n0 10686  df-z 10753  df-uz 10968  df-fz 11550  df-fzo 11661  df-word 12342  df-wlk 23562  df-trail 23563  df-spth 23565
This theorem is referenced by:  isspth  23615
  Copyright terms: Public domain W3C validator