![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > uvtxusgrel | Structured version Visualization version GIF version |
Description: A universal vertex, i.e. an element of the set of all universal vertices, of a simple graph. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 31-Oct-2020.) |
Ref | Expression |
---|---|
uvtxnbgr.v | ⊢ 𝑉 = (Vtx‘𝐺) |
uvtxusgr.e | ⊢ 𝐸 = (Edg‘𝐺) |
Ref | Expression |
---|---|
uvtxusgrel | ⊢ (𝐺 ∈ USGraph → (𝑁 ∈ (UnivVtx‘𝐺) ↔ (𝑁 ∈ 𝑉 ∧ ∀𝑘 ∈ (𝑉 ∖ {𝑁}){𝑘, 𝑁} ∈ 𝐸))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uvtxnbgr.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | uvtxusgr.e | . . . 4 ⊢ 𝐸 = (Edg‘𝐺) | |
3 | 1, 2 | uvtxusgr 28524 | . . 3 ⊢ (𝐺 ∈ USGraph → (UnivVtx‘𝐺) = {𝑣 ∈ 𝑉 ∣ ∀𝑘 ∈ (𝑉 ∖ {𝑣}){𝑘, 𝑣} ∈ 𝐸}) |
4 | 3 | eleq2d 2818 | . 2 ⊢ (𝐺 ∈ USGraph → (𝑁 ∈ (UnivVtx‘𝐺) ↔ 𝑁 ∈ {𝑣 ∈ 𝑉 ∣ ∀𝑘 ∈ (𝑉 ∖ {𝑣}){𝑘, 𝑣} ∈ 𝐸})) |
5 | sneq 4632 | . . . . 5 ⊢ (𝑣 = 𝑁 → {𝑣} = {𝑁}) | |
6 | 5 | difeq2d 4118 | . . . 4 ⊢ (𝑣 = 𝑁 → (𝑉 ∖ {𝑣}) = (𝑉 ∖ {𝑁})) |
7 | preq2 4731 | . . . . 5 ⊢ (𝑣 = 𝑁 → {𝑘, 𝑣} = {𝑘, 𝑁}) | |
8 | 7 | eleq1d 2817 | . . . 4 ⊢ (𝑣 = 𝑁 → ({𝑘, 𝑣} ∈ 𝐸 ↔ {𝑘, 𝑁} ∈ 𝐸)) |
9 | 6, 8 | raleqbidv 3341 | . . 3 ⊢ (𝑣 = 𝑁 → (∀𝑘 ∈ (𝑉 ∖ {𝑣}){𝑘, 𝑣} ∈ 𝐸 ↔ ∀𝑘 ∈ (𝑉 ∖ {𝑁}){𝑘, 𝑁} ∈ 𝐸)) |
10 | 9 | elrab 3679 | . 2 ⊢ (𝑁 ∈ {𝑣 ∈ 𝑉 ∣ ∀𝑘 ∈ (𝑉 ∖ {𝑣}){𝑘, 𝑣} ∈ 𝐸} ↔ (𝑁 ∈ 𝑉 ∧ ∀𝑘 ∈ (𝑉 ∖ {𝑁}){𝑘, 𝑁} ∈ 𝐸)) |
11 | 4, 10 | bitrdi 286 | 1 ⊢ (𝐺 ∈ USGraph → (𝑁 ∈ (UnivVtx‘𝐺) ↔ (𝑁 ∈ 𝑉 ∧ ∀𝑘 ∈ (𝑉 ∖ {𝑁}){𝑘, 𝑁} ∈ 𝐸))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3060 {crab 3431 ∖ cdif 3941 {csn 4622 {cpr 4624 ‘cfv 6532 Vtxcvtx 28121 Edgcedg 28172 USGraphcusgr 28274 UnivVtxcuvtx 28507 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7708 ax-cnex 11148 ax-resscn 11149 ax-1cn 11150 ax-icn 11151 ax-addcl 11152 ax-addrcl 11153 ax-mulcl 11154 ax-mulrcl 11155 ax-mulcom 11156 ax-addass 11157 ax-mulass 11158 ax-distr 11159 ax-i2m1 11160 ax-1ne0 11161 ax-1rid 11162 ax-rnegex 11163 ax-rrecex 11164 ax-cnre 11165 ax-pre-lttri 11166 ax-pre-lttrn 11167 ax-pre-ltadd 11168 ax-pre-mulgt0 11169 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-op 4629 df-uni 4902 df-int 4944 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6289 df-ord 6356 df-on 6357 df-lim 6358 df-suc 6359 df-iota 6484 df-fun 6534 df-fn 6535 df-f 6536 df-f1 6537 df-fo 6538 df-f1o 6539 df-fv 6540 df-riota 7349 df-ov 7396 df-oprab 7397 df-mpo 7398 df-om 7839 df-1st 7957 df-2nd 7958 df-frecs 8248 df-wrecs 8279 df-recs 8353 df-rdg 8392 df-1o 8448 df-2o 8449 df-oadd 8452 df-er 8686 df-en 8923 df-dom 8924 df-sdom 8925 df-fin 8926 df-dju 9878 df-card 9916 df-pnf 11232 df-mnf 11233 df-xr 11234 df-ltxr 11235 df-le 11236 df-sub 11428 df-neg 11429 df-nn 12195 df-2 12257 df-n0 12455 df-xnn0 12527 df-z 12541 df-uz 12805 df-fz 13467 df-hash 14273 df-edg 28173 df-upgr 28207 df-umgr 28208 df-usgr 28276 df-nbgr 28455 df-uvtx 28508 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |