Theorem uspgredgiedg 29783

Description: In a simple pseudograph, for each edge there is exactly one indexed edge. (Contributed by AV, 20-Apr-2025.)

Hypotheses

Ref	Expression
uspgredgiedg.e	⊢ 𝐸 = (Edg‘𝐺)
uspgredgiedg.i	⊢ 𝐼 = (iEdg‘𝐺)

Assertion

Ref	Expression
uspgredgiedg	⊢ ((𝐺 ∈ USPGraph ∧ 𝐾 ∈ 𝐸) → ∃!𝑥 ∈ dom 𝐼 𝐾 = (𝐼‘𝑥))

Distinct variable groups:   𝑥,𝐸   𝑥,𝐼   𝑥,𝐾

Allowed substitution hint:   𝐺(𝑥)

Proof of Theorem uspgredgiedg

Step	Hyp	Ref	Expression
1		uspgredgiedg.i	. . . . 5 ⊢ 𝐼 = (iEdg‘𝐺)
2	1	uspgrf1oedg 29781	. . . 4 ⊢ (𝐺 ∈ USPGraph → 𝐼:dom 𝐼⟶1-1onto(Edg‘𝐺))
3		uspgredgiedg.e	. . . . 5 ⊢ 𝐸 = (Edg‘𝐺)
4		f1oeq3 6833	. . . . 5 ⊢ (𝐸 = (Edg‘𝐺) → (𝐼:dom 𝐼⟶1-1onto𝐸 ↔ 𝐼:dom 𝐼⟶1-1onto(Edg‘𝐺)))
5	3, 4	ax-mp 5	. . . 4 ⊢ (𝐼:dom 𝐼⟶1-1onto𝐸 ↔ 𝐼:dom 𝐼⟶1-1onto(Edg‘𝐺))
6	2, 5	sylibr 237	. . 3 ⊢ (𝐺 ∈ USPGraph → 𝐼:dom 𝐼⟶1-1onto𝐸)
7		f1ofveu 7434	. . 3 ⊢ ((𝐼:dom 𝐼⟶1-1onto𝐸 ∧ 𝐾 ∈ 𝐸) → ∃!𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝐾)
8	6, 7	sylan 592	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ 𝐾 ∈ 𝐸) → ∃!𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝐾)
9		eqcom 2770	. . 3 ⊢ (𝐾 = (𝐼‘𝑥) ↔ (𝐼‘𝑥) = 𝐾)
10	9	reubii 3378	. 2 ⊢ (∃!𝑥 ∈ dom 𝐼 𝐾 = (𝐼‘𝑥) ↔ ∃!𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝐾)
11	8, 10	sylibr 237	1 ⊢ ((𝐺 ∈ USPGraph ∧ 𝐾 ∈ 𝐸) → ∃!𝑥 ∈ dom 𝐼 𝐾 = (𝐼‘𝑥))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃!wreu 3367  dom cdm 5655  ⟶1-1ontowf1o 6554  ‘cfv 6555  iEdgciedg 29602  Edgcedg 29652  USPGraphcuspgr 29756

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 5252  ax-nul 5263  ax-pr 5395  ax-un 7772

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-reu 3370  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 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-edg 29653  df-uspgr 29758

This theorem is used by: (None)