
theorem Th63: :: Simplicial0
  for G being complete _Graph, v being Vertex of G holds v is simplicial
proof
  let G be complete _Graph, v be Vertex of G;
  now
    let G2 be AdjGraph of G,{v};
    G2 is inducedSubgraph of G,G.AdjacentSet({v}) by Def5;
    hence G2 is complete by Th62;
  end;
  hence thesis;
end;
