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 49807
Description: Lemma for prstcnid 49808 and prstchomval 49814. (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 49806 . . 3 (𝜑𝐶 = ((𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩) sSet ⟨(comp‘ndx), ∅⟩))
43fveq2d 6838 . 2 (𝜑 → (𝐸𝐶) = (𝐸‘((𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩) sSet ⟨(comp‘ndx), ∅⟩)))
5 prstcnid.e . . 3 𝐸 = Slot (𝐸‘ndx)
6 prstcnid.no . . 3 (𝐸‘ndx) ≠ (comp‘ndx)
75, 6setsnid 17135 . 2 (𝐸‘(𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩)) = (𝐸‘((𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩) sSet ⟨(comp‘ndx), ∅⟩))
84, 7eqtr4di 2789 1 (𝜑 → (𝐸𝐶) = (𝐸‘(𝐾 sSet ⟨(Hom ‘ndx), ((le‘𝐾) × {1o})⟩)))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2113  wne 2932  c0 4285  {csn 4580  cop 4586   × cxp 5622  cfv 6492  (class class class)co 7358  1oc1o 8390   sSet csts 17090  Slot cslot 17108  ndxcnx 17120  lecple 17184  Hom chom 17188  compcco 17189   Proset cproset 18215  ProsetToCatcprstc 49804
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  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 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-res 5636  df-iota 6448  df-fun 6494  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-sets 17091  df-slot 17109  df-prstc 49805
This theorem is referenced by:  prstcnid  49808  prstchomval  49814
  Copyright terms: Public domain W3C validator