![]() |
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 2824 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
2 | eqid 2824 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
3 | 1, 2 | usgrfs 26455 | . . 3 ⊢ (𝐺 ∈ USGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}) |
4 | f1f 6337 | . . 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 26393 | . 2 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ UMGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2})) |
7 | 5, 6 | mpbird 249 | 1 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ UMGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1658 ∈ wcel 2166 {crab 3120 𝒫 cpw 4377 dom cdm 5341 ⟶wf 6118 –1-1→wf1 6119 ‘cfv 6122 2c2 11405 ♯chash 13409 Vtxcvtx 26293 iEdgciedg 26294 UMGraphcumgr 26378 USGraphcusgr 26447 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1896 ax-4 1910 ax-5 2011 ax-6 2077 ax-7 2114 ax-8 2168 ax-9 2175 ax-10 2194 ax-11 2209 ax-12 2222 ax-13 2390 ax-ext 2802 ax-sep 5004 ax-nul 5012 ax-pow 5064 ax-pr 5126 ax-un 7208 ax-cnex 10307 ax-resscn 10308 ax-1cn 10309 ax-icn 10310 ax-addcl 10311 ax-addrcl 10312 ax-mulcl 10313 ax-mulrcl 10314 ax-mulcom 10315 ax-addass 10316 ax-mulass 10317 ax-distr 10318 ax-i2m1 10319 ax-1ne0 10320 ax-1rid 10321 ax-rnegex 10322 ax-rrecex 10323 ax-cnre 10324 ax-pre-lttri 10325 ax-pre-lttrn 10326 ax-pre-ltadd 10327 ax-pre-mulgt0 10328 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 881 df-3or 1114 df-3an 1115 df-tru 1662 df-ex 1881 df-nf 1885 df-sb 2070 df-mo 2604 df-eu 2639 df-clab 2811 df-cleq 2817 df-clel 2820 df-nfc 2957 df-ne 2999 df-nel 3102 df-ral 3121 df-rex 3122 df-reu 3123 df-rab 3125 df-v 3415 df-sbc 3662 df-csb 3757 df-dif 3800 df-un 3802 df-in 3804 df-ss 3811 df-pss 3813 df-nul 4144 df-if 4306 df-pw 4379 df-sn 4397 df-pr 4399 df-tp 4401 df-op 4403 df-uni 4658 df-int 4697 df-iun 4741 df-br 4873 df-opab 4935 df-mpt 4952 df-tr 4975 df-id 5249 df-eprel 5254 df-po 5262 df-so 5263 df-fr 5300 df-we 5302 df-xp 5347 df-rel 5348 df-cnv 5349 df-co 5350 df-dm 5351 df-rn 5352 df-res 5353 df-ima 5354 df-pred 5919 df-ord 5965 df-on 5966 df-lim 5967 df-suc 5968 df-iota 6085 df-fun 6124 df-fn 6125 df-f 6126 df-f1 6127 df-fo 6128 df-f1o 6129 df-fv 6130 df-riota 6865 df-ov 6907 df-oprab 6908 df-mpt2 6909 df-om 7326 df-1st 7427 df-2nd 7428 df-wrecs 7671 df-recs 7733 df-rdg 7771 df-1o 7825 df-er 8008 df-en 8222 df-dom 8223 df-sdom 8224 df-fin 8225 df-card 9077 df-pnf 10392 df-mnf 10393 df-xr 10394 df-ltxr 10395 df-le 10396 df-sub 10586 df-neg 10587 df-nn 11350 df-2 11413 df-n0 11618 df-z 11704 df-uz 11968 df-fz 12619 df-hash 13410 df-umgr 26380 df-usgr 26449 |
This theorem is referenced by: usgrumgruspgr 26478 usgrun 26485 usgrunop 26486 usgredg2 26487 usgredgprv 26489 usgrpredgv 26492 usgredg 26494 usgrnloopv 26495 usgrnloop 26497 usgrnloop0 26499 usgredgne 26501 usgr2edg 26505 usgr2edg1 26507 subusgr 26585 usgrres 26604 usgrres1 26611 nbusgrvtx 26644 nbusgr 26645 vtxdusgrval 26784 usgr2wspthons3 27292 fusgrhashclwwlkn 27431 3cyclfrgr 27668 vdgn0frgrv2 27675 frgrncvvdeqlem2 27680 frgr2wwlkeu 27707 frgr2wwlkeqm 27711 fusgr2wsp2nb 27714 |
Copyright terms: Public domain | W3C validator |