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

Theorem constr3trl 23496
Description: Construction of a trail from three given edges in a graph. (Contributed by Alexander van der Vekens, 13-Nov-2017.)
Hypotheses
Ref Expression
constr3cycl.f  |-  F  =  { <. 0 ,  ( `' E `  { A ,  B } ) >. ,  <. 1 ,  ( `' E `  { B ,  C } ) >. ,  <. 2 ,  ( `' E `  { C ,  A } ) >. }
constr3cycl.p  |-  P  =  ( { <. 0 ,  A >. ,  <. 1 ,  B >. }  u.  { <. 2 ,  C >. , 
<. 3 ,  A >. } )
Assertion
Ref Expression
constr3trl  |-  ( ( V USGrph  E  /\  ( A  e.  V  /\  B  e.  V  /\  C  e.  V )  /\  ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E ) )  ->  F
( V Trails  E ) P )

Proof of Theorem constr3trl
Dummy variable  k is distinct from all other variables.
StepHypRef Expression
1 usgrav 23221 . . 3  |-  ( V USGrph  E  ->  ( V  e. 
_V  /\  E  e.  _V ) )
2 constr3cycl.f . . . . 5  |-  F  =  { <. 0 ,  ( `' E `  { A ,  B } ) >. ,  <. 1 ,  ( `' E `  { B ,  C } ) >. ,  <. 2 ,  ( `' E `  { C ,  A } ) >. }
3 constr3cycl.p . . . . 5  |-  P  =  ( { <. 0 ,  A >. ,  <. 1 ,  B >. }  u.  { <. 2 ,  C >. , 
<. 3 ,  A >. } )
42, 3constr3lem1 23482 . . . 4  |-  ( F  e.  _V  /\  P  e.  _V )
5 simplr 754 . . . . . . . . . . 11  |-  ( ( ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( F  e.  _V  /\  P  e.  _V ) )  /\  V USGrph  E )  /\  ( A  e.  V  /\  B  e.  V  /\  C  e.  V )
)  ->  V USGrph  E )
62, 3constr3trllem1 23487 . . . . . . . . . . 11  |-  ( ( V USGrph  E  /\  ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E ) )  ->  F  e. Word  dom  E )
75, 6sylan 471 . . . . . . . . . 10  |-  ( ( ( ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( F  e.  _V  /\  P  e.  _V )
)  /\  V USGrph  E )  /\  ( A  e.  V  /\  B  e.  V  /\  C  e.  V ) )  /\  ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E ) )  ->  F  e. Word  dom  E )
82, 3constr3trllem2 23488 . . . . . . . . . . 11  |-  ( ( V USGrph  E  /\  ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E ) )  ->  Fun  `' F
)
95, 8sylan 471 . . . . . . . . . 10  |-  ( ( ( ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( F  e.  _V  /\  P  e.  _V )
)  /\  V USGrph  E )  /\  ( A  e.  V  /\  B  e.  V  /\  C  e.  V ) )  /\  ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E ) )  ->  Fun  `' F
)
107, 9jca 532 . . . . . . . . 9  |-  ( ( ( ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( F  e.  _V  /\  P  e.  _V )
)  /\  V USGrph  E )  /\  ( A  e.  V  /\  B  e.  V  /\  C  e.  V ) )  /\  ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E ) )  ->  ( F  e. Word  dom  E  /\  Fun  `' F ) )
112, 3constr3trllem3 23489 . . . . . . . . . 10  |-  ( ( A  e.  V  /\  B  e.  V  /\  C  e.  V )  ->  P : ( 0 ... ( # `  F
) ) --> V )
1211ad2antlr 726 . . . . . . . . 9  |-  ( ( ( ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( F  e.  _V  /\  P  e.  _V )
)  /\  V USGrph  E )  /\  ( A  e.  V  /\  B  e.  V  /\  C  e.  V ) )  /\  ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E ) )  ->  P : ( 0 ... ( # `  F ) ) --> V )
132, 3constr3trllem5 23491 . . . . . . . . . 10  |-  ( ( V USGrph  E  /\  ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E ) )  ->  A. k  e.  ( 0..^ ( # `  F
) ) ( E `
 ( F `  k ) )  =  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )
