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 48621
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 48627. (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 6840 . 2 (𝑔 = 𝑋 → (2nd𝑔) = (2nd𝑋))
3 id 22 . 2 (𝑋𝐺𝑋𝐺)
4 fvexd 6855 . 2 (𝑋𝐺 → (2nd𝑋) ∈ V)
51, 2, 3, 4fvmptd3 6971 1 (𝑋𝐺 → (𝐹𝑋) = (2nd𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  wrex 3061  Vcvv 3429  𝒫 cpw 4541  {copab 5147  cmpt 5166  cfv 6498  2nd c2nd 7941  Vtxcvtx 29065  Edgcedg 29116  USPGraphcuspgr 29217  Pairscspr 47937
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-iota 6454  df-fun 6500  df-fv 6506
This theorem is referenced by:  uspgrsprf1  48623  uspgrsprfo  48624
  Copyright terms: Public domain W3C validator