Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rusgrusgr | Structured version Visualization version GIF version |
Description: A k-regular simple graph is a simple graph. (Contributed by Alexander van der Vekens, 8-Jul-2018.) (Revised by AV, 18-Dec-2020.) |
Ref | Expression |
---|---|
rusgrusgr | ⊢ (𝐺 RegUSGraph 𝐾 → 𝐺 ∈ USGraph) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rusgrprop 27271 | . 2 ⊢ (𝐺 RegUSGraph 𝐾 → (𝐺 ∈ USGraph ∧ 𝐺 RegGraph 𝐾)) | |
2 | 1 | simpld 495 | 1 ⊢ (𝐺 RegUSGraph 𝐾 → 𝐺 ∈ USGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2105 class class class wbr 5057 USGraphcusgr 26861 RegGraph crgr 27264 RegUSGraph crusgr 27265 |
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-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-sn 4558 df-pr 4560 df-op 4564 df-br 5058 df-opab 5120 df-xp 5554 df-rusgr 27267 |
This theorem is referenced by: finrusgrfusgr 27274 rusgr0edg 27679 rusgrnumwwlks 27680 rusgrnumwwlk 27681 rusgrnumwlkg 27683 numclwwlk1 28067 clwlknon2num 28074 numclwlk1lem1 28075 numclwlk1lem2 28076 |
Copyright terms: Public domain | W3C validator |