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

Theorem p1evtxdeqfi 16536
Description: If an edge  E which does not contain vertex  U is added to a graph  G (yielding a graph  F), the degree of  U is the same in both graphs. (Contributed by AV, 2-Mar-2021.)
Hypotheses
Ref Expression
p1evtxdeq.v  |-  V  =  (Vtx `  G )
p1evtxdeq.i  |-  I  =  (iEdg `  G )
p1evtxdeq.f  |-  ( ph  ->  Fun  I )
p1evtxdeq.fv  |-  ( ph  ->  (Vtx `  F )  =  V )
p1evtxdeq.fi  |-  ( ph  ->  (iEdg `  F )  =  ( I  u. 
{ <. K ,  E >. } ) )
p1evtxdeq.k  |-  ( ph  ->  K  e.  X )
p1evtxdeq.d  |-  ( ph  ->  K  e/  dom  I
)
p1evtxdeq.u  |-  ( ph  ->  U  e.  V )
p1evtxdeqfi.vfi  |-  ( ph  ->  V  e.  Fin )
p1evtxdeqfi.u  |-  ( ph  ->  G  e. UPGraph )
p1evtxdeqfi.ifi  |-  ( ph  ->  dom  I  e.  Fin )
p1evtxdeqfi.e  |-  ( ph  ->  E  e.  ~P V
)
p1evtxdeqfi.2o  |-  ( ph  ->  E  ~~  2o )
p1evtxdeq.e  |-  ( ph  ->  E  e.  Y )
p1evtxdeq.n  |-  ( ph  ->  U  e/  E )
Assertion
Ref Expression
p1evtxdeqfi  |-  ( ph  ->  ( (VtxDeg `  F
) `  U )  =  ( (VtxDeg `  G ) `  U
) )

Proof of Theorem p1evtxdeqfi
StepHypRef Expression
1 p1evtxdeq.v . . 3  |-  V  =  (Vtx `  G )
2 p1evtxdeq.i . . 3  |-  I  =  (iEdg `  G )
3 p1evtxdeq.f . . 3  |-  ( ph  ->  Fun  I )
4 p1evtxdeq.fv . . 3  |-  ( ph  ->  (Vtx `  F )  =  V )
5 p1evtxdeq.fi . . 3  |-  ( ph  ->  (iEdg `  F )  =  ( I  u. 
{ <. K ,  E >. } ) )
6 p1evtxdeq.k . . 3  |-  ( ph  ->  K  e.  X )
7 p1evtxdeq.d . . 3  |-  ( ph  ->  K  e/  dom  I
)
8 p1evtxdeq.u . . 3  |-  ( ph  ->  U  e.  V )
9 p1evtxdeqfi.vfi . . 3  |-  ( ph  ->  V  e.  Fin )
10 p1evtxdeqfi.u . . 3  |-  ( ph  ->  G  e. UPGraph )
11 p1evtxdeqfi.ifi . . 3  |-  ( ph  ->  dom  I  e.  Fin )
12 p1evtxdeqfi.e . . 3  |-  ( ph  ->  E  e.  ~P V
)
13 p1evtxdeqfi.2o . . 3  |-  ( ph  ->  E  ~~  2o )
14 p1evtxdeq.e . . 3  |-  ( ph  ->  E  e.  Y )
151, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14p1evtxdeqfilem 16535 . 2  |-  ( ph  ->  ( (VtxDeg `  F
) `  U )  =  ( ( (VtxDeg `  G ) `  U
)  +  ( (VtxDeg `  <. V ,  { <. K ,  E >. }
>. ) `  U ) ) )
169elexd 2835 . . . . 5  |-  ( ph  ->  V  e.  _V )
17 opexg 4366 . . . . . . 7  |-  ( ( K  e.  X  /\  E  e.  ~P V
)  ->  <. K ,  E >.  e.  _V )
186, 12, 17syl2anc 415 . . . . . 6  |-  ( ph  -> 
<. K ,  E >.  e. 
_V )
19 snexg 4319 . . . . . 6  |-  ( <. K ,  E >.  e. 
_V  ->  { <. K ,  E >. }  e.  _V )
2018, 19syl 14 . . . . 5  |-  ( ph  ->  { <. K ,  E >. }  e.  _V )
21 opiedgfv 16249 . . . . 5  |-  ( ( V  e.  _V  /\  {
<. K ,  E >. }  e.  _V )  -> 
(iEdg `  <. V ,  { <. K ,  E >. } >. )  =  { <. K ,  E >. } )
2216, 20, 21syl2anc 415 . . . 4  |-  ( ph  ->  (iEdg `  <. V ,  { <. K ,  E >. } >. )  =  { <. K ,  E >. } )
23 opvtxfv 16246 . . . . 5  |-  ( ( V  e.  _V  /\  {
<. K ,  E >. }  e.  _V )  -> 
(Vtx `  <. V ,  { <. K ,  E >. } >. )  =  V )
2416, 20, 23syl2anc 415 . . . 4  |-  ( ph  ->  (Vtx `  <. V ,  { <. K ,  E >. } >. )  =  V )
256, 9, 12, 13upgr1een 16348 . . . 4  |-  ( ph  -> 
<. V ,  { <. K ,  E >. } >.  e. UPGraph )
26 p1evtxdeq.n . . . 4  |-  ( ph  ->  U  e/  E )
2722, 24, 6, 8, 9, 25, 14, 261hevtxdg0fi 16531 . . 3  |-  ( ph  ->  ( (VtxDeg `  <. V ,  { <. K ,  E >. } >. ) `  U )  =  0 )
2827oveq2d 6095 . 2  |-  ( ph  ->  ( ( (VtxDeg `  G ) `  U
)  +  ( (VtxDeg `  <. V ,  { <. K ,  E >. }
>. ) `  U ) )  =  ( ( (VtxDeg `  G ) `  U )  +  0 ) )
29 eqid 2238 . . . . . 6  |-  dom  I  =  dom  I
301, 2, 29, 11, 9, 10vtxdgfif 16517 . . . . 5  |-  ( ph  ->  (VtxDeg `  G ) : V --> NN0 )
3130, 8ffvelcdmd 5838 . . . 4  |-  ( ph  ->  ( (VtxDeg `  G
) `  U )  e.  NN0 )
3231nn0cnd 9605 . . 3  |-  ( ph  ->  ( (VtxDeg `  G
) `  U )  e.  CC )
3332addridd 8469 . 2  |-  ( ph  ->  ( ( (VtxDeg `  G ) `  U
)  +  0 )  =  ( (VtxDeg `  G ) `  U
) )
3415, 28, 333eqtrd 2275 1  |-  ( ph  ->  ( (VtxDeg `  F
) `  U )  =  ( (VtxDeg `  G ) `  U
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1402    e. wcel 2209    e/ wnel 2515   _Vcvv 2821    u. cun 3218   ~Pcpw 3688   {csn 3708   <.cop 3711   class class class wbr 4128   dom cdm 4772   Fun wfun 5369   ` cfv 5375  (class class class)co 6079   2oc2o 6675    ~~ cen 7014   Fincfn 7016   0cc0 8173    + caddc 8176   NN0cn0 9546  Vtxcvtx 16236  iEdgciedg 16237  UPGraphcupgr 16315  VtxDegcvtxdg 16510
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4244  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-iinf 4733  ax-cnex 8264  ax-resscn 8265  ax-1cn 8266  ax-1re 8267  ax-icn 8268  ax-addcl 8269  ax-addrcl 8270  ax-mulcl 8271  ax-addcom 8273  ax-mulcom 8274  ax-addass 8275  ax-mulass 8276  ax-distr 8277  ax-i2m1 8278  ax-0lt1 8279  ax-1rid 8280  ax-0id 8281  ax-rnegex 8282  ax-cnre 8284  ax-pre-ltirr 8285  ax-pre-ltwlin 8286  ax-pre-lttrn 8287  ax-pre-apti 8288  ax-pre-ltadd 8289
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-tr 4228  df-id 4436  df-iord 4509  df-on 4511  df-ilim 4512  df-suc 4514  df-iom 4736  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-riota 6032  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-recs 6570  df-irdg 6635  df-frec 6656  df-1o 6681  df-2o 6682  df-oadd 6685  df-er 6801  df-en 7017  df-dom 7018  df-fin 7019  df-pnf 8356  df-mnf 8357  df-xr 8358  df-ltxr 8359  df-le 8360  df-sub 8493  df-neg 8494  df-inn 9288  df-2 9346  df-3 9347  df-4 9348  df-5 9349  df-6 9350  df-7 9351  df-8 9352  df-9 9353  df-n0 9547  df-z 9628  df-dec 9761  df-uz 9905  df-xadd 10158  df-fz 10395  df-ihash 11198  df-ndx 13338  df-slot 13339  df-base 13341  df-edgf 16229  df-vtx 16238  df-iedg 16239  df-upgren 16317  df-vtxdg 16511
This theorem is referenced by:  vdegp1aid  16538
  Copyright terms: Public domain W3C validator