| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > p1evtxdeq | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| p1evtxdeq.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| p1evtxdeq.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| p1evtxdeq.f | ⊢ (𝜑 → Fun 𝐼) |
| p1evtxdeq.fv | ⊢ (𝜑 → (Vtx‘𝐹) = 𝑉) |
| p1evtxdeq.fi | ⊢ (𝜑 → (iEdg‘𝐹) = (𝐼 ∪ {〈𝐾, 𝐸〉})) |
| p1evtxdeq.k | ⊢ (𝜑 → 𝐾 ∈ 𝑋) |
| p1evtxdeq.d | ⊢ (𝜑 → 𝐾 ∉ dom 𝐼) |
| p1evtxdeq.u | ⊢ (𝜑 → 𝑈 ∈ 𝑉) |
| p1evtxdeq.e | ⊢ (𝜑 → 𝐸 ∈ 𝑌) |
| p1evtxdeq.n | ⊢ (𝜑 → 𝑈 ∉ 𝐸) |
| Ref | Expression |
|---|---|
| p1evtxdeq | ⊢ (𝜑 → ((VtxDeg‘𝐹)‘𝑈) = ((VtxDeg‘𝐺)‘𝑈)) |
| Step | Hyp | Ref | 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 | p1evtxdeq.e | . . 3 ⊢ (𝜑 → 𝐸 ∈ 𝑌) | |
| 10 | 1, 2, 3, 4, 5, 6, 7, 8, 9 | p1evtxdeqlem 29599 | . 2 ⊢ (𝜑 → ((VtxDeg‘𝐹)‘𝑈) = (((VtxDeg‘𝐺)‘𝑈) +𝑒 ((VtxDeg‘〈𝑉, {〈𝐾, 𝐸〉}〉)‘𝑈))) |
| 11 | 1 | fvexi 6849 | . . . . . 6 ⊢ 𝑉 ∈ V |
| 12 | snex 5377 | . . . . . 6 ⊢ {〈𝐾, 𝐸〉} ∈ V | |
| 13 | 11, 12 | pm3.2i 470 | . . . . 5 ⊢ (𝑉 ∈ V ∧ {〈𝐾, 𝐸〉} ∈ V) |
| 14 | opiedgfv 29093 | . . . . 5 ⊢ ((𝑉 ∈ V ∧ {〈𝐾, 𝐸〉} ∈ V) → (iEdg‘〈𝑉, {〈𝐾, 𝐸〉}〉) = {〈𝐾, 𝐸〉}) | |
| 15 | 13, 14 | mp1i 13 | . . . 4 ⊢ (𝜑 → (iEdg‘〈𝑉, {〈𝐾, 𝐸〉}〉) = {〈𝐾, 𝐸〉}) |
| 16 | opvtxfv 29090 | . . . . 5 ⊢ ((𝑉 ∈ V ∧ {〈𝐾, 𝐸〉} ∈ V) → (Vtx‘〈𝑉, {〈𝐾, 𝐸〉}〉) = 𝑉) | |
| 17 | 13, 16 | mp1i 13 | . . . 4 ⊢ (𝜑 → (Vtx‘〈𝑉, {〈𝐾, 𝐸〉}〉) = 𝑉) |
| 18 | p1evtxdeq.n | . . . 4 ⊢ (𝜑 → 𝑈 ∉ 𝐸) | |
| 19 | 15, 17, 6, 8, 9, 18 | 1hevtxdg0 29592 | . . 3 ⊢ (𝜑 → ((VtxDeg‘〈𝑉, {〈𝐾, 𝐸〉}〉)‘𝑈) = 0) |
| 20 | 19 | oveq2d 7377 | . 2 ⊢ (𝜑 → (((VtxDeg‘𝐺)‘𝑈) +𝑒 ((VtxDeg‘〈𝑉, {〈𝐾, 𝐸〉}〉)‘𝑈)) = (((VtxDeg‘𝐺)‘𝑈) +𝑒 0)) |
| 21 | 1 | vtxdgelxnn0 29559 | . . . 4 ⊢ (𝑈 ∈ 𝑉 → ((VtxDeg‘𝐺)‘𝑈) ∈ ℕ0*) |
| 22 | xnn0xr 12509 | . . . 4 ⊢ (((VtxDeg‘𝐺)‘𝑈) ∈ ℕ0* → ((VtxDeg‘𝐺)‘𝑈) ∈ ℝ*) | |
| 23 | 8, 21, 22 | 3syl 18 | . . 3 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝑈) ∈ ℝ*) |
| 24 | 23 | xaddridd 13189 | . 2 ⊢ (𝜑 → (((VtxDeg‘𝐺)‘𝑈) +𝑒 0) = ((VtxDeg‘𝐺)‘𝑈)) |
| 25 | 10, 20, 24 | 3eqtrd 2776 | 1 ⊢ (𝜑 → ((VtxDeg‘𝐹)‘𝑈) = ((VtxDeg‘𝐺)‘𝑈)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∉ wnel 3037 Vcvv 3430 ∪ cun 3888 {csn 4568 〈cop 4574 dom cdm 5625 Fun wfun 6487 ‘cfv 6493 (class class class)co 7361 0cc0 11032 ℝ*cxr 11172 ℕ0*cxnn0 12504 +𝑒 cxad 13055 Vtxcvtx 29082 iEdgciedg 29083 VtxDegcvtxdg 29552 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-oadd 8403 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-dju 9819 df-card 9857 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-nn 12169 df-n0 12432 df-xnn0 12505 df-z 12519 df-uz 12783 df-xadd 13058 df-fz 13456 df-hash 14287 df-vtx 29084 df-iedg 29085 df-vtxdg 29553 |
| This theorem is referenced by: vdegp1ai 29623 |
| Copyright terms: Public domain | W3C validator |