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

Theorem upgrle2 27954
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 483 . 2 ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → 𝐺 ∈ UPGraph)
2 upgruhgr 27951 . . . . 5 (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph)
3 upgrle2.i . . . . . 6 𝐼 = (iEdg‘𝐺)
43uhgrfun 27915 . . . . 5 (𝐺 ∈ UHGraph → Fun 𝐼)
52, 4syl 17 . . . 4 (𝐺 ∈ UPGraph → Fun 𝐼)
65funfnd 6530 . . 3 (𝐺 ∈ UPGraph → 𝐼 Fn dom 𝐼)
76adantr 481 . 2 ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → 𝐼 Fn dom 𝐼)
8 simpr 485 . 2 ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → 𝑋 ∈ dom 𝐼)
9 eqid 2736 . . 3 (Vtx‘𝐺) = (Vtx‘𝐺)
109, 3upgrle 27939 . 2 ((𝐺 ∈ UPGraph ∧ 𝐼 Fn dom 𝐼𝑋 ∈ dom 𝐼) → (♯‘(𝐼𝑋)) ≤ 2)
111, 7, 8, 10syl3anc 1371 1 ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → (♯‘(𝐼𝑋)) ≤ 2)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1541  wcel 2106   class class class wbr 5104  dom cdm 5632  Fun wfun 6488   Fn wfn 6489  cfv 6494  cle 11187  2c2 12205  chash 14227  Vtxcvtx 27845  iEdgciedg 27846  UHGraphcuhgr 27905  UPGraphcupgr 27929
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-10 2137  ax-12 2171  ax-ext 2707  ax-sep 5255  ax-nul 5262  ax-pr 5383
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-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-ne 2943  df-ral 3064  df-rex 3073  df-rab 3407  df-v 3446  df-sbc 3739  df-dif 3912  df-un 3914  df-in 3916  df-ss 3926  df-nul 4282  df-if 4486  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4865  df-br 5105  df-opab 5167  df-id 5530  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-iota 6446  df-fun 6496  df-fn 6497  df-f 6498  df-fv 6502  df-uhgr 27907  df-upgr 27931
This theorem is referenced by:  upgr2pthnlp  28578
  Copyright terms: Public domain W3C validator