Theorem fthmon 17828

Description: A faithful functor reflects monomorphisms. (Contributed by Mario Carneiro, 27-Jan-2017.)

Hypotheses

Ref	Expression
fthmon.b	⊢ 𝐵 = (Base‘𝐶)
fthmon.h	⊢ 𝐻 = (Hom ‘𝐶)
fthmon.f	⊢ (𝜑 → 𝐹(𝐶 Faith 𝐷)𝐺)
fthmon.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
fthmon.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
fthmon.r	⊢ (𝜑 → 𝑅 ∈ (𝑋𝐻𝑌))
fthmon.m	⊢ 𝑀 = (Mono‘𝐶)
fthmon.n	⊢ 𝑁 = (Mono‘𝐷)
fthmon.1	⊢ (𝜑 → ((𝑋𝐺𝑌)‘𝑅) ∈ ((𝐹‘𝑋)𝑁(𝐹‘𝑌)))

Assertion

Ref	Expression
fthmon	⊢ (𝜑 → 𝑅 ∈ (𝑋𝑀𝑌))

Proof of Theorem fthmon

Dummy variables 𝑓 𝑔 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fthmon.r	. 2 ⊢ (𝜑 → 𝑅 ∈ (𝑋𝐻𝑌))
2		eqid 2730	. . . . . 6 ⊢ (Base‘𝐷) = (Base‘𝐷)
3		eqid 2730	. . . . . 6 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
4		eqid 2730	. . . . . 6 ⊢ (comp‘𝐷) = (comp‘𝐷)
5		fthmon.n	. . . . . 6 ⊢ 𝑁 = (Mono‘𝐷)
6		fthmon.f	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹(𝐶 Faith 𝐷)𝐺)
7		fthfunc 17808	. . . . . . . . . . . 12 ⊢ (𝐶 Faith 𝐷) ⊆ (𝐶 Func 𝐷)
8	7	ssbri 5134	. . . . . . . . . . 11 ⊢ (𝐹(𝐶 Faith 𝐷)𝐺 → 𝐹(𝐶 Func 𝐷)𝐺)
9	6, 8	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹(𝐶 Func 𝐷)𝐺)
10		df-br 5090	. . . . . . . . . 10 ⊢ (𝐹(𝐶 Func 𝐷)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
11	9, 10	sylib 218	. . . . . . . . 9 ⊢ (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
12		funcrcl 17762	. . . . . . . . 9 ⊢ (⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷) → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
13	11, 12	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
14	13	simprd 495	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ Cat)
15	14	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → 𝐷 ∈ Cat)
16		fthmon.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝐶)
17	9	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → 𝐹(𝐶 Func 𝐷)𝐺)
18	16, 2, 17	funcf1 17765	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → 𝐹:𝐵⟶(Base‘𝐷))
19		fthmon.x	. . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
20	19	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → 𝑋 ∈ 𝐵)
21	18, 20	ffvelcdmd 7013	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → (𝐹‘𝑋) ∈ (Base‘𝐷))
22		fthmon.y	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
23	22	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → 𝑌 ∈ 𝐵)
24	18, 23	ffvelcdmd 7013	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → (𝐹‘𝑌) ∈ (Base‘𝐷))
25		simpr1 1195	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → 𝑧 ∈ 𝐵)
26	18, 25	ffvelcdmd 7013	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → (𝐹‘𝑧) ∈ (Base‘𝐷))
27		fthmon.1	. . . . . . 7 ⊢ (𝜑 → ((𝑋𝐺𝑌)‘𝑅) ∈ ((𝐹‘𝑋)𝑁(𝐹‘𝑌)))
28	27	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → ((𝑋𝐺𝑌)‘𝑅) ∈ ((𝐹‘𝑋)𝑁(𝐹‘𝑌)))
29		fthmon.h	. . . . . . . 8 ⊢ 𝐻 = (Hom ‘𝐶)
30	16, 29, 3, 17, 25, 20	funcf2 17767	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → (𝑧𝐺𝑋):(𝑧𝐻𝑋)⟶((𝐹‘𝑧)(Hom ‘𝐷)(𝐹‘𝑋)))
31		simpr2 1196	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → 𝑓 ∈ (𝑧𝐻𝑋))
32	30, 31	ffvelcdmd 7013	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → ((𝑧𝐺𝑋)‘𝑓) ∈ ((𝐹‘𝑧)(Hom ‘𝐷)(𝐹‘𝑋)))
33		simpr3 1197	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → 𝑔 ∈ (𝑧𝐻𝑋))
34	30, 33	ffvelcdmd 7013	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → ((𝑧𝐺𝑋)‘𝑔) ∈ ((𝐹‘𝑧)(Hom ‘𝐷)(𝐹‘𝑋)))
35	2, 3, 4, 5, 15, 21, 24, 26, 28, 32, 34	moni 17635	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → ((((𝑋𝐺𝑌)‘𝑅)(⟨(𝐹‘𝑧), (𝐹‘𝑋)⟩(comp‘𝐷)(𝐹‘𝑌))((𝑧𝐺𝑋)‘𝑓)) = (((𝑋𝐺𝑌)‘𝑅)(⟨(𝐹‘𝑧), (𝐹‘𝑋)⟩(comp‘𝐷)(𝐹‘𝑌))((𝑧𝐺𝑋)‘𝑔)) ↔ ((𝑧𝐺𝑋)‘𝑓) = ((𝑧𝐺𝑋)‘𝑔)))
36		eqid 2730	. . . . . . . 8 ⊢ (comp‘𝐶) = (comp‘𝐶)
37	1	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → 𝑅 ∈ (𝑋𝐻𝑌))
38	16, 29, 36, 4, 17, 25, 20, 23, 31, 37	funcco 17770	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → ((𝑧𝐺𝑌)‘(𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑓)) = (((𝑋𝐺𝑌)‘𝑅)(⟨(𝐹‘𝑧), (𝐹‘𝑋)⟩(comp‘𝐷)(𝐹‘𝑌))((𝑧𝐺𝑋)‘𝑓)))
39	16, 29, 36, 4, 17, 25, 20, 23, 33, 37	funcco 17770	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → ((𝑧𝐺𝑌)‘(𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔)) = (((𝑋𝐺𝑌)‘𝑅)(⟨(𝐹‘𝑧), (𝐹‘𝑋)⟩(comp‘𝐷)(𝐹‘𝑌))((𝑧𝐺𝑋)‘𝑔)))
40	38, 39	eqeq12d 2746	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → (((𝑧𝐺𝑌)‘(𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑓)) = ((𝑧𝐺𝑌)‘(𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔)) ↔ (((𝑋𝐺𝑌)‘𝑅)(⟨(𝐹‘𝑧), (𝐹‘𝑋)⟩(comp‘𝐷)(𝐹‘𝑌))((𝑧𝐺𝑋)‘𝑓)) = (((𝑋𝐺𝑌)‘𝑅)(⟨(𝐹‘𝑧), (𝐹‘𝑋)⟩(comp‘𝐷)(𝐹‘𝑌))((𝑧𝐺𝑋)‘𝑔))))
41	6	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → 𝐹(𝐶 Faith 𝐷)𝐺)
42	13	simpld 494	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ Cat)
43	42	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → 𝐶 ∈ Cat)
44	16, 29, 36, 43, 25, 20, 23, 31, 37	catcocl 17583	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → (𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑓) ∈ (𝑧𝐻𝑌))
45	16, 29, 36, 43, 25, 20, 23, 33, 37	catcocl 17583	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → (𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) ∈ (𝑧𝐻𝑌))
46	16, 29, 3, 41, 25, 23, 44, 45	fthi 17819	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → (((𝑧𝐺𝑌)‘(𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑓)) = ((𝑧𝐺𝑌)‘(𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔)) ↔ (𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑓) = (𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔)))
47	40, 46	bitr3d 281	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → ((((𝑋𝐺𝑌)‘𝑅)(⟨(𝐹‘𝑧), (𝐹‘𝑋)⟩(comp‘𝐷)(𝐹‘𝑌))((𝑧𝐺𝑋)‘𝑓)) = (((𝑋𝐺𝑌)‘𝑅)(⟨(𝐹‘𝑧), (𝐹‘𝑋)⟩(comp‘𝐷)(𝐹‘𝑌))((𝑧𝐺𝑋)‘𝑔)) ↔ (𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑓) = (𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔)))
48	16, 29, 3, 41, 25, 20, 31, 33	fthi 17819	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → (((𝑧𝐺𝑋)‘𝑓) = ((𝑧𝐺𝑋)‘𝑔) ↔ 𝑓 = 𝑔))
49	35, 47, 48	3bitr3d 309	. . . 4 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → ((𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑓) = (𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) ↔ 𝑓 = 𝑔))
50	49	biimpd 229	. . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑓 ∈ (𝑧𝐻𝑋) ∧ 𝑔 ∈ (𝑧𝐻𝑋))) → ((𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑓) = (𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) → 𝑓 = 𝑔))
51	50	ralrimivvva 3176	. 2 ⊢ (𝜑 → ∀𝑧 ∈ 𝐵 ∀𝑓 ∈ (𝑧𝐻𝑋)∀𝑔 ∈ (𝑧𝐻𝑋)((𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑓) = (𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) → 𝑓 = 𝑔))
52		fthmon.m	. . 3 ⊢ 𝑀 = (Mono‘𝐶)
53	16, 29, 36, 52, 42, 19, 22	ismon2 17633	. 2 ⊢ (𝜑 → (𝑅 ∈ (𝑋𝑀𝑌) ↔ (𝑅 ∈ (𝑋𝐻𝑌) ∧ ∀𝑧 ∈ 𝐵 ∀𝑓 ∈ (𝑧𝐻𝑋)∀𝑔 ∈ (𝑧𝐻𝑋)((𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑓) = (𝑅(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) → 𝑓 = 𝑔))))
54	1, 51, 53	mpbir2and 713	1 ⊢ (𝜑 → 𝑅 ∈ (𝑋𝑀𝑌))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2110  ∀wral 3045  ⟨cop 4580   class class class wbr 5089  ‘cfv 6477  (class class class)co 7341  Basecbs 17112  Hom chom 17164  compcco 17165  Catccat 17562  Monocmon 17627   Func cfunc 17753   Faith cfth 17804

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2112  ax-9 2120  ax-10 2143  ax-11 2159  ax-12 2179  ax-ext 2702  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7663

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3345  df-rab 3394  df-v 3436  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4282  df-if 4474  df-pw 4550  df-sn 4575  df-pr 4577  df-op 4581  df-uni 4858  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-iota 6433  df-fun 6479  df-fn 6480  df-f 6481  df-f1 6482  df-fo 6483  df-f1o 6484  df-fv 6485  df-ov 7344  df-oprab 7345  df-mpo 7346  df-1st 7916  df-2nd 7917  df-map 8747  df-ixp 8817  df-cat 17566  df-mon 17629  df-func 17757  df-fth 17806

This theorem is referenced by:  fthepi  17829