| 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 3065 | . 2 ⊢ (𝐶 ∉ V ↔ ¬ 𝐶 ∈ V) | |
| 2 | fvprc 6873 | . 2 ⊢ (¬ 𝐶 ∈ V → (Vtx‘𝐶) = ∅) | |
| 3 | 1, 2 | sylbi 220 | 1 ⊢ (𝐶 ∉ V → (Vtx‘𝐶) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1570 ∈ wcel 2143 ∉ wnel 3064 Vcvv 3455 ∅c0 4286 ‘cfv 6536 Vtxcvtx 29346 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-nul 5269 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-nel 3065 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-iota 6492 df-fv 6544 |
| This theorem is referenced by: wlk0prc 30002 |
| Copyright terms: Public domain | W3C validator |