Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  isrusgr Structured version   Visualization version   GIF version

Theorem isrusgr 27392
 Description: The property of being a k-regular simple graph. (Contributed by Alexander van der Vekens, 7-Jul-2018.) (Revised by AV, 18-Dec-2020.)
Assertion
Ref Expression
isrusgr ((𝐺𝑊𝐾𝑍) → (𝐺 RegUSGraph 𝐾 ↔ (𝐺 ∈ USGraph ∧ 𝐺 RegGraph 𝐾)))

Proof of Theorem isrusgr
Dummy variables 𝑔 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1 2877 . . . 4 (𝑔 = 𝐺 → (𝑔 ∈ USGraph ↔ 𝐺 ∈ USGraph))
21adantr 484 . . 3 ((𝑔 = 𝐺𝑘 = 𝐾) → (𝑔 ∈ USGraph ↔ 𝐺 ∈ USGraph))
3 breq12 5038 . . 3 ((𝑔 = 𝐺𝑘 = 𝐾) → (𝑔 RegGraph 𝑘𝐺 RegGraph 𝐾))
42, 3anbi12d 633 . 2 ((𝑔 = 𝐺𝑘 = 𝐾) → ((𝑔 ∈ USGraph ∧ 𝑔 RegGraph 𝑘) ↔ (𝐺 ∈ USGraph ∧ 𝐺 RegGraph 𝐾)))
5 df-rusgr 27389 . 2 RegUSGraph = {⟨𝑔, 𝑘⟩ ∣ (𝑔 ∈ USGraph ∧ 𝑔 RegGraph 𝑘)}
64, 5brabga 5389 1 ((𝐺𝑊𝐾𝑍) → (𝐺 RegUSGraph 𝐾 ↔ (𝐺 ∈ USGraph ∧ 𝐺 RegGraph 𝐾)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111   class class class wbr 5033  USGraphcusgr 26983   RegGraph crgr 27386   RegUSGraph crusgr 27387 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5170  ax-nul 5177  ax-pr 5298 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-v 3443  df-dif 3885  df-un 3887  df-nul 4246  df-if 4428  df-sn 4528  df-pr 4530  df-op 4534  df-br 5034  df-opab 5096  df-rusgr 27389 This theorem is referenced by:  rusgrprop  27393  isrusgr0  27397  usgr0edg0rusgr  27406  0vtxrusgr  27408
 Copyright terms: Public domain W3C validator