Metamath Proof Explorer


Theorem clnbgrssvtx

Description: The closed neighborhood of a vertex K in a graph is a subset of all vertices of the graph. (Contributed by AV, 9-May-2025)

Ref Expression
Hypothesis clnbgrvtxel.v V = Vtx G
Assertion clnbgrssvtx Could not format assertion : No typesetting found for |- ( G ClNeighbVtx K ) C_ V with typecode |-

Proof

Step Hyp Ref Expression
1 clnbgrvtxel.v V = Vtx G
2 1 clnbgrisvtx Could not format ( n e. ( G ClNeighbVtx K ) -> n e. V ) : No typesetting found for |- ( n e. ( G ClNeighbVtx K ) -> n e. V ) with typecode |-
3 2 ssriv Could not format ( G ClNeighbVtx K ) C_ V : No typesetting found for |- ( G ClNeighbVtx K ) C_ V with typecode |-