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

Theorem usgrf1oedg 29789
Description: The edge function of a simple graph is a 1-1 function onto the set of edges. (Contributed by AV, 18-Oct-2020.)
Hypotheses
Ref Expression
usgrf1oedg.i 𝐼 = (iEdg‘𝐺)
usgrf1oedg.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
usgrf1oedg (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1-onto→𝐸)

Proof of Theorem usgrf1oedg
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eqid 2760 . . . 4 (Vtx‘𝐺) = (Vtx‘𝐺)
2 usgrf1oedg.i . . . 4 𝐼 = (iEdg‘𝐺)
31, 2usgrf 29737 . . 3 (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
4 f1f1orn 6836 . . 3 (𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
53, 4syl 18 . 2 (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
6 usgrf1oedg.e . . . 4 𝐸 = (Edg‘𝐺)
7 edgval 29628 . . . . . 6 (Edg‘𝐺) = ran (iEdg‘𝐺)
87a1i 11 . . . . 5 (𝐺 ∈ USGraph → (Edg‘𝐺) = ran (iEdg‘𝐺))
92eqcomi 2769 . . . . . 6 (iEdg‘𝐺) = 𝐼
109rneqi 5918 . . . . 5 ran (iEdg‘𝐺) = ran 𝐼
118, 10eqtrdi 2811 . . . 4 (𝐺 ∈ USGraph → (Edg‘𝐺) = ran 𝐼)
126, 11eqtrid 2807 . . 3 (𝐺 ∈ USGraph → 𝐸 = ran 𝐼)
1312f1oeq3d 6821 . 2 (𝐺 ∈ USGraph → (𝐼:dom 𝐼–1-1-onto→𝐸 ↔ 𝐼:dom 𝐼–1-1-onto→ran 𝐼))
145, 13mpbird 260 1 (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1-onto→𝐸)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  {crab 3412   ∖ cdif 4045  ∅c0 4278  𝒫 cpw 4556  {csn 4583  dom cdm 5650  ran crn 5651  –1-1→wf1 6535  –1-1-onto→wf1o 6537  ‘cfv 6538  2c2 12398  ♯chash 14475  Vtxcvtx 29575  iEdgciedg 29576  Edgcedg 29626  USGraphcusgr 29731
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-edg 29627  df-usgr 29733
This theorem is used by:  usgr2trlncl  30347
  Copyright terms: Public domain W3C validator