| 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 29149 | . . . 4 ⊢ (𝑈 ∈ 𝑉 → 𝐺 ∈ V) |
| 3 | vtxdgval.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 4 | vtxdgval.a | . . . . 5 ⊢ 𝐴 = dom 𝐼 | |
| 5 | 1, 3, 4 | vtxdgfval 29614 | . . . 4 ⊢ (𝐺 ∈ V → (VtxDeg‘𝐺) = (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))) |
| 6 | 2, 5 | syl 17 | . . 3 ⊢ (𝑈 ∈ 𝑉 → (VtxDeg‘𝐺) = (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))) |
| 7 | 6 | fveq1d 6865 | . 2 ⊢ (𝑈 ∈ 𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))‘𝑈)) |
| 8 | eleq1 2849 | . . . . . 6 ⊢ (𝑢 = 𝑈 → (𝑢 ∈ (𝐼‘𝑥) ↔ 𝑈 ∈ (𝐼‘𝑥))) | |
| 9 | 8 | rabbidv 3420 | . . . . 5 ⊢ (𝑢 = 𝑈 → {𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)} = {𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) |
| 10 | 9 | fveq2d 6867 | . . . 4 ⊢ (𝑢 = 𝑈 → (♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) = (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)})) |
| 11 | sneq 4591 | . . . . . . 7 ⊢ (𝑢 = 𝑈 → {𝑢} = {𝑈}) | |
| 12 | 11 | eqeq2d 2772 | . . . . . 6 ⊢ (𝑢 = 𝑈 → ((𝐼‘𝑥) = {𝑢} ↔ (𝐼‘𝑥) = {𝑈})) |
| 13 | 12 | rabbidv 3420 | . . . . 5 ⊢ (𝑢 = 𝑈 → {𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}} = {𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}) |
| 14 | 13 | fveq2d 6867 | . . . 4 ⊢ (𝑢 = 𝑈 → (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}) = (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})) |
| 15 | 10, 14 | oveq12d 7410 | . . 3 ⊢ (𝑢 = 𝑈 → ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| 16 | eqid 2761 | . . 3 ⊢ (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}))) = (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}))) | |
| 17 | ovex 7425 | . . 3 ⊢ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})) ∈ V | |
| 18 | 15, 16, 17 | fvmpt 6971 | . 2 ⊢ (𝑈 ∈ 𝑉 → ((𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| 19 | 7, 18 | eqtrd 2796 | 1 ⊢ (𝑈 ∈ 𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1559 ∈ wcel 2141 {crab 3413 Vcvv 3453 {csn 4581 ↦ cmpt 5180 dom cdm 5645 ‘cfv 6517 (class class class)co 7392 +𝑒 cxad 13109 ♯chash 14340 Vtxcvtx 29143 iEdgciedg 29144 VtxDegcvtxdg 29612 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pr 5389 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-ov 7395 df-vtxdg 29613 |
| This theorem is referenced by: vtxdgfival 29616 vtxdun 29628 vtxdlfgrval 29632 vtxd0nedgb 29635 vtxdushgrfvedg 29637 vtxdginducedm1 29690 |
| Copyright terms: Public domain | W3C validator |