| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uspgrf1oedg | Structured version Visualization version GIF version | ||
| Description: The edge function of a simple pseudograph is a bijective function onto the edges of the graph. (Contributed by AV, 2-Jan-2020.) (Revised by AV, 15-Oct-2020.) |
| Ref | Expression |
|---|---|
| usgrf1o.e | ⊢ 𝐸 = (iEdg‘𝐺) |
| Ref | Expression |
|---|---|
| uspgrf1oedg | ⊢ (𝐺 ∈ USPGraph → 𝐸:dom 𝐸⟶1-1onto(Edg‘𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . 3 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | usgrf1o.e | . . 3 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 3 | 1, 2 | uspgrf 29792 | . 2 ⊢ (𝐺 ∈ USPGraph → 𝐸:dom 𝐸⟶1-1{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
| 4 | f1f1orn 6866 | . . 3 ⊢ (𝐸:dom 𝐸⟶1-1{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → 𝐸:dom 𝐸⟶1-1ontoran 𝐸) | |
| 5 | 2 | rneqi 5931 | . . . . 5 ⊢ ran 𝐸 = ran (iEdg‘𝐺) |
| 6 | edgval 29684 | . . . . 5 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
| 7 | 5, 6 | eqtr4i 2789 | . . . 4 ⊢ ran 𝐸 = (Edg‘𝐺) |
| 8 | f1oeq3 6844 | . . . 4 ⊢ (ran 𝐸 = (Edg‘𝐺) → (𝐸:dom 𝐸⟶1-1ontoran 𝐸 ↔ 𝐸:dom 𝐸⟶1-1onto(Edg‘𝐺))) | |
| 9 | 7, 8 | ax-mp 5 | . . 3 ⊢ (𝐸:dom 𝐸⟶1-1ontoran 𝐸 ↔ 𝐸:dom 𝐸⟶1-1onto(Edg‘𝐺)) |
| 10 | 4, 9 | sylib 221 | . 2 ⊢ (𝐸:dom 𝐸⟶1-1{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → 𝐸:dom 𝐸⟶1-1onto(Edg‘𝐺)) |
| 11 | 3, 10 | syl 18 | 1 ⊢ (𝐺 ∈ USPGraph → 𝐸:dom 𝐸⟶1-1onto(Edg‘𝐺)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2147 {crab 3416 ∖ cdif 4048 ∅c0 4281 𝒫 cpw 4560 {csn 4588 class class class wbr 5108 dom cdm 5658 ran crn 5659 ⟶1-1wf1 6563 ⟶1-1ontowf1o 6565 ‘cfv 6566 ≤ cle 11383 2c2 12437 ♯chash 14515 Vtxcvtx 29631 iEdgciedg 29632 Edgcedg 29682 USPGraphcuspgr 29786 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-edg 29683 df-uspgr 29788 |
| This theorem is used by: uspgredgiedg 29813 uspgriedgedg 29814 uspgr2wlkeq 30283 wlkiswwlks2lem4 30518 wlkiswwlks2lem5 30519 clwlkclwwlk 30650 isuspgrim0lem 49325 upgrimwlklem2 49330 upgrimwlklem3 49331 upgrimtrlslem2 49337 upgrimtrls 49338 uspgrlimlem1 49420 uspgrlimlem2 49421 uspgrlimlem3 49422 uspgrlimlem4 49423 uspgrlim 49424 |
| Copyright terms: Public domain | W3C validator |