![]() |
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 27953 | . . . 4 ⊢ (𝑈 ∈ 𝑉 → 𝐺 ∈ V) |
3 | vtxdgval.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
4 | vtxdgval.a | . . . . 5 ⊢ 𝐴 = dom 𝐼 | |
5 | 1, 3, 4 | vtxdgfval 28415 | . . . 4 ⊢ (𝐺 ∈ V → (VtxDeg‘𝐺) = (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))) |
6 | 2, 5 | syl 17 | . . 3 ⊢ (𝑈 ∈ 𝑉 → (VtxDeg‘𝐺) = (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))) |
7 | 6 | fveq1d 6844 | . 2 ⊢ (𝑈 ∈ 𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))‘𝑈)) |
8 | eleq1 2825 | . . . . . 6 ⊢ (𝑢 = 𝑈 → (𝑢 ∈ (𝐼‘𝑥) ↔ 𝑈 ∈ (𝐼‘𝑥))) | |
9 | 8 | rabbidv 3415 | . . . . 5 ⊢ (𝑢 = 𝑈 → {𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)} = {𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) |
10 | 9 | fveq2d 6846 | . . . 4 ⊢ (𝑢 = 𝑈 → (♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) = (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)})) |
11 | sneq 4596 | . . . . . . 7 ⊢ (𝑢 = 𝑈 → {𝑢} = {𝑈}) | |
12 | 11 | eqeq2d 2747 | . . . . . 6 ⊢ (𝑢 = 𝑈 → ((𝐼‘𝑥) = {𝑢} ↔ (𝐼‘𝑥) = {𝑈})) |
13 | 12 | rabbidv 3415 | . . . . 5 ⊢ (𝑢 = 𝑈 → {𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}} = {𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}) |
14 | 13 | fveq2d 6846 | . . . 4 ⊢ (𝑢 = 𝑈 → (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}) = (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})) |
15 | 10, 14 | oveq12d 7375 | . . 3 ⊢ (𝑢 = 𝑈 → ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
16 | eqid 2736 | . . 3 ⊢ (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}))) = (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}))) | |
17 | ovex 7390 | . . 3 ⊢ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})) ∈ V | |
18 | 15, 16, 17 | fvmpt 6948 | . 2 ⊢ (𝑈 ∈ 𝑉 → ((𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
19 | 7, 18 | eqtrd 2776 | 1 ⊢ (𝑈 ∈ 𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2106 {crab 3407 Vcvv 3445 {csn 4586 ↦ cmpt 5188 dom cdm 5633 ‘cfv 6496 (class class class)co 7357 +𝑒 cxad 13031 ♯chash 14230 Vtxcvtx 27947 iEdgciedg 27948 VtxDegcvtxdg 28413 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pr 5384 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-id 5531 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-ov 7360 df-vtxdg 28414 |
This theorem is referenced by: vtxdgfival 28417 vtxdun 28429 vtxdlfgrval 28433 vtxd0nedgb 28436 vtxdushgrfvedg 28438 vtxdginducedm1 28491 |
Copyright terms: Public domain | W3C validator |