| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > p1evtxdeqfi | 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 | ⊢ (𝜑 → 𝑈 ∈ 𝑉) |
| p1evtxdeqfi.vfi | ⊢ (𝜑 → 𝑉 ∈ Fin) |
| p1evtxdeqfi.u | ⊢ (𝜑 → 𝐺 ∈ UPGraph) |
| p1evtxdeqfi.ifi | ⊢ (𝜑 → dom 𝐼 ∈ Fin) |
| p1evtxdeqfi.e | ⊢ (𝜑 → 𝐸 ∈ 𝒫 𝑉) |
| p1evtxdeqfi.2o | ⊢ (𝜑 → 𝐸 ≈ 2o) |
| p1evtxdeq.e | ⊢ (𝜑 → 𝐸 ∈ 𝑌) |
| p1evtxdeq.n | ⊢ (𝜑 → 𝑈 ∉ 𝐸) |
| Ref | Expression |
|---|---|
| p1evtxdeqfi | ⊢ (𝜑 → ((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 | 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 ⊢ (𝜑 → 𝐸 ∈ 𝑌) | |
| 15 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 | p1evtxdeqfilem 16165 | . 2 ⊢ (𝜑 → ((VtxDeg‘𝐹)‘𝑈) = (((VtxDeg‘𝐺)‘𝑈) + ((VtxDeg‘〈𝑉, {〈𝐾, 𝐸〉}〉)‘𝑈))) |
| 16 | 9 | elexd 2816 | . . . . 5 ⊢ (𝜑 → 𝑉 ∈ V) |
| 17 | opexg 4320 | . . . . . . 7 ⊢ ((𝐾 ∈ 𝑋 ∧ 𝐸 ∈ 𝒫 𝑉) → 〈𝐾, 𝐸〉 ∈ V) | |
| 18 | 6, 12, 17 | syl2anc 411 | . . . . . 6 ⊢ (𝜑 → 〈𝐾, 𝐸〉 ∈ V) |
| 19 | snexg 4274 | . . . . . 6 ⊢ (〈𝐾, 𝐸〉 ∈ V → {〈𝐾, 𝐸〉} ∈ V) | |
| 20 | 18, 19 | syl 14 | . . . . 5 ⊢ (𝜑 → {〈𝐾, 𝐸〉} ∈ V) |
| 21 | opiedgfv 15879 | . . . . 5 ⊢ ((𝑉 ∈ V ∧ {〈𝐾, 𝐸〉} ∈ V) → (iEdg‘〈𝑉, {〈𝐾, 𝐸〉}〉) = {〈𝐾, 𝐸〉}) | |
| 22 | 16, 20, 21 | syl2anc 411 | . . . 4 ⊢ (𝜑 → (iEdg‘〈𝑉, {〈𝐾, 𝐸〉}〉) = {〈𝐾, 𝐸〉}) |
| 23 | opvtxfv 15876 | . . . . 5 ⊢ ((𝑉 ∈ V ∧ {〈𝐾, 𝐸〉} ∈ V) → (Vtx‘〈𝑉, {〈𝐾, 𝐸〉}〉) = 𝑉) | |
| 24 | 16, 20, 23 | syl2anc 411 | . . . 4 ⊢ (𝜑 → (Vtx‘〈𝑉, {〈𝐾, 𝐸〉}〉) = 𝑉) |
| 25 | 6, 9, 12, 13 | upgr1een 15978 | . . . 4 ⊢ (𝜑 → 〈𝑉, {〈𝐾, 𝐸〉}〉 ∈ UPGraph) |
| 26 | p1evtxdeq.n | . . . 4 ⊢ (𝜑 → 𝑈 ∉ 𝐸) | |
| 27 | 22, 24, 6, 8, 9, 25, 14, 26 | 1hevtxdg0fi 16161 | . . 3 ⊢ (𝜑 → ((VtxDeg‘〈𝑉, {〈𝐾, 𝐸〉}〉)‘𝑈) = 0) |
| 28 | 27 | oveq2d 6034 | . 2 ⊢ (𝜑 → (((VtxDeg‘𝐺)‘𝑈) + ((VtxDeg‘〈𝑉, {〈𝐾, 𝐸〉}〉)‘𝑈)) = (((VtxDeg‘𝐺)‘𝑈) + 0)) |
| 29 | eqid 2231 | . . . . . 6 ⊢ dom 𝐼 = dom 𝐼 | |
| 30 | 1, 2, 29, 11, 9, 10 | vtxdgfif 16147 | . . . . 5 ⊢ (𝜑 → (VtxDeg‘𝐺):𝑉⟶ℕ0) |
| 31 | 30, 8 | ffvelcdmd 5783 | . . . 4 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝑈) ∈ ℕ0) |
| 32 | 31 | nn0cnd 9457 | . . 3 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝑈) ∈ ℂ) |
| 33 | 32 | addridd 8328 | . 2 ⊢ (𝜑 → (((VtxDeg‘𝐺)‘𝑈) + 0) = ((VtxDeg‘𝐺)‘𝑈)) |
| 34 | 15, 28, 33 | 3eqtrd 2268 | 1 ⊢ (𝜑 → ((VtxDeg‘𝐹)‘𝑈) = ((VtxDeg‘𝐺)‘𝑈)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 ∈ wcel 2202 ∉ wnel 2497 Vcvv 2802 ∪ cun 3198 𝒫 cpw 3652 {csn 3669 〈cop 3672 class class class wbr 4088 dom cdm 4725 Fun wfun 5320 ‘cfv 5326 (class class class)co 6018 2oc2o 6576 ≈ cen 6907 Fincfn 6909 0cc0 8032 + caddc 8035 ℕ0cn0 9402 Vtxcvtx 15866 iEdgciedg 15867 UPGraphcupgr 15945 VtxDegcvtxdg 16140 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-recs 6471 df-irdg 6536 df-frec 6557 df-1o 6582 df-2o 6583 df-oadd 6586 df-er 6702 df-en 6910 df-dom 6911 df-fin 6912 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-5 9205 df-6 9206 df-7 9207 df-8 9208 df-9 9209 df-n0 9403 df-z 9480 df-dec 9612 df-uz 9756 df-xadd 10008 df-fz 10244 df-ihash 11039 df-ndx 13087 df-slot 13088 df-base 13090 df-edgf 15859 df-vtx 15868 df-iedg 15869 df-upgren 15947 df-vtxdg 16141 |
| This theorem is referenced by: vdegp1aid 16168 |
| Copyright terms: Public domain | W3C validator |