| 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-1-onto→(Edg‘𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2734 | . . 3 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | usgrf1o.e | . . 3 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 3 | 1, 2 | uspgrf 29176 | . 2 ⊢ (𝐺 ∈ USPGraph → 𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
| 4 | f1f1orn 6783 | . . 3 ⊢ (𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → 𝐸:dom 𝐸–1-1-onto→ran 𝐸) | |
| 5 | 2 | rneqi 5884 | . . . . 5 ⊢ ran 𝐸 = ran (iEdg‘𝐺) |
| 6 | edgval 29071 | . . . . 5 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
| 7 | 5, 6 | eqtr4i 2760 | . . . 4 ⊢ ran 𝐸 = (Edg‘𝐺) |
| 8 | f1oeq3 6762 | . . . 4 ⊢ (ran 𝐸 = (Edg‘𝐺) → (𝐸:dom 𝐸–1-1-onto→ran 𝐸 ↔ 𝐸:dom 𝐸–1-1-onto→(Edg‘𝐺))) | |
| 9 | 7, 8 | ax-mp 5 | . . 3 ⊢ (𝐸:dom 𝐸–1-1-onto→ran 𝐸 ↔ 𝐸:dom 𝐸–1-1-onto→(Edg‘𝐺)) |
| 10 | 4, 9 | sylib 218 | . 2 ⊢ (𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → 𝐸:dom 𝐸–1-1-onto→(Edg‘𝐺)) |
| 11 | 3, 10 | syl 17 | 1 ⊢ (𝐺 ∈ USPGraph → 𝐸:dom 𝐸–1-1-onto→(Edg‘𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1541 ∈ wcel 2113 {crab 3397 ∖ cdif 3896 ∅c0 4283 𝒫 cpw 4552 {csn 4578 class class class wbr 5096 dom cdm 5622 ran crn 5623 –1-1→wf1 6487 –1-1-onto→wf1o 6489 ‘cfv 6490 ≤ cle 11165 2c2 12198 ♯chash 14251 Vtxcvtx 29018 iEdgciedg 29019 Edgcedg 29069 USPGraphcuspgr 29170 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pr 5375 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-sbc 3739 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-mpt 5178 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-edg 29070 df-uspgr 29172 |
| This theorem is referenced by: uspgredgiedg 29197 uspgriedgedg 29198 uspgr2wlkeq 29668 wlkiswwlks2lem4 29894 wlkiswwlks2lem5 29895 clwlkclwwlk 30026 isuspgrim0lem 48081 upgrimwlklem2 48086 upgrimwlklem3 48087 upgrimtrlslem2 48093 upgrimtrls 48094 uspgrlimlem1 48176 uspgrlimlem2 48177 uspgrlimlem3 48178 uspgrlimlem4 48179 uspgrlim 48180 |
| Copyright terms: Public domain | W3C validator |