![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > umgr0e | Structured version Visualization version GIF version |
Description: The empty graph, with vertices but no edges, is a multigraph. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 25-Nov-2020.) |
Ref | Expression |
---|---|
umgr0e.g | ⊢ (𝜑 → 𝐺 ∈ 𝑊) |
umgr0e.e | ⊢ (𝜑 → (iEdg‘𝐺) = ∅) |
Ref | Expression |
---|---|
umgr0e | ⊢ (𝜑 → 𝐺 ∈ UMGraph) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | umgr0e.e | . . . 4 ⊢ (𝜑 → (iEdg‘𝐺) = ∅) | |
2 | 1 | f10d 6868 | . . 3 ⊢ (𝜑 → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) |
3 | f1f 6788 | . . 3 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) | |
4 | 2, 3 | syl 17 | . 2 ⊢ (𝜑 → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) |
5 | umgr0e.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑊) | |
6 | eqid 2730 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
7 | eqid 2730 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
8 | 6, 7 | isumgr 28620 | . . 3 ⊢ (𝐺 ∈ 𝑊 → (𝐺 ∈ UMGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})) |
9 | 5, 8 | syl 17 | . 2 ⊢ (𝜑 → (𝐺 ∈ UMGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})) |
10 | 4, 9 | mpbird 256 | 1 ⊢ (𝜑 → 𝐺 ∈ UMGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1539 ∈ wcel 2104 {crab 3430 ∖ cdif 3946 ∅c0 4323 𝒫 cpw 4603 {csn 4629 dom cdm 5677 ⟶wf 6540 –1-1→wf1 6541 ‘cfv 6544 2c2 12273 ♯chash 14296 Vtxcvtx 28521 iEdgciedg 28522 UMGraphcumgr 28606 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-sep 5300 ax-nul 5307 ax-pr 5428 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-clab 2708 df-cleq 2722 df-clel 2808 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3431 df-v 3474 df-sbc 3779 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-br 5150 df-opab 5212 df-id 5575 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fv 6552 df-umgr 28608 |
This theorem is referenced by: upgr0e 28636 |
Copyright terms: Public domain | W3C validator |