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

Theorem uspgrf1oedg 27079
 Description: The edge function of a simple pseudograph is a bijective function onto the edges of the graph. (Contributed by AV, 2-Jan-2020.) (Revised by AV, 15-Oct-2020.)
Hypothesis
Ref Expression
usgrf1o.e 𝐸 = (iEdg‘𝐺)
Assertion
Ref Expression
uspgrf1oedg (𝐺 ∈ USPGraph → 𝐸:dom 𝐸1-1-onto→(Edg‘𝐺))

Proof of Theorem uspgrf1oedg
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eqid 2758 . . 3 (Vtx‘𝐺) = (Vtx‘𝐺)
2 usgrf1o.e . . 3 𝐸 = (iEdg‘𝐺)
31, 2uspgrf 27060 . 2 (𝐺 ∈ USPGraph → 𝐸:dom 𝐸1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
4 f1f1orn 6618 . . 3 (𝐸:dom 𝐸1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → 𝐸:dom 𝐸1-1-onto→ran 𝐸)
52rneqi 5783 . . . . 5 ran 𝐸 = ran (iEdg‘𝐺)
6 edgval 26955 . . . . 5 (Edg‘𝐺) = ran (iEdg‘𝐺)
75, 6eqtr4i 2784 . . . 4 ran 𝐸 = (Edg‘𝐺)
8 f1oeq3 6597 . . . 4 (ran 𝐸 = (Edg‘𝐺) → (𝐸:dom 𝐸1-1-onto→ran 𝐸𝐸:dom 𝐸1-1-onto→(Edg‘𝐺)))
97, 8ax-mp 5 . . 3 (𝐸:dom 𝐸1-1-onto→ran 𝐸𝐸:dom 𝐸1-1-onto→(Edg‘𝐺))
104, 9sylib 221 . 2 (𝐸:dom 𝐸1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → 𝐸:dom 𝐸1-1-onto→(Edg‘𝐺))
113, 10syl 17 1 (𝐺 ∈ USPGraph → 𝐸:dom 𝐸1-1-onto→(Edg‘𝐺))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   = wceq 1538   ∈ wcel 2111  {crab 3074   ∖ cdif 3857  ∅c0 4227  𝒫 cpw 4497  {csn 4525   class class class wbr 5036  dom cdm 5528  ran crn 5529  –1-1→wf1 6337  –1-1-onto→wf1o 6339  ‘cfv 6340   ≤ cle 10727  2c2 11742  ♯chash 13753  Vtxcvtx 26902  iEdgciedg 26903  Edgcedg 26953  USPGraphcuspgr 27054 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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-sep 5173  ax-nul 5180  ax-pr 5302  ax-un 7465 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2557  df-eu 2588  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ne 2952  df-ral 3075  df-rex 3076  df-rab 3079  df-v 3411  df-sbc 3699  df-dif 3863  df-un 3865  df-in 3867  df-ss 3877  df-nul 4228  df-if 4424  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4802  df-br 5037  df-opab 5099  df-mpt 5117  df-id 5434  df-xp 5534  df-rel 5535  df-cnv 5536  df-co 5537  df-dm 5538  df-rn 5539  df-iota 6299  df-fun 6342  df-fn 6343  df-f 6344  df-f1 6345  df-fo 6346  df-f1o 6347  df-fv 6348  df-edg 26954  df-uspgr 27056 This theorem is referenced by:  uspgr2wlkeq  27548  wlkiswwlks2lem4  27771  wlkiswwlks2lem5  27772  clwlkclwwlk  27900
 Copyright terms: Public domain W3C validator