Theorem usgrf1oedg 29134

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 29082	. . 3 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
4		f1f1orn 6811	. . 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 28976	. . . . . 6 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
8	7	a1i 11	. . . . 5 ⊢ (𝐺 ∈ USGraph → (Edg‘𝐺) = ran (iEdg‘𝐺))
9	2	eqcomi 2738	. . . . . 6 ⊢ (iEdg‘𝐺) = 𝐼
10	9	rneqi 5901	. . . . 5 ⊢ ran (iEdg‘𝐺) = ran 𝐼
11	8, 10	eqtrdi 2780	. . . 4 ⊢ (𝐺 ∈ USGraph → (Edg‘𝐺) = ran 𝐼)
12	6, 11	eqtrid 2776	. . 3 ⊢ (𝐺 ∈ USGraph → 𝐸 = ran 𝐼)
13	12	f1oeq3d 6797	. 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 3405   ∖ cdif 3911  ∅c0 4296  𝒫 cpw 4563  {csn 4589  dom cdm 5638  ran crn 5639  –1-1→wf1 6508  –1-1-onto→wf1o 6510  ‘cfv 6511  2c2 12241  ♯chash 14295  Vtxcvtx 28923  iEdgciedg 28924  Edgcedg 28974  USGraphcusgr 29076

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 5251  ax-nul 5261  ax-pr 5387  ax-un 7711

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 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-edg 28975  df-usgr 29078

This theorem is referenced by:  usgr2trlncl  29690