MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  upgrle2 Structured version   Visualization version   GIF version

Theorem upgrle2 29196
Description: An edge of an undirected pseudograph has at most two ends. (Contributed by AV, 6-Feb-2021.)
Hypothesis
Ref Expression
upgrle2.i 𝐼 = (iEdg‘𝐺)
Assertion
Ref Expression
upgrle2 ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → (♯‘(𝐼𝑋)) ≤ 2)

Proof of Theorem upgrle2
StepHypRef Expression
1 simpl 482 . 2 ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → 𝐺 ∈ UPGraph)
2 upgruhgr 29193 . . . . 5 (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph)
3 upgrle2.i . . . . . 6 𝐼 = (iEdg‘𝐺)
43uhgrfun 29157 . . . . 5 (𝐺 ∈ UHGraph → Fun 𝐼)
52, 4syl 17 . . . 4 (𝐺 ∈ UPGraph → Fun 𝐼)
65funfnd 6533 . . 3 (𝐺 ∈ UPGraph → 𝐼 Fn dom 𝐼)
76adantr 480 . 2 ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → 𝐼 Fn dom 𝐼)
8 simpr 484 . 2 ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → 𝑋 ∈ dom 𝐼)
9 eqid 2737 . . 3 (Vtx‘𝐺) = (Vtx‘𝐺)
109, 3upgrle 29181 . 2 ((𝐺 ∈ UPGraph ∧ 𝐼 Fn dom 𝐼𝑋 ∈ dom 𝐼) → (♯‘(𝐼𝑋)) ≤ 2)
111, 7, 8, 10syl3anc 1374 1 ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → (♯‘(𝐼𝑋)) ≤ 2)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114   class class class wbr 5100  dom cdm 5634  Fun wfun 6496   Fn wfn 6497  cfv 6502  cle 11181  2c2 12214  chash 14267  Vtxcvtx 29087  iEdgciedg 29088  UHGraphcuhgr 29147  UPGraphcupgr 29171
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-12 2185  ax-ext 2709  ax-sep 5245  ax-nul 5255  ax-pr 5381
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-id 5529  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-fv 6510  df-uhgr 29149  df-upgr 29173
This theorem is referenced by:  upgr2pthnlp  29823
  Copyright terms: Public domain W3C validator