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

Theorem p1evtxdp1fi 16325
Description: If an edge  E (not being a loop) which contains vertex  U is added to a graph  G (yielding a graph  F), the degree of  U is increased by 1. (Contributed by AV, 3-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 )
p1evtxdp1.n  |-  ( ph  ->  U  e.  E )
Assertion
Ref Expression
p1evtxdp1fi  |-  ( ph  ->  ( (VtxDeg `  F
) `  U )  =  ( ( (VtxDeg `  G ) `  U
)  +  1 ) )

Proof of Theorem p1evtxdp1fi
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 )
141, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 12p1evtxdeqfilem 16323 . 2  |-  ( ph  ->  ( (VtxDeg `  F
) `  U )  =  ( ( (VtxDeg `  G ) `  U
)  +  ( (VtxDeg `  <. V ,  { <. K ,  E >. }
>. ) `  U ) ) )
159elexd 2829 . . . . 5  |-  ( ph  ->  V  e.  _V )
16 opexg 4346 . . . . . . 7  |-  ( ( K  e.  X  /\  E  e.  ~P V
)  ->  <. K ,  E >.  e.  _V )
176, 12, 16syl2anc 411 . . . . . 6  |-  ( ph  -> 
<. K ,  E >.  e. 
_V )
18 snexg 4299 . . . . . 6  |-  ( <. K ,  E >.  e. 
_V  ->  { <. K ,  E >. }  e.  _V )
1917, 18syl 14 . . . . 5  |-  ( ph  ->  { <. K ,  E >. }  e.  _V )
20 opiedgfv 16037 . . . . 5  |-  ( ( V  e.  _V  /\  {
<. K ,  E >. }  e.  _V )  -> 
(iEdg `  <. V ,  { <. K ,  E >. } >. )  =  { <. K ,  E >. } )
2115, 19, 20syl2anc 411 . . . 4  |-  ( ph  ->  (iEdg `  <. V ,  { <. K ,  E >. } >. )  =  { <. K ,  E >. } )
22 opvtxfv 16034 . . . . 5  |-  ( ( V  e.  _V  /\  {
<. K ,  E >. }  e.  _V )  -> 
(Vtx `  <. V ,  { <. K ,  E >. } >. )  =  V )
2315, 19, 22syl2anc 411 . . . 4  |-  ( ph  ->  (Vtx `  <. V ,  { <. K ,  E >. } >. )  =  V )
246, 9, 12, 13umgr1een 16137 . . . 4  |-  ( ph  -> 
<. V ,  { <. K ,  E >. } >.  e. UMGraph )
25 p1evtxdp1.n . . . 4  |-  ( ph  ->  U  e.  E )
2621, 23, 6, 8, 9, 24, 12, 25, 131hevtxdg1en 16320 . . 3  |-  ( ph  ->  ( (VtxDeg `  <. V ,  { <. K ,  E >. } >. ) `  U )  =  1 )
2726oveq2d 6068 . 2  |-  ( ph  ->  ( ( (VtxDeg `  G ) `  U
)  +  ( (VtxDeg `  <. V ,  { <. K ,  E >. }
>. ) `  U ) )  =  ( ( (VtxDeg `  G ) `  U )  +  1 ) )
2814, 27eqtrd 2267 1  |-  ( ph  ->  ( (VtxDeg `  F
) `  U )  =  ( ( (VtxDeg `  G ) `  U
)  +  1 ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2205    e/ wnel 2509   _Vcvv 2815    u. cun 3211   ~Pcpw 3671   {csn 3691   <.cop 3694   class class class wbr 4111   dom cdm 4751   Fun wfun 5348   ` cfv 5354  (class class class)co 6052   2oc2o 6643    ~~ cen 6975   Fincfn 6977   1c1 8130    + caddc 8132  Vtxcvtx 16024  iEdgciedg 16025  UPGraphcupgr 16103  VtxDegcvtxdg 16298
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-mulcom 8230  ax-addass 8231  ax-mulass 8232  ax-distr 8233  ax-i2m1 8234  ax-0lt1 8235  ax-1rid 8236  ax-0id 8237  ax-rnegex 8238  ax-cnre 8240  ax-pre-ltirr 8241  ax-pre-ltwlin 8242  ax-pre-lttrn 8243  ax-pre-apti 8244  ax-pre-ltadd 8245
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-if 3623  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-id 4416  df-iord 4489  df-on 4491  df-ilim 4492  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-irdg 6603  df-frec 6624  df-1o 6649  df-2o 6650  df-oadd 6653  df-er 6769  df-en 6978  df-dom 6979  df-fin 6980  df-pnf 8312  df-mnf 8313  df-xr 8314  df-ltxr 8315  df-le 8316  df-sub 8448  df-neg 8449  df-inn 9240  df-2 9298  df-3 9299  df-4 9300  df-5 9301  df-6 9302  df-7 9303  df-8 9304  df-9 9305  df-n0 9499  df-z 9580  df-dec 9713  df-uz 9857  df-xadd 10109  df-fz 10346  df-ihash 11143  df-ndx 13232  df-slot 13233  df-base 13235  df-edgf 16017  df-vtx 16026  df-iedg 16027  df-upgren 16105  df-umgren 16106  df-vtxdg 16299
This theorem is referenced by:  vdegp1bid  16327
  Copyright terms: Public domain W3C validator