| 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 2764 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | usgrf1oedg.i | . . . 4 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 3 | 1, 2 | usgrf 29358 | . . 3 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) |
| 4 | f1f1orn 6820 | . . 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 29252 | . . . . . 6 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
| 8 | 7 | a1i 11 | . . . . 5 ⊢ (𝐺 ∈ USGraph → (Edg‘𝐺) = ran (iEdg‘𝐺)) |
| 9 | 2 | eqcomi 2773 | . . . . . 6 ⊢ (iEdg‘𝐺) = 𝐼 |
| 10 | 9 | rneqi 5915 | . . . . 5 ⊢ ran (iEdg‘𝐺) = ran 𝐼 |
| 11 | 8, 10 | eqtrdi 2815 | . . . 4 ⊢ (𝐺 ∈ USGraph → (Edg‘𝐺) = ran 𝐼) |
| 12 | 6, 11 | eqtrid 2811 | . . 3 ⊢ (𝐺 ∈ USGraph → 𝐸 = ran 𝐼) |
| 13 | 12 | f1oeq3d 6805 | . 2 ⊢ (𝐺 ∈ USGraph → (𝐼:dom 𝐼–1-1-onto→𝐸 ↔ 𝐼:dom 𝐼–1-1-onto→ran 𝐼)) |
| 14 | 5, 13 | mpbird 259 | 1 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1-onto→𝐸) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1562 ∈ wcel 2144 {crab 3416 ∖ cdif 3903 ∅c0 4287 𝒫 cpw 4557 {csn 4584 dom cdm 5649 ran crn 5650 –1-1→wf1 6520 –1-1-onto→wf1o 6522 ‘cfv 6523 2c2 12274 ♯chash 14345 Vtxcvtx 29199 iEdgciedg 29200 Edgcedg 29250 USGraphcusgr 29352 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pr 5392 ax-un 7720 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-sbc 3747 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5544 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-edg 29251 df-usgr 29354 |
| This theorem is referenced by: usgr2trlncl 29962 |
| Copyright terms: Public domain | W3C validator |