Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > uvtxnbgrss | Structured version Visualization version GIF version |
Description: A universal vertex has all other vertices as neighbors. (Contributed by Alexander van der Vekens, 14-Oct-2017.) (Revised by AV, 30-Oct-2020.) |
Ref | Expression |
---|---|
uvtxel.v | ⊢ 𝑉 = (Vtx‘𝐺) |
Ref | Expression |
---|---|
uvtxnbgrss | ⊢ (𝑁 ∈ (UnivVtx‘𝐺) → (𝑉 ∖ {𝑁}) ⊆ (𝐺 NeighbVtx 𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uvtxel.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | 1 | vtxnbuvtx 27451 | . 2 ⊢ (𝑁 ∈ (UnivVtx‘𝐺) → ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁)) |
3 | dfss3 3879 | . 2 ⊢ ((𝑉 ∖ {𝑁}) ⊆ (𝐺 NeighbVtx 𝑁) ↔ ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁)) | |
4 | 2, 3 | sylibr 237 | 1 ⊢ (𝑁 ∈ (UnivVtx‘𝐺) → (𝑉 ∖ {𝑁}) ⊆ (𝐺 NeighbVtx 𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1543 ∈ wcel 2110 ∀wral 3054 ∖ cdif 3854 ⊆ wss 3857 {csn 4531 ‘cfv 6369 (class class class)co 7202 Vtxcvtx 27059 NeighbVtx cnbgr 27392 UnivVtxcuvtx 27445 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2706 ax-sep 5181 ax-nul 5188 ax-pr 5311 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2537 df-eu 2566 df-clab 2713 df-cleq 2726 df-clel 2812 df-nfc 2882 df-ne 2936 df-ral 3059 df-rex 3060 df-rab 3063 df-v 3403 df-sbc 3688 df-dif 3860 df-un 3862 df-in 3864 df-ss 3874 df-nul 4228 df-if 4430 df-sn 4532 df-pr 4534 df-op 4538 df-uni 4810 df-br 5044 df-opab 5106 df-mpt 5125 df-id 5444 df-xp 5546 df-rel 5547 df-cnv 5548 df-co 5549 df-dm 5550 df-iota 6327 df-fun 6371 df-fv 6377 df-ov 7205 df-uvtx 27446 |
This theorem is referenced by: uvtxnbgr 27460 |
Copyright terms: Public domain | W3C validator |