Theorem nbgrssvtx 29245

Description: The neighbors of a vertex 𝐾 in a graph form a subset of all vertices of the graph. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 26-Oct-2020.) (Revised by AV, 12-Feb-2022.)

Hypothesis

Ref	Expression
nbgrisvtx.v	⊢ 𝑉 = (Vtx‘𝐺)

Assertion

Ref	Expression
nbgrssvtx	⊢ (𝐺 NeighbVtx 𝐾) ⊆ 𝑉

Proof of Theorem nbgrssvtx

Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nbgrisvtx.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
2	1	nbgrisvtx 29244	. 2 ⊢ (𝑛 ∈ (𝐺 NeighbVtx 𝐾) → 𝑛 ∈ 𝑉)
3	2	ssriv 3947	1 ⊢ (𝐺 NeighbVtx 𝐾) ⊆ 𝑉

Syntax hints:   = wceq 1540   ⊆ wss 3911  ‘cfv 6499  (class class class)co 7369  Vtxcvtx 28899   NeighbVtx cnbgr 29235

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5246  ax-nul 5256  ax-pr 5382  ax-un 7691

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6452  df-fun 6501  df-fv 6507  df-ov 7372  df-oprab 7373  df-mpo 7374  df-1st 7947  df-2nd 7948  df-nbgr 29236

This theorem is referenced by:  fusgreghash2wspv  30237