| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgrumgr | Structured version Visualization version GIF version | ||
| Description: A simple graph is an undirected multigraph. (Contributed by AV, 25-Nov-2020.) |
| Ref | Expression |
|---|---|
| usgrumgr | ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ UMGraph) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2739 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | eqid 2739 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 3 | 1, 2 | usgrfs 29244 | . . 3 ⊢ (𝐺 ∈ USGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}) |
| 4 | f1f 6723 | . . 3 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}) | |
| 5 | 3, 4 | syl 17 | . 2 ⊢ (𝐺 ∈ USGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}) |
| 6 | 1, 2 | isumgrs 29183 | . 2 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ UMGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2})) |
| 7 | 5, 6 | mpbird 258 | 1 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ UMGraph) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 ∈ wcel 2119 {crab 3391 𝒫 cpw 4529 dom cdm 5618 ⟶wf 6481 –1-1→wf1 6482 ‘cfv 6485 2c2 12227 ♯chash 14283 Vtxcvtx 29083 iEdgciedg 29084 UMGraphcumgr 29168 USGraphcusgr 29236 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-er 8633 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-n0 12429 df-z 12516 df-uz 12780 df-fz 13453 df-hash 14284 df-umgr 29170 df-usgr 29238 |
| This theorem is referenced by: usgrumgruspgr 29269 usgrun 29277 usgrunop 29278 usgredg2 29279 usgredgprv 29281 usgrpredgv 29284 usgredg 29286 usgrnloopv 29287 usgrnloop 29289 usgrnloop0 29291 usgredgne 29293 usgr2edg 29297 usgr2edg1 29299 subusgr 29376 usgrres 29395 usgrres1 29402 nbusgrvtx 29435 nbusgr 29436 vtxdusgrval 29574 usgrwwlks2on 30044 fusgrhashclwwlkn 30167 3cyclfrgr 30376 vdgn0frgrv2 30383 frgrncvvdeqlem2 30388 frgr2wwlkeqm 30419 fusgr2wsp2nb 30422 usgrgt2cycl 35358 cusgr3cyclex 35364 pgnbgreunbgr 48616 |
| Copyright terms: Public domain | W3C validator |