Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  uspgrsprfv Structured version   Visualization version   GIF version

Theorem uspgrsprfv 49243
Description: The value of the function 𝐹 which maps a "simple pseudograph" for a fixed set 𝑉 of vertices to the set of edges (i.e. range of the edge function) of the graph. Solely for 𝐺 as defined here, the function 𝐹 is a bijection between the "simple pseudographs" and the subsets of the set of pairs 𝑃 over the fixed set 𝑉 of vertices, see uspgrbispr 49249. (Contributed by AV, 24-Nov-2021.)
Hypotheses
Ref Expression
uspgrsprf.p 𝑃 = 𝒫 (Pairs‘𝑉)
uspgrsprf.g 𝐺 = {⟨𝑣, 𝑒⟩ ∣ (𝑣 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒))}
uspgrsprf.f 𝐹 = (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔))
Assertion
Ref Expression
uspgrsprfv (𝑋 ∈ 𝐺 → (𝐹‘𝑋) = (2nd ‘𝑋))
Distinct variable groups:   𝑃,𝑒,𝑞,𝑣   𝑒,𝑉,𝑞,𝑣   𝑔,𝐺   𝑔,𝑋
Allowed substitution hints:   𝑃(𝑔)   𝐹(𝑣, 𝑒, 𝑔, 𝑞)   𝐺(𝑣, 𝑒, 𝑞)   𝑉(𝑔)   𝑋(𝑣, 𝑒, 𝑞)

Proof of Theorem uspgrsprfv
StepHypRef Expression
1 uspgrsprf.f . 2 𝐹 = (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔))
2 fveq2 6885 . 2 (𝑔 = 𝑋 → (2nd ‘𝑔) = (2nd ‘𝑋))
3 id 23 . 2 (𝑋 ∈ 𝐺 → 𝑋 ∈ 𝐺)
4 fvexd 6900 . 2 (𝑋 ∈ 𝐺 → (2nd ‘𝑋) ∈ V)
51, 2, 3, 4fvmptd3 7017 1 (𝑋 ∈ 𝐺 → (𝐹‘𝑋) = (2nd ‘𝑋))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∃wrex 3086  Vcvv 3450  𝒫 cpw 4556  {copab 5166   ↦ cmpt 5185  ‘cfv 6538  2nd c2nd 8000  Vtxcvtx 29574  Edgcedg 29625  USPGraphcuspgr 29729  Pairscspr 48559
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6540  df-fv 6546
This theorem is used by:  uspgrsprf1  49245  uspgrsprfo  49246
  Copyright terms: Public domain W3C validator