Theorem usgreqdrusgr 29859

Description: If all vertices in a simple graph have the same degree, the graph is k-regular. (Contributed by AV, 26-Dec-2020.)

Hypotheses

Ref	Expression
isrusgr0.v	⊢ 𝑉 = (Vtx‘𝐺)
isrusgr0.d	⊢ 𝐷 = (VtxDeg‘𝐺)

Assertion

Ref	Expression
usgreqdrusgr	⊢ ((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ0* ∧ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾) → 𝐺 RegUSGraph 𝐾)

Distinct variable groups:   𝑣,𝐺   𝑣,𝐾

Allowed substitution hints:   𝐷(𝑣)   𝑉(𝑣)

Proof of Theorem usgreqdrusgr

Step	Hyp	Ref	Expression
1		isrusgr0.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
2		isrusgr0.d	. . . 4 ⊢ 𝐷 = (VtxDeg‘𝐺)
3	1, 2	isrusgr0 29857	. . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ0*) → (𝐺 RegUSGraph 𝐾 ↔ (𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ0* ∧ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾)))
4	3	3adant3 1148	. 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ0* ∧ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾) → (𝐺 RegUSGraph 𝐾 ↔ (𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ0* ∧ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾)))
5	4	ibir 271	1 ⊢ ((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ0* ∧ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾) → 𝐺 RegUSGraph 𝐾)

Syntax hints:   → wi 4   ↔ wb 209   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149  ∀wral 3085   class class class wbr 5113  ‘cfv 6537  ℕ₀^*cxnn0 12577  Vtxcvtx 29287  USGraphcusgr 29440  VtxDegcvtxdg 29756   RegUSGraph crusgr 29847

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-ext 2741  ax-sep 5261  ax-pr 5405

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-iota 6493  df-fv 6545  df-rgr 29848  df-rusgr 29849

This theorem is referenced by:  fusgrn0eqdrusgr  29861  frgrregorufrg  30618