| 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 30093 | . 2 ⊢ (𝜑 → ((VtxDeg‘𝐹)‘𝑈) = (((VtxDeg‘𝐺)‘𝑈) +e ((VtxDeg‘〈𝑉, {〈𝐾, 𝐸〉}〉)‘𝑈))) |
| 11 | 1 | fvexi 6899 | . . . . . 6 ⊢ 𝑉 ∈ V |
| 12 | snex 5397 | . . . . . 6 ⊢ {〈𝐾, 𝐸〉} ∈ V | |
| 13 | 11, 12 | pm3.2i 476 | . . . . 5 ⊢ (𝑉 ∈ V ∧ {〈𝐾, 𝐸〉} ∈ V) |
| 14 | opiedgfv 29585 | . . . . 5 ⊢ ((𝑉 ∈ V ∧ {〈𝐾, 𝐸〉} ∈ V) → (iEdg‘〈𝑉, {〈𝐾, 𝐸〉}〉) = {〈𝐾, 𝐸〉}) | |
| 15 | 13, 14 | mp1i 14 | . . . 4 ⊢ (𝜑 → (iEdg‘〈𝑉, {〈𝐾, 𝐸〉}〉) = {〈𝐾, 𝐸〉}) |
| 16 | opvtxfv 29582 | . . . . 5 ⊢ ((𝑉 ∈ V ∧ {〈𝐾, 𝐸〉} ∈ V) → (Vtx‘〈𝑉, {〈𝐾, 𝐸〉}〉) = 𝑉) | |
| 17 | 13, 16 | mp1i 14 | . . . 4 ⊢ (𝜑 → (Vtx‘〈𝑉, {〈𝐾, 𝐸〉}〉) = 𝑉) |
| 18 | p1evtxdeq.n | . . . 4 ⊢ (𝜑 → 𝑈 ∉ 𝐸) | |
| 19 | 15, 17, 6, 8, 9, 18 | 1hevtxdg0 30086 | . . 3 ⊢ (𝜑 → ((VtxDeg‘〈𝑉, {〈𝐾, 𝐸〉}〉)‘𝑈) = 0) |
| 20 | 19 | oveq2d 7436 | . 2 ⊢ (𝜑 → (((VtxDeg‘𝐺)‘𝑈) +e ((VtxDeg‘〈𝑉, {〈𝐾, 𝐸〉}〉)‘𝑈)) = (((VtxDeg‘𝐺)‘𝑈) +e 0)) |
| 21 | 1 | vtxdgelxnn0 30053 | . . . 4 ⊢ (𝑈 ∈ 𝑉 → ((VtxDeg‘𝐺)‘𝑈) ∈ ℕ0*) |
| 22 | xnn0xr 12684 | . . . 4 ⊢ (((VtxDeg‘𝐺)‘𝑈) ∈ ℕ0* → ((VtxDeg‘𝐺)‘𝑈) ∈ ℝ*) | |
| 23 | 8, 21, 22 | 3syl 19 | . . 3 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝑈) ∈ ℝ*) |
| 24 | 23 | xaddridd 13373 | . 2 ⊢ (𝜑 → (((VtxDeg‘𝐺)‘𝑈) +e 0) = ((VtxDeg‘𝐺)‘𝑈)) |
| 25 | 10, 20, 24 | 3eqtrd 2800 | 1 ⊢ (𝜑 → ((VtxDeg‘𝐹)‘𝑈) = ((VtxDeg‘𝐺)‘𝑈)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∉ wnel 3062 Vcvv 3451 ∪ cun 3897 {csn 4584 〈cop 4590 dom cdm 5651 Fun wfun 6532 ‘cfv 6538 (class class class)co 7420 0cc0 11200 ℝ*cxr 11342 ℕ0*cxnn0 12679 +e cxad 13239 Vtxcvtx 29574 iEdgciedg 29575 VtxDegcvtxdg 30046 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-oadd 8480 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-dju 9982 df-card 10020 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-n0 12607 df-xnn0 12680 df-z 12694 df-uz 12966 df-xadd 13242 df-fz 13640 df-hash 14475 df-vtx 29576 df-iedg 29577 df-vtxdg 30047 |
| This theorem is used by: vdegp1ai 30117 |
| Copyright terms: Public domain | W3C validator |