Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  prstcval Structured version   Visualization version   GIF version

Theorem prstcval 49907
Description: Lemma for prstcnidlem 49908 and prstcthin 49917. (Contributed by Zhi Wang, 20-Sep-2024.) (New usage is discouraged.)
Hypotheses
Ref Expression
prstcnid.c (𝜑𝐶 = (ProsetToCat‘𝐾))
prstcnid.k (𝜑𝐾 ∈ Proset )
Assertion
Ref Expression
prstcval (𝜑𝐶 = ((𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩) sSet ⟨(comp‘ndx), ∅⟩))

Proof of Theorem prstcval
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 prstcnid.c . 2 (𝜑𝐶 = (ProsetToCat‘𝐾))
2 prstcnid.k . . 3 (𝜑𝐾 ∈ Proset )
3 id 22 . . . . . 6 (𝑘 = 𝐾𝑘 = 𝐾)
4 fveq2 6842 . . . . . . . 8 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
54xpeq1d 5661 . . . . . . 7 (𝑘 = 𝐾 → ((le‘𝑘) × {1o}) = ((le‘𝐾) × {1o}))
65opeq2d 4838 . . . . . 6 (𝑘 = 𝐾 → ⟨(Hom ‘ndx), ((le‘𝑘) × {1o})⟩ = ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩)
73, 6oveq12d 7386 . . . . 5 (𝑘 = 𝐾 → (𝑘 sSet ⟨(Hom ‘ndx), ((le‘𝑘) × {1o})⟩) = (𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩))
87oveq1d 7383 . . . 4 (𝑘 = 𝐾 → ((𝑘 sSet ⟨(Hom ‘ndx), ((le‘𝑘) × {1o})⟩) sSet ⟨(comp‘ndx), ∅⟩) = ((𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩) sSet ⟨(comp‘ndx), ∅⟩))
9 df-prstc 49906 . . . 4 ProsetToCat = (𝑘 ∈ Proset ↦ ((𝑘 sSet ⟨(Hom ‘ndx), ((le‘𝑘) × {1o})⟩) sSet ⟨(comp‘ndx), ∅⟩))
10 ovex 7401 . . . 4 ((𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩) sSet ⟨(comp‘ndx), ∅⟩) ∈ V
118, 9, 10fvmpt 6949 . . 3 (𝐾 ∈ Proset → (ProsetToCat‘𝐾) = ((𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩) sSet ⟨(comp‘ndx), ∅⟩))
122, 11syl 17 . 2 (𝜑 → (ProsetToCat‘𝐾) = ((𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩) sSet ⟨(comp‘ndx), ∅⟩))
131, 12eqtrd 2772 1 (𝜑𝐶 = ((𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩) sSet ⟨(comp‘ndx), ∅⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  c0 4287  {csn 4582  cop 4588   × cxp 5630  cfv 6500  (class class class)co 7368  1oc1o 8400   sSet csts 17102  ndxcnx 17132  lecple 17196  Hom chom 17200  compcco 17201   Proset cproset 18227  ProsetToCatcprstc 49905
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 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379
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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-iota 6456  df-fun 6502  df-fv 6508  df-ov 7371  df-prstc 49906
This theorem is referenced by:  prstcnidlem  49908  prstcthin  49917
  Copyright terms: Public domain W3C validator