Theorem ismon 17695

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 17694	. . . 4 ⊢ (𝜑 → 𝑀 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))}))
7		simprl 770	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → 𝑥 = 𝑋)
8		simprr 772	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → 𝑦 = 𝑌)
9	7, 8	oveq12d 7405	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌))
10	7	oveq2d 7403	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑧𝐻𝑥) = (𝑧𝐻𝑋))
11	7	opeq2d 4844	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → ⟨𝑧, 𝑥⟩ = ⟨𝑧, 𝑋⟩)
12	11, 8	oveq12d 7405	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (⟨𝑧, 𝑥⟩ · 𝑦) = (⟨𝑧, 𝑋⟩ · 𝑌))
13	12	oveqd 7404	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔) = (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))
14	10, 13	mpteq12dv 5194	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔)) = (𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)))
15	14	cnveqd 5839	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔)) = ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)))
16	15	funeqd 6538	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔)) ↔ Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))))
17	16	ralbidv 3156	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔)) ↔ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))))
18	9, 17	rabeqbidv 3424	. . . 4 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → {𝑓 ∈ (𝑥𝐻𝑦) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑥) ↦ (𝑓(⟨𝑧, 𝑥⟩ · 𝑦)𝑔))} = {𝑓 ∈ (𝑋𝐻𝑌) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))})
19		ismon.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
20		ismon.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
21		ovex 7420	. . . . . 6 ⊢ (𝑋𝐻𝑌) ∈ V
22	21	rabex 5294	. . . . 5 ⊢ {𝑓 ∈ (𝑋𝐻𝑌) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))} ∈ V
23	22	a1i 11	. . . 4 ⊢ (𝜑 → {𝑓 ∈ (𝑋𝐻𝑌) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))} ∈ V)
24	6, 18, 19, 20, 23	ovmpod 7541	. . 3 ⊢ (𝜑 → (𝑋𝑀𝑌) = {𝑓 ∈ (𝑋𝐻𝑌) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))})
25	24	eleq2d 2814	. 2 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝑀𝑌) ↔ 𝐹 ∈ {𝑓 ∈ (𝑋𝐻𝑌) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))}))
26		oveq1 7394	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))
27	26	mpteq2dv 5201	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)) = (𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝐹(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)))
28	27	cnveqd 5839	. . . . 5 ⊢ (𝑓 = 𝐹 → ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)) = ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝐹(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)))
29	28	funeqd 6538	. . . 4 ⊢ (𝑓 = 𝐹 → (Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)) ↔ Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝐹(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))))
30	29	ralbidv 3156	. . 3 ⊢ (𝑓 = 𝐹 → (∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)) ↔ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝐹(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))))
31	30	elrab 3659	. 2 ⊢ (𝐹 ∈ {𝑓 ∈ (𝑋𝐻𝑌) ∣ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝑓(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))} ↔ (𝐹 ∈ (𝑋𝐻𝑌) ∧ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝐹(⟨𝑧, 𝑋⟩ · 𝑌)𝑔))))
32	25, 31	bitrdi 287	1 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝑀𝑌) ↔ (𝐹 ∈ (𝑋𝐻𝑌) ∧ ∀𝑧 ∈ 𝐵 Fun ◡(𝑔 ∈ (𝑧𝐻𝑋) ↦ (𝐹(⟨𝑧, 𝑋⟩ · 𝑌)𝑔)))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044  {crab 3405  Vcvv 3447  ⟨cop 4595   ↦ cmpt 5188  ^◡ccnv 5637  Fun wfun 6505  ‘cfv 6511  (class class class)co 7387  Basecbs 17179  Hom chom 17231  compcco 17232  Catccat 17625  Monocmon 17690

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-1st 7968  df-2nd 7969  df-mon 17692

This theorem is referenced by:  ismon2  17696  monhom  17697  isepi  17702