| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uspgredgiedg | Structured version Visualization version GIF version | ||
| Description: In a simple pseudograph, for each edge there is exactly one indexed edge. (Contributed by AV, 20-Apr-2025.) |
| Ref | Expression |
|---|---|
| uspgredgiedg.e | ⊢ 𝐸 = (Edg‘𝐺) |
| uspgredgiedg.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| Ref | Expression |
|---|---|
| uspgredgiedg | ⊢ ((𝐺 ∈ USPGraph ∧ 𝐾 ∈ 𝐸) → ∃!𝑥 ∈ dom 𝐼 𝐾 = (𝐼‘𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uspgredgiedg.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 2 | 1 | uspgrf1oedg 29261 | . . . 4 ⊢ (𝐺 ∈ USPGraph → 𝐼:dom 𝐼–1-1-onto→(Edg‘𝐺)) |
| 3 | uspgredgiedg.e | . . . . 5 ⊢ 𝐸 = (Edg‘𝐺) | |
| 4 | f1oeq3 6758 | . . . . 5 ⊢ (𝐸 = (Edg‘𝐺) → (𝐼:dom 𝐼–1-1-onto→𝐸 ↔ 𝐼:dom 𝐼–1-1-onto→(Edg‘𝐺))) | |
| 5 | 3, 4 | ax-mp 5 | . . . 4 ⊢ (𝐼:dom 𝐼–1-1-onto→𝐸 ↔ 𝐼:dom 𝐼–1-1-onto→(Edg‘𝐺)) |
| 6 | 2, 5 | sylibr 235 | . . 3 ⊢ (𝐺 ∈ USPGraph → 𝐼:dom 𝐼–1-1-onto→𝐸) |
| 7 | f1ofveu 7351 | . . 3 ⊢ ((𝐼:dom 𝐼–1-1-onto→𝐸 ∧ 𝐾 ∈ 𝐸) → ∃!𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝐾) | |
| 8 | 6, 7 | sylan 586 | . 2 ⊢ ((𝐺 ∈ USPGraph ∧ 𝐾 ∈ 𝐸) → ∃!𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝐾) |
| 9 | eqcom 2746 | . . 3 ⊢ (𝐾 = (𝐼‘𝑥) ↔ (𝐼‘𝑥) = 𝐾) | |
| 10 | 9 | reubii 3353 | . 2 ⊢ (∃!𝑥 ∈ dom 𝐼 𝐾 = (𝐼‘𝑥) ↔ ∃!𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝐾) |
| 11 | 8, 10 | sylibr 235 | 1 ⊢ ((𝐺 ∈ USPGraph ∧ 𝐾 ∈ 𝐸) → ∃!𝑥 ∈ dom 𝐼 𝐾 = (𝐼‘𝑥)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∃!wreu 3342 dom cdm 5619 –1-1-onto→wf1o 6485 ‘cfv 6486 iEdgciedg 29085 Edgcedg 29135 USPGraphcuspgr 29236 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5219 ax-nul 5229 ax-pr 5363 ax-un 7679 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4263 df-if 4456 df-pw 4532 df-sn 4557 df-pr 4559 df-op 4563 df-uni 4840 df-br 5074 df-opab 5136 df-mpt 5155 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-edg 29136 df-uspgr 29238 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |