| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > vtxdgval | Structured version Visualization version GIF version | ||
| Description: The degree of a vertex. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by Alexander van der Vekens, 20-Dec-2017.) (Revised by AV, 10-Dec-2020.) (Revised by AV, 22-Mar-2021.) |
| Ref | Expression |
|---|---|
| vtxdgval.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| vtxdgval.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| vtxdgval.a | ⊢ 𝐴 = dom 𝐼 |
| Ref | Expression |
|---|---|
| vtxdgval | ⊢ (𝑈 ∈ 𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vtxdgval.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | 1 | 1vgrex 28936 | . . . 4 ⊢ (𝑈 ∈ 𝑉 → 𝐺 ∈ V) |
| 3 | vtxdgval.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 4 | vtxdgval.a | . . . . 5 ⊢ 𝐴 = dom 𝐼 | |
| 5 | 1, 3, 4 | vtxdgfval 29402 | . . . 4 ⊢ (𝐺 ∈ V → (VtxDeg‘𝐺) = (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))) |
| 6 | 2, 5 | syl 17 | . . 3 ⊢ (𝑈 ∈ 𝑉 → (VtxDeg‘𝐺) = (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))) |
| 7 | 6 | fveq1d 6863 | . 2 ⊢ (𝑈 ∈ 𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))‘𝑈)) |
| 8 | eleq1 2817 | . . . . . 6 ⊢ (𝑢 = 𝑈 → (𝑢 ∈ (𝐼‘𝑥) ↔ 𝑈 ∈ (𝐼‘𝑥))) | |
| 9 | 8 | rabbidv 3416 | . . . . 5 ⊢ (𝑢 = 𝑈 → {𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)} = {𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) |
| 10 | 9 | fveq2d 6865 | . . . 4 ⊢ (𝑢 = 𝑈 → (♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) = (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)})) |
| 11 | sneq 4602 | . . . . . . 7 ⊢ (𝑢 = 𝑈 → {𝑢} = {𝑈}) | |
| 12 | 11 | eqeq2d 2741 | . . . . . 6 ⊢ (𝑢 = 𝑈 → ((𝐼‘𝑥) = {𝑢} ↔ (𝐼‘𝑥) = {𝑈})) |
| 13 | 12 | rabbidv 3416 | . . . . 5 ⊢ (𝑢 = 𝑈 → {𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}} = {𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}) |
| 14 | 13 | fveq2d 6865 | . . . 4 ⊢ (𝑢 = 𝑈 → (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}) = (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})) |
| 15 | 10, 14 | oveq12d 7408 | . . 3 ⊢ (𝑢 = 𝑈 → ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| 16 | eqid 2730 | . . 3 ⊢ (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}))) = (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}))) | |
| 17 | ovex 7423 | . . 3 ⊢ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})) ∈ V | |
| 18 | 15, 16, 17 | fvmpt 6971 | . 2 ⊢ (𝑈 ∈ 𝑉 → ((𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| 19 | 7, 18 | eqtrd 2765 | 1 ⊢ (𝑈 ∈ 𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 {crab 3408 Vcvv 3450 {csn 4592 ↦ cmpt 5191 dom cdm 5641 ‘cfv 6514 (class class class)co 7390 +𝑒 cxad 13077 ♯chash 14302 Vtxcvtx 28930 iEdgciedg 28931 VtxDegcvtxdg 29400 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pr 5390 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-ov 7393 df-vtxdg 29401 |
| This theorem is referenced by: vtxdgfival 29404 vtxdun 29416 vtxdlfgrval 29420 vtxd0nedgb 29423 vtxdushgrfvedg 29425 vtxdginducedm1 29478 |
| Copyright terms: Public domain | W3C validator |