| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uhgr0e | Structured version Visualization version GIF version | ||
| Description: The empty graph, with vertices but no edges, is a hypergraph. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 25-Nov-2020.) |
| Ref | Expression |
|---|---|
| uhgr0e.g | ⊢ (𝜑 → 𝐺 ∈ 𝑊) |
| uhgr0e.e | ⊢ (𝜑 → (iEdg‘𝐺) = ∅) |
| Ref | Expression |
|---|---|
| uhgr0e | ⊢ (𝜑 → 𝐺 ∈ UHGraph) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f0 6760 | . . 3 ⊢ ∅:∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}) | |
| 2 | dm0 5908 | . . . 4 ⊢ dom ∅ = ∅ | |
| 3 | 2 | feq2i 6698 | . . 3 ⊢ (∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}) ↔ ∅:∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅})) |
| 4 | 1, 3 | mpbir 234 | . 2 ⊢ ∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}) |
| 5 | uhgr0e.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝑊) | |
| 6 | eqid 2762 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 7 | eqid 2762 | . . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 8 | 6, 7 | isuhgr 29525 | . . . 4 ⊢ (𝐺 ∈ 𝑊 → (𝐺 ∈ UHGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))) |
| 9 | 5, 8 | syl 18 | . . 3 ⊢ (𝜑 → (𝐺 ∈ UHGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))) |
| 10 | uhgr0e.e | . . . 4 ⊢ (𝜑 → (iEdg‘𝐺) = ∅) | |
| 11 | id 23 | . . . . 5 ⊢ ((iEdg‘𝐺) = ∅ → (iEdg‘𝐺) = ∅) | |
| 12 | dmeq 5891 | . . . . 5 ⊢ ((iEdg‘𝐺) = ∅ → dom (iEdg‘𝐺) = dom ∅) | |
| 13 | 11, 12 | feq12d 6694 | . . . 4 ⊢ ((iEdg‘𝐺) = ∅ → ((iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 (Vtx‘𝐺) ∖ {∅}) ↔ ∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))) |
| 14 | 10, 13 | syl 18 | . . 3 ⊢ (𝜑 → ((iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 (Vtx‘𝐺) ∖ {∅}) ↔ ∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))) |
| 15 | 9, 14 | bitrd 282 | . 2 ⊢ (𝜑 → (𝐺 ∈ UHGraph ↔ ∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))) |
| 16 | 4, 15 | mpbiri 261 | 1 ⊢ (𝜑 → 𝐺 ∈ UHGraph) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2145 ∖ cdif 3899 ∅c0 4282 𝒫 cpw 4560 {csn 4587 dom cdm 5659 ⟶wf 6533 ‘cfv 6537 Vtxcvtx 29461 iEdgciedg 29462 UHGraphcuhgr 29521 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-mo 2566 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-uhgr 29523 |
| This theorem is used by: uhgr0vb 29537 |
| Copyright terms: Public domain | W3C validator |