Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > edguhgr | Structured version Visualization version GIF version |
Description: An edge of a hypergraph is a subset of vertices. (Contributed by AV, 26-Oct-2020.) (Proof shortened by AV, 28-Nov-2020.) |
Ref | Expression |
---|---|
edguhgr | ⊢ ((𝐺 ∈ UHGraph ∧ 𝐸 ∈ (Edg‘𝐺)) → 𝐸 ∈ 𝒫 (Vtx‘𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uhgredgn0 26912 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐸 ∈ (Edg‘𝐺)) → 𝐸 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅})) | |
2 | 1 | eldifad 3947 | 1 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐸 ∈ (Edg‘𝐺)) → 𝐸 ∈ 𝒫 (Vtx‘𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∈ wcel 2110 ∅c0 4290 𝒫 cpw 4538 {csn 4566 ‘cfv 6354 Vtxcvtx 26780 Edgcedg 26831 UHGraphcuhgr 26840 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4838 df-br 5066 df-opab 5128 df-mpt 5146 df-id 5459 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-fv 6362 df-edg 26832 df-uhgr 26842 |
This theorem is referenced by: uhgredgrnv 26914 uhgrissubgr 27056 umgrres1lem 27091 nbuhgr 27124 nbuhgr2vtx1edgblem 27132 isomuspgrlem2c 43994 |
Copyright terms: Public domain | W3C validator |