| 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 29773 | . . 3 ⊢ UnivVtx = (𝑔 ∈ V ↦ {𝑣 ∈ (Vtx‘𝑔) ∣ ∀𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑣})𝑛 ∈ (𝑔 NeighbVtx 𝑣)}) | |
| 2 | fveq2 6888 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (Vtx‘𝑔) = (Vtx‘𝐺)) | |
| 3 | uvtxval.v | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 4 | 2, 3 | eqtr4di 2819 | . . . . 5 ⊢ (𝑔 = 𝐺 → (Vtx‘𝑔) = 𝑉) |
| 5 | 4 | difeq1d 4083 | . . . 4 ⊢ (𝑔 = 𝐺 → ((Vtx‘𝑔) ∖ {𝑣}) = (𝑉 ∖ {𝑣})) |
| 6 | oveq1 7430 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑔 NeighbVtx 𝑣) = (𝐺 NeighbVtx 𝑣)) | |
| 7 | 6 | eleq2d 2852 | . . . 4 ⊢ (𝑔 = 𝐺 → (𝑛 ∈ (𝑔 NeighbVtx 𝑣) ↔ 𝑛 ∈ (𝐺 NeighbVtx 𝑣))) |
| 8 | 5, 7 | raleqbidv 3341 | . . 3 ⊢ (𝑔 = 𝐺 → (∀𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑣})𝑛 ∈ (𝑔 NeighbVtx 𝑣) ↔ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣))) |
| 9 | 1, 8 | fvmptrabfv 7029 | . 2 ⊢ (UnivVtx‘𝐺) = {𝑣 ∈ (Vtx‘𝐺) ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)} |
| 10 | 3 | eqcomi 2775 | . . 3 ⊢ (Vtx‘𝐺) = 𝑉 |
| 11 | 10 | rabeqi 3432 | . 2 ⊢ {𝑣 ∈ (Vtx‘𝐺) ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)} = {𝑣 ∈ 𝑉 ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)} |
| 12 | 9, 11 | eqtri 2789 | 1 ⊢ (UnivVtx‘𝐺) = {𝑣 ∈ 𝑉 ∣ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2146 ∀wral 3082 {crab 3419 ∖ cdif 3905 {csn 4594 ‘cfv 6543 (class class class)co 7423 Vtxcvtx 29383 NeighbVtx cnbgr 29719 UnivVtxcuvtx 29772 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pr 5409 |
| 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 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-iota 6499 df-fun 6545 df-fv 6551 df-ov 7426 df-uvtx 29773 |
| This theorem is used by: uvtxel 29775 uvtx0 29781 isuvtx 29782 uvtx01vtx 29784 uvtxusgr 29789 |
| Copyright terms: Public domain | W3C validator |