![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fusgrregdegfi | Structured version Visualization version GIF version |
Description: In a nonempty finite simple graph, the degree of each vertex is finite. (Contributed by Alexander van der Vekens, 6-Mar-2018.) (Revised by AV, 19-Dec-2020.) |
Ref | Expression |
---|---|
isrusgr0.v | ⊢ 𝑉 = (Vtx‘𝐺) |
isrusgr0.d | ⊢ 𝐷 = (VtxDeg‘𝐺) |
Ref | Expression |
---|---|
fusgrregdegfi | ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑉 ≠ ∅) → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 → 𝐾 ∈ ℕ0)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isrusgr0.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | 1 | vtxdgfusgr 28332 | . . 3 ⊢ (𝐺 ∈ FinUSGraph → ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0) |
3 | r19.26 3112 | . . . . . 6 ⊢ (∀𝑣 ∈ 𝑉 (((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ∧ (𝐷‘𝑣) = 𝐾) ↔ (∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ∧ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾)) | |
4 | isrusgr0.d | . . . . . . . . . . . 12 ⊢ 𝐷 = (VtxDeg‘𝐺) | |
5 | 4 | fveq1i 6840 | . . . . . . . . . . 11 ⊢ (𝐷‘𝑣) = ((VtxDeg‘𝐺)‘𝑣) |
6 | 5 | eqeq1i 2741 | . . . . . . . . . 10 ⊢ ((𝐷‘𝑣) = 𝐾 ↔ ((VtxDeg‘𝐺)‘𝑣) = 𝐾) |
7 | eleq1 2825 | . . . . . . . . . 10 ⊢ (((VtxDeg‘𝐺)‘𝑣) = 𝐾 → (((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ↔ 𝐾 ∈ ℕ0)) | |
8 | 6, 7 | sylbi 216 | . . . . . . . . 9 ⊢ ((𝐷‘𝑣) = 𝐾 → (((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ↔ 𝐾 ∈ ℕ0)) |
9 | 8 | biimpac 479 | . . . . . . . 8 ⊢ ((((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ∧ (𝐷‘𝑣) = 𝐾) → 𝐾 ∈ ℕ0) |
10 | 9 | ralimi 3084 | . . . . . . 7 ⊢ (∀𝑣 ∈ 𝑉 (((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ∧ (𝐷‘𝑣) = 𝐾) → ∀𝑣 ∈ 𝑉 𝐾 ∈ ℕ0) |
11 | rspn0 4310 | . . . . . . 7 ⊢ (𝑉 ≠ ∅ → (∀𝑣 ∈ 𝑉 𝐾 ∈ ℕ0 → 𝐾 ∈ ℕ0)) | |
12 | 10, 11 | syl5com 31 | . . . . . 6 ⊢ (∀𝑣 ∈ 𝑉 (((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ∧ (𝐷‘𝑣) = 𝐾) → (𝑉 ≠ ∅ → 𝐾 ∈ ℕ0)) |
13 | 3, 12 | sylbir 234 | . . . . 5 ⊢ ((∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ∧ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾) → (𝑉 ≠ ∅ → 𝐾 ∈ ℕ0)) |
14 | 13 | ex 413 | . . . 4 ⊢ (∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 → (𝑉 ≠ ∅ → 𝐾 ∈ ℕ0))) |
15 | 14 | com23 86 | . . 3 ⊢ (∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 → (𝑉 ≠ ∅ → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 → 𝐾 ∈ ℕ0))) |
16 | 2, 15 | syl 17 | . 2 ⊢ (𝐺 ∈ FinUSGraph → (𝑉 ≠ ∅ → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 → 𝐾 ∈ ℕ0))) |
17 | 16 | imp 407 | 1 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑉 ≠ ∅) → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 → 𝐾 ∈ ℕ0)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ≠ wne 2941 ∀wral 3062 ∅c0 4280 ‘cfv 6493 ℕ0cn0 12409 Vtxcvtx 27833 FinUSGraphcfusgr 28150 VtxDegcvtxdg 28299 |
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 5240 ax-sep 5254 ax-nul 5261 ax-pow 5318 ax-pr 5382 ax-un 7668 ax-cnex 11103 ax-resscn 11104 ax-1cn 11105 ax-icn 11106 ax-addcl 11107 ax-addrcl 11108 ax-mulcl 11109 ax-mulrcl 11110 ax-mulcom 11111 ax-addass 11112 ax-mulass 11113 ax-distr 11114 ax-i2m1 11115 ax-1ne0 11116 ax-1rid 11117 ax-rnegex 11118 ax-rrecex 11119 ax-cnre 11120 ax-pre-lttri 11121 ax-pre-lttrn 11122 ax-pre-ltadd 11123 ax-pre-mulgt0 11124 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 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 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3351 df-reu 3352 df-rab 3406 df-v 3445 df-sbc 3738 df-csb 3854 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3927 df-nul 4281 df-if 4485 df-pw 4560 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-int 4906 df-iun 4954 df-br 5104 df-opab 5166 df-mpt 5187 df-tr 5221 df-id 5529 df-eprel 5535 df-po 5543 df-so 5544 df-fr 5586 df-we 5588 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6251 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6445 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7309 df-ov 7356 df-oprab 7357 df-mpo 7358 df-om 7799 df-1st 7917 df-2nd 7918 df-frecs 8208 df-wrecs 8239 df-recs 8313 df-rdg 8352 df-1o 8408 df-2o 8409 df-oadd 8412 df-er 8644 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-dju 9833 df-card 9871 df-pnf 11187 df-mnf 11188 df-xr 11189 df-ltxr 11190 df-le 11191 df-sub 11383 df-neg 11384 df-nn 12150 df-2 12212 df-n0 12410 df-xnn0 12482 df-z 12496 df-uz 12760 df-xadd 13026 df-fz 13417 df-hash 14223 df-vtx 27835 df-iedg 27836 df-edg 27885 df-uhgr 27895 df-upgr 27919 df-umgr 27920 df-uspgr 27987 df-usgr 27988 df-fusgr 28151 df-vtxdg 28300 |
This theorem is referenced by: fusgrn0eqdrusgr 28404 frusgrnn0 28405 fusgreghash2wsp 29168 frrusgrord0lem 29169 |
Copyright terms: Public domain | W3C validator |