145, 13sylan 471 . . . . . . . . 9  |-  ( ( ( ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( F  e.  _V  /\  P  e.  _V )
)  /\  V USGrph  E )  /\  ( A  e.  V  /\  B  e.  V  /\  C  e.  V ) )  /\  ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E ) )  ->  A. k  e.  ( 0..^ ( # `  F
) ) ( E `
 ( F `  k ) )  =  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } )
1510, 12, 143jca 1168 . . . . . . . 8  |-  ( ( ( ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( F  e.  _V  /\  P  e.  _V )
)  /\  V USGrph  E )  /\  ( A  e.  V  /\  B  e.  V  /\  C  e.  V ) )  /\  ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E ) )  ->  ( ( F  e. Word  dom  E  /\  Fun  `' F )  /\  P : ( 0 ... ( # `  F
) ) --> V  /\  A. k  e.  ( 0..^ ( # `  F
) ) ( E `
 ( F `  k ) )  =  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } ) )
1615ex 434 . . . . . . 7  |-  ( ( ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( F  e.  _V  /\  P  e.  _V ) )  /\  V USGrph  E )  /\  ( A  e.  V  /\  B  e.  V  /\  C  e.  V )
)  ->  ( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  -> 
( ( F  e. Word  dom  E  /\  Fun  `' F )  /\  P : ( 0 ... ( # `  F
) ) --> V  /\  A. k  e.  ( 0..^ ( # `  F
) ) ( E `
 ( F `  k ) )  =  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } ) ) )
17 istrl 23387 . . . . . . . 8  |-  ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( F  e.  _V  /\  P  e.  _V )
)  ->  ( F
( V Trails  E ) P 
<->  ( ( F  e. Word  dom  E  /\  Fun  `' F )  /\  P : ( 0 ... ( # `  F
) ) --> V  /\  A. k  e.  ( 0..^ ( # `  F
) ) ( E `
 ( F `  k ) )  =  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } ) ) )
1817ad2antrr 725 . . . . . . 7  |-  ( ( ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( F  e.  _V  /\  P  e.  _V ) )  /\  V USGrph  E )  /\  ( A  e.  V  /\  B  e.  V  /\  C  e.  V )
)  ->  ( F
( V Trails  E ) P 
<->  ( ( F  e. Word  dom  E  /\  Fun  `' F )  /\  P : ( 0 ... ( # `  F
) ) --> V  /\  A. k  e.  ( 0..^ ( # `  F
) ) ( E `
 ( F `  k ) )  =  { ( P `  k ) ,  ( P `  ( k  +  1 ) ) } ) ) )
