![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > usgreqdrusgr | Structured version Visualization version GIF version |
Description: If all vertices in a simple graph have the same degree, the graph is k-regular. (Contributed by AV, 26-Dec-2020.) |
Ref | Expression |
---|---|
isrusgr0.v | ⊢ 𝑉 = (Vtx‘𝐺) |
isrusgr0.d | ⊢ 𝐷 = (VtxDeg‘𝐺) |
Ref | Expression |
---|---|
usgreqdrusgr | ⊢ ((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ0* ∧ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾) → 𝐺 RegUSGraph 𝐾) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isrusgr0.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | isrusgr0.d | . . . 4 ⊢ 𝐷 = (VtxDeg‘𝐺) | |
3 | 1, 2 | isrusgr0 29599 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ0*) → (𝐺 RegUSGraph 𝐾 ↔ (𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ0* ∧ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾))) |
4 | 3 | 3adant3 1131 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ0* ∧ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾) → (𝐺 RegUSGraph 𝐾 ↔ (𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ0* ∧ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾))) |
5 | 4 | ibir 268 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ0* ∧ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾) → 𝐺 RegUSGraph 𝐾) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 ∀wral 3059 class class class wbr 5148 ‘cfv 6563 ℕ0*cxnn0 12597 Vtxcvtx 29028 USGraphcusgr 29181 VtxDegcvtxdg 29498 RegUSGraph crusgr 29589 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-ral 3060 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-iota 6516 df-fv 6571 df-rgr 29590 df-rusgr 29591 |
This theorem is referenced by: fusgrn0eqdrusgr 29603 frgrregorufrg 30355 |
Copyright terms: Public domain | W3C validator |