Theorem uspgrsprfv 41753

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 the fixed set 𝑉 of vertices, see uspgrbispr 41759. (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

Step	Hyp	Ref	Expression
1		uspgrsprf.f	. . 3 ⊢ 𝐹 = (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔))
2	1	a1i 11	. 2 ⊢ (𝑋 ∈ 𝐺 → 𝐹 = (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔)))
3		fveq2 6191	. . 3 ⊢ (𝑔 = 𝑋 → (2nd ‘𝑔) = (2nd ‘𝑋))
4	3	adantl 482	. 2 ⊢ ((𝑋 ∈ 𝐺 ∧ 𝑔 = 𝑋) → (2nd ‘𝑔) = (2nd ‘𝑋))
5		id 22	. 2 ⊢ (𝑋 ∈ 𝐺 → 𝑋 ∈ 𝐺)
6		fvexd 6203	. 2 ⊢ (𝑋 ∈ 𝐺 → (2nd ‘𝑋) ∈ V)
7	2, 4, 5, 6	fvmptd 6288	1 ⊢ (𝑋 ∈ 𝐺 → (𝐹‘𝑋) = (2nd ‘𝑋))

Syntax hints:   → wi 4   ∧ wa 384   = wceq 1483   ∈ wcel 1990  ∃wrex 2913  Vcvv 3200  𝒫 cpw 4158  {copab 4712   ↦ cmpt 4729  ‘cfv 5888  2^nd c2nd 7167  Vtxcvtx 25874  Edgcedg 25939   USPGraph cuspgr 26043  Pairscspr 41727

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-iota 5851  df-fun 5890  df-fv 5896

This theorem is referenced by:  uspgrsprf1  41755  uspgrsprfo  41756