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

Theorem vdegp1aid 16191
Description: The induction step for a vertex degree calculation. If the degree of  U in the edge set  E is  P, then adding  { X ,  Y } to the edge set, where  X  =/=  U  =/= 
Y, yields degree  P as well. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by Mario Carneiro, 28-Feb-2016.) (Revised by AV, 3-Mar-2021.)
Hypotheses
Ref Expression
vdegp1ai.vg  |-  V  =  (Vtx `  G )
vdegp1aid.u  |-  ( ph  ->  U  e.  V )
vdegp1ai.i  |-  I  =  (iEdg `  G )
vdegp1aid.w  |-  ( ph  ->  I  e. Word  { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) } )
vdegp1aid.d  |-  ( ph  ->  ( (VtxDeg `  G
) `  U )  =  P )
vdegp1aid.vf  |-  ( ph  ->  (Vtx `  F )  =  V )
vdegp1aid.fi  |-  ( ph  ->  V  e.  Fin )
vdegp1aid.x  |-  ( ph  ->  X  e.  V )
vdegp1aid.xu  |-  ( ph  ->  X  =/=  U )
vdegp1aid.y  |-  ( ph  ->  Y  e.  V )
vdegp1aid.yu  |-  ( ph  ->  Y  =/=  U )
vdegp1aid.xy  |-  ( ph  ->  X  =/=  Y )
vdegp1aid.f  |-  ( ph  ->  (iEdg `  F )  =  ( I ++  <" { X ,  Y } "> ) )
Assertion
Ref Expression
vdegp1aid  |-  ( ph  ->  ( (VtxDeg `  F
) `  U )  =  P )
Distinct variable groups:    x, U    x, V    x, X    x, Y    x, G
Allowed substitution hints:    ph( x)    P( x)    F( x)    I( x)

Proof of Theorem vdegp1aid
StepHypRef Expression
1 vdegp1ai.vg . . 3  |-  V  =  (Vtx `  G )
2 vdegp1ai.i . . 3  |-  I  =  (iEdg `  G )
3 vdegp1aid.w . . . . 5  |-  ( ph  ->  I  e. Word  { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) } )
4 wrdf 11125 . . . . 5  |-  ( I  e. Word  { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) }  ->  I : ( 0..^ ( `  I ) ) --> { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) } )
53, 4syl 14 . . . 4  |-  ( ph  ->  I : ( 0..^ ( `  I )
) --> { x  e. 
~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) } )
65ffund 5485 . . 3  |-  ( ph  ->  Fun  I )
7 vdegp1aid.vf . . 3  |-  ( ph  ->  (Vtx `  F )  =  V )
8 vdegp1aid.f . . . 4  |-  ( ph  ->  (iEdg `  F )  =  ( I ++  <" { X ,  Y } "> ) )
9 wrdv 11135 . . . . . 6  |-  ( I  e. Word  { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) }  ->  I  e. Word  _V )
103, 9syl 14 . . . . 5  |-  ( ph  ->  I  e. Word  _V )
11 vdegp1aid.x . . . . . 6  |-  ( ph  ->  X  e.  V )
12 vdegp1aid.y . . . . . 6  |-  ( ph  ->  Y  e.  V )
13 prexg 4300 . . . . . 6  |-  ( ( X  e.  V  /\  Y  e.  V )  ->  { X ,  Y }  e.  _V )
1411, 12, 13syl2anc 411 . . . . 5  |-  ( ph  ->  { X ,  Y }  e.  _V )
15 cats1un 11308 . . . . 5  |-  ( ( I  e. Word  _V  /\  { X ,  Y }  e.  _V )  ->  (
I ++  <" { X ,  Y } "> )  =  ( I  u.  { <. ( `  I ) ,  { X ,  Y } >. } ) )
1610, 14, 15syl2anc 411 . . . 4  |-  ( ph  ->  ( I ++  <" { X ,  Y } "> )  =  ( I  u.  { <. ( `  I ) ,  { X ,  Y } >. } ) )
178, 16eqtrd 2263 . . 3  |-  ( ph  ->  (iEdg `  F )  =  ( I  u. 
{ <. ( `  I ) ,  { X ,  Y } >. } ) )
18 lencl 11123 . . . 4  |-  ( I  e. Word  { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) }  ->  ( `  I )  e.  NN0 )
193, 18syl 14 . . 3  |-  ( ph  ->  ( `  I )  e.  NN0 )
20 wrdlndm 11136 . . . 4  |-  ( I  e. Word  { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) }  ->  ( `  I )  e/  dom  I )
213, 20syl 14 . . 3  |-  ( ph  ->  ( `  I )  e/  dom  I )
22 vdegp1aid.u . . 3  |-  ( ph  ->  U  e.  V )
23 vdegp1aid.fi . . 3  |-  ( ph  ->  V  e.  Fin )
2411vgrex 15897 . . . . . 6  |-  ( X  e.  V  ->  G  e.  _V )
2511, 24syl 14 . . . . 5  |-  ( ph  ->  G  e.  _V )
261, 2wrdupgren 15973 . . . . 5  |-  ( ( G  e.  _V  /\  I  e. Word  { x  e. 
~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) } )  ->  ( G  e. UPGraph  <-> 
I  e. Word  { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) } ) )
2725, 3, 26syl2anc 411 . . . 4  |-  ( ph  ->  ( G  e. UPGraph  <->  I  e. Word  { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) } ) )
283, 27mpbird 167 . . 3  |-  ( ph  ->  G  e. UPGraph )
29 wrdfin 11138 . . . . 5  |-  ( I  e. Word  { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) }  ->  I  e.  Fin )
303, 29syl 14 . . . 4  |-  ( ph  ->  I  e.  Fin )
31 fundmfi 7138 . . . 4  |-  ( ( I  e.  Fin  /\  Fun  I )  ->  dom  I  e.  Fin )
3230, 6, 31syl2anc 411 . . 3  |-  ( ph  ->  dom  I  e.  Fin )
33 prelpwi 4305 . . . 4  |-  ( ( X  e.  V  /\  Y  e.  V )  ->  { X ,  Y }  e.  ~P V
)
3411, 12, 33syl2anc 411 . . 3  |-  ( ph  ->  { X ,  Y }  e.  ~P V
)
35 vdegp1aid.xy . . . 4  |-  ( ph  ->  X  =/=  Y )
36 pr2ne 7399 . . . . 5  |-  ( ( X  e.  V  /\  Y  e.  V )  ->  ( { X ,  Y }  ~~  2o  <->  X  =/=  Y ) )
3711, 12, 36syl2anc 411 . . . 4  |-  ( ph  ->  ( { X ,  Y }  ~~  2o  <->  X  =/=  Y ) )
3835, 37mpbird 167 . . 3  |-  ( ph  ->  { X ,  Y }  ~~  2o )
39 vdegp1aid.xu . . . . . . . 8  |-  ( ph  ->  X  =/=  U )
4039neneqd 2422 . . . . . . 7  |-  ( ph  ->  -.  X  =  U )
4140neqcomd 2235 . . . . . 6  |-  ( ph  ->  -.  U  =  X )
42 vdegp1aid.yu . . . . . . . 8  |-  ( ph  ->  Y  =/=  U )
4342neneqd 2422 . . . . . . 7  |-  ( ph  ->  -.  Y  =  U )
4443neqcomd 2235 . . . . . 6  |-  ( ph  ->  -.  U  =  Y )
45 ioran 759 . . . . . 6  |-  ( -.  ( U  =  X  \/  U  =  Y )  <->  ( -.  U  =  X  /\  -.  U  =  Y ) )
4641, 44, 45sylanbrc 417 . . . . 5  |-  ( ph  ->  -.  ( U  =  X  \/  U  =  Y ) )
47 elpri 3691 . . . . 5  |-  ( U  e.  { X ,  Y }  ->  ( U  =  X  \/  U  =  Y ) )
4846, 47nsyl 633 . . . 4  |-  ( ph  ->  -.  U  e.  { X ,  Y }
)
49 df-nel 2497 . . . 4  |-  ( U  e/  { X ,  Y }  <->  -.  U  e.  { X ,  Y }
)
5048, 49sylibr 134 . . 3  |-  ( ph  ->  U  e/  { X ,  Y } )
511, 2, 6, 7, 17, 19, 21, 22, 23, 28, 32, 34, 38, 14, 50p1evtxdeqfi 16189 . 2  |-  ( ph  ->  ( (VtxDeg `  F
) `  U )  =  ( (VtxDeg `  G ) `  U
) )
52 vdegp1aid.d . 2  |-  ( ph  ->  ( (VtxDeg `  G
) `  U )  =  P )
5351, 52eqtrd 2263 1  |-  ( ph  ->  ( (VtxDeg `  F
) `  U )  =  P )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 105    \/ wo 715    = wceq 1397    e. wcel 2201    =/= wne 2401    e/ wnel 2496   {crab 2513   _Vcvv 2801    u. cun 3197   ~Pcpw 3651   {csn 3668   {cpr 3669   <.cop 3671   class class class wbr 4087   dom cdm 4724   Fun wfun 5319   -->wf 5321   ` cfv 5325  (class class class)co 6020   1oc1o 6577   2oc2o 6578    ~~ cen 6909   Fincfn 6911   0cc0 8034   NN0cn0 9404  ..^cfzo 10379  ♯chash 11040  Word cword 11119   ++ cconcat 11173   <"cs1 11198  Vtxcvtx 15889  iEdgciedg 15890  UPGraphcupgr 15968  VtxDegcvtxdg 16163
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 2203  ax-14 2204  ax-ext 2212  ax-coll 4203  ax-sep 4206  ax-nul 4214  ax-pow 4263  ax-pr 4298  ax-un 4529  ax-setind 4634  ax-iinf 4685  ax-cnex 8125  ax-resscn 8126  ax-1cn 8127  ax-1re 8128  ax-icn 8129  ax-addcl 8130  ax-addrcl 8131  ax-mulcl 8132  ax-addcom 8134  ax-mulcom 8135  ax-addass 8136  ax-mulass 8137  ax-distr 8138  ax-i2m1 8139  ax-0lt1 8140  ax-1rid 8141  ax-0id 8142  ax-rnegex 8143  ax-cnre 8145  ax-pre-ltirr 8146  ax-pre-ltwlin 8147  ax-pre-lttrn 8148  ax-pre-apti 8149  ax-pre-ltadd 8150
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 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-nel 2497  df-ral 2514  df-rex 2515  df-reu 2516  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-if 3605  df-pw 3653  df-sn 3674  df-pr 3675  df-op 3677  df-uni 3893  df-int 3928  df-iun 3971  df-br 4088  df-opab 4150  df-mpt 4151  df-tr 4187  df-id 4389  df-iord 4462  df-on 4464  df-ilim 4465  df-suc 4467  df-iom 4688  df-xp 4730  df-rel 4731  df-cnv 4732  df-co 4733  df-dm 4734  df-rn 4735  df-res 4736  df-ima 4737  df-iota 5285  df-fun 5327  df-fn 5328  df-f 5329  df-f1 5330  df-fo 5331  df-f1o 5332  df-fv 5333  df-riota 5973  df-ov 6023  df-oprab 6024  df-mpo 6025  df-1st 6305  df-2nd 6306  df-recs 6473  df-irdg 6538  df-frec 6559  df-1o 6584  df-2o 6585  df-oadd 6588  df-er 6704  df-en 6912  df-dom 6913  df-fin 6914  df-pnf 8218  df-mnf 8219  df-xr 8220  df-ltxr 8221  df-le 8222  df-sub 8354  df-neg 8355  df-inn 9146  df-2 9204  df-3 9205  df-4 9206  df-5 9207  df-6 9208  df-7 9209  df-8 9210  df-9 9211  df-n0 9405  df-z 9482  df-dec 9614  df-uz 9758  df-xadd 10010  df-fz 10246  df-fzo 10380  df-ihash 11041  df-word 11120  df-concat 11174  df-s1 11199  df-ndx 13105  df-slot 13106  df-base 13108  df-edgf 15882  df-vtx 15891  df-iedg 15892  df-upgren 15970  df-vtxdg 16164
This theorem is referenced by:  konigsberglem1  16365  konigsberglem2  16366  konigsberglem3  16367
  Copyright terms: Public domain W3C validator