Theorem uspgrf1oedg 29258

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.

Step	Hyp	Ref	Expression
1		eqid 2737	. . 3 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
2		usgrf1o.e	. . 3 ⊢ 𝐸 = (iEdg‘𝐺)
3	1, 2	uspgrf 29239	. 2 ⊢ (𝐺 ∈ USPGraph → 𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
4		f1f1orn 6793	. . 3 ⊢ (𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → 𝐸:dom 𝐸–1-1-onto→ran 𝐸)
5	2	rneqi 5894	. . . . 5 ⊢ ran 𝐸 = ran (iEdg‘𝐺)
6		edgval 29134	. . . . 5 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
7	5, 6	eqtr4i 2763	. . . 4 ⊢ ran 𝐸 = (Edg‘𝐺)
8		f1oeq3 6772	. . . 4 ⊢ (ran 𝐸 = (Edg‘𝐺) → (𝐸:dom 𝐸–1-1-onto→ran 𝐸 ↔ 𝐸:dom 𝐸–1-1-onto→(Edg‘𝐺)))
9	7, 8	ax-mp 5	. . 3 ⊢ (𝐸:dom 𝐸–1-1-onto→ran 𝐸 ↔ 𝐸:dom 𝐸–1-1-onto→(Edg‘𝐺))
10	4, 9	sylib 218	. 2 ⊢ (𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → 𝐸:dom 𝐸–1-1-onto→(Edg‘𝐺))
11	3, 10	syl 17	1 ⊢ (𝐺 ∈ USPGraph → 𝐸:dom 𝐸–1-1-onto→(Edg‘𝐺))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1542   ∈ wcel 2114  {crab 3401   ∖ cdif 3900  ∅c0 4287  𝒫 cpw 4556  {csn 4582   class class class wbr 5100  dom cdm 5632  ran crn 5633  –1-1→wf1 6497  –1-1-onto→wf1o 6499  ‘cfv 6500   ≤ cle 11179  2c2 12212  ♯chash 14265  Vtxcvtx 29081  iEdgciedg 29082  Edgcedg 29132  USPGraphcuspgr 29233

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-edg 29133  df-uspgr 29235

This theorem is referenced by:  uspgredgiedg  29260  uspgriedgedg  29261  uspgr2wlkeq  29731  wlkiswwlks2lem4  29957  wlkiswwlks2lem5  29958  clwlkclwwlk  30089  isuspgrim0lem  48253  upgrimwlklem2  48258  upgrimwlklem3  48259  upgrimtrlslem2  48265  upgrimtrls  48266  uspgrlimlem1  48348  uspgrlimlem2  48349  uspgrlimlem3  48350  uspgrlimlem4  48351  uspgrlim  48352