| 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 16323 | . 2 ⊢ (𝜑 → ((VtxDeg‘𝐹)‘𝑈) = (((VtxDeg‘𝐺)‘𝑈) + ((VtxDeg‘〈𝑉, {〈𝐾, 𝐸〉}〉)‘𝑈))) |
| 16 | 9 | elexd 2829 | . . . . 5 ⊢ (𝜑 → 𝑉 ∈ V) |
| 17 | opexg 4346 | . . . . . . 7 ⊢ ((𝐾 ∈ 𝑋 ∧ 𝐸 ∈ 𝒫 𝑉) → 〈𝐾, 𝐸〉 ∈ V) | |
| 18 | 6, 12, 17 | syl2anc 411 | . . . . . 6 ⊢ (𝜑 → 〈𝐾, 𝐸〉 ∈ V) |
| 19 | snexg 4299 | . . . . . 6 ⊢ (〈𝐾, 𝐸〉 ∈ V → {〈𝐾, 𝐸〉} ∈ V) | |
| 20 | 18, 19 | syl 14 | . . . . 5 ⊢ (𝜑 → {〈𝐾, 𝐸〉} ∈ V) |
| 21 | opiedgfv 16037 | . . . . 5 ⊢ ((𝑉 ∈ V ∧ {〈𝐾, 𝐸〉} ∈ V) → (iEdg‘〈𝑉, {〈𝐾, 𝐸〉}〉) = {〈𝐾, 𝐸〉}) | |
| 22 | 16, 20, 21 | syl2anc 411 | . . . 4 ⊢ (𝜑 → (iEdg‘〈𝑉, {〈𝐾, 𝐸〉}〉) = {〈𝐾, 𝐸〉}) |
| 23 | opvtxfv 16034 | . . . . 5 ⊢ ((𝑉 ∈ V ∧ {〈𝐾, 𝐸〉} ∈ V) → (Vtx‘〈𝑉, {〈𝐾, 𝐸〉}〉) = 𝑉) | |
| 24 | 16, 20, 23 | syl2anc 411 | . . . 4 ⊢ (𝜑 → (Vtx‘〈𝑉, {〈𝐾, 𝐸〉}〉) = 𝑉) |
| 25 | 6, 9, 12, 13 | upgr1een 16136 | . . . 4 ⊢ (𝜑 → 〈𝑉, {〈𝐾, 𝐸〉}〉 ∈ UPGraph) |
| 26 | p1evtxdeq.n | . . . 4 ⊢ (𝜑 → 𝑈 ∉ 𝐸) | |
| 27 | 22, 24, 6, 8, 9, 25, 14, 26 | 1hevtxdg0fi 16319 | . . 3 ⊢ (𝜑 → ((VtxDeg‘〈𝑉, {〈𝐾, 𝐸〉}〉)‘𝑈) = 0) |
| 28 | 27 | oveq2d 6068 | . 2 ⊢ (𝜑 → (((VtxDeg‘𝐺)‘𝑈) + ((VtxDeg‘〈𝑉, {〈𝐾, 𝐸〉}〉)‘𝑈)) = (((VtxDeg‘𝐺)‘𝑈) + 0)) |
| 29 | eqid 2234 | . . . . . 6 ⊢ dom 𝐼 = dom 𝐼 | |
| 30 | 1, 2, 29, 11, 9, 10 | vtxdgfif 16305 | . . . . 5 ⊢ (𝜑 → (VtxDeg‘𝐺):𝑉⟶ℕ0) |
| 31 | 30, 8 | ffvelcdmd 5815 | . . . 4 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝑈) ∈ ℕ0) |
| 32 | 31 | nn0cnd 9557 | . . 3 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝑈) ∈ ℂ) |
| 33 | 32 | addridd 8424 | . 2 ⊢ (𝜑 → (((VtxDeg‘𝐺)‘𝑈) + 0) = ((VtxDeg‘𝐺)‘𝑈)) |
| 34 | 15, 28, 33 | 3eqtrd 2271 | 1 ⊢ (𝜑 → ((VtxDeg‘𝐹)‘𝑈) = ((VtxDeg‘𝐺)‘𝑈)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2205 ∉ wnel 2509 Vcvv 2815 ∪ cun 3211 𝒫 cpw 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 0cc0 8129 + caddc 8132 ℕ0cn0 9498 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-vtxdg 16299 |
| This theorem is referenced by: vdegp1aid 16326 |
| Copyright terms: Public domain | W3C validator |