Theorem monfval 17780

Description: Definition of a monomorphism in a category. (Contributed by Mario Carneiro, 3-Jan-2017.)

Hypotheses

Ref	Expression
ismon.b	⊢ 𝐵 = (Base‘𝐶)
ismon.h	⊢ 𝐻 = (Hom ‘𝐶)
ismon.o	⊢ · = (comp‘𝐶)
ismon.s	⊢ 𝑀 = (Mono‘𝐶)
ismon.c	⊢ (𝜑 → 𝐶 ∈ Cat)

Assertion

Ref	Expression
monfval	⊢ (𝜑 → 𝑀 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))}))

Distinct variable groups:   𝑓,𝑔,𝑥,𝑦,𝑧,𝐵   𝜑,𝑓,𝑔,𝑥,𝑦,𝑧   𝐶,𝑓,𝑔,𝑥,𝑦,𝑧   𝑓,𝐻,𝑔,𝑥,𝑦,𝑧   · ,𝑓,𝑔,𝑥,𝑦,𝑧   𝑓,𝑀

Allowed substitution hints:   𝑀(𝑥,𝑦,𝑧,𝑔)

Proof of Theorem monfval

Dummy variables 𝑏 𝑐 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ismon.s	. 2 ⊢ 𝑀 = (Mono‘𝐶)
2		ismon.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ Cat)
3		fvexd 6922	. . . . 5 ⊢ (𝑐 = 𝐶 → (Base‘𝑐) ∈ V)
4		fveq2 6907	. . . . . 6 ⊢ (𝑐 = 𝐶 → (Base‘𝑐) = (Base‘𝐶))
5		ismon.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐶)
6	4, 5	eqtr4di 2793	. . . . 5 ⊢ (𝑐 = 𝐶 → (Base‘𝑐) = 𝐵)
7		fvexd 6922	. . . . . 6 ⊢ ((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) → (Hom ‘𝑐) ∈ V)
8		simpl 482	. . . . . . . 8 ⊢ ((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) → 𝑐 = 𝐶)
9	8	fveq2d 6911	. . . . . . 7 ⊢ ((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) → (Hom ‘𝑐) = (Hom ‘𝐶))
10		ismon.h	. . . . . . 7 ⊢ 𝐻 = (Hom ‘𝐶)
11	9, 10	eqtr4di 2793	. . . . . 6 ⊢ ((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) → (Hom ‘𝑐) = 𝐻)
12		simplr 769	. . . . . . 7 ⊢ (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → 𝑏 = 𝐵)
13		simpr 484	. . . . . . . . 9 ⊢ (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → ℎ = 𝐻)
14	13	oveqd 7448	. . . . . . . 8 ⊢ (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → (𝑥ℎ𝑦) = (𝑥𝐻𝑦))
15	13	oveqd 7448	. . . . . . . . . . . 12 ⊢ (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → (𝑧ℎ𝑥) = (𝑧𝐻𝑥))
16		simpll 767	. . . . . . . . . . . . . . . 16 ⊢ (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → 𝑐 = 𝐶)
17	16	fveq2d 6911	. . . . . . . . . . . . . . 15 ⊢ (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → (comp‘𝑐) = (comp‘𝐶))
18		ismon.o	. . . . . . . . . . . . . . 15 ⊢ · = (comp‘𝐶)
19	17, 18	eqtr4di 2793	. . . . . . . . . . . . . 14 ⊢ (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → (comp‘𝑐) = · )
20	19	oveqd 7448	. . . . . . . . . . . . 13 ⊢ (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → (⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦) = (⟨𝑧, 𝑥⟩ · 𝑦))
21	20	oveqd 7448	. . . . . . . . . . . 12 ⊢ (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔) = (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))
22	15, 21	mpteq12dv 5239	. . . . . . . . . . 11 ⊢ (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → (𝑔 ∈ (𝑧ℎ𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔)) = (𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔)))
23	22	cnveqd 5889	. . . . . . . . . 10 ⊢ (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → ◡(𝑔 ∈ (𝑧ℎ𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔)) = ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔)))
24	23	funeqd 6590	. . . . . . . . 9 ⊢ (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → (Fun ◡(𝑔 ∈ (𝑧ℎ𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔)) ↔ Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))))
25	12, 24	raleqbidv 3344	. . . . . . . 8 ⊢ (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → (∀𝑧 ∈ 𝑏 Fun ◡(𝑔 ∈ (𝑧ℎ𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔)) ↔ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))))
26	14, 25	rabeqbidv 3452	. . . . . . 7 ⊢ (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → {𝑓 ∈ (𝑥ℎ𝑦) ∣ ∀𝑧 ∈ 𝑏 Fun ◡(𝑔 ∈ (𝑧ℎ𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔))} = {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))})
27	12, 12, 26	mpoeq123dv 7508	. . . . . 6 ⊢ (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → (𝑥 ∈ 𝑏, 𝑦 ∈ 𝑏 ↦ {𝑓 ∈ (𝑥ℎ𝑦) ∣ ∀𝑧 ∈ 𝑏 Fun ◡(𝑔 ∈ (𝑧ℎ𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔))}) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))}))
28	7, 11, 27	csbied2 3948	. . . . 5 ⊢ ((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) → ⦋(Hom ‘𝑐) / ℎ⦌(𝑥 ∈ 𝑏, 𝑦 ∈ 𝑏 ↦ {𝑓 ∈ (𝑥ℎ𝑦) ∣ ∀𝑧 ∈ 𝑏 Fun ◡(𝑔 ∈ (𝑧ℎ𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔))}) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))}))
29	3, 6, 28	csbied2 3948	. . . 4 ⊢ (𝑐 = 𝐶 → ⦋(Base‘𝑐) / 𝑏⦌⦋(Hom ‘𝑐) / ℎ⦌(𝑥 ∈ 𝑏, 𝑦 ∈ 𝑏 ↦ {𝑓 ∈ (𝑥ℎ𝑦) ∣ ∀𝑧 ∈ 𝑏 Fun ◡(𝑔 ∈ (𝑧ℎ𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔))}) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))}))
30		df-mon 17778	. . . 4 ⊢ Mono = (𝑐 ∈ Cat ↦ ⦋(Base‘𝑐) / 𝑏⦌⦋(Hom ‘𝑐) / ℎ⦌(𝑥 ∈ 𝑏, 𝑦 ∈ 𝑏 ↦ {𝑓 ∈ (𝑥ℎ𝑦) ∣ ∀𝑧 ∈ 𝑏 Fun ◡(𝑔 ∈ (𝑧ℎ𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔))}))
31	5	fvexi 6921	. . . . 5 ⊢ 𝐵 ∈ V
32	31, 31	mpoex 8103	. . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))}) ∈ V
33	29, 30, 32	fvmpt 7016	. . 3 ⊢ (𝐶 ∈ Cat → (Mono‘𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))}))
34	2, 33	syl 17	. 2 ⊢ (𝜑 → (Mono‘𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))}))
35	1, 34	eqtrid 2787	1 ⊢ (𝜑 → 𝑀 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))}))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1537   ∈ wcel 2106  ∀wral 3059  {crab 3433  Vcvv 3478  ⦋csb 3908  ⟨cop 4637   ↦ cmpt 5231  ^◡ccnv 5688  Fun wfun 6557  ‘cfv 6563  (class class class)co 7431   ∈ cmpo 7433  Basecbs 17245  Hom chom 17309  compcco 17310  Catccat 17709  Monocmon 17776

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8013  df-2nd 8014  df-mon 17778

This theorem is referenced by:  ismon  17781  monpropd  17785