![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ushgrf | Structured version Visualization version GIF version |
Description: The edge function of an undirected simple hypergraph is a one-to-one function into the power set of the set of vertices. (Contributed by AV, 9-Oct-2020.) |
Ref | Expression |
---|---|
uhgrf.v | ⊢ 𝑉 = (Vtx‘𝐺) |
uhgrf.e | ⊢ 𝐸 = (iEdg‘𝐺) |
Ref | Expression |
---|---|
ushgrf | ⊢ (𝐺 ∈ USHGraph → 𝐸:dom 𝐸–1-1→(𝒫 𝑉 ∖ {∅})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uhgrf.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | uhgrf.e | . . 3 ⊢ 𝐸 = (iEdg‘𝐺) | |
3 | 1, 2 | isushgr 26854 | . 2 ⊢ (𝐺 ∈ USHGraph → (𝐺 ∈ USHGraph ↔ 𝐸:dom 𝐸–1-1→(𝒫 𝑉 ∖ {∅}))) |
4 | 3 | ibi 270 | 1 ⊢ (𝐺 ∈ USHGraph → 𝐸:dom 𝐸–1-1→(𝒫 𝑉 ∖ {∅})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 ∖ cdif 3878 ∅c0 4243 𝒫 cpw 4497 {csn 4525 dom cdm 5519 –1-1→wf1 6321 ‘cfv 6324 Vtxcvtx 26789 iEdgciedg 26790 USHGraphcushgr 26850 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-nul 5174 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fv 6332 df-ushgr 26852 |
This theorem is referenced by: ushgruhgr 26862 uspgrupgrushgr 26970 ushgredgedg 27019 ushgredgedgloop 27021 isomushgr 44344 ushrisomgr 44359 |
Copyright terms: Public domain | W3C validator |