| 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 29859 | . . 3 ⊢ (𝐺 ∈ FinUSGraph → ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0) |
| 3 | r19.26 3124 | . . . . . 6 ⊢ (∀𝑣 ∈ 𝑉 (((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ∧ (𝐷‘𝑣) = 𝐾) ↔ (∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ∧ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾)) | |
| 4 | isrusgr0.d | . . . . . . . . . . . 12 ⊢ 𝐷 = (VtxDeg‘𝐺) | |
| 5 | 4 | fveq1i 6882 | . . . . . . . . . . 11 ⊢ (𝐷‘𝑣) = ((VtxDeg‘𝐺)‘𝑣) |
| 6 | 5 | eqeq1i 2767 | . . . . . . . . . 10 ⊢ ((𝐷‘𝑣) = 𝐾 ↔ ((VtxDeg‘𝐺)‘𝑣) = 𝐾) |
| 7 | eleq1 2850 | . . . . . . . . . 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 3101 | . . . . . . 7 ⊢ (∀𝑣 ∈ 𝑉 (((VtxDeg‘𝐺)‘𝑣) ∈ ℕ0 ∧ (𝐷‘𝑣) = 𝐾) → ∀𝑣 ∈ 𝑉 𝐾 ∈ ℕ0) |
| 11 | rspn0 4310 | . . . . . . 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 |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1569 ∈ wcel 2142 ≠ wne 2957 ∀wral 3078 ∅c0 4285 ‘cfv 6536 ℕ0cn0 12510 Vtxcvtx 29357 FinUSGraphcfusgr 29677 VtxDegcvtxdg 29826 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-2o 8452 df-oadd 8455 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-dju 9894 df-card 9932 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-nn 12240 df-2 12309 df-n0 12511 df-xnn0 12584 df-z 12598 df-uz 12869 df-xadd 13144 df-fz 13542 df-hash 14374 df-vtx 29359 df-iedg 29360 df-edg 29409 df-uhgr 29419 df-upgr 29443 df-umgr 29444 df-uspgr 29511 df-usgr 29512 df-fusgr 29678 df-vtxdg 29827 |
| This theorem is used by: fusgrn0eqdrusgr 29931 frusgrnn0 29932 fusgreghash2wsp 30700 frrusgrord0lem 30701 |
| Copyright terms: Public domain | W3C validator |