Theorem usgrf1oedg 26997

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 2798	. . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
2		usgrf1oedg.i	. . . 4 ⊢ 𝐼 = (iEdg‘𝐺)
3	1, 2	usgrf 26948	. . 3 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
4		f1f1orn 6601	. . 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 26842	. . . . . 6 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
8	7	a1i 11	. . . . 5 ⊢ (𝐺 ∈ USGraph → (Edg‘𝐺) = ran (iEdg‘𝐺))
9	2	eqcomi 2807	. . . . . 6 ⊢ (iEdg‘𝐺) = 𝐼
10	9	rneqi 5771	. . . . 5 ⊢ ran (iEdg‘𝐺) = ran 𝐼
11	8, 10	eqtrdi 2849	. . . 4 ⊢ (𝐺 ∈ USGraph → (Edg‘𝐺) = ran 𝐼)
12	6, 11	syl5eq 2845	. . 3 ⊢ (𝐺 ∈ USGraph → 𝐸 = ran 𝐼)
13	12	f1oeq3d 6587	. 2 ⊢ (𝐺 ∈ USGraph → (𝐼:dom 𝐼–1-1-onto→𝐸 ↔ 𝐼:dom 𝐼–1-1-onto→ran 𝐼))
14	5, 13	mpbird 260	1 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1-onto→𝐸)

Syntax hints:   → wi 4   = wceq 1538   ∈ wcel 2111  {crab 3110   ∖ cdif 3878  ∅c0 4243  𝒫 cpw 4497  {csn 4525  dom cdm 5519  ran crn 5520  –1-1→wf1 6321  –1-1-onto→wf1o 6323  ‘cfv 6324  2c2 11680  ♯chash 13686  Vtxcvtx 26789  iEdgciedg 26790  Edgcedg 26840  USGraphcusgr 26942

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-edg 26841  df-usgr 26944

This theorem is referenced by:  usgr2trlncl  27549