1916, 18sylibrd 234 . . . . . 6  |-  ( ( ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( F  e.  _V  /\  P  e.  _V ) )  /\  V USGrph  E )  /\  ( A  e.  V  /\  B  e.  V  /\  C  e.  V )
)  ->  ( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  ->  F ( V Trails  E
) P ) )
2019ex 434 . . . . 5  |-  ( ( ( ( V  e. 
_V  /\  E  e.  _V )  /\  ( F  e.  _V  /\  P  e.  _V ) )  /\  V USGrph  E )  ->  (
( A  e.  V  /\  B  e.  V  /\  C  e.  V
)  ->  ( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  ->  F ( V Trails  E
) P ) ) )
2120ex 434 . . . 4  |-  ( ( ( V  e.  _V  /\  E  e.  _V )  /\  ( F  e.  _V  /\  P  e.  _V )
)  ->  ( V USGrph  E  ->  ( ( A  e.  V  /\  B  e.  V  /\  C  e.  V )  ->  (
( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  ->  F ( V Trails  E ) P ) ) ) )
224, 21mpan2 671 . . 3  |-  ( ( V  e.  _V  /\  E  e.  _V )  ->  ( V USGrph  E  -> 
( ( A  e.  V  /\  B  e.  V  /\  C  e.  V )  ->  (
( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  ->  F ( V Trails  E ) P ) ) ) )
231, 22mpcom 36 . 2  |-  ( V USGrph  E  ->  ( ( A  e.  V  /\  B  e.  V  /\  C  e.  V )  ->  (
( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  ->  F ( V Trails  E ) P ) ) )
24233imp 1181 1  |-  ( ( V USGrph  E  /\  ( A  e.  V  /\  B  e.  V  /\  C  e.  V )  /\  ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E ) )  ->  F
( V Trails  E ) P )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    /\ w3a 965    = wceq 1369    e. wcel 1756   A.wral 2710   _Vcvv 2967    u. cun 3321   {cpr 3874   {ctp 3876   <.cop 3878   class class class wbr 4287   `'ccnv 4834   dom cdm 4835   ran crn 4836   Fun wfun 5407   -->wf 5409   ` cfv 5413  (class class class)co 6086   0cc0 9274   1c1 9275    + caddc 9277   2c2 10363   3c3 10364   ...cfz 11429  ..^cfzo 11540   #chash 12095  Word cword 12213   USGrph cusg 23215   Trails ctrail 23357
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2419  ax-rep 4398  ax-sep 4408  ax-nul 4416  ax-pow 4465  ax-pr 4526  ax-un 6367  ax-cnex 9330  ax-resscn 9331  ax-1cn 9332  ax-icn 9333  ax-addcl 9334  ax-addrcl 9335  ax-mulcl 9336  ax-mulrcl 9337  ax-mulcom 9338  ax-addass 9339  ax-mulass 9340  ax-distr 9341  ax-i2m1 9342  ax-1ne0 9343  ax-1rid 9344  ax-rnegex 9345  ax-rrecex 9346  ax-cnre 9347  ax-pre-lttri 9348  ax-pre-lttrn 9349  ax-pre-ltadd 9350  ax-pre-mulgt0 9351
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2256  df-mo 2257  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-nel 2604  df-ral 2715  df-rex 2716  df-reu 2717  df-rmo 2718  df-rab 2719  df-v 2969  df-sbc 3182  df-csb 3284  df-dif 3326  df-un 3328  df-in 3330  df-ss 3337  df-pss 3339  df-nul 3633  df-if 3787  df-pw 3857  df-sn 3873  df-pr 3875  df-tp 3877  df-op 3879  df-uni 4087  df-int 4124  df-iun 4168  df-br 4288  df-opab 4346  df-mpt 4347  df-tr 4381  df-eprel 4627  df-id 4631  df-po 4636  df-so 4637  df-fr 4674  df-we 4676  df-ord 4717  df-on 4718  df-lim 4719  df-suc 4720  df-xp 4841  df-rel 4842  df-cnv 4843  df-co 4844  df-dm 4845  df-rn 4846  df-res 4847  df-ima 4848  df-iota 5376  df-fun 5415  df-fn 5416  df-f 5417  df-f1 5418  df-fo 5419  df-f1o 5420  df-fv 5421  df-riota 6047  df-ov 6089  df-oprab 6090  df-mpt2 6091  df-om 6472  df-1st 6572  df-2nd 6573  df-recs 6824  df-rdg 6858  df-1o 6912  df-oadd 6916  df-er 7093  df-map 7208  df-pm 7209  df-en 7303  df-dom 7304  df-sdom 7305  df-fin 7306  df-card 8101  df-cda 8329  df-pnf 9412  df-mnf 9413  df-xr 9414  df-ltxr 9415  df-le 9416  df-sub 9589  df-neg 9590  df-nn 10315  df-2 10372  df-3 10373  df-n0 10572  df-z 10639  df-uz 10854  df-fz 11430  df-fzo 11541  df-hash 12096  df-word 12221  df-usgra 23217  df-wlk 23366  df-trail 23367
This theorem is referenced by:  constr3pth  23497
  Copyright terms: Public domain W3C validator