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 49446
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 49452. (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 6905 . 2 (𝑔 = 𝑋 → (2nd ‘𝑔) = (2nd ‘𝑋))
3 id 23 . 2 (𝑋 ∈ 𝐺 → 𝑋 ∈ 𝐺)
4 fvexd 6920 . 2 (𝑋 ∈ 𝐺 → (2nd ‘𝑋) ∈ V)
51, 2, 3, 4fvmptd3 7037 1 (𝑋 ∈ 𝐺 → (𝐹‘𝑋) = (2nd ‘𝑋))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  Vcvv 3454  𝒫 cpw 4560  {copab 5170   ↦ cmpt 5189  ‘cfv 6555  2nd c2nd 8021  Vtxcvtx 29601  Edgcedg 29652  USPGraphcuspgr 29756  Pairscspr 48762
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
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-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  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-iota 6509  df-fun 6557  df-fv 6563
This theorem is used by:  uspgrsprf1  49448  uspgrsprfo  49449
  Copyright terms: Public domain W3C validator