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

Theorem uvtxval 26512
 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 26511 . . 3 UnivVtx = (𝑔 ∈ V ↦ {𝑣 ∈ (Vtx‘𝑔) ∣ ∀𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑣})𝑛 ∈ (𝑔 NeighbVtx 𝑣)})
2 fveq2 6333 . . . . . 6 (𝑔 = 𝐺 → (Vtx‘𝑔) = (Vtx‘𝐺))
3 uvtxval.v . . . . . 6 𝑉 = (Vtx‘𝐺)
42, 3syl6eqr 2823 . . . . 5 (𝑔 = 𝐺 → (Vtx‘𝑔) = 𝑉)
54difeq1d 3878 . . . 4 (𝑔 = 𝐺 → ((Vtx‘𝑔) ∖ {𝑣}) = (𝑉 ∖ {𝑣}))
6 oveq1 6803 . . . . 5 (𝑔 = 𝐺 → (𝑔 NeighbVtx 𝑣) = (𝐺 NeighbVtx 𝑣))
76eleq2d 2836 . . . 4 (𝑔 = 𝐺 → (𝑛 ∈ (𝑔 NeighbVtx 𝑣) ↔ 𝑛 ∈ (𝐺 NeighbVtx 𝑣)))
85, 7raleqbidv 3301 . . 3 (𝑔 = 𝐺 → (∀𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑣})𝑛 ∈ (𝑔 NeighbVtx 𝑣) ↔ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)))
91, 8fvmptrabfv 6453 . 2 (UnivVtx‘𝐺) = {𝑣 ∈ (Vtx‘𝐺) ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)}
103eqcomi 2780 . . 3 (Vtx‘𝐺) = 𝑉
1110rabeqi 3343 . 2 {𝑣 ∈ (Vtx‘𝐺) ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)} = {𝑣𝑉 ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)}
129, 11eqtri 2793 1 (UnivVtx‘𝐺) = {𝑣𝑉 ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)}
 Colors of variables: wff setvar class Syntax hints:   = wceq 1631   ∈ wcel 2145  ∀wral 3061  {crab 3065   ∖ cdif 3720  {csn 4317  ‘cfv 6030  (class class class)co 6796  Vtxcvtx 26095   NeighbVtx cnbgr 26447  UnivVtxcuvtx 26510 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4916  ax-nul 4924  ax-pow 4975  ax-pr 5035 This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3353  df-sbc 3588  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4227  df-sn 4318  df-pr 4320  df-op 4324  df-uni 4576  df-br 4788  df-opab 4848  df-mpt 4865  df-id 5158  df-xp 5256  df-rel 5257  df-cnv 5258  df-co 5259  df-dm 5260  df-iota 5993  df-fun 6032  df-fv 6038  df-ov 6799  df-uvtx 26511 This theorem is referenced by:  uvtxel  26514  uvtx0  26521  isuvtx  26522  uvtx01vtx  26525  uvtxusgr  26532
 Copyright terms: Public domain W3C validator