| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > vtxvalprc | Structured version Visualization version GIF version | ||
| Description: Degenerated case 4 for vertices: The set of vertices of a proper class is the empty set. (Contributed by AV, 12-Oct-2020.) |
| Ref | Expression |
|---|---|
| vtxvalprc | ⊢ (𝐶 ∉ V → (Vtx‘𝐶) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-nel 3071 | . 2 ⊢ (𝐶 ∉ V ↔ ¬ 𝐶 ∈ V) | |
| 2 | fvprc 6874 | . 2 ⊢ (¬ 𝐶 ∈ V → (Vtx‘𝐶) = ∅) | |
| 3 | 1, 2 | sylbi 220 | 1 ⊢ (𝐶 ∉ V → (Vtx‘𝐶) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1567 ∈ wcel 2149 ∉ wnel 3070 Vcvv 3463 ∅c0 4294 ‘cfv 6537 Vtxcvtx 29286 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-nul 5271 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 df-nel 3071 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-iota 6493 df-fv 6545 |
| This theorem is referenced by: wlk0prc 29942 |
| Copyright terms: Public domain | W3C validator |