![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fusgrusgr | Structured version Visualization version GIF version |
Description: A finite simple graph is a simple graph. (Contributed by AV, 16-Jan-2020.) (Revised by AV, 21-Oct-2020.) |
Ref | Expression |
---|---|
fusgrusgr | ⊢ (𝐺 ∈ FinUSGraph → 𝐺 ∈ USGraph) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2731 | . . 3 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
2 | 1 | isfusgr 28329 | . 2 ⊢ (𝐺 ∈ FinUSGraph ↔ (𝐺 ∈ USGraph ∧ (Vtx‘𝐺) ∈ Fin)) |
3 | 2 | simplbi 498 | 1 ⊢ (𝐺 ∈ FinUSGraph → 𝐺 ∈ USGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2106 ‘cfv 6501 Fincfn 8890 Vtxcvtx 28010 USGraphcusgr 28163 FinUSGraphcfusgr 28327 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2709 df-cleq 2723 df-clel 2809 df-rab 3406 df-v 3448 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4288 df-if 4492 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4871 df-br 5111 df-iota 6453 df-fv 6509 df-fusgr 28328 |
This theorem is referenced by: fusgredgfi 28336 fusgrfisstep 28340 fusgrfupgrfs 28342 nbfiusgrfi 28386 vtxdgfusgrf 28508 usgruvtxvdb 28540 vdiscusgrb 28541 vdiscusgr 28542 fusgrn0eqdrusgr 28581 wlksnfi 28915 fusgrhashclwwlkn 29086 clwlksndivn 29093 fusgr2wsp2nb 29341 fusgreghash2wspv 29342 numclwwlk4 29393 |
Copyright terms: Public domain | W3C validator |