Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  upgrfn Structured version   Visualization version   GIF version

Theorem upgrfn 26181
 Description: The edge function of an undirected pseudograph is a function into unordered pairs of vertices. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by AV, 10-Oct-2020.)
Hypotheses
Ref Expression
isupgr.v 𝑉 = (Vtx‘𝐺)
isupgr.e 𝐸 = (iEdg‘𝐺)
Assertion
Ref Expression
upgrfn ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) → 𝐸:𝐴⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
Distinct variable groups:   𝑥,𝐺   𝑥,𝑉
Allowed substitution hints:   𝐴(𝑥)   𝐸(𝑥)

Proof of Theorem upgrfn
StepHypRef Expression
1 isupgr.v . . . 4 𝑉 = (Vtx‘𝐺)
2 isupgr.e . . . 4 𝐸 = (iEdg‘𝐺)
31, 2upgrf 26180 . . 3 (𝐺 ∈ UPGraph → 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
4 fndm 6151 . . . 4 (𝐸 Fn 𝐴 → dom 𝐸 = 𝐴)
54feq2d 6192 . . 3 (𝐸 Fn 𝐴 → (𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ↔ 𝐸:𝐴⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
63, 5syl5ibcom 235 . 2 (𝐺 ∈ UPGraph → (𝐸 Fn 𝐴𝐸:𝐴⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
76imp 444 1 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) → 𝐸:𝐴⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1632   ∈ wcel 2139  {crab 3054   ∖ cdif 3712  ∅c0 4058  𝒫 cpw 4302  {csn 4321   class class class wbr 4804  dom cdm 5266   Fn wfn 6044  ⟶wf 6045  ‘cfv 6049   ≤ cle 10267  2c2 11262  ♯chash 13311  Vtxcvtx 26073  iEdgciedg 26074  UPGraphcupgr 26174 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-nul 4941 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ral 3055  df-rex 3056  df-rab 3059  df-v 3342  df-sbc 3577  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-op 4328  df-uni 4589  df-br 4805  df-opab 4865  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-fv 6057  df-upgr 26176 This theorem is referenced by:  upgrn0  26183  upgrle  26184
 Copyright terms: Public domain W3C validator