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

Theorem vtxvalprc 29029
Description: Degenerated case 4 for vertices: The set of vertices of a proper class is the empty set. (Contributed by AV, 12-Oct-2020.)
Assertion
Ref Expression
vtxvalprc (𝐶 ∉ V → (Vtx‘𝐶) = ∅)

Proof of Theorem vtxvalprc
StepHypRef Expression
1 df-nel 3038 . 2 (𝐶 ∉ V ↔ ¬ 𝐶 ∈ V)
2 fvprc 6873 . 2 𝐶 ∈ V → (Vtx‘𝐶) = ∅)
31, 2sylbi 217 1 (𝐶 ∉ V → (Vtx‘𝐶) = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1540  wcel 2109  wnel 3037  Vcvv 3464  c0 4313  cfv 6536  Vtxcvtx 28980
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 2708  ax-nul 5281  ax-pr 5407
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 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nel 3038  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-br 5125  df-iota 6489  df-fv 6544
This theorem is referenced by:  wlk0prc  29639
  Copyright terms: Public domain W3C validator