| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fusgrvtxdgonume | Structured version Visualization version GIF version | ||
| Description: The number of vertices of odd degree is even in a finite simple graph. Proposition 1.2.1 in [Diestel] p. 5. See also remark about equation (2) in section I.1 in [Bollobas] p. 4. (Contributed by AV, 27-Dec-2021.) |
| Ref | Expression |
|---|---|
| finsumvtxdgeven.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| finsumvtxdgeven.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| finsumvtxdgeven.d | ⊢ 𝐷 = (VtxDeg‘𝐺) |
| Ref | Expression |
|---|---|
| fusgrvtxdgonume | ⊢ (𝐺 ∈ FinUSGraph → 2 ∥ (♯‘{𝑣 ∈ 𝑉 ∣ ¬ 2 ∥ (𝐷‘𝑣)})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | finsumvtxdgeven.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | finsumvtxdgeven.i | . . 3 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 3 | 1, 2 | fusgrfupgrfs 29353 | . 2 ⊢ (𝐺 ∈ FinUSGraph → (𝐺 ∈ UPGraph ∧ 𝑉 ∈ Fin ∧ 𝐼 ∈ Fin)) |
| 4 | finsumvtxdgeven.d | . . 3 ⊢ 𝐷 = (VtxDeg‘𝐺) | |
| 5 | 1, 2, 4 | vtxdgoddnumeven 29576 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑉 ∈ Fin ∧ 𝐼 ∈ Fin) → 2 ∥ (♯‘{𝑣 ∈ 𝑉 ∣ ¬ 2 ∥ (𝐷‘𝑣)})) |
| 6 | 3, 5 | syl 17 | 1 ⊢ (𝐺 ∈ FinUSGraph → 2 ∥ (♯‘{𝑣 ∈ 𝑉 ∣ ¬ 2 ∥ (𝐷‘𝑣)})) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 {crab 3397 class class class wbr 5096 ‘cfv 6490 Fincfn 8881 2c2 12198 ♯chash 14251 ∥ cdvds 16177 Vtxcvtx 29018 iEdgciedg 29019 UPGraphcupgr 29102 FinUSGraphcfusgr 29338 VtxDegcvtxdg 29488 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-inf2 9548 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 ax-pre-sup 11102 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-int 4901 df-iun 4946 df-disj 5064 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-se 5576 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-isom 6499 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-oadd 8399 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-fin 8885 df-sup 9343 df-oi 9413 df-dju 9811 df-card 9849 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-div 11793 df-nn 12144 df-2 12206 df-3 12207 df-n0 12400 df-xnn0 12473 df-z 12487 df-uz 12750 df-rp 12904 df-xadd 13025 df-fz 13422 df-fzo 13569 df-seq 13923 df-exp 13983 df-hash 14252 df-cj 15020 df-re 15021 df-im 15022 df-sqrt 15156 df-abs 15157 df-clim 15409 df-sum 15608 df-dvds 16178 df-vtx 29020 df-iedg 29021 df-edg 29070 df-uhgr 29080 df-upgr 29104 df-umgr 29105 df-uspgr 29172 df-usgr 29173 df-fusgr 29339 df-vtxdg 29489 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |