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 6553 | . . 3 ⊢ ∅:∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}) | |
2 | dm0 5783 | . . . 4 ⊢ dom ∅ = ∅ | |
3 | 2 | feq2i 6499 | . . 3 ⊢ (∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}) ↔ ∅:∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅})) |
4 | 1, 3 | mpbir 232 | . 2 ⊢ ∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}) |
5 | uhgr0e.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝑊) | |
6 | eqid 2818 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
7 | eqid 2818 | . . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
8 | 6, 7 | isuhgr 26772 | . . . 4 ⊢ (𝐺 ∈ 𝑊 → (𝐺 ∈ UHGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))) |
9 | 5, 8 | syl 17 | . . 3 ⊢ (𝜑 → (𝐺 ∈ UHGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))) |
10 | uhgr0e.e | . . . 4 ⊢ (𝜑 → (iEdg‘𝐺) = ∅) | |
11 | id 22 | . . . . 5 ⊢ ((iEdg‘𝐺) = ∅ → (iEdg‘𝐺) = ∅) | |
12 | dmeq 5765 | . . . . 5 ⊢ ((iEdg‘𝐺) = ∅ → dom (iEdg‘𝐺) = dom ∅) | |
13 | 11, 12 | feq12d 6495 | . . . 4 ⊢ ((iEdg‘𝐺) = ∅ → ((iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 (Vtx‘𝐺) ∖ {∅}) ↔ ∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))) |
14 | 10, 13 | syl 17 | . . 3 ⊢ (𝜑 → ((iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 (Vtx‘𝐺) ∖ {∅}) ↔ ∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))) |
15 | 9, 14 | bitrd 280 | . 2 ⊢ (𝜑 → (𝐺 ∈ UHGraph ↔ ∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))) |
16 | 4, 15 | mpbiri 259 | 1 ⊢ (𝜑 → 𝐺 ∈ UHGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 = wceq 1528 ∈ wcel 2105 ∖ cdif 3930 ∅c0 4288 𝒫 cpw 4535 {csn 4557 dom cdm 5548 ⟶wf 6344 ‘cfv 6348 Vtxcvtx 26708 iEdgciedg 26709 UHGraphcuhgr 26768 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pr 5320 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-sbc 3770 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-br 5058 df-opab 5120 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-fv 6356 df-uhgr 26770 |
This theorem is referenced by: uhgr0vb 26784 |
Copyright terms: Public domain | W3C validator |