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

Theorem iscplgrnb 28673
Description: A graph is complete iff all vertices are neighbors of all vertices. (Contributed by AV, 1-Nov-2020.)
Hypothesis
Ref Expression
cplgruvtxb.v 𝑉 = (Vtx‘𝐺)
Assertion
Ref Expression
iscplgrnb (𝐺𝑊 → (𝐺 ∈ ComplGraph ↔ ∀𝑣𝑉𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)))
Distinct variable groups:   𝑣,𝐺   𝑣,𝑉   𝑛,𝐺,𝑣   𝑛,𝑉   𝑣,𝑊
Allowed substitution hint:   𝑊(𝑛)

Proof of Theorem iscplgrnb
StepHypRef Expression
1 cplgruvtxb.v . . 3 𝑉 = (Vtx‘𝐺)
21iscplgr 28672 . 2 (𝐺𝑊 → (𝐺 ∈ ComplGraph ↔ ∀𝑣𝑉 𝑣 ∈ (UnivVtx‘𝐺)))
31uvtxel 28645 . . . . 5 (𝑣 ∈ (UnivVtx‘𝐺) ↔ (𝑣𝑉 ∧ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)))
43a1i 11 . . . 4 (𝐺𝑊 → (𝑣 ∈ (UnivVtx‘𝐺) ↔ (𝑣𝑉 ∧ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣))))
54baibd 541 . . 3 ((𝐺𝑊𝑣𝑉) → (𝑣 ∈ (UnivVtx‘𝐺) ↔ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)))
65ralbidva 3176 . 2 (𝐺𝑊 → (∀𝑣𝑉 𝑣 ∈ (UnivVtx‘𝐺) ↔ ∀𝑣𝑉𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)))
72, 6bitrd 279 1 (𝐺𝑊 → (𝐺 ∈ ComplGraph ↔ ∀𝑣𝑉𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 397   = wceq 1542  wcel 2107  wral 3062  cdif 3946  {csn 4629  cfv 6544  (class class class)co 7409  Vtxcvtx 28256   NeighbVtx cnbgr 28589  UnivVtxcuvtx 28642  ComplGraphccplgr 28666
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-iota 6496  df-fun 6546  df-fv 6552  df-ov 7412  df-uvtx 28643  df-cplgr 28668
This theorem is referenced by:  iscplgredg  28674  iscusgredg  28680  cplgr3v  28692
  Copyright terms: Public domain W3C validator