| 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 29195 | . . . 4 ⊢ (𝐺 ∈ USPGraph → 𝐼:dom 𝐼–1-1-onto→(Edg‘𝐺)) |
| 3 | uspgredgiedg.e | . . . . 5 ⊢ 𝐸 = (Edg‘𝐺) | |
| 4 | f1oeq3 6762 | . . . . 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 234 | . . 3 ⊢ (𝐺 ∈ USPGraph → 𝐼:dom 𝐼–1-1-onto→𝐸) |
| 7 | f1ofveu 7350 | . . 3 ⊢ ((𝐼:dom 𝐼–1-1-onto→𝐸 ∧ 𝐾 ∈ 𝐸) → ∃!𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝐾) | |
| 8 | 6, 7 | sylan 580 | . 2 ⊢ ((𝐺 ∈ USPGraph ∧ 𝐾 ∈ 𝐸) → ∃!𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝐾) |
| 9 | eqcom 2741 | . . 3 ⊢ (𝐾 = (𝐼‘𝑥) ↔ (𝐼‘𝑥) = 𝐾) | |
| 10 | 9 | reubii 3357 | . 2 ⊢ (∃!𝑥 ∈ dom 𝐼 𝐾 = (𝐼‘𝑥) ↔ ∃!𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝐾) |
| 11 | 8, 10 | sylibr 234 | 1 ⊢ ((𝐺 ∈ USPGraph ∧ 𝐾 ∈ 𝐸) → ∃!𝑥 ∈ dom 𝐼 𝐾 = (𝐼‘𝑥)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∃!wreu 3346 dom cdm 5622 –1-1-onto→wf1o 6489 ‘cfv 6490 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-reu 3349 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-res 5634 df-ima 5635 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: (None) |
| Copyright terms: Public domain | W3C validator |