MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  monfval Structured version   Visualization version   GIF version

Theorem monfval 16599
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.
StepHypRef Expression
1 ismon.s . 2 𝑀 = (Mono‘𝐶)
2 ismon.c . . 3 (𝜑𝐶 ∈ Cat)
3 fvexd 6344 . . . . 5 (𝑐 = 𝐶 → (Base‘𝑐) ∈ V)
4 fveq2 6332 . . . . . 6 (𝑐 = 𝐶 → (Base‘𝑐) = (Base‘𝐶))
5 ismon.b . . . . . 6 𝐵 = (Base‘𝐶)
64, 5syl6eqr 2823 . . . . 5 (𝑐 = 𝐶 → (Base‘𝑐) = 𝐵)
7 fvexd 6344 . . . . . 6 ((𝑐 = 𝐶𝑏 = 𝐵) → (Hom ‘𝑐) ∈ V)
8 simpl 468 . . . . . . . 8 ((𝑐 = 𝐶𝑏 = 𝐵) → 𝑐 = 𝐶)
98fveq2d 6336 . . . . . . 7 ((𝑐 = 𝐶𝑏 = 𝐵) → (Hom ‘𝑐) = (Hom ‘𝐶))
10 ismon.h . . . . . . 7 𝐻 = (Hom ‘𝐶)
119, 10syl6eqr 2823 . . . . . 6 ((𝑐 = 𝐶𝑏 = 𝐵) → (Hom ‘𝑐) = 𝐻)
12 simplr 752 . . . . . . 7 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → 𝑏 = 𝐵)
13 simpr 471 . . . . . . . . 9 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → = 𝐻)
1413oveqd 6810 . . . . . . . 8 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → (𝑥𝑦) = (𝑥𝐻𝑦))
1513oveqd 6810 . . . . . . . . . . . 12 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → (𝑧𝑥) = (𝑧𝐻𝑥))
16 simpll 750 . . . . . . . . . . . . . . . 16 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → 𝑐 = 𝐶)
1716fveq2d 6336 . . . . . . . . . . . . . . 15 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → (comp‘𝑐) = (comp‘𝐶))
18 ismon.o . . . . . . . . . . . . . . 15 · = (comp‘𝐶)
1917, 18syl6eqr 2823 . . . . . . . . . . . . . 14 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → (comp‘𝑐) = · )
2019oveqd 6810 . . . . . . . . . . . . 13 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → (⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦) = (⟨𝑧, 𝑥· 𝑦))
2120oveqd 6810 . . . . . . . . . . . 12 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔) = (𝑓(⟨𝑧, 𝑥· 𝑦)𝑔))
2215, 21mpteq12dv 4867 . . . . . . . . . . 11 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → (𝑔 ∈ (𝑧𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔)) = (𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥· 𝑦)𝑔)))
2322cnveqd 5436 . . . . . . . . . 10 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → (𝑔 ∈ (𝑧𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔)) = (𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥· 𝑦)𝑔)))
2423funeqd 6053 . . . . . . . . 9 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → (Fun (𝑔 ∈ (𝑧𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔)) ↔ Fun (𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥· 𝑦)𝑔))))
2512, 24raleqbidv 3301 . . . . . . . 8 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → (∀𝑧𝑏 Fun (𝑔 ∈ (𝑧𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔)) ↔ ∀𝑧𝐵 Fun (𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥· 𝑦)𝑔))))
2614, 25rabeqbidv 3345 . . . . . . 7 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → {𝑓 ∈ (𝑥𝑦) ∣ ∀𝑧𝑏 Fun (𝑔 ∈ (𝑧𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔))} = {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧𝐵 Fun (𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥· 𝑦)𝑔))})
2712, 12, 26mpt2eq123dv 6864 . . . . . 6 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → (𝑥𝑏, 𝑦𝑏 ↦ {𝑓 ∈ (𝑥𝑦) ∣ ∀𝑧𝑏 Fun (𝑔 ∈ (𝑧𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔))}) = (𝑥𝐵, 𝑦𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧𝐵 Fun (𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥· 𝑦)𝑔))}))
287, 11, 27csbied2 3710 . . . . 5 ((𝑐 = 𝐶𝑏 = 𝐵) → (Hom ‘𝑐) / (𝑥𝑏, 𝑦𝑏 ↦ {𝑓 ∈ (𝑥𝑦) ∣ ∀𝑧𝑏 Fun (𝑔 ∈ (𝑧𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔))}) = (𝑥𝐵, 𝑦𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧𝐵 Fun (𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥· 𝑦)𝑔))}))
293, 6, 28csbied2 3710 . . . 4 (𝑐 = 𝐶(Base‘𝑐) / 𝑏(Hom ‘𝑐) / (𝑥𝑏, 𝑦𝑏 ↦ {𝑓 ∈ (𝑥𝑦) ∣ ∀𝑧𝑏 Fun (𝑔 ∈ (𝑧𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔))}) = (𝑥𝐵, 𝑦𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧𝐵 Fun (𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥· 𝑦)𝑔))}))
30 df-mon 16597 . . . 4 Mono = (𝑐 ∈ Cat ↦ (Base‘𝑐) / 𝑏(Hom ‘𝑐) / (𝑥𝑏, 𝑦𝑏 ↦ {𝑓 ∈ (𝑥𝑦) ∣ ∀𝑧𝑏 Fun (𝑔 ∈ (𝑧𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩(comp‘𝑐)𝑦)𝑔))}))
31 fvex 6342 . . . . . 6 (Base‘𝐶) ∈ V
325, 31eqeltri 2846 . . . . 5 𝐵 ∈ V
3332, 32mpt2ex 7397 . . . 4 (𝑥𝐵, 𝑦𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧𝐵 Fun (𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥· 𝑦)𝑔))}) ∈ V
3429, 30, 33fvmpt 6424 . . 3 (𝐶 ∈ Cat → (Mono‘𝐶) = (𝑥𝐵, 𝑦𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧𝐵 Fun (𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥· 𝑦)𝑔))}))
352, 34syl 17 . 2 (𝜑 → (Mono‘𝐶) = (𝑥𝐵, 𝑦𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧𝐵 Fun (𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥· 𝑦)𝑔))}))
361, 35syl5eq 2817 1 (𝜑𝑀 = (𝑥𝐵, 𝑦𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧𝐵 Fun (𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥· 𝑦)𝑔))}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382   = wceq 1631  wcel 2145  wral 3061  {crab 3065  Vcvv 3351  csb 3682  cop 4322  cmpt 4863  ccnv 5248  Fun wfun 6025  cfv 6031  (class class class)co 6793  cmpt2 6795  Basecbs 16064  Hom chom 16160  compcco 16161  Catccat 16532  Monocmon 16595
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-rep 4904  ax-sep 4915  ax-nul 4923  ax-pow 4974  ax-pr 5034  ax-un 7096
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-ral 3066  df-rex 3067  df-reu 3068  df-rab 3070  df-v 3353  df-sbc 3588  df-csb 3683  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4226  df-pw 4299  df-sn 4317  df-pr 4319  df-op 4323  df-uni 4575  df-iun 4656  df-br 4787  df-opab 4847  df-mpt 4864  df-id 5157  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039  df-ov 6796  df-oprab 6797  df-mpt2 6798  df-1st 7315  df-2nd 7316  df-mon 16597
This theorem is referenced by:  ismon  16600  monpropd  16604
  Copyright terms: Public domain W3C validator