Theorem setcmon 18180

Description: A monomorphism of sets is an injection. (Contributed by Mario Carneiro, 3-Jan-2017.)

Hypotheses

Ref	Expression
setcmon.c	⊢ 𝐶 = (SetCat‘𝑈)
setcmon.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)
setcmon.x	⊢ (𝜑 → 𝑋 ∈ 𝑈)
setcmon.y	⊢ (𝜑 → 𝑌 ∈ 𝑈)
setcmon.h	⊢ 𝑀 = (Mono‘𝐶)

Assertion

Ref	Expression
setcmon	⊢ (𝜑 → (𝐹 ∈ (𝑋𝑀𝑌) ↔ 𝐹:𝑋–1-1→𝑌))

Proof of Theorem setcmon

Dummy variables 𝑥 𝑔 ℎ 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2762	. . . . . 6 ⊢ (Base‘𝐶) = (Base‘𝐶)
2		eqid 2762	. . . . . 6 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
3		eqid 2762	. . . . . 6 ⊢ (comp‘𝐶) = (comp‘𝐶)
4		setcmon.h	. . . . . 6 ⊢ 𝑀 = (Mono‘𝐶)
5		setcmon.u	. . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
6		setcmon.c	. . . . . . . 8 ⊢ 𝐶 = (SetCat‘𝑈)
7	6	setccat 18178	. . . . . . 7 ⊢ (𝑈 ∈ 𝑉 → 𝐶 ∈ Cat)
8	5, 7	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ Cat)
9		setcmon.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝑈)
10	6, 5	setcbas 18171	. . . . . . 7 ⊢ (𝜑 → 𝑈 = (Base‘𝐶))
11	9, 10	eleqtrd 2864	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶))
12		setcmon.y	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝑈)
13	12, 10	eleqtrd 2864	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶))
14	1, 2, 3, 4, 8, 11, 13	monhom 17828	. . . . 5 ⊢ (𝜑 → (𝑋𝑀𝑌) ⊆ (𝑋(Hom ‘𝐶)𝑌))
15	14	sselda 3934	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) → 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
16	6, 5, 2, 9, 12	elsetchom 18174	. . . . 5 ⊢ (𝜑 → (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ↔ 𝐹:𝑋⟶𝑌))
17	16	biimpa 482	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌)) → 𝐹:𝑋⟶𝑌)
18	15, 17	syldan 603	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) → 𝐹:𝑋⟶𝑌)
19		simprr 785	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐹‘𝑥) = (𝐹‘𝑦))
20	19	sneqd 4599	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → {(𝐹‘𝑥)} = {(𝐹‘𝑦)})
21	20	xpeq2d 5689	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝑋 × {(𝐹‘𝑥)}) = (𝑋 × {(𝐹‘𝑦)}))
22	18	adantr 486	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝐹:𝑋⟶𝑌)
23	22	ffnd 6707	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝐹 Fn 𝑋)
24		simprll 791	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑥 ∈ 𝑋)
25		fcoconst 7131	. . . . . . . . . . 11 ⊢ ((𝐹 Fn 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝐹 ∘ (𝑋 × {𝑥})) = (𝑋 × {(𝐹‘𝑥)}))
26	23, 24, 25	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐹 ∘ (𝑋 × {𝑥})) = (𝑋 × {(𝐹‘𝑥)}))
27		simprlr 792	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑦 ∈ 𝑋)
28		fcoconst 7131	. . . . . . . . . . 11 ⊢ ((𝐹 Fn 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐹 ∘ (𝑋 × {𝑦})) = (𝑋 × {(𝐹‘𝑦)}))
29	23, 27, 28	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐹 ∘ (𝑋 × {𝑦})) = (𝑋 × {(𝐹‘𝑦)}))
30	21, 26, 29	3eqtr4d 2807	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐹 ∘ (𝑋 × {𝑥})) = (𝐹 ∘ (𝑋 × {𝑦})))
31	5	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑈 ∈ 𝑉)
32	9	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑋 ∈ 𝑈)
33	12	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑌 ∈ 𝑈)
34		fconst6g 6768	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝑋 → (𝑋 × {𝑥}):𝑋⟶𝑋)
35	24, 34	syl 18	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝑋 × {𝑥}):𝑋⟶𝑋)
36	6, 31, 3, 32, 32, 33, 35, 22	setcco 18176	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝑋 × {𝑥})) = (𝐹 ∘ (𝑋 × {𝑥})))
37		fconst6g 6768	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝑋 → (𝑋 × {𝑦}):𝑋⟶𝑋)
38	27, 37	syl 18	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝑋 × {𝑦}):𝑋⟶𝑋)
39	6, 31, 3, 32, 32, 33, 38, 22	setcco 18176	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝑋 × {𝑦})) = (𝐹 ∘ (𝑋 × {𝑦})))
40	30, 36, 39	3eqtr4d 2807	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝑋 × {𝑥})) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝑋 × {𝑦})))
41	8	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝐶 ∈ Cat)
42	11	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑋 ∈ (Base‘𝐶))
43	13	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑌 ∈ (Base‘𝐶))
44		simplr 781	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝐹 ∈ (𝑋𝑀𝑌))
45	6, 31, 2, 32, 32	elsetchom 18174	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → ((𝑋 × {𝑥}) ∈ (𝑋(Hom ‘𝐶)𝑋) ↔ (𝑋 × {𝑥}):𝑋⟶𝑋))
46	35, 45	mpbird 260	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝑋 × {𝑥}) ∈ (𝑋(Hom ‘𝐶)𝑋))
47	6, 31, 2, 32, 32	elsetchom 18174	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → ((𝑋 × {𝑦}) ∈ (𝑋(Hom ‘𝐶)𝑋) ↔ (𝑋 × {𝑦}):𝑋⟶𝑋))
48	38, 47	mpbird 260	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝑋 × {𝑦}) ∈ (𝑋(Hom ‘𝐶)𝑋))
49	1, 2, 3, 4, 41, 42, 43, 42, 44, 46, 48	moni 17829	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → ((𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝑋 × {𝑥})) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝑋 × {𝑦})) ↔ (𝑋 × {𝑥}) = (𝑋 × {𝑦})))
50	40, 49	mpbid 235	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝑋 × {𝑥}) = (𝑋 × {𝑦}))
51	50	fveq1d 6884	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → ((𝑋 × {𝑥})‘𝑥) = ((𝑋 × {𝑦})‘𝑥))
52		vex 3457	. . . . . . . 8 ⊢ 𝑥 ∈ V
53	52	fvconst2 7206	. . . . . . 7 ⊢ (𝑥 ∈ 𝑋 → ((𝑋 × {𝑥})‘𝑥) = 𝑥)
54	24, 53	syl 18	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → ((𝑋 × {𝑥})‘𝑥) = 𝑥)
55		vex 3457	. . . . . . . 8 ⊢ 𝑦 ∈ V
56	55	fvconst2 7206	. . . . . . 7 ⊢ (𝑥 ∈ 𝑋 → ((𝑋 × {𝑦})‘𝑥) = 𝑦)
57	24, 56	syl 18	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → ((𝑋 × {𝑦})‘𝑥) = 𝑦)
58	51, 54, 57	3eqtr3d 2805	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑥 = 𝑦)
59	58	expr 462	. . . 4 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
60	59	ralrimivva 3207	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
61		dff13 7254	. . 3 ⊢ (𝐹:𝑋–1-1→𝑌 ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
62	18, 60, 61	sylanbrc 595	. 2 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) → 𝐹:𝑋–1-1→𝑌)
63		f1f 6775	. . . 4 ⊢ (𝐹:𝑋–1-1→𝑌 → 𝐹:𝑋⟶𝑌)
64	16	biimpar 483	. . . 4 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶𝑌) → 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
65	63, 64	sylan2 605	. . 3 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
66	10	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → 𝑈 = (Base‘𝐶))
67	66	eleq2d 2848	. . . . 5 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → (𝑧 ∈ 𝑈 ↔ 𝑧 ∈ (Base‘𝐶)))
68	5	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝑈 ∈ 𝑉)
69		simprl 783	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝑧 ∈ 𝑈)
70	9	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝑋 ∈ 𝑈)
71	12	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝑌 ∈ 𝑈)
72		simprrl 793	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋))
73	6, 68, 2, 69, 70	elsetchom 18174	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ↔ 𝑔:𝑧⟶𝑋))
74	72, 73	mpbid 235	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝑔:𝑧⟶𝑋)
75	63	ad2antlr 740	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝐹:𝑋⟶𝑌)
76	6, 68, 3, 69, 70, 71, 74, 75	setcco 18176	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹 ∘ 𝑔))
77		simprrr 794	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → ℎ ∈ (𝑧(Hom ‘𝐶)𝑋))
78	6, 68, 2, 69, 70	elsetchom 18174	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → (ℎ ∈ (𝑧(Hom ‘𝐶)𝑋) ↔ ℎ:𝑧⟶𝑋))
79	77, 78	mpbid 235	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → ℎ:𝑧⟶𝑋)
80	6, 68, 3, 69, 70, 71, 79, 75	setcco 18176	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) = (𝐹 ∘ ℎ))
81	76, 80	eqeq12d 2778	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → ((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) ↔ (𝐹 ∘ 𝑔) = (𝐹 ∘ ℎ)))
82		simplr 781	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝐹:𝑋–1-1→𝑌)
83		cocan1 7295	. . . . . . . . . . 11 ⊢ ((𝐹:𝑋–1-1→𝑌 ∧ 𝑔:𝑧⟶𝑋 ∧ ℎ:𝑧⟶𝑋) → ((𝐹 ∘ 𝑔) = (𝐹 ∘ ℎ) ↔ 𝑔 = ℎ))
84	82, 74, 79, 83	syl3anc 1398	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → ((𝐹 ∘ 𝑔) = (𝐹 ∘ ℎ) ↔ 𝑔 = ℎ))
85	84	biimpd 232	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → ((𝐹 ∘ 𝑔) = (𝐹 ∘ ℎ) → 𝑔 = ℎ))
86	81, 85	sylbid 243	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → ((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))
87	86	anassrs 473	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ 𝑧 ∈ 𝑈) ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋))) → ((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))
88	87	ralrimivva 3207	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ 𝑧 ∈ 𝑈) → ∀𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋)∀ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))
89	88	ex 418	. . . . 5 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → (𝑧 ∈ 𝑈 → ∀𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋)∀ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ)))
90	67, 89	sylbird 263	. . . 4 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → (𝑧 ∈ (Base‘𝐶) → ∀𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋)∀ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ)))
91	90	ralrimiv 3155	. . 3 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → ∀𝑧 ∈ (Base‘𝐶)∀𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋)∀ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))
92	1, 2, 3, 4, 8, 11, 13	ismon2 17827	. . . 4 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝑀𝑌) ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ ∀𝑧 ∈ (Base‘𝐶)∀𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋)∀ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))))
93	92	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → (𝐹 ∈ (𝑋𝑀𝑌) ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ ∀𝑧 ∈ (Base‘𝐶)∀𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋)∀ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))))
94	65, 91, 93	mpbir2and 726	. 2 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → 𝐹 ∈ (𝑋𝑀𝑌))
95	62, 94	impbida 813	1 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝑀𝑌) ↔ 𝐹:𝑋–1-1→𝑌))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078  {csn 4587  ⟨cop 4593   × cxp 5657   ∘ ccom 5663   Fn wfn 6532  ⟶wf 6533  –1-1→wf1 6534  ‘cfv 6537  (class class class)co 7416  Basecbs 17305  Hom chom 17357  compcco 17358  Catccat 17756  Monocmon 17821  SetCatcsetc 18168

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-cnex 11183  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203  ax-pre-mulgt0 11204

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  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-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-1st 7989  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8458  df-er 8699  df-map 8831  df-en 8956  df-dom 8957  df-sdom 8958  df-fin 8959  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276  df-sub 11470  df-neg 11471  df-nn 12261  df-2 12330  df-3 12331  df-4 12332  df-5 12333  df-6 12334  df-7 12335  df-8 12336  df-9 12337  df-n0 12532  df-z 12619  df-dec 12740  df-uz 12891  df-fz 13564  df-struct 17243  df-slot 17278  df-ndx 17290  df-base 17306  df-hom 17370  df-cco 17371  df-cat 17760  df-cid 17761  df-mon 17823  df-setc 18169

This theorem is used by: (None)