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

Theorem vdegp1aid 16296
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 11223 . . . . 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 5511 . . 3  |-  ( ph  ->  Fun  I )
7 vdegp1aid.vf . . 3  |-  ( ph  ->  (Vtx `  F )  =  V )
8 vdegp1aid.f . . . 4  |-  ( ph  ->  (iEdg `  F )  =  ( I ++  <" { X ,  Y } "> ) )
9 wrdv 11233 . . . . . 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 4324 . . . . . 6  |-  ( ( X  e.  V  /\  Y  e.  V )  ->  { X ,  Y }  e.  _V )
1411, 12, 13syl2anc 411 . . . . 5  |-  ( ph  ->  { X ,  Y }  e.  _V )
15 cats1un 11406 . . . . 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 2265 . . 3  |-  ( ph  ->  (iEdg `  F )  =  ( I  u. 
{ <. ( `  I ) ,  { X ,  Y } >. } ) )
18 lencl 11221 . . . 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 11234 . . . 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 16002 . . . . . 6  |-  ( X  e.  V  ->  G  e.  _V )
2511, 24syl 14 . . . . 5  |-  ( ph  ->  G  e.  _V )
261, 2wrdupgren 16078 . . . . 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 11236 . . . . 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 7203 . . . 4  |-  ( ( I  e.  Fin  /\  Fun  I )  ->  dom  I  e.  Fin )
3230, 6, 31syl2anc 411 . . 3  |-  ( ph  ->  dom  I  e.  Fin )
33 prelpwi 4329 . . . 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 7488 . . . . 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 2433 . . . . . . 7  |-  ( ph  ->  -.  X  =  U )
4140neqcomd 2237 . . . . . 6  |-  ( ph  ->  -.  U  =  X )
42 vdegp1aid.yu . . . . . . . 8  |-  ( ph  ->  Y  =/=  U )
4342neneqd 2433 . . . . . . 7  |-  ( ph  ->  -.  Y  =  U )
4443neqcomd 2237 . . . . . 6  |-  ( ph  ->  -.  U  =  Y )
45 ioran 760 . . . . . 6  |-  ( -.  ( U  =  X  \/  U  =  Y )  <->  ( -.  U  =  X  /\  -.  U  =  Y ) )
4641, 44, 45sylanbrc 417 . . . . 5  |-  ( ph  ->  -.  ( U  =  X  \/  U  =  Y ) )
47 elpri 3711 . . . . 5  |-  ( U  e.  { X ,  Y }  ->  ( U  =  X  \/  U  =  Y ) )
4846, 47nsyl 633 . . . 4  |-  ( ph  ->  -.  U  e.  { X ,  Y }
)
49 df-nel 2508 . . . 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 16294 . 2  |-  ( ph  ->  ( (VtxDeg `  F
) `  U )  =  ( (VtxDeg `  G ) `  U
) )
52 vdegp1aid.d . 2  |-  ( ph  ->  ( (VtxDeg `  G
) `  U )  =  P )
5351, 52eqtrd 2265 1  |-  ( ph  ->  ( (VtxDeg `  F
) `  U )  =  P )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 105    \/ wo 716    = wceq 1398    e. wcel 2203    =/= wne 2412    e/ wnel 2507   {crab 2524   _Vcvv 2812    u. cun 3208   ~Pcpw 3668   {csn 3688   {cpr 3689   <.cop 3691   class class class wbr 4108   dom cdm 4748   Fun wfun 5345   -->wf 5347   ` cfv 5351  (class class class)co 6049   1oc1o 6639   2oc2o 6640    ~~ cen 6972   Fincfn 6974   0cc0 8123   NN0cn0 9492  ..^cfzo 10472  ♯chash 11133  Word cword 11217   ++ cconcat 11271   <"cs1 11296  Vtxcvtx 15994  iEdgciedg 15995  UPGraphcupgr 16073  VtxDegcvtxdg 16268
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709  ax-cnex 8214  ax-resscn 8215  ax-1cn 8216  ax-1re 8217  ax-icn 8218  ax-addcl 8219  ax-addrcl 8220  ax-mulcl 8221  ax-addcom 8223  ax-mulcom 8224  ax-addass 8225  ax-mulass 8226  ax-distr 8227  ax-i2m1 8228  ax-0lt1 8229  ax-1rid 8230  ax-0id 8231  ax-rnegex 8232  ax-cnre 8234  ax-pre-ltirr 8235  ax-pre-ltwlin 8236  ax-pre-lttrn 8237  ax-pre-apti 8238  ax-pre-ltadd 8239
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-if 3620  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-id 4413  df-iord 4486  df-on 4488  df-ilim 4489  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-recs 6535  df-irdg 6600  df-frec 6621  df-1o 6646  df-2o 6647  df-oadd 6650  df-er 6766  df-en 6975  df-dom 6976  df-fin 6977  df-pnf 8306  df-mnf 8307  df-xr 8308  df-ltxr 8309  df-le 8310  df-sub 8442  df-neg 8443  df-inn 9234  df-2 9292  df-3 9293  df-4 9294  df-5 9295  df-6 9296  df-7 9297  df-8 9298  df-9 9299  df-n0 9493  df-z 9574  df-dec 9706  df-uz 9850  df-xadd 10102  df-fz 10339  df-fzo 10473  df-ihash 11134  df-word 11218  df-concat 11272  df-s1 11297  df-ndx 13204  df-slot 13205  df-base 13207  df-edgf 15987  df-vtx 15996  df-iedg 15997  df-upgren 16075  df-vtxdg 16269
This theorem is referenced by:  konigsberglem1  16470  konigsberglem2  16471  konigsberglem3  16472
  Copyright terms: Public domain W3C validator