ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  clwwlknonex2e Unicode version

Theorem clwwlknonex2e 16290
Description: Extending a closed walk  W on vertex  X by an additional edge (forth and back) results in a closed walk on vertex  X. (Contributed by AV, 17-Apr-2022.)
Hypotheses
Ref Expression
clwwlknonex2.v  |-  V  =  (Vtx `  G )
clwwlknonex2.e  |-  E  =  (Edg `  G )
Assertion
Ref Expression
clwwlknonex2e  |-  ( ( ( X  e.  V  /\  Y  e.  V  /\  N  e.  ( ZZ>=
`  3 ) )  /\  { X ,  Y }  e.  E  /\  W  e.  ( X (ClWWalksNOn `  G ) ( N  -  2 ) ) )  ->  (
( W ++  <" X "> ) ++  <" Y "> )  e.  ( X (ClWWalksNOn `  G ) N ) )

Proof of Theorem clwwlknonex2e
StepHypRef Expression
1 clwwlknonex2.v . . 3  |-  V  =  (Vtx `  G )
2 clwwlknonex2.e . . 3  |-  E  =  (Edg `  G )
31, 2clwwlknonex2 16289 . 2  |-  ( ( ( X  e.  V  /\  Y  e.  V  /\  N  e.  ( ZZ>=
`  3 ) )  /\  { X ,  Y }  e.  E  /\  W  e.  ( X (ClWWalksNOn `  G ) ( N  -  2 ) ) )  ->  (
( W ++  <" X "> ) ++  <" Y "> )  e.  ( N ClWWalksN  G ) )
4 isclwwlknon 16280 . . . . 5  |-  ( W  e.  ( X (ClWWalksNOn `  G ) ( N  -  2 ) )  <-> 
( W  e.  ( ( N  -  2 ) ClWWalksN  G )  /\  ( W `  0 )  =  X ) )
5 isclwwlkn 16263 . . . . . . . . . 10  |-  ( W  e.  ( ( N  -  2 ) ClWWalksN  G
)  <->  ( W  e.  (ClWWalks `  G )  /\  ( `  W )  =  ( N  - 
2 ) ) )
61clwwlkbp 16245 . . . . . . . . . . . . 13  |-  ( W  e.  (ClWWalks `  G
)  ->  ( G  e.  _V  /\  W  e. Word  V  /\  W  =/=  (/) ) )
76simp2d 1036 . . . . . . . . . . . 12  |-  ( W  e.  (ClWWalks `  G
)  ->  W  e. Word  V )
8 clwwlkgt0 16246 . . . . . . . . . . . 12  |-  ( W  e.  (ClWWalks `  G
)  ->  0  <  ( `  W ) )
97, 8jca 306 . . . . . . . . . . 11  |-  ( W  e.  (ClWWalks `  G
)  ->  ( W  e. Word  V  /\  0  < 
( `  W ) ) )
109adantr 276 . . . . . . . . . 10  |-  ( ( W  e.  (ClWWalks `  G
)  /\  ( `  W
)  =  ( N  -  2 ) )  ->  ( W  e. Word  V  /\  0  <  ( `  W ) ) )
115, 10sylbi 121 . . . . . . . . 9  |-  ( W  e.  ( ( N  -  2 ) ClWWalksN  G
)  ->  ( W  e. Word  V  /\  0  < 
( `  W ) ) )
1211ad2antrl 490 . . . . . . . 8  |-  ( ( ( X  e.  V  /\  Y  e.  V  /\  N  e.  ( ZZ>=
`  3 ) )  /\  ( W  e.  ( ( N  - 
2 ) ClWWalksN  G )  /\  ( W `  0
)  =  X ) )  ->  ( W  e. Word  V  /\  0  < 
( `  W ) ) )
13 simpl1 1026 . . . . . . . 8  |-  ( ( ( X  e.  V  /\  Y  e.  V  /\  N  e.  ( ZZ>=
`  3 ) )  /\  ( W  e.  ( ( N  - 
2 ) ClWWalksN  G )  /\  ( W `  0
)  =  X ) )  ->  X  e.  V )
14 simpl2 1027 . . . . . . . 8  |-  ( ( ( X  e.  V  /\  Y  e.  V  /\  N  e.  ( ZZ>=
`  3 ) )  /\  ( W  e.  ( ( N  - 
2 ) ClWWalksN  G )  /\  ( W `  0
)  =  X ) )  ->  Y  e.  V )
15 ccat2s1fstg 11224 . . . . . . . 8  |-  ( ( ( W  e. Word  V  /\  0  <  ( `  W
) )  /\  ( X  e.  V  /\  Y  e.  V )
)  ->  ( (
( W ++  <" X "> ) ++  <" Y "> ) `  0
)  =  ( W `
 0 ) )
1612, 13, 14, 15syl12anc 1271 . . . . . . 7  |-  ( ( ( X  e.  V  /\  Y  e.  V  /\  N  e.  ( ZZ>=
`  3 ) )  /\  ( W  e.  ( ( N  - 
2 ) ClWWalksN  G )  /\  ( W `  0
)  =  X ) )  ->  ( (
( W ++  <" X "> ) ++  <" Y "> ) `  0
)  =  ( W `
 0 ) )
17 simprr 533 . . . . . . 7  |-  ( ( ( X  e.  V  /\  Y  e.  V  /\  N  e.  ( ZZ>=
`  3 ) )  /\  ( W  e.  ( ( N  - 
2 ) ClWWalksN  G )  /\  ( W `  0
)  =  X ) )  ->  ( W `  0 )  =  X )
1816, 17eqtrd 2264 . . . . . 6  |-  ( ( ( X  e.  V  /\  Y  e.  V  /\  N  e.  ( ZZ>=
`  3 ) )  /\  ( W  e.  ( ( N  - 
2 ) ClWWalksN  G )  /\  ( W `  0
)  =  X ) )  ->  ( (
( W ++  <" X "> ) ++  <" Y "> ) `  0
)  =  X )
1918ex 115 . . . . 5  |-  ( ( X  e.  V  /\  Y  e.  V  /\  N  e.  ( ZZ>= ` 
3 ) )  -> 
( ( W  e.  ( ( N  - 
2 ) ClWWalksN  G )  /\  ( W `  0
)  =  X )  ->  ( ( ( W ++  <" X "> ) ++  <" Y "> ) `  0
)  =  X ) )
204, 19biimtrid 152 . . . 4  |-  ( ( X  e.  V  /\  Y  e.  V  /\  N  e.  ( ZZ>= ` 
3 ) )  -> 
( W  e.  ( X (ClWWalksNOn `  G ) ( N  -  2 ) )  ->  ( (
( W ++  <" X "> ) ++  <" Y "> ) `  0
)  =  X ) )
2120a1d 22 . . 3  |-  ( ( X  e.  V  /\  Y  e.  V  /\  N  e.  ( ZZ>= ` 
3 ) )  -> 
( { X ,  Y }  e.  E  ->  ( W  e.  ( X (ClWWalksNOn `  G ) ( N  -  2 ) )  ->  ( (
( W ++  <" X "> ) ++  <" Y "> ) `  0
)  =  X ) ) )
22213imp 1219 . 2  |-  ( ( ( X  e.  V  /\  Y  e.  V  /\  N  e.  ( ZZ>=
`  3 ) )  /\  { X ,  Y }  e.  E  /\  W  e.  ( X (ClWWalksNOn `  G ) ( N  -  2 ) ) )  ->  (
( ( W ++  <" X "> ) ++  <" Y "> ) `  0 )  =  X )
23 isclwwlknon 16280 . 2  |-  ( ( ( W ++  <" X "> ) ++  <" Y "> )  e.  ( X (ClWWalksNOn `  G ) N )  <->  ( ( ( W ++  <" X "> ) ++  <" Y "> )  e.  ( N ClWWalksN  G )  /\  (
( ( W ++  <" X "> ) ++  <" Y "> ) `  0 )  =  X ) )
243, 22, 23sylanbrc 417 1  |-  ( ( ( X  e.  V  /\  Y  e.  V  /\  N  e.  ( ZZ>=
`  3 ) )  /\  { X ,  Y }  e.  E  /\  W  e.  ( X (ClWWalksNOn `  G ) ( N  -  2 ) ) )  ->  (
( W ++  <" X "> ) ++  <" Y "> )  e.  ( X (ClWWalksNOn `  G ) N ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1004    = wceq 1397    e. wcel 2202    =/= wne 2402   _Vcvv 2802   (/)c0 3494   {cpr 3670   class class class wbr 4088   ` cfv 5326  (class class class)co 6017   0cc0 8031    < clt 8213    - cmin 8349   2c2 9193   3c3 9194   ZZ>=cuz 9754  ♯chash 11036  Word cword 11112   ++ cconcat 11166   <"cs1 11191  Vtxcvtx 15862  Edgcedg 15907  ClWWalkscclwwlk 16241   ClWWalksN cclwwlkn 16253  ClWWalksNOncclwwlknon 16276
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-frec 6556  df-1o 6581  df-er 6701  df-map 6818  df-en 6909  df-dom 6910  df-fin 6911  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-reap 8754  df-ap 8761  df-inn 9143  df-2 9201  df-3 9202  df-n0 9402  df-z 9479  df-uz 9755  df-fz 10243  df-fzo 10377  df-ihash 11037  df-word 11113  df-lsw 11158  df-concat 11167  df-s1 11192  df-ndx 13084  df-slot 13085  df-base 13087  df-vtx 15864  df-clwwlk 16242  df-clwwlkn 16254  df-clwwlknon 16277
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator