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

Theorem cplgr0v 27136
Description: A null graph (with no vertices) is a complete graph. (Contributed by Alexander van der Vekens, 13-Oct-2017.) (Revised by AV, 1-Nov-2020.)
Hypothesis
Ref Expression
cplgr0v.v 𝑉 = (Vtx‘𝐺)
Assertion
Ref Expression
cplgr0v ((𝐺𝑊𝑉 = ∅) → 𝐺 ∈ ComplGraph)

Proof of Theorem cplgr0v
Dummy variable 𝑣 is distinct from all other variables.
StepHypRef Expression
1 rzal 4449 . . 3 (𝑉 = ∅ → ∀𝑣𝑉 𝑣 ∈ (UnivVtx‘𝐺))
21adantl 482 . 2 ((𝐺𝑊𝑉 = ∅) → ∀𝑣𝑉 𝑣 ∈ (UnivVtx‘𝐺))
3 cplgr0v.v . . . 4 𝑉 = (Vtx‘𝐺)
43iscplgr 27124 . . 3 (𝐺𝑊 → (𝐺 ∈ ComplGraph ↔ ∀𝑣𝑉 𝑣 ∈ (UnivVtx‘𝐺)))
54adantr 481 . 2 ((𝐺𝑊𝑉 = ∅) → (𝐺 ∈ ComplGraph ↔ ∀𝑣𝑉 𝑣 ∈ (UnivVtx‘𝐺)))
62, 5mpbird 258 1 ((𝐺𝑊𝑉 = ∅) → 𝐺 ∈ ComplGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1528  wcel 2105  wral 3135  c0 4288  cfv 6348  Vtxcvtx 26708  UnivVtxcuvtx 27094  ComplGraphccplgr 27118
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-ral 3140  df-rex 3141  df-rab 3144  df-v 3494  df-sbc 3770  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4831  df-br 5058  df-opab 5120  df-mpt 5138  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-iota 6307  df-fun 6350  df-fv 6356  df-ov 7148  df-uvtx 27095  df-cplgr 27120
This theorem is referenced by:  cusgr0v  27137
  Copyright terms: Public domain W3C validator