Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > isuvtx | 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, 30-Oct-2020.) (Revised by AV, 14-Feb-2022.) |
Ref | Expression |
---|---|
uvtxel.v | ⊢ 𝑉 = (Vtx‘𝐺) |
isuvtx.e | ⊢ 𝐸 = (Edg‘𝐺) |
Ref | Expression |
---|---|
isuvtx | ⊢ (UnivVtx‘𝐺) = {𝑣 ∈ 𝑉 ∣ ∀𝑘 ∈ (𝑉 ∖ {𝑣})∃𝑒 ∈ 𝐸 {𝑘, 𝑣} ⊆ 𝑒} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uvtxel.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | 1 | uvtxval 27169 | . 2 ⊢ (UnivVtx‘𝐺) = {𝑣 ∈ 𝑉 ∣ ∀𝑘 ∈ (𝑉 ∖ {𝑣})𝑘 ∈ (𝐺 NeighbVtx 𝑣)} |
3 | isuvtx.e | . . . . . . 7 ⊢ 𝐸 = (Edg‘𝐺) | |
4 | 1, 3 | nbgrel 27122 | . . . . . 6 ⊢ (𝑘 ∈ (𝐺 NeighbVtx 𝑣) ↔ ((𝑘 ∈ 𝑉 ∧ 𝑣 ∈ 𝑉) ∧ 𝑘 ≠ 𝑣 ∧ ∃𝑒 ∈ 𝐸 {𝑣, 𝑘} ⊆ 𝑒)) |
5 | df-3an 1085 | . . . . . 6 ⊢ (((𝑘 ∈ 𝑉 ∧ 𝑣 ∈ 𝑉) ∧ 𝑘 ≠ 𝑣 ∧ ∃𝑒 ∈ 𝐸 {𝑣, 𝑘} ⊆ 𝑒) ↔ (((𝑘 ∈ 𝑉 ∧ 𝑣 ∈ 𝑉) ∧ 𝑘 ≠ 𝑣) ∧ ∃𝑒 ∈ 𝐸 {𝑣, 𝑘} ⊆ 𝑒)) | |
6 | 4, 5 | bitri 277 | . . . . 5 ⊢ (𝑘 ∈ (𝐺 NeighbVtx 𝑣) ↔ (((𝑘 ∈ 𝑉 ∧ 𝑣 ∈ 𝑉) ∧ 𝑘 ≠ 𝑣) ∧ ∃𝑒 ∈ 𝐸 {𝑣, 𝑘} ⊆ 𝑒)) |
7 | prcom 4668 | . . . . . . . 8 ⊢ {𝑘, 𝑣} = {𝑣, 𝑘} | |
8 | 7 | sseq1i 3995 | . . . . . . 7 ⊢ ({𝑘, 𝑣} ⊆ 𝑒 ↔ {𝑣, 𝑘} ⊆ 𝑒) |
9 | 8 | rexbii 3247 | . . . . . 6 ⊢ (∃𝑒 ∈ 𝐸 {𝑘, 𝑣} ⊆ 𝑒 ↔ ∃𝑒 ∈ 𝐸 {𝑣, 𝑘} ⊆ 𝑒) |
10 | id 22 | . . . . . . . . 9 ⊢ (𝑣 ∈ 𝑉 → 𝑣 ∈ 𝑉) | |
11 | eldifi 4103 | . . . . . . . . 9 ⊢ (𝑘 ∈ (𝑉 ∖ {𝑣}) → 𝑘 ∈ 𝑉) | |
12 | 10, 11 | anim12ci 615 | . . . . . . . 8 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑘 ∈ (𝑉 ∖ {𝑣})) → (𝑘 ∈ 𝑉 ∧ 𝑣 ∈ 𝑉)) |
13 | eldifsni 4722 | . . . . . . . . 9 ⊢ (𝑘 ∈ (𝑉 ∖ {𝑣}) → 𝑘 ≠ 𝑣) | |
14 | 13 | adantl 484 | . . . . . . . 8 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑘 ∈ (𝑉 ∖ {𝑣})) → 𝑘 ≠ 𝑣) |
15 | 12, 14 | jca 514 | . . . . . . 7 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑘 ∈ (𝑉 ∖ {𝑣})) → ((𝑘 ∈ 𝑉 ∧ 𝑣 ∈ 𝑉) ∧ 𝑘 ≠ 𝑣)) |
16 | 15 | biantrurd 535 | . . . . . 6 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑘 ∈ (𝑉 ∖ {𝑣})) → (∃𝑒 ∈ 𝐸 {𝑣, 𝑘} ⊆ 𝑒 ↔ (((𝑘 ∈ 𝑉 ∧ 𝑣 ∈ 𝑉) ∧ 𝑘 ≠ 𝑣) ∧ ∃𝑒 ∈ 𝐸 {𝑣, 𝑘} ⊆ 𝑒))) |
17 | 9, 16 | syl5rbb 286 | . . . . 5 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑘 ∈ (𝑉 ∖ {𝑣})) → ((((𝑘 ∈ 𝑉 ∧ 𝑣 ∈ 𝑉) ∧ 𝑘 ≠ 𝑣) ∧ ∃𝑒 ∈ 𝐸 {𝑣, 𝑘} ⊆ 𝑒) ↔ ∃𝑒 ∈ 𝐸 {𝑘, 𝑣} ⊆ 𝑒)) |
18 | 6, 17 | syl5bb 285 | . . . 4 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑘 ∈ (𝑉 ∖ {𝑣})) → (𝑘 ∈ (𝐺 NeighbVtx 𝑣) ↔ ∃𝑒 ∈ 𝐸 {𝑘, 𝑣} ⊆ 𝑒)) |
19 | 18 | ralbidva 3196 | . . 3 ⊢ (𝑣 ∈ 𝑉 → (∀𝑘 ∈ (𝑉 ∖ {𝑣})𝑘 ∈ (𝐺 NeighbVtx 𝑣) ↔ ∀𝑘 ∈ (𝑉 ∖ {𝑣})∃𝑒 ∈ 𝐸 {𝑘, 𝑣} ⊆ 𝑒)) |
20 | 19 | rabbiia 3472 | . 2 ⊢ {𝑣 ∈ 𝑉 ∣ ∀𝑘 ∈ (𝑉 ∖ {𝑣})𝑘 ∈ (𝐺 NeighbVtx 𝑣)} = {𝑣 ∈ 𝑉 ∣ ∀𝑘 ∈ (𝑉 ∖ {𝑣})∃𝑒 ∈ 𝐸 {𝑘, 𝑣} ⊆ 𝑒} |
21 | 2, 20 | eqtri 2844 | 1 ⊢ (UnivVtx‘𝐺) = {𝑣 ∈ 𝑉 ∣ ∀𝑘 ∈ (𝑉 ∖ {𝑣})∃𝑒 ∈ 𝐸 {𝑘, 𝑣} ⊆ 𝑒} |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ≠ wne 3016 ∀wral 3138 ∃wrex 3139 {crab 3142 ∖ cdif 3933 ⊆ wss 3936 {csn 4567 {cpr 4569 ‘cfv 6355 (class class class)co 7156 Vtxcvtx 26781 Edgcedg 26832 NeighbVtx cnbgr 27114 UnivVtxcuvtx 27167 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-fal 1550 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fv 6363 df-ov 7159 df-oprab 7160 df-mpo 7161 df-1st 7689 df-2nd 7690 df-nbgr 27115 df-uvtx 27168 |
This theorem is referenced by: uvtxel1 27178 |
Copyright terms: Public domain | W3C validator |