Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > upgrle2 | Structured version Visualization version Unicode version |
Description: An edge of an undirected pseudograph has at most two ends. (Contributed by AV, 6-Feb-2021.) |
Ref | Expression |
---|---|
upgrle2.i | iEdg |
Ref | Expression |
---|---|
upgrle2 | UPGraph |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 473 | . 2 UPGraph UPGraph | |
2 | upgruhgr 25997 | . . . . 5 UPGraph UHGraph | |
3 | upgrle2.i | . . . . . 6 iEdg | |
4 | 3 | uhgrfun 25961 | . . . . 5 UHGraph |
5 | 2, 4 | syl 17 | . . . 4 UPGraph |
6 | funfn 5918 | . . . 4 | |
7 | 5, 6 | sylib 208 | . . 3 UPGraph |
8 | 7 | adantr 481 | . 2 UPGraph |
9 | simpr 477 | . 2 UPGraph | |
10 | eqid 2622 | . . 3 Vtx Vtx | |
11 | 10, 3 | upgrle 25985 | . 2 UPGraph |
12 | 1, 8, 9, 11 | syl3anc 1326 | 1 UPGraph |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wa 384 wceq 1483 wcel 1990 class class class wbr 4653 cdm 5114 wfun 5882 wfn 5883 cfv 5888 cle 10075 c2 11070 chash 13117 Vtxcvtx 25874 iEdgciedg 25875 UHGraph cuhgr 25951 UPGraph cupgr 25975 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-fv 5896 df-uhgr 25953 df-upgr 25977 |
This theorem is referenced by: upgr2pthnlp 26628 |
Copyright terms: Public domain | W3C validator |