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

Theorem vtxvalprc 29638
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 3066 . 2 (𝐶 ∉ V ↔ ¬ 𝐶 ∈ V)
2 fvprc 6888 . 2 (¬ 𝐶 ∈ V → (Vtx‘𝐶) = ∅)
31, 2sylbi 220 1 (𝐶 ∉ V → (Vtx‘𝐶) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1569   ∈ wcel 2146   ∉ wnel 3065  Vcvv 3454  ∅c0 4281  ‘cfv 6547  Vtxcvtx 29589
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-nel 3066  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6501  df-fv 6555
This theorem is used by:  wlk0prc  30248
  Copyright terms: Public domain W3C validator