| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uvtxnbgrvtx | Structured version Visualization version GIF version | ||
| Description: A universal vertex is neighbor of all other vertices. (Contributed by Alexander van der Vekens, 14-Oct-2017.) (Revised by AV, 30-Oct-2020.) |
| Ref | Expression |
|---|---|
| uvtxel.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| uvtxnbgrvtx | ⊢ (𝑁 ∈ (UnivVtx‘𝐺) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑁 ∈ (𝐺 NeighbVtx 𝑣)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uvtxel.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | 1 | vtxnbuvtx 29972 | . . 3 ⊢ (𝑁 ∈ (UnivVtx‘𝐺) → ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁)) |
| 3 | eleq1w 2843 | . . . . . . 7 ⊢ (𝑛 = 𝑣 → (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ↔ 𝑣 ∈ (𝐺 NeighbVtx 𝑁))) | |
| 4 | 3 | rspcva 3574 | . . . . . 6 ⊢ ((𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁)) → 𝑣 ∈ (𝐺 NeighbVtx 𝑁)) |
| 5 | nbgrsym 29944 | . . . . . . 7 ⊢ (𝑣 ∈ (𝐺 NeighbVtx 𝑁) ↔ 𝑁 ∈ (𝐺 NeighbVtx 𝑣)) | |
| 6 | 5 | a1i 11 | . . . . . 6 ⊢ (𝑁 ∈ (UnivVtx‘𝐺) → (𝑣 ∈ (𝐺 NeighbVtx 𝑁) ↔ 𝑁 ∈ (𝐺 NeighbVtx 𝑣))) |
| 7 | 4, 6 | syl5ibcom 248 | . . . . 5 ⊢ ((𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁)) → (𝑁 ∈ (UnivVtx‘𝐺) → 𝑁 ∈ (𝐺 NeighbVtx 𝑣))) |
| 8 | 7 | expcom 419 | . . . 4 ⊢ (∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁) → (𝑣 ∈ (𝑉 ∖ {𝑁}) → (𝑁 ∈ (UnivVtx‘𝐺) → 𝑁 ∈ (𝐺 NeighbVtx 𝑣)))) |
| 9 | 8 | com23 87 | . . 3 ⊢ (∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁) → (𝑁 ∈ (UnivVtx‘𝐺) → (𝑣 ∈ (𝑉 ∖ {𝑁}) → 𝑁 ∈ (𝐺 NeighbVtx 𝑣)))) |
| 10 | 2, 9 | mpcom 39 | . 2 ⊢ (𝑁 ∈ (UnivVtx‘𝐺) → (𝑣 ∈ (𝑉 ∖ {𝑁}) → 𝑁 ∈ (𝐺 NeighbVtx 𝑣))) |
| 11 | 10 | ralrimiv 3153 | 1 ⊢ (𝑁 ∈ (UnivVtx‘𝐺) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑁 ∈ (𝐺 NeighbVtx 𝑣)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∀wral 3076 ∖ cdif 3895 {csn 4583 ‘cfv 6538 (class class class)co 7420 Vtxcvtx 29574 NeighbVtx cnbgr 29913 UnivVtxcuvtx 29966 |
| 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 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-un 7751 |
| 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-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3899 df-un 3901 df-in 3903 df-ss 3914 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-1st 8001 df-2nd 8002 df-nbgr 29914 df-uvtx 29967 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |