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

Theorem is2wlkonot 25161
Description: The set of walks of length 2 between two vertices (in a graph) as ordered triple. (Contributed by Alexander van der Vekens, 15-Feb-2018.)
Assertion
Ref Expression
is2wlkonot  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  ( V 2WalksOnOt  E )  =  ( a  e.  V ,  b  e.  V  |->  { t  e.  ( ( V  X.  V )  X.  V
)  |  E. f E. p ( f ( a ( V WalkOn  E
) b ) p  /\  ( # `  f
)  =  2  /\  ( ( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) ) } ) )
Distinct variable groups:    E, a,
b, t, f, p    V, a, b, t, f, p
Allowed substitution hints:    X( t, f, p, a, b)    Y( t, f, p, a, b)

Proof of Theorem is2wlkonot
Dummy variables  e 
v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 3067 . . 3  |-  ( V  e.  X  ->  V  e.  _V )
21adantr 463 . 2  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  V  e.  _V )
3 elex 3067 . . 3  |-  ( E  e.  Y  ->  E  e.  _V )
43adantl 464 . 2  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  E  e.  _V )
5 mpt2exga 6814 . . . 4  |-  ( ( V  e.  X  /\  V  e.  X )  ->  ( a  e.  V ,  b  e.  V  |->  { t  e.  ( ( V  X.  V
)  X.  V )  |  E. f E. p ( f ( a ( V WalkOn  E
) b ) p  /\  ( # `  f
)  =  2  /\  ( ( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) ) } )  e. 
_V )
65anidms 643 . . 3  |-  ( V  e.  X  ->  (
a  e.  V , 
b  e.  V  |->  { t  e.  ( ( V  X.  V )  X.  V )  |  E. f E. p
( f ( a ( V WalkOn  E ) b ) p  /\  ( # `  f )  =  2  /\  (
( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) ) } )  e. 
_V )
76adantr 463 . 2  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  ( a  e.  V ,  b  e.  V  |->  { t  e.  ( ( V  X.  V
)  X.  V )  |  E. f E. p ( f ( a ( V WalkOn  E
) b ) p  /\  ( # `  f
)  =  2  /\  ( ( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) ) } )  e. 
_V )
8 simpl 455 . . . 4  |-  ( ( v  =  V  /\  e  =  E )  ->  v  =  V )
9 id 22 . . . . . . . 8  |-  ( v  =  V  ->  v  =  V )
109, 9xpeq12d 4967 . . . . . . 7  |-  ( v  =  V  ->  (
v  X.  v )  =  ( V  X.  V ) )
1110, 9xpeq12d 4967 . . . . . 6  |-  ( v  =  V  ->  (
( v  X.  v
)  X.  v )  =  ( ( V  X.  V )  X.  V ) )
1211adantr 463 . . . . 5  |-  ( ( v  =  V  /\  e  =  E )  ->  ( ( v  X.  v )  X.  v
)  =  ( ( V  X.  V )  X.  V ) )
13 oveq12 6243 . . . . . . . . 9  |-  ( ( v  =  V  /\  e  =  E )  ->  ( v WalkOn  e )  =  ( V WalkOn  E
) )
1413oveqd 6251 . . . . . . . 8  |-  ( ( v  =  V  /\  e  =  E )  ->  ( a ( v WalkOn 
e ) b )  =  ( a ( V WalkOn  E ) b ) )
1514breqd 4405 . . . . . . 7  |-  ( ( v  =  V  /\  e  =  E )  ->  ( f ( a ( v WalkOn  e ) b ) p  <->  f (
a ( V WalkOn  E
) b ) p ) )
16153anbi1d 1305 . . . . . 6  |-  ( ( v  =  V  /\  e  =  E )  ->  ( ( f ( a ( v WalkOn  e
) b ) p  /\  ( # `  f
)  =  2  /\  ( ( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) )  <->  ( f ( a ( V WalkOn  E
) b ) p  /\  ( # `  f
)  =  2  /\  ( ( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) ) ) )
17162exbidv 1737 . . . . 5  |-  ( ( v  =  V  /\  e  =  E )  ->  ( E. f E. p ( f ( a ( v WalkOn  e
) b ) p  /\  ( # `  f
)  =  2  /\  ( ( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) )  <->  E. f E. p
( f ( a ( V WalkOn  E ) b ) p  /\  ( # `  f )  =  2  /\  (
( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) ) ) )
1812, 17rabeqbidv 3053 . . . 4  |-  ( ( v  =  V  /\  e  =  E )  ->  { t  e.  ( ( v  X.  v
)  X.  v )  |  E. f E. p ( f ( a ( v WalkOn  e
) b ) p  /\  ( # `  f
)  =  2  /\  ( ( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) ) }  =  {
t  e.  ( ( V  X.  V )  X.  V )  |  E. f E. p
( f ( a ( V WalkOn  E ) b ) p  /\  ( # `  f )  =  2  /\  (
( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) ) } )
198, 8, 18mpt2eq123dv 6296 . . 3  |-  ( ( v  =  V  /\  e  =  E )  ->  ( a  e.  v ,  b  e.  v 
|->  { t  e.  ( ( v  X.  v
)  X.  v )  |  E. f E. p ( f ( a ( v WalkOn  e
) b ) p  /\  ( # `  f
)  =  2  /\  ( ( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) ) } )  =  ( a  e.  V ,  b  e.  V  |->  { t  e.  ( ( V  X.  V
)  X.  V )  |  E. f E. p ( f ( a ( V WalkOn  E
) b ) p  /\  ( # `  f
)  =  2  /\  ( ( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) ) } ) )
20 df-2wlkonot 25156 . . 3  |- 2WalksOnOt  =  ( v  e.  _V , 
e  e.  _V  |->  ( a  e.  v ,  b  e.  v  |->  { t  e.  ( ( v  X.  v )  X.  v )  |  E. f E. p
( f ( a ( v WalkOn  e ) b ) p  /\  ( # `  f )  =  2  /\  (
( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) ) } ) )
2119, 20ovmpt2ga 6369 . 2  |-  ( ( V  e.  _V  /\  E  e.  _V  /\  (
a  e.  V , 
b  e.  V  |->  { t  e.  ( ( V  X.  V )  X.  V )  |  E. f E. p
( f ( a ( V WalkOn  E ) b ) p  /\  ( # `  f )  =  2  /\  (
( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) ) } )  e. 
_V )  ->  ( V 2WalksOnOt  E )  =  ( a  e.  V , 
b  e.  V  |->  { t  e.  ( ( V  X.  V )  X.  V )  |  E. f E. p
( f ( a ( V WalkOn  E ) b ) p  /\  ( # `  f )  =  2  /\  (
( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) ) } ) )
222, 4, 7, 21syl3anc 1230 1  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  ( V 2WalksOnOt  E )  =  ( a  e.  V ,  b  e.  V  |->  { t  e.  ( ( V  X.  V )  X.  V
)  |  E. f E. p ( f ( a ( V WalkOn  E
) b ) p  /\  ( # `  f
)  =  2  /\  ( ( 1st `  ( 1st `  t ) )  =  a  /\  ( 2nd `  ( 1st `  t
) )  =  ( p `  1 )  /\  ( 2nd `  t
)  =  b ) ) } ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 367    /\ w3a 974    = wceq 1405   E.wex 1633    e. wcel 1842   {crab 2757   _Vcvv 3058   class class class wbr 4394    X. cxp 4940   ` cfv 5525  (class class class)co 6234    |-> cmpt2 6236   1stc1st 6736   2ndc2nd 6737   1c1 9443   2c2 10546   #chash 12359   WalkOn cwlkon 24800   2WalksOnOt c2wlkonot 25153
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1639  ax-4 1652  ax-5 1725  ax-6 1771  ax-7 1814  ax-8 1844  ax-9 1846  ax-10 1861  ax-11 1866  ax-12 1878  ax-13 2026  ax-ext 2380  ax-rep 4506  ax-sep 4516  ax-nul 4524  ax-pow 4571  ax-pr 4629  ax-un 6530
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 976  df-tru 1408  df-ex 1634  df-nf 1638  df-sb 1764  df-eu 2242  df-mo 2243  df-clab 2388  df-cleq 2394  df-clel 2397  df-nfc 2552  df-ne 2600  df-ral 2758  df-rex 2759  df-reu 2760  df-rab 2762  df-v 3060  df-sbc 3277  df-csb 3373  df-dif 3416  df-un 3418  df-in 3420  df-ss 3427  df-nul 3738  df-if 3885  df-pw 3956  df-sn 3972  df-pr 3974  df-op 3978  df-uni 4191  df-iun 4272  df-br 4395  df-opab 4453  df-mpt 4454  df-id 4737  df-xp 4948  df-rel 4949  df-cnv 4950  df-co 4951  df-dm 4952  df-rn 4953  df-res 4954  df-ima 4955  df-iota 5489  df-fun 5527  df-fn 5528  df-f 5529  df-f1 5530  df-fo 5531  df-f1o 5532  df-fv 5533  df-ov 6237  df-oprab 6238  df-mpt2 6239  df-1st 6738  df-2nd 6739  df-2wlkonot 25156
This theorem is referenced by:  2wlkonot  25163
  Copyright terms: Public domain W3C validator