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

Theorem cplgruvtxb 27182
 Description: A graph 𝐺 is complete iff each vertex is a universal vertex. (Contributed by Alexander van der Vekens, 14-Oct-2017.) (Revised by AV, 15-Feb-2022.)
Hypothesis
Ref Expression
cplgruvtxb.v 𝑉 = (Vtx‘𝐺)
Assertion
Ref Expression
cplgruvtxb (𝐺𝑊 → (𝐺 ∈ ComplGraph ↔ (UnivVtx‘𝐺) = 𝑉))

Proof of Theorem cplgruvtxb
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6643 . . 3 (𝑔 = 𝐺 → (UnivVtx‘𝑔) = (UnivVtx‘𝐺))
2 fveq2 6643 . . . 4 (𝑔 = 𝐺 → (Vtx‘𝑔) = (Vtx‘𝐺))
3 cplgruvtxb.v . . . 4 𝑉 = (Vtx‘𝐺)
42, 3syl6eqr 2874 . . 3 (𝑔 = 𝐺 → (Vtx‘𝑔) = 𝑉)
51, 4eqeq12d 2837 . 2 (𝑔 = 𝐺 → ((UnivVtx‘𝑔) = (Vtx‘𝑔) ↔ (UnivVtx‘𝐺) = 𝑉))
6 df-cplgr 27180 . 2 ComplGraph = {𝑔 ∣ (UnivVtx‘𝑔) = (Vtx‘𝑔)}
75, 6elab2g 3645 1 (𝐺𝑊 → (𝐺 ∈ ComplGraph ↔ (UnivVtx‘𝐺) = 𝑉))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   = wceq 1538   ∈ wcel 2115  ‘cfv 6328  Vtxcvtx 26768  UnivVtxcuvtx 27154  ComplGraphccplgr 27178 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 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793 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 2071  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-rab 3135  df-v 3473  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4267  df-if 4441  df-sn 4541  df-pr 4543  df-op 4547  df-uni 4812  df-br 5040  df-iota 6287  df-fv 6336  df-cplgr 27180 This theorem is referenced by:  iscplgr  27184  cusgruvtxb  27191  nbcplgr  27203
 Copyright terms: Public domain W3C validator