| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > vtxdgfifival | GIF version | ||
| Description: The degree of a vertex for graphs with finite vertex and edge sets. (Contributed by Jim Kingdon, 10-Feb-2026.) |
| Ref | Expression |
|---|---|
| vtxdgval.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| vtxdgval.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| vtxdgval.a | ⊢ 𝐴 = dom 𝐼 |
| vtxdgfifival.a | ⊢ (𝜑 → 𝐴 ∈ Fin) |
| vtxdgfifival.v | ⊢ (𝜑 → 𝑉 ∈ Fin) |
| vtxdgfifival.u | ⊢ (𝜑 → 𝑈 ∈ 𝑉) |
| vtxdgfifival.g | ⊢ (𝜑 → 𝐺 ∈ UPGraph) |
| Ref | Expression |
|---|---|
| vtxdgfifival | ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) + (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vtxdgfifival.u | . . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑉) | |
| 2 | vtxdgval.v | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | 2 | 1vgrex 15836 | . . . . 5 ⊢ (𝑈 ∈ 𝑉 → 𝐺 ∈ V) |
| 4 | vtxdgval.i | . . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 5 | vtxdgval.a | . . . . . 6 ⊢ 𝐴 = dom 𝐼 | |
| 6 | 2, 4, 5 | vtxdgfval 16047 | . . . . 5 ⊢ (𝐺 ∈ V → (VtxDeg‘𝐺) = (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))) |
| 7 | 3, 6 | syl 14 | . . . 4 ⊢ (𝑈 ∈ 𝑉 → (VtxDeg‘𝐺) = (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))) |
| 8 | 7 | fveq1d 5631 | . . 3 ⊢ (𝑈 ∈ 𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))‘𝑈)) |
| 9 | 1, 8 | syl 14 | . 2 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝑈) = ((𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))‘𝑈)) |
| 10 | eqid 2229 | . . 3 ⊢ (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}))) = (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}))) | |
| 11 | eleq1 2292 | . . . . . 6 ⊢ (𝑢 = 𝑈 → (𝑢 ∈ (𝐼‘𝑥) ↔ 𝑈 ∈ (𝐼‘𝑥))) | |
| 12 | 11 | rabbidv 2788 | . . . . 5 ⊢ (𝑢 = 𝑈 → {𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)} = {𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) |
| 13 | 12 | fveq2d 5633 | . . . 4 ⊢ (𝑢 = 𝑈 → (♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) = (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)})) |
| 14 | sneq 3677 | . . . . . . 7 ⊢ (𝑢 = 𝑈 → {𝑢} = {𝑈}) | |
| 15 | 14 | eqeq2d 2241 | . . . . . 6 ⊢ (𝑢 = 𝑈 → ((𝐼‘𝑥) = {𝑢} ↔ (𝐼‘𝑥) = {𝑈})) |
| 16 | 15 | rabbidv 2788 | . . . . 5 ⊢ (𝑢 = 𝑈 → {𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}} = {𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}) |
| 17 | 16 | fveq2d 5633 | . . . 4 ⊢ (𝑢 = 𝑈 → (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}) = (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})) |
| 18 | 13, 17 | oveq12d 6025 | . . 3 ⊢ (𝑢 = 𝑈 → ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| 19 | vtxdgfifival.a | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 20 | vtxdgfifival.v | . . . . . . . 8 ⊢ (𝜑 → 𝑉 ∈ Fin) | |
| 21 | vtxdgfifival.g | . . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ UPGraph) | |
| 22 | 2, 4, 5, 19, 20, 1, 21 | vtxedgfi 16048 | . . . . . . 7 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)} ∈ Fin) |
| 23 | hashcl 11015 | . . . . . . 7 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)} ∈ Fin → (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) ∈ ℕ0) | |
| 24 | 22, 23 | syl 14 | . . . . . 6 ⊢ (𝜑 → (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) ∈ ℕ0) |
| 25 | 24 | nn0red 9434 | . . . . 5 ⊢ (𝜑 → (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) ∈ ℝ) |
| 26 | 25 | rexrd 8207 | . . . 4 ⊢ (𝜑 → (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) ∈ ℝ*) |
| 27 | 2, 4, 5, 19, 20, 1, 21 | vtxlpfi 16049 | . . . . . . 7 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}} ∈ Fin) |
| 28 | hashcl 11015 | . . . . . . 7 ⊢ ({𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}} ∈ Fin → (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}) ∈ ℕ0) | |
| 29 | 27, 28 | syl 14 | . . . . . 6 ⊢ (𝜑 → (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}) ∈ ℕ0) |
| 30 | 29 | nn0red 9434 | . . . . 5 ⊢ (𝜑 → (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}) ∈ ℝ) |
| 31 | 30 | rexrd 8207 | . . . 4 ⊢ (𝜑 → (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}) ∈ ℝ*) |
| 32 | 26, 31 | xaddcld 10092 | . . 3 ⊢ (𝜑 → ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})) ∈ ℝ*) |
| 33 | 10, 18, 1, 32 | fvmptd3 5730 | . 2 ⊢ (𝜑 → ((𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| 34 | 25, 30 | rexaddd 10062 | . 2 ⊢ (𝜑 → ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) + (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| 35 | 9, 33, 34 | 3eqtrd 2266 | 1 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) + (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 {crab 2512 Vcvv 2799 {csn 3666 ↦ cmpt 4145 dom cdm 4719 ‘cfv 5318 (class class class)co 6007 Fincfn 6895 + caddc 8013 ℝ*cxr 8191 ℕ0cn0 9380 +𝑒 cxad 9978 ♯chash 11009 Vtxcvtx 15828 iEdgciedg 15829 UPGraphcupgr 15906 VtxDegcvtxdg 16045 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-addcom 8110 ax-mulcom 8111 ax-addass 8112 ax-mulass 8113 ax-distr 8114 ax-i2m1 8115 ax-0lt1 8116 ax-1rid 8117 ax-0id 8118 ax-rnegex 8119 ax-cnre 8121 ax-pre-ltirr 8122 ax-pre-ltwlin 8123 ax-pre-lttrn 8124 ax-pre-ltadd 8126 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4384 df-iord 4457 df-on 4459 df-ilim 4460 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-recs 6457 df-frec 6543 df-1o 6568 df-2o 6569 df-er 6688 df-en 6896 df-dom 6897 df-fin 6898 df-pnf 8194 df-mnf 8195 df-xr 8196 df-ltxr 8197 df-le 8198 df-sub 8330 df-neg 8331 df-inn 9122 df-2 9180 df-3 9181 df-4 9182 df-5 9183 df-6 9184 df-7 9185 df-8 9186 df-9 9187 df-n0 9381 df-z 9458 df-dec 9590 df-uz 9734 df-xadd 9981 df-ihash 11010 df-ndx 13050 df-slot 13051 df-base 13053 df-edgf 15821 df-vtx 15830 df-iedg 15831 df-upgren 15908 df-vtxdg 16046 |
| This theorem is referenced by: vtxdgfi0e 16054 vtxdfifiun 16056 vtxdumgrfival 16057 |
| Copyright terms: Public domain | W3C validator |