| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uvtxval | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| uvtxval.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| uvtxval | ⊢ (UnivVtx‘𝐺) = {𝑣 ∈ 𝑉 ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-uvtx 29973 | . . 3 ⊢ UnivVtx = (𝑔 ∈ V ↦ {𝑣 ∈ (Vtx‘𝑔) ∣ ∀𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑣})𝑛 ∈ (𝑔 NeighbVtx 𝑣)}) | |
| 2 | fveq2 6886 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (Vtx‘𝑔) = (Vtx‘𝐺)) | |
| 3 | uvtxval.v | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 4 | 2, 3 | eqtr4di 2813 | . . . . 5 ⊢ (𝑔 = 𝐺 → (Vtx‘𝑔) = 𝑉) |
| 5 | 4 | difeq1d 4062 | . . . 4 ⊢ (𝑔 = 𝐺 → ((Vtx‘𝑔) ∖ {𝑣}) = (𝑉 ∖ {𝑣})) |
| 6 | oveq1 7428 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑔 NeighbVtx 𝑣) = (𝐺 NeighbVtx 𝑣)) | |
| 7 | 6 | eleq2d 2846 | . . . 4 ⊢ (𝑔 = 𝐺 → (𝑛 ∈ (𝑔 NeighbVtx 𝑣) ↔ 𝑛 ∈ (𝐺 NeighbVtx 𝑣))) |
| 8 | 5, 7 | raleqbidv 3334 | . . 3 ⊢ (𝑔 = 𝐺 → (∀𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑣})𝑛 ∈ (𝑔 NeighbVtx 𝑣) ↔ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣))) |
| 9 | 1, 8 | fvmptrabfv 7027 | . 2 ⊢ (UnivVtx‘𝐺) = {𝑣 ∈ (Vtx‘𝐺) ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)} |
| 10 | 3 | eqcomi 2769 | . . 3 ⊢ (Vtx‘𝐺) = 𝑉 |
| 11 | 10 | rabeqi 3425 | . 2 ⊢ {𝑣 ∈ (Vtx‘𝐺) ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)} = {𝑣 ∈ 𝑉 ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)} |
| 12 | 9, 11 | eqtri 2783 | 1 ⊢ (UnivVtx‘𝐺) = {𝑣 ∈ 𝑉 ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2144 ∀wral 3076 {crab 3412 ∖ cdif 4045 {csn 4584 ‘cfv 6539 (class class class)co 7421 Vtxcvtx 29580 NeighbVtx cnbgr 29919 UnivVtxcuvtx 29972 |
| 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 |
| 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-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 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-iota 6494 df-fun 6541 df-fv 6547 df-ov 7424 df-uvtx 29973 |
| This theorem is used by: uvtxel 29975 uvtx0 29981 isuvtx 29982 uvtx01vtx 29984 uvtxusgr 29989 |
| Copyright terms: Public domain | W3C validator |