| 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 482 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → 𝐺 ∈ UPGraph) | |
| 2 | upgruhgr 29086 | . . . . 5 ⊢ (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph) | |
| 3 | upgrle2.i | . . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 4 | 3 | uhgrfun 29050 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → Fun 𝐼) |
| 5 | 2, 4 | syl 17 | . . . 4 ⊢ (𝐺 ∈ UPGraph → Fun 𝐼) |
| 6 | 5 | funfnd 6572 | . . 3 ⊢ (𝐺 ∈ UPGraph → 𝐼 Fn dom 𝐼) |
| 7 | 6 | adantr 480 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → 𝐼 Fn dom 𝐼) |
| 8 | simpr 484 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → 𝑋 ∈ dom 𝐼) | |
| 9 | eqid 2736 | . . 3 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 10 | 9, 3 | upgrle 29074 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐼 Fn dom 𝐼 ∧ 𝑋 ∈ dom 𝐼) → (♯‘(𝐼‘𝑋)) ≤ 2) |
| 11 | 1, 7, 8, 10 | syl3anc 1373 | 1 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → (♯‘(𝐼‘𝑋)) ≤ 2) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 class class class wbr 5124 dom cdm 5659 Fun wfun 6530 Fn wfn 6531 ‘cfv 6536 ≤ cle 11275 2c2 12300 ♯chash 14353 Vtxcvtx 28980 iEdgciedg 28981 UHGraphcuhgr 29040 UPGraphcupgr 29064 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-12 2178 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pr 5407 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-ne 2934 df-ral 3053 df-rex 3062 df-rab 3421 df-v 3466 df-sbc 3771 df-dif 3934 df-un 3936 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-br 5125 df-opab 5187 df-id 5553 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-fv 6544 df-uhgr 29042 df-upgr 29066 |
| This theorem is referenced by: upgr2pthnlp 29719 |
| Copyright terms: Public domain | W3C validator |