Theorem ismon 17901

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

Hypotheses

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

Assertion

Ref	Expression
ismon	⊢ (𝜑 → (𝐹 ∈ (𝑋𝑀𝑌) ↔ (𝐹 ∈ (𝑋𝐻𝑌) ∧ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝐹(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)))))

Distinct variable groups:   𝑧,𝑔,𝐵   𝜑,𝑔,𝑧   𝐶,𝑔,𝑧   𝑔,𝐻,𝑧   · ,𝑔,𝑧   𝑔,𝐹,𝑧   𝑔,𝑋,𝑧   𝑔,𝑌,𝑧

Allowed substitution hints:   𝑀(𝑧, 𝑔)

Proof of Theorem ismon

Dummy variables 𝑓 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ismon.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐶)
2		ismon.h	. . . . 5 ⊢ 𝐻 = (Hom ‘𝐶)
3		ismon.o	. . . . 5 ⊢ · = (comp‘𝐶)
4		ismon.s	. . . . 5 ⊢ 𝑀 = (Mono‘𝐶)
5		ismon.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ Cat)
6	1, 2, 3, 4, 5	monfval 17900	. . . 4 ⊢ (𝜑 → 𝑀 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))}))
7		simprl 783	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → 𝑥 = 𝑋)
8		simprr 785	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → 𝑦 = 𝑌)
9	7, 8	oveq12d 7436	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌))
10	7	oveq2d 7434	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑧𝐻𝑥) = (𝑧𝐻𝑋))
11	7	opeq2d 4840	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → ⟨𝑧, 𝑥⟩ = ⟨𝑧, 𝑋⟩)
12	11, 8	oveq12d 7436	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (⟨𝑧, 𝑥⟩ · 𝑦) = (⟨𝑧, 𝑋⟩ · 𝑌))
13	12	oveqd 7435	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔) = (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))
14	10, 13	mpteq12dv 5192	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔)) = (𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)))
15	14	cnveqd 5853	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔)) = ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)))
16	15	funeqd 6559	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔)) ↔ Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))))
17	16	ralbidv 3186	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔)) ↔ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))))
18	9, 17	rabeqbidv 3430	. . . 4 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))} = {𝑓 ∈ (𝑋𝐻𝑌) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))})
19		ismon.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
20		ismon.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
21		ovex 7451	. . . . . 6 ⊢ (𝑋𝐻𝑌) ∈ V
22	21	rabex 5300	. . . . 5 ⊢ {𝑓 ∈ (𝑋𝐻𝑌) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))} ∈ V
23	22	a1i 11	. . . 4 ⊢ (𝜑 → {𝑓 ∈ (𝑋𝐻𝑌) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))} ∈ V)
24	6, 18, 19, 20, 23	ovmpod 7570	. . 3 ⊢ (𝜑 → (𝑋𝑀𝑌) = {𝑓 ∈ (𝑋𝐻𝑌) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))})
25	24	eleq2d 2847	. 2 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝑀𝑌) ↔ 𝐹 ∈ {𝑓 ∈ (𝑋𝐻𝑌) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))}))
26		oveq1 7425	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))
27	26	mpteq2dv 5199	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)) = (𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝐹(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)))
28	27	cnveqd 5853	. . . . 5 ⊢ (𝑓 = 𝐹 → ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)) = ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝐹(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)))
29	28	funeqd 6559	. . . 4 ⊢ (𝑓 = 𝐹 → (Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)) ↔ Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝐹(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))))
30	29	ralbidv 3186	. . 3 ⊢ (𝑓 = 𝐹 → (∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)) ↔ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝐹(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))))
31	30	elrab 3645	. 2 ⊢ (𝐹 ∈ {𝑓 ∈ (𝑋𝐻𝑌) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))} ↔ (𝐹 ∈ (𝑋𝐻𝑌) ∧ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝐹(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))))
32	25, 31	bitrdi 290	1 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝑀𝑌) ↔ (𝐹 ∈ (𝑋𝐻𝑌) ∧ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝐹(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  {crab 3413  Vcvv 3451  ⟨cop 4590   ↦ cmpt 5186  ^◡ccnv 5650  Fun wfun 6531  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  Hom chom 17432  compcco 17433  Catccat 17831  Monocmon 17896

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-mon 17898

This theorem is used by:  ismon2  17902  monhom  17903  isepi  17908