Theorem uspgrf 29189

Description: The edge function of a simple pseudograph is a one-to-one function into unordered pairs of vertices. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 13-Oct-2020.)

Hypotheses

Ref	Expression
isuspgr.v	⊢ 𝑉 = (Vtx‘𝐺)
isuspgr.e	⊢ 𝐸 = (iEdg‘𝐺)

Assertion

Ref	Expression
uspgrf	⊢ (𝐺 ∈ USPGraph → 𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})

Distinct variable groups:   𝑥,𝐺   𝑥,𝑉

Allowed substitution hint:   𝐸(𝑥)

Proof of Theorem uspgrf

Step	Hyp	Ref	Expression
1		isuspgr.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
2		isuspgr.e	. . 3 ⊢ 𝐸 = (iEdg‘𝐺)
3	1, 2	isuspgr 29187	. 2 ⊢ (𝐺 ∈ USPGraph → (𝐺 ∈ USPGraph ↔ 𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
4	3	ibi 267	1 ⊢ (𝐺 ∈ USPGraph → 𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2108  {crab 3443   ∖ cdif 3973  ∅c0 4352  𝒫 cpw 4622  {csn 4648   class class class wbr 5166  dom cdm 5700  –1-1→wf1 6570  ‘cfv 6573   ≤ cle 11325  2c2 12348  ♯chash 14379  Vtxcvtx 29031  iEdgciedg 29032  USPGraphcuspgr 29183

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711  ax-nul 5324

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fv 6581  df-uspgr 29185

This theorem is referenced by:  uspgrf1oedg  29208  usgrumgruspgr  29217  usgruspgrb  29218  usgrislfuspgr  29222  uspgrn2crct  29841