Theorem rusgrrgr 30153

Description: A k-regular simple graph is a k-regular graph. (Contributed by Alexander van der Vekens, 8-Jul-2018.) (Revised by AV, 18-Dec-2020.)

Assertion

Ref	Expression
rusgrrgr	⊢ (𝐺 RegUSGraph 𝐾 → 𝐺 RegGraph 𝐾)

Proof of Theorem rusgrrgr

Step	Hyp	Ref	Expression
1		rusgrprop 30152	. 2 ⊢ (𝐺 RegUSGraph 𝐾 → (𝐺 ∈ USGraph ∧ 𝐺 RegGraph 𝐾))
2	1	simprd 501	1 ⊢ (𝐺 RegUSGraph 𝐾 → 𝐺 RegGraph 𝐾)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2144   class class class wbr 5102  USGraphcusgr 29739   RegGraph crgr 30145   RegUSGraph crusgr 30146

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5657  df-rusgr 30148

This theorem is used by:  0grrgr  30170  rgrprc  30181  frrusgrord  30951