| 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 2761 | . . 3 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | usgrf1o.e | . . 3 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 3 | 1, 2 | uspgrf 29735 | . 2 ⊢ (𝐺 ∈ USPGraph → 𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
| 4 | f1f1orn 6836 | . . 3 ⊢ (𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → 𝐸:dom 𝐸–1-1-onto→ran 𝐸) | |
| 5 | 2 | rneqi 5919 | . . . . 5 ⊢ ran 𝐸 = ran (iEdg‘𝐺) |
| 6 | edgval 29627 | . . . . 5 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
| 7 | 5, 6 | eqtr4i 2787 | . . . 4 ⊢ ran 𝐸 = (Edg‘𝐺) |
| 8 | f1oeq3 6814 | . . . 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 221 | . 2 ⊢ (𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → 𝐸:dom 𝐸–1-1-onto→(Edg‘𝐺)) |
| 11 | 3, 10 | syl 18 | 1 ⊢ (𝐺 ∈ USPGraph → 𝐸:dom 𝐸–1-1-onto→(Edg‘𝐺)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2145 {crab 3413 ∖ cdif 3896 ∅c0 4279 𝒫 cpw 4557 {csn 4584 class class class wbr 5103 dom cdm 5651 ran crn 5652 –1-1→wf1 6535 –1-1-onto→wf1o 6537 ‘cfv 6538 ≤ cle 11344 2c2 12397 ♯chash 14474 Vtxcvtx 29574 iEdgciedg 29575 Edgcedg 29625 USPGraphcuspgr 29729 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7751 |
| 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 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-edg 29626 df-uspgr 29731 |
| This theorem is used by: uspgredgiedg 29756 uspgriedgedg 29757 uspgr2wlkeq 30226 wlkiswwlks2lem4 30461 wlkiswwlks2lem5 30462 clwlkclwwlk 30593 isuspgrim0lem 48990 upgrimwlklem2 48995 upgrimwlklem3 48996 upgrimtrlslem2 49002 upgrimtrls 49003 uspgrlimlem1 49085 uspgrlimlem2 49086 uspgrlimlem3 49087 uspgrlimlem4 49088 uspgrlim 49089 |
| Copyright terms: Public domain | W3C validator |