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

Theorem prstcnidlem 50042
Description: Lemma for prstcnid 50043 and prstchomval 50049. (Contributed by Zhi Wang, 20-Sep-2024.) (New usage is discouraged.)
Hypotheses
Ref Expression
prstcnid.c (𝜑𝐶 = (ProsetToCat‘𝐾))
prstcnid.k (𝜑𝐾 ∈ Proset )
prstcnid.e 𝐸 = Slot (𝐸‘ndx)
prstcnid.no (𝐸‘ndx) ≠ (comp‘ndx)
Assertion
Ref Expression
prstcnidlem (𝜑 → (𝐸𝐶) = (𝐸‘(𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩)))

Proof of Theorem prstcnidlem
StepHypRef Expression
1 prstcnid.c . . . 4 (𝜑𝐶 = (ProsetToCat‘𝐾))
2 prstcnid.k . . . 4 (𝜑𝐾 ∈ Proset )
31, 2prstcval 50041 . . 3 (𝜑𝐶 = ((𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩) sSet ⟨(comp‘ndx), ∅⟩))
43fveq2d 6831 . 2 (𝜑 → (𝐸𝐶) = (𝐸‘((𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩) sSet ⟨(comp‘ndx), ∅⟩)))
5 prstcnid.e . . 3 𝐸 = Slot (𝐸‘ndx)
6 prstcnid.no . . 3 (𝐸‘ndx) ≠ (comp‘ndx)
75, 6setsnid 17169 . 2 (𝐸‘(𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩)) = (𝐸‘((𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩) sSet ⟨(comp‘ndx), ∅⟩))
84, 7eqtr4di 2792 1 (𝜑 → (𝐸𝐶) = (𝐸‘(𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩)))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1547  wcel 2119  wne 2934  c0 4261  {csn 4555  cop 4561   × cxp 5616  cfv 6485  (class class class)co 7356  1oc1o 8388   sSet csts 17124  Slot cslot 17142  ndxcnx 17154  lecple 17218  Hom chom 17222  compcco 17223   Proset cproset 18249  ProsetToCatcprstc 50039
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-sbc 3724  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-res 5630  df-iota 6441  df-fun 6487  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-sets 17125  df-slot 17143  df-prstc 50040
This theorem is referenced by:  prstcnid  50043  prstchomval  50049
  Copyright terms: Public domain W3C validator