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

Theorem usgrf1oedg 29668
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 2762 . . . 4 (Vtx‘𝐺) = (Vtx‘𝐺)
2 usgrf1oedg.i . . . 4 𝐼 = (iEdg‘𝐺)
31, 2usgrf 29616 . . 3 (𝐺 ∈ USGraph → 𝐼:dom 𝐼1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
4 f1f1orn 6833 . . 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 29507 . . . . . 6 (Edg‘𝐺) = ran (iEdg‘𝐺)
87a1i 11 . . . . 5 (𝐺 ∈ USGraph → (Edg‘𝐺) = ran (iEdg‘𝐺))
92eqcomi 2771 . . . . . 6 (iEdg‘𝐺) = 𝐼
109rneqi 5925 . . . . 5 ran (iEdg‘𝐺) = ran 𝐼
118, 10eqtrdi 2813 . . . 4 (𝐺 ∈ USGraph → (Edg‘𝐺) = ran 𝐼)
126, 11eqtrid 2809 . . 3 (𝐺 ∈ USGraph → 𝐸 = ran 𝐼)
1312f1oeq3d 6818 . 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 1570  wcel 2145  {crab 3414  cdif 3899  c0 4282  𝒫 cpw 4560  {csn 4587  dom cdm 5659  ran crn 5660  1-1wf1 6534  1-1-ontowf1o 6536  cfv 6537  2c2 12322  chash 14396  Vtxcvtx 29454  iEdgciedg 29455  Edgcedg 29505  USGraphcusgr 29610
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-edg 29506  df-usgr 29612
This theorem is used by:  usgr2trlncl  30226
  Copyright terms: Public domain W3C validator