| 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 29789 | . . 3 ⊢ (𝐺 ∈ FinUSGraph → ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0) |
| 3 | r19.26 3131 | . . . . . 6 ⊢ (∀𝑣 ∈ 𝑉 (((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ∧ (𝐷‘𝑣) = 𝐾) ↔ (∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ∧ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾)) | |
| 4 | isrusgr0.d | . . . . . . . . . . . 12 ⊢ 𝐷 = (VtxDeg‘𝐺) | |
| 5 | 4 | fveq1i 6883 | . . . . . . . . . . 11 ⊢ (𝐷‘𝑣) = ((VtxDeg‘𝐺)‘𝑣) |
| 6 | 5 | eqeq1i 2774 | . . . . . . . . . 10 ⊢ ((𝐷‘𝑣) = 𝐾 ↔ ((VtxDeg‘𝐺)‘𝑣) = 𝐾) |
| 7 | eleq1 2857 | . . . . . . . . . 10 ⊢ (((VtxDeg‘𝐺)‘𝑣) = 𝐾 → (((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ↔ 𝐾 ∈ ℕ0)) | |
| 8 | 6, 7 | sylbi 220 | . . . . . . . . 9 ⊢ ((𝐷‘𝑣) = 𝐾 → (((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ↔ 𝐾 ∈ ℕ0)) |
| 9 | 8 | biimpac 483 | . . . . . . . 8 ⊢ ((((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ∧ (𝐷‘𝑣) = 𝐾) → 𝐾 ∈ ℕ0) |
| 10 | 9 | ralimi 3108 | . . . . . . 7 ⊢ (∀𝑣 ∈ 𝑉 (((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ∧ (𝐷‘𝑣) = 𝐾) → ∀𝑣 ∈ 𝑉 𝐾 ∈ ℕ0) |
| 11 | rspn0 4317 | . . . . . . 7 ⊢ (𝑉 ≠ ∅ → (∀𝑣 ∈ 𝑉 𝐾 ∈ ℕ0 → 𝐾 ∈ ℕ0)) | |
| 12 | 10, 11 | syl5com 32 | . . . . . 6 ⊢ (∀𝑣 ∈ 𝑉 (((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ∧ (𝐷‘𝑣) = 𝐾) → (𝑉 ≠ ∅ → 𝐾 ∈ ℕ0)) |
| 13 | 3, 12 | sylbir 238 | . . . . 5 ⊢ ((∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ∧ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾) → (𝑉 ≠ ∅ → 𝐾 ∈ ℕ0)) |
| 14 | 13 | ex 417 | . . . 4 ⊢ (∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 → (𝑉 ≠ ∅ → 𝐾 ∈ ℕ0))) |
| 15 | 14 | com23 87 | . . 3 ⊢ (∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 → (𝑉 ≠ ∅ → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 → 𝐾 ∈ ℕ0))) |
| 16 | 2, 15 | syl 18 | . 2 ⊢ (𝐺 ∈ FinUSGraph → (𝑉 ≠ ∅ → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 → 𝐾 ∈ ℕ0))) |
| 17 | 16 | imp 411 | 1 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑉 ≠ ∅) → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 → 𝐾 ∈ ℕ0)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∀wral 3085 ∅c0 4292 ‘cfv 6537 ℕ0cn0 12504 Vtxcvtx 29287 FinUSGraphcfusgr 29607 VtxDegcvtxdg 29756 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3375 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-2o 8454 df-oadd 8457 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-dju 9887 df-card 9925 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-n0 12505 df-xnn0 12578 df-z 12592 df-uz 12863 df-xadd 13138 df-fz 13536 df-hash 14367 df-vtx 29289 df-iedg 29290 df-edg 29339 df-uhgr 29349 df-upgr 29373 df-umgr 29374 df-uspgr 29441 df-usgr 29442 df-fusgr 29608 df-vtxdg 29757 |
| This theorem is referenced by: fusgrn0eqdrusgr 29861 frusgrnn0 29862 fusgreghash2wsp 30630 frrusgrord0lem 30631 |
| Copyright terms: Public domain | W3C validator |