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 26840 | . 2 ⊢ (𝐺 ∈ USHGraph → (𝐺 ∈ USHGraph ↔ 𝐸:dom 𝐸–1-1→(𝒫 𝑉 ∖ {∅}))) |
4 | 3 | ibi 269 | 1 ⊢ (𝐺 ∈ USHGraph → 𝐸:dom 𝐸–1-1→(𝒫 𝑉 ∖ {∅})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 ∖ cdif 3933 ∅c0 4291 𝒫 cpw 4539 {csn 4561 dom cdm 5550 –1-1→wf1 6347 ‘cfv 6350 Vtxcvtx 26775 iEdgciedg 26776 USHGraphcushgr 26836 |
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 2156 ax-12 2172 ax-ext 2793 ax-nul 5203 |
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 3497 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-br 5060 df-opab 5122 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fv 6358 df-ushgr 26838 |
This theorem is referenced by: ushgruhgr 26848 uspgrupgrushgr 26956 ushgredgedg 27005 ushgredgedgloop 27007 isomushgr 43984 ushrisomgr 43999 |
Copyright terms: Public domain | W3C validator |