Theorem mndtcval 51048

Description: Value of the category built from a monoid. (Contributed by Zhi Wang, 22-Sep-2024.) (New usage is discouraged.)

Hypotheses

Ref	Expression
mndtcbaseu.c	⊢ (𝜑 → 𝐶 = (MndToCat‘𝑀))
mndtcbaseu.m	⊢ (𝜑 → 𝑀 ∈ Mnd)

Assertion

Ref	Expression
mndtcval	⊢ (𝜑 → 𝐶 = {⟨(Base‘ndx), {𝑀}⟩, ⟨(Hom ‘ndx), {⟨𝑀, 𝑀, (Base‘𝑀)⟩}⟩, ⟨(comp‘ndx), {⟨⟨𝑀, 𝑀, 𝑀⟩, (+g‘𝑀)⟩}⟩})

Proof of Theorem mndtcval

Dummy variable 𝑚 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mndtcbaseu.c	. 2 ⊢ (𝜑 → 𝐶 = (MndToCat‘𝑀))
2		mndtcbaseu.m	. . 3 ⊢ (𝜑 → 𝑀 ∈ Mnd)
3		sneq 4594	. . . . . 6 ⊢ (𝑚 = 𝑀 → {𝑚} = {𝑀})
4	3	opeq2d 4852	. . . . 5 ⊢ (𝑚 = 𝑀 → ⟨(Base‘ndx), {𝑚}⟩ = ⟨(Base‘ndx), {𝑀}⟩)
5		id 23	. . . . . . . 8 ⊢ (𝑚 = 𝑀 → 𝑚 = 𝑀)
6		fveq2 6916	. . . . . . . 8 ⊢ (𝑚 = 𝑀 → (Base‘𝑚) = (Base‘𝑀))
7	5, 5, 6	oteq123d 4871	. . . . . . 7 ⊢ (𝑚 = 𝑀 → ⟨𝑚, 𝑚, (Base‘𝑚)⟩ = ⟨𝑀, 𝑀, (Base‘𝑀)⟩)
8	7	sneqd 4596	. . . . . 6 ⊢ (𝑚 = 𝑀 → {⟨𝑚, 𝑚, (Base‘𝑚)⟩} = {⟨𝑀, 𝑀, (Base‘𝑀)⟩})
9	8	opeq2d 4852	. . . . 5 ⊢ (𝑚 = 𝑀 → ⟨(Hom ‘ndx), {⟨𝑚, 𝑚, (Base‘𝑚)⟩}⟩ = ⟨(Hom ‘ndx), {⟨𝑀, 𝑀, (Base‘𝑀)⟩}⟩)
10	5, 5, 5	oteq123d 4871	. . . . . . . 8 ⊢ (𝑚 = 𝑀 → ⟨𝑚, 𝑚, 𝑚⟩ = ⟨𝑀, 𝑀, 𝑀⟩)
11		fveq2 6916	. . . . . . . 8 ⊢ (𝑚 = 𝑀 → (+g‘𝑚) = (+g‘𝑀))
12	10, 11	opeq12d 4853	. . . . . . 7 ⊢ (𝑚 = 𝑀 → ⟨⟨𝑚, 𝑚, 𝑚⟩, (+g‘𝑚)⟩ = ⟨⟨𝑀, 𝑀, 𝑀⟩, (+g‘𝑀)⟩)
13	12	sneqd 4596	. . . . . 6 ⊢ (𝑚 = 𝑀 → {⟨⟨𝑚, 𝑚, 𝑚⟩, (+g‘𝑚)⟩} = {⟨⟨𝑀, 𝑀, 𝑀⟩, (+g‘𝑀)⟩})
14	13	opeq2d 4852	. . . . 5 ⊢ (𝑚 = 𝑀 → ⟨(comp‘ndx), {⟨⟨𝑚, 𝑚, 𝑚⟩, (+g‘𝑚)⟩}⟩ = ⟨(comp‘ndx), {⟨⟨𝑀, 𝑀, 𝑀⟩, (+g‘𝑀)⟩}⟩)
15	4, 9, 14	tpeq123d 4711	. . . 4 ⊢ (𝑚 = 𝑀 → {⟨(Base‘ndx), {𝑚}⟩, ⟨(Hom ‘ndx), {⟨𝑚, 𝑚, (Base‘𝑚)⟩}⟩, ⟨(comp‘ndx), {⟨⟨𝑚, 𝑚, 𝑚⟩, (+g‘𝑚)⟩}⟩} = {⟨(Base‘ndx), {𝑀}⟩, ⟨(Hom ‘ndx), {⟨𝑀, 𝑀, (Base‘𝑀)⟩}⟩, ⟨(comp‘ndx), {⟨⟨𝑀, 𝑀, 𝑀⟩, (+g‘𝑀)⟩}⟩})
16		df-mndtc 51047	. . . 4 ⊢ MndToCat = (𝑚 ∈ Mnd ↦ {⟨(Base‘ndx), {𝑚}⟩, ⟨(Hom ‘ndx), {⟨𝑚, 𝑚, (Base‘𝑚)⟩}⟩, ⟨(comp‘ndx), {⟨⟨𝑚, 𝑚, 𝑚⟩, (+g‘𝑚)⟩}⟩})
17		tpex 7794	. . . 4 ⊢ {⟨(Base‘ndx), {𝑀}⟩, ⟨(Hom ‘ndx), {⟨𝑀, 𝑀, (Base‘𝑀)⟩}⟩, ⟨(comp‘ndx), {⟨⟨𝑀, 𝑀, 𝑀⟩, (+g‘𝑀)⟩}⟩} ∈ V
18	15, 16, 17	fvmpt 7024	. . 3 ⊢ (𝑀 ∈ Mnd → (MndToCat‘𝑀) = {⟨(Base‘ndx), {𝑀}⟩, ⟨(Hom ‘ndx), {⟨𝑀, 𝑀, (Base‘𝑀)⟩}⟩, ⟨(comp‘ndx), {⟨⟨𝑀, 𝑀, 𝑀⟩, (+g‘𝑀)⟩}⟩})
19	2, 18	syl 18	. 2 ⊢ (𝜑 → (MndToCat‘𝑀) = {⟨(Base‘ndx), {𝑀}⟩, ⟨(Hom ‘ndx), {⟨𝑀, 𝑀, (Base‘𝑀)⟩}⟩, ⟨(comp‘ndx), {⟨⟨𝑀, 𝑀, 𝑀⟩, (+g‘𝑀)⟩}⟩})
20	1, 19	eqtrd 2798	1 ⊢ (𝜑 → 𝐶 = {⟨(Base‘ndx), {𝑀}⟩, ⟨(Hom ‘ndx), {⟨𝑀, 𝑀, (Base‘𝑀)⟩}⟩, ⟨(comp‘ndx), {⟨⟨𝑀, 𝑀, 𝑀⟩, (+g‘𝑀)⟩}⟩})

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  {csn 4588  {ctp 4592  ⟨cop 4840  ⟨cotp 4863  ‘cfv 6566  ndxcnx 17415  Basecbs 17431  +_gcplusg 17472  Hom chom 17483  compcco 17484  Mndcmnd 18973  MndToCatcmndtc 51046

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-ot 4864  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-mndtc 51047

This theorem is used by:  mndtcbasval  51049  mndtchom  51053  mndtcco  51054