| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgrf1oedg | Structured version Visualization version GIF version | ||
| Description: The edge function of a simple graph is a 1-1 function onto the set of edges. (Contributed by AV, 18-Oct-2020.) |
| Ref | Expression |
|---|---|
| usgrf1oedg.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| usgrf1oedg.e | ⊢ 𝐸 = (Edg‘𝐺) |
| Ref | Expression |
|---|---|
| usgrf1oedg | ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1-onto→𝐸) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2769 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | usgrf1oedg.i | . . . 4 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 3 | 1, 2 | usgrf 29446 | . . 3 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) |
| 4 | f1f1orn 6833 | . . 3 ⊢ (𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → 𝐼:dom 𝐼–1-1-onto→ran 𝐼) | |
| 5 | 3, 4 | syl 18 | . 2 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1-onto→ran 𝐼) |
| 6 | usgrf1oedg.e | . . . 4 ⊢ 𝐸 = (Edg‘𝐺) | |
| 7 | edgval 29340 | . . . . . 6 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
| 8 | 7 | a1i 11 | . . . . 5 ⊢ (𝐺 ∈ USGraph → (Edg‘𝐺) = ran (iEdg‘𝐺)) |
| 9 | 2 | eqcomi 2778 | . . . . . 6 ⊢ (iEdg‘𝐺) = 𝐼 |
| 10 | 9 | rneqi 5928 | . . . . 5 ⊢ ran (iEdg‘𝐺) = ran 𝐼 |
| 11 | 8, 10 | eqtrdi 2820 | . . . 4 ⊢ (𝐺 ∈ USGraph → (Edg‘𝐺) = ran 𝐼) |
| 12 | 6, 11 | eqtrid 2816 | . . 3 ⊢ (𝐺 ∈ USGraph → 𝐸 = ran 𝐼) |
| 13 | 12 | f1oeq3d 6818 | . 2 ⊢ (𝐺 ∈ USGraph → (𝐼:dom 𝐼–1-1-onto→𝐸 ↔ 𝐼:dom 𝐼–1-1-onto→ran 𝐼)) |
| 14 | 5, 13 | mpbird 260 | 1 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1-onto→𝐸) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ∈ wcel 2149 {crab 3423 ∖ cdif 3910 ∅c0 4294 𝒫 cpw 4567 {csn 4594 dom cdm 5662 ran crn 5663 –1-1→wf1 6534 –1-1-onto→wf1o 6536 ‘cfv 6537 2c2 12295 ♯chash 14366 Vtxcvtx 29287 iEdgciedg 29288 Edgcedg 29338 USGraphcusgr 29440 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-edg 29339 df-usgr 29442 |
| This theorem is referenced by: usgr2trlncl 30050 |
| Copyright terms: Public domain | W3C validator |