Theorem usgrf1oedg 29152

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.

Step	Hyp	Ref	Expression
1		eqid 2729	. . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
2		usgrf1oedg.i	. . . 4 ⊢ 𝐼 = (iEdg‘𝐺)
3	1, 2	usgrf 29100	. . 3 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
4		f1f1orn 6775	. . 3 ⊢ (𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
5	3, 4	syl 17	. 2 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
6		usgrf1oedg.e	. . . 4 ⊢ 𝐸 = (Edg‘𝐺)
7		edgval 28994	. . . . . 6 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
8	7	a1i 11	. . . . 5 ⊢ (𝐺 ∈ USGraph → (Edg‘𝐺) = ran (iEdg‘𝐺))
9	2	eqcomi 2738	. . . . . 6 ⊢ (iEdg‘𝐺) = 𝐼
10	9	rneqi 5879	. . . . 5 ⊢ ran (iEdg‘𝐺) = ran 𝐼
11	8, 10	eqtrdi 2780	. . . 4 ⊢ (𝐺 ∈ USGraph → (Edg‘𝐺) = ran 𝐼)
12	6, 11	eqtrid 2776	. . 3 ⊢ (𝐺 ∈ USGraph → 𝐸 = ran 𝐼)
13	12	f1oeq3d 6761	. 2 ⊢ (𝐺 ∈ USGraph → (𝐼:dom 𝐼–1-1-onto→𝐸 ↔ 𝐼:dom 𝐼–1-1-onto→ran 𝐼))
14	5, 13	mpbird 257	1 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1-onto→𝐸)

Syntax hints:   → wi 4   = wceq 1540   ∈ wcel 2109  {crab 3394   ∖ cdif 3900  ∅c0 4284  𝒫 cpw 4551  {csn 4577  dom cdm 5619  ran crn 5620  –1-1→wf1 6479  –1-1-onto→wf1o 6481  ‘cfv 6482  2c2 12183  ♯chash 14237  Vtxcvtx 28941  iEdgciedg 28942  Edgcedg 28992  USGraphcusgr 29094

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5235  ax-nul 5245  ax-pr 5371  ax-un 7671

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3395  df-v 3438  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-br 5093  df-opab 5155  df-mpt 5174  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-edg 28993  df-usgr 29096

This theorem is referenced by:  usgr2trlncl  29705