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

Theorem upgrle2 29308
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 486 . 2 ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → 𝐺 ∈ UPGraph)
2 upgruhgr 29305 . . . . 5 (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph)
3 upgrle2.i . . . . . 6 𝐼 = (iEdg‘𝐺)
43uhgrfun 29269 . . . . 5 (𝐺 ∈ UHGraph → Fun 𝐼)
52, 4syl 17 . . . 4 (𝐺 ∈ UPGraph → Fun 𝐼)
65funfnd 6554 . . 3 (𝐺 ∈ UPGraph → 𝐼 Fn dom 𝐼)
76adantr 484 . 2 ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → 𝐼 Fn dom 𝐼)
8 simpr 488 . 2 ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → 𝑋 ∈ dom 𝐼)
9 eqid 2764 . . 3 (Vtx‘𝐺) = (Vtx‘𝐺)
109, 3upgrle 29293 . 2 ((𝐺 ∈ UPGraph ∧ 𝐼 Fn dom 𝐼𝑋 ∈ dom 𝐼) → (♯‘(𝐼𝑋)) ≤ 2)
111, 7, 8, 10syl3anc 1392 1 ((𝐺 ∈ UPGraph ∧ 𝑋 ∈ dom 𝐼) → (♯‘(𝐼𝑋)) ≤ 2)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1562  wcel 2144   class class class wbr 5102  dom cdm 5649  Fun wfun 6517   Fn wfn 6518  cfv 6523  cle 11219  2c2 12274  chash 14345  Vtxcvtx 29199  iEdgciedg 29200  UHGraphcuhgr 29259  UPGraphcupgr 29283
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-nul 5258  ax-pr 5392
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-ne 2960  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5103  df-opab 5165  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-fv 6531  df-uhgr 29261  df-upgr 29285
This theorem is referenced by:  upgr2pthnlp  29934
  Copyright terms: Public domain W3C validator