| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > upgrle2 | Structured version Visualization version GIF 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 ∧ 𝑋 ∈ dom 𝐼) → (♯‘(𝐼‘𝑋)) ≤ 2) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 488 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → 𝐺 ∈ UPGraph) | |
| 2 | upgruhgr 29680 | . . . . 5 ⊢ (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph) | |
| 3 | upgrle2.i | . . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 4 | 3 | uhgrfun 29644 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → Fun 𝐼) |
| 5 | 2, 4 | syl 18 | . . . 4 ⊢ (𝐺 ∈ UPGraph → Fun 𝐼) |
| 6 | 5 | funfnd 6571 | . . 3 ⊢ (𝐺 ∈ UPGraph → 𝐼 Fn dom 𝐼) |
| 7 | 6 | adantr 486 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → 𝐼 Fn dom 𝐼) |
| 8 | simpr 490 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → 𝑋 ∈ dom 𝐼) | |
| 9 | eqid 2760 | . . 3 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 10 | 9, 3 | upgrle 29668 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐼 Fn dom 𝐼 ∧ 𝑋 ∈ dom 𝐼) → (♯‘(𝐼‘𝑋)) ≤ 2) |
| 11 | 1, 7, 8, 10 | syl3anc 1398 | 1 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → (♯‘(𝐼‘𝑋)) ≤ 2) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 class class class wbr 5102 dom cdm 5650 Fun wfun 6532 Fn wfn 6533 ‘cfv 6538 ≤ cle 11344 2c2 12397 ♯chash 14474 Vtxcvtx 29574 iEdgciedg 29575 UHGraphcuhgr 29634 UPGraphcupgr 29658 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-uhgr 29636 df-upgr 29660 |
| This theorem is used by: upgr2pthnlp 30318 |
| Copyright terms: Public domain | W3C validator |