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

Theorem p1evtxdeqfi 16553
Description: If an edge 𝐸 which does not contain vertex 𝑈 is added to a graph 𝐺 (yielding a graph 𝐹), the degree of 𝑈 is the same in both graphs. (Contributed by AV, 2-Mar-2021.)
Hypotheses
Ref Expression
p1evtxdeq.v 𝑉 = (Vtx‘𝐺)
p1evtxdeq.i 𝐼 = (iEdg‘𝐺)
p1evtxdeq.f (𝜑 → Fun 𝐼)
p1evtxdeq.fv (𝜑 → (Vtx‘𝐹) = 𝑉)
p1evtxdeq.fi (𝜑 → (iEdg‘𝐹) = (𝐼 ∪ {⟨𝐾, 𝐸⟩}))
p1evtxdeq.k (𝜑𝐾𝑋)
p1evtxdeq.d (𝜑𝐾 ∉ dom 𝐼)
p1evtxdeq.u (𝜑𝑈𝑉)
p1evtxdeqfi.vfi (𝜑𝑉 ∈ Fin)
p1evtxdeqfi.u (𝜑𝐺 ∈ UPGraph)
p1evtxdeqfi.ifi (𝜑 → dom 𝐼 ∈ Fin)
p1evtxdeqfi.e (𝜑𝐸 ∈ 𝒫 𝑉)
p1evtxdeqfi.2o (𝜑𝐸 ≈ 2o)
p1evtxdeq.e (𝜑𝐸𝑌)
p1evtxdeq.n (𝜑𝑈𝐸)
Assertion
Ref Expression
p1evtxdeqfi (𝜑 → ((VtxDeg‘𝐹)‘𝑈) = ((VtxDeg‘𝐺)‘𝑈))

Proof of Theorem p1evtxdeqfi
StepHypRef Expression
1 p1evtxdeq.v . . 3 𝑉 = (Vtx‘𝐺)
2 p1evtxdeq.i . . 3 𝐼 = (iEdg‘𝐺)
3 p1evtxdeq.f . . 3 (𝜑 → Fun 𝐼)
4 p1evtxdeq.fv . . 3 (𝜑 → (Vtx‘𝐹) = 𝑉)
5 p1evtxdeq.fi . . 3 (𝜑 → (iEdg‘𝐹) = (𝐼 ∪ {⟨𝐾, 𝐸⟩}))
6 p1evtxdeq.k . . 3 (𝜑𝐾𝑋)
7 p1evtxdeq.d . . 3 (𝜑𝐾 ∉ dom 𝐼)
8 p1evtxdeq.u . . 3 (𝜑𝑈𝑉)
9 p1evtxdeqfi.vfi . . 3 (𝜑𝑉 ∈ Fin)
10 p1evtxdeqfi.u . . 3 (𝜑𝐺 ∈ UPGraph)
11 p1evtxdeqfi.ifi . . 3 (𝜑 → dom 𝐼 ∈ Fin)
12 p1evtxdeqfi.e . . 3 (𝜑𝐸 ∈ 𝒫 𝑉)
13 p1evtxdeqfi.2o . . 3 (𝜑𝐸 ≈ 2o)
14 p1evtxdeq.e . . 3 (𝜑𝐸𝑌)
151, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14p1evtxdeqfilem 16552 . 2 (𝜑 → ((VtxDeg‘𝐹)‘𝑈) = (((VtxDeg‘𝐺)‘𝑈) + ((VtxDeg‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩)‘𝑈)))
169elexd 2835 . . . . 5 (𝜑𝑉 ∈ V)
17 opexg 4368 . . . . . . 7 ((𝐾𝑋𝐸 ∈ 𝒫 𝑉) → ⟨𝐾, 𝐸⟩ ∈ V)
186, 12, 17syl2anc 415 . . . . . 6 (𝜑 → ⟨𝐾, 𝐸⟩ ∈ V)
19 snexg 4321 . . . . . 6 (⟨𝐾, 𝐸⟩ ∈ V → {⟨𝐾, 𝐸⟩} ∈ V)
2018, 19syl 14 . . . . 5 (𝜑 → {⟨𝐾, 𝐸⟩} ∈ V)
21 opiedgfv 16266 . . . . 5 ((𝑉 ∈ V ∧ {⟨𝐾, 𝐸⟩} ∈ V) → (iEdg‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩) = {⟨𝐾, 𝐸⟩})
2216, 20, 21syl2anc 415 . . . 4 (𝜑 → (iEdg‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩) = {⟨𝐾, 𝐸⟩})
23 opvtxfv 16263 . . . . 5 ((𝑉 ∈ V ∧ {⟨𝐾, 𝐸⟩} ∈ V) → (Vtx‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩) = 𝑉)
2416, 20, 23syl2anc 415 . . . 4 (𝜑 → (Vtx‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩) = 𝑉)
256, 9, 12, 13upgr1een 16365 . . . 4 (𝜑 → ⟨𝑉, {⟨𝐾, 𝐸⟩}⟩ ∈ UPGraph)
26 p1evtxdeq.n . . . 4 (𝜑𝑈𝐸)
2722, 24, 6, 8, 9, 25, 14, 261hevtxdg0fi 16548 . . 3 (𝜑 → ((VtxDeg‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩)‘𝑈) = 0)
2827oveq2d 6101 . 2 (𝜑 → (((VtxDeg‘𝐺)‘𝑈) + ((VtxDeg‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩)‘𝑈)) = (((VtxDeg‘𝐺)‘𝑈) + 0))
29 eqid 2238 . . . . . 6 dom 𝐼 = dom 𝐼
301, 2, 29, 11, 9, 10vtxdgfif 16534 . . . . 5 (𝜑 → (VtxDeg‘𝐺):𝑉⟶ℕ0)
3130, 8ffvelcdmd 5844 . . . 4 (𝜑 → ((VtxDeg‘𝐺)‘𝑈) ∈ ℕ0)
3231nn0cnd 9622 . . 3 (𝜑 → ((VtxDeg‘𝐺)‘𝑈) ∈ ℂ)
3332addridd 8475 . 2 (𝜑 → (((VtxDeg‘𝐺)‘𝑈) + 0) = ((VtxDeg‘𝐺)‘𝑈))
3415, 28, 333eqtrd 2275 1 (𝜑 → ((VtxDeg‘𝐹)‘𝑈) = ((VtxDeg‘𝐺)‘𝑈))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4   = wceq 1402  wcel 2209  wnel 2515  Vcvv 2821  cun 3218  𝒫 cpw 3688  {csn 3709  cop 3712   class class class wbr 4130  dom cdm 4774  Fun wfun 5371  cfv 5377  (class class class)co 6085  2oc2o 6681  cen 7020  Fincfn 7022  0cc0 8179   + caddc 8182  0cn0 9563  Vtxcvtx 16253  iEdgciedg 16254  UPGraphcupgr 16332  VtxDegcvtxdg 16527
This proof depends on 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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295
This proof 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 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-frec 6662  df-1o 6687  df-2o 6688  df-oadd 6691  df-er 6807  df-en 7023  df-dom 7024  df-fin 7025  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-5 9366  df-6 9367  df-7 9368  df-8 9369  df-9 9370  df-n0 9564  df-z 9645  df-dec 9778  df-uz 9922  df-xadd 10175  df-fz 10412  df-ihash 11215  df-ndx 13355  df-slot 13356  df-base 13358  df-edgf 16246  df-vtx 16255  df-iedg 16256  df-upgren 16334  df-vtxdg 16528
This theorem is used by:  vdegp1aid  16555
  Copyright terms: Public domain W3C validator