Theorem uspgrf1oedg 29636

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 2760	. . 3 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
2		usgrf1o.e	. . 3 ⊢ 𝐸 = (iEdg‘𝐺)
3	1, 2	uspgrf 29617	. 2 ⊢ (𝐺 ∈ USPGraph → 𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
4		f1f1orn 6830	. . 3 ⊢ (𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → 𝐸:dom 𝐸–1-1-onto→ran 𝐸)
5	2	rneqi 5921	. . . . 5 ⊢ ran 𝐸 = ran (iEdg‘𝐺)
6		edgval 29509	. . . . 5 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
7	5, 6	eqtr4i 2786	. . . 4 ⊢ ran 𝐸 = (Edg‘𝐺)
8		f1oeq3 6808	. . . 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 221	. 2 ⊢ (𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → 𝐸:dom 𝐸–1-1-onto→(Edg‘𝐺))
11	3, 10	syl 18	1 ⊢ (𝐺 ∈ USPGraph → 𝐸:dom 𝐸–1-1-onto→(Edg‘𝐺))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2145  {crab 3412   ∖ cdif 3896  ∅c0 4279  𝒫 cpw 4557  {csn 4584   class class class wbr 5103  dom cdm 5655  ran crn 5656  –1-1→wf1 6530  –1-1-onto→wf1o 6532  ‘cfv 6533   ≤ cle 11271  2c2 12322  ♯chash 14397  Vtxcvtx 29456  iEdgciedg 29457  Edgcedg 29507  USPGraphcuspgr 29611

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 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7737

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 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 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-edg 29508  df-uspgr 29613

This theorem is used by:  uspgredgiedg  29638  uspgriedgedg  29639  uspgr2wlkeq  30108  wlkiswwlks2lem4  30343  wlkiswwlks2lem5  30344  clwlkclwwlk  30475  isuspgrim0lem  48812  upgrimwlklem2  48817  upgrimwlklem3  48818  upgrimtrlslem2  48824  upgrimtrls  48825  uspgrlimlem1  48907  uspgrlimlem2  48908  uspgrlimlem3  48909  uspgrlimlem4  48910  uspgrlim  48911