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

Theorem vtxvalprc 29505
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 3062 . 2 (𝐶 ∉ V ↔ ¬ 𝐶 ∈ V)
2 fvprc 6871 . 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 1570  wcel 2145  wnel 3061  Vcvv 3450  c0 4279  cfv 6533  Vtxcvtx 29456
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-nul 5263  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-nel 3062  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6489  df-fv 6541
This theorem is used by:  wlk0prc  30115
  Copyright terms: Public domain W3C validator