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

Theorem uvtxval 30025
Description: The set of all universal vertices. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 29-Oct-2020.) (Revised by AV, 14-Feb-2022.)
Hypothesis
Ref Expression
uvtxval.v 𝑉 = (Vtx‘𝐺)
Assertion
Ref Expression
uvtxval (UnivVtx‘𝐺) = {𝑣 ∈ 𝑉 ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)}
Distinct variable groups:   𝑛,𝐺,𝑣   𝑛,𝑉,𝑣

Proof of Theorem uvtxval
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 df-uvtx 30024 . . 3 UnivVtx = (𝑔 ∈ V ↦ {𝑣 ∈ (Vtx‘𝑔) ∣ ∀𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑣})𝑛 ∈ (𝑔 NeighbVtx 𝑣)})
2 fveq2 6916 . . . . . 6 (𝑔 = 𝐺 → (Vtx‘𝑔) = (Vtx‘𝐺))
3 uvtxval.v . . . . . 6 𝑉 = (Vtx‘𝐺)
42, 3eqtr4di 2816 . . . . 5 (𝑔 = 𝐺 → (Vtx‘𝑔) = 𝑉)
54difeq1d 4065 . . . 4 (𝑔 = 𝐺 → ((Vtx‘𝑔) ∖ {𝑣}) = (𝑉 ∖ {𝑣}))
6 oveq1 7458 . . . . 5 (𝑔 = 𝐺 → (𝑔 NeighbVtx 𝑣) = (𝐺 NeighbVtx 𝑣))
76eleq2d 2850 . . . 4 (𝑔 = 𝐺 → (𝑛 ∈ (𝑔 NeighbVtx 𝑣) ↔ 𝑛 ∈ (𝐺 NeighbVtx 𝑣)))
85, 7raleqbidv 3338 . . 3 (𝑔 = 𝐺 → (∀𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑣})𝑛 ∈ (𝑔 NeighbVtx 𝑣) ↔ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)))
91, 8fvmptrabfv 7057 . 2 (UnivVtx‘𝐺) = {𝑣 ∈ (Vtx‘𝐺) ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)}
103eqcomi 2772 . . 3 (Vtx‘𝐺) = 𝑉
1110rabeqi 3429 . 2 {𝑣 ∈ (Vtx‘𝐺) ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)} = {𝑣 ∈ 𝑉 ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)}
129, 11eqtri 2786 1 (UnivVtx‘𝐺) = {𝑣 ∈ 𝑉 ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416   ∖ cdif 4048  {csn 4588  ‘cfv 6566  (class class class)co 7451  Vtxcvtx 29631   NeighbVtx cnbgr 29970  UnivVtxcuvtx 30023
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-uvtx 30024
This theorem is used by:  uvtxel  30026  uvtx0  30032  isuvtx  30033  uvtx01vtx  30035  uvtxusgr  30040
  Copyright terms: Public domain W3C validator