setcepi - Metamath Proof Explorer

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

Theorem setcepi 18076

Description: An epimorphism of sets is a surjection. (Contributed by Mario Carneiro, 3-Jan-2017.)

**Hypotheses**
Ref	Expression
setcmon.c	⊢ 𝐶 = (SetCat‘𝑈)
setcmon.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)
setcmon.x	⊢ (𝜑 → 𝑋 ∈ 𝑈)
setcmon.y	⊢ (𝜑 → 𝑌 ∈ 𝑈)
setcepi.h	⊢ 𝐸 = (Epi‘𝐶)
setcepi.2	⊢ (𝜑 → 2_o ∈ 𝑈)

**Assertion**
Ref	Expression
setcepi	⊢ (𝜑 → (𝐹 ∈ (𝑋𝐸𝑌) ↔ 𝐹:𝑋–onto→𝑌))

Proof of Theorem setcepi Dummy variables 𝑥 𝑔 𝑎 ℎ 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2725	. . . . . 6 ⊢ (Base‘𝐶) = (Base‘𝐶)
2		eqid 2725	. . . . . 6 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
3		eqid 2725	. . . . . 6 ⊢ (comp‘𝐶) = (comp‘𝐶)
4		setcepi.h	. . . . . 6 ⊢ 𝐸 = (Epi‘𝐶)
5		setcmon.u	. . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
6		setcmon.c	. . . . . . . 8 ⊢ 𝐶 = (SetCat‘𝑈)
7	6	setccat 18073	. . . . . . 7 ⊢ (𝑈 ∈ 𝑉 → 𝐶 ∈ Cat)
8	5, 7	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ Cat)
9		setcmon.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝑈)
10	6, 5	setcbas 18066	. . . . . . 7 ⊢ (𝜑 → 𝑈 = (Base‘𝐶))
11	9, 10	eleqtrd 2827	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶))
12		setcmon.y	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝑈)
13	12, 10	eleqtrd 2827	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶))
14	1, 2, 3, 4, 8, 11, 13	epihom 17724	. . . . 5 ⊢ (𝜑 → (𝑋𝐸𝑌) ⊆ (𝑋(Hom ‘𝐶)𝑌))
15	14	sselda 3977	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
16	6, 5, 2, 9, 12	elsetchom 18069	. . . . 5 ⊢ (𝜑 → (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ↔ 𝐹:𝑋⟶𝑌))
17	16	biimpa 475	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌)) → 𝐹:𝑋⟶𝑌)
18	15, 17	syldan 589	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → 𝐹:𝑋⟶𝑌)
19	18	frnd 6729	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → ran 𝐹 ⊆ 𝑌)
20	18	ffnd 6722	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → 𝐹 Fn 𝑋)
21		fnfvelrn 7087	. . . . . . . . . . . . . 14 ⊢ ((𝐹 Fn 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ ran 𝐹)
22	20, 21	sylan 578	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ ran 𝐹)
23	22	iftrued 4537	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) ∧ 𝑥 ∈ 𝑋) → if((𝐹‘𝑥) ∈ ran 𝐹, 1_o, ∅) = 1_o)
24	23	mpteq2dva 5248	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → (𝑥 ∈ 𝑋 ↦ if((𝐹‘𝑥) ∈ ran 𝐹, 1_o, ∅)) = (𝑥 ∈ 𝑋 ↦ 1_o))
25	18	ffvelcdmda 7091	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ 𝑌)
26	18	feqmptd 6964	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → 𝐹 = (𝑥 ∈ 𝑋 ↦ (𝐹‘𝑥)))
27		eqidd 2726	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → (𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)) = (𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)))
28		eleq1 2813	. . . . . . . . . . . . 13 ⊢ (𝑎 = (𝐹‘𝑥) → (𝑎 ∈ ran 𝐹 ↔ (𝐹‘𝑥) ∈ ran 𝐹))
29	28	ifbid 4552	. . . . . . . . . . . 12 ⊢ (𝑎 = (𝐹‘𝑥) → if(𝑎 ∈ ran 𝐹, 1_o, ∅) = if((𝐹‘𝑥) ∈ ran 𝐹, 1_o, ∅))
30	25, 26, 27, 29	fmptco 7136	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → ((𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)) ∘ 𝐹) = (𝑥 ∈ 𝑋 ↦ if((𝐹‘𝑥) ∈ ran 𝐹, 1_o, ∅)))
31		fconstmpt 5739	. . . . . . . . . . . . 13 ⊢ (𝑌 × {1_o}) = (𝑎 ∈ 𝑌 ↦ 1_o)
32	31	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → (𝑌 × {1_o}) = (𝑎 ∈ 𝑌 ↦ 1_o))
33		eqidd 2726	. . . . . . . . . . . 12 ⊢ (𝑎 = (𝐹‘𝑥) → 1_o = 1_o)
34	25, 26, 32, 33	fmptco 7136	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → ((𝑌 × {1_o}) ∘ 𝐹) = (𝑥 ∈ 𝑋 ↦ 1_o))
35	24, 30, 34	3eqtr4d 2775	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → ((𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)) ∘ 𝐹) = ((𝑌 × {1_o}) ∘ 𝐹))
36	5	adantr 479	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → 𝑈 ∈ 𝑉)
37	9	adantr 479	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → 𝑋 ∈ 𝑈)
38	12	adantr 479	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → 𝑌 ∈ 𝑈)
39		setcepi.2	. . . . . . . . . . . 12 ⊢ (𝜑 → 2_o ∈ 𝑈)
40	39	adantr 479	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → 2_o ∈ 𝑈)
41		eqid 2725	. . . . . . . . . . . . 13 ⊢ (𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)) = (𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅))
42		1oex 8495	. . . . . . . . . . . . . . . . 17 ⊢ 1_o ∈ V
43	42	prid2 4768	. . . . . . . . . . . . . . . 16 ⊢ 1_o ∈ {∅, 1_o}
44		df2o3 8493	. . . . . . . . . . . . . . . 16 ⊢ 2_o = {∅, 1_o}
45	43, 44	eleqtrri 2824	. . . . . . . . . . . . . . 15 ⊢ 1_o ∈ 2_o
46		0ex 5307	. . . . . . . . . . . . . . . . 17 ⊢ ∅ ∈ V
47	46	prid1 4767	. . . . . . . . . . . . . . . 16 ⊢ ∅ ∈ {∅, 1_o}
48	47, 44	eleqtrri 2824	. . . . . . . . . . . . . . 15 ⊢ ∅ ∈ 2_o
49	45, 48	ifcli 4576	. . . . . . . . . . . . . 14 ⊢ if(𝑎 ∈ ran 𝐹, 1_o, ∅) ∈ 2_o
50	49	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝑎 ∈ 𝑌 → if(𝑎 ∈ ran 𝐹, 1_o, ∅) ∈ 2_o)
51	41, 50	fmpti 7119	. . . . . . . . . . . 12 ⊢ (𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)):𝑌⟶2_o
52	51	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → (𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)):𝑌⟶2_o)
53	6, 36, 3, 37, 38, 40, 18, 52	setcco 18071	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → ((𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅))(⟨𝑋, 𝑌⟩(comp‘𝐶)2_o)𝐹) = ((𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)) ∘ 𝐹))
54		fconst6g 6784	. . . . . . . . . . . 12 ⊢ (1_o ∈ 2_o → (𝑌 × {1_o}):𝑌⟶2_o)
55	45, 54	mp1i 13	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → (𝑌 × {1_o}):𝑌⟶2_o)
56	6, 36, 3, 37, 38, 40, 18, 55	setcco 18071	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → ((𝑌 × {1_o})(⟨𝑋, 𝑌⟩(comp‘𝐶)2_o)𝐹) = ((𝑌 × {1_o}) ∘ 𝐹))
57	35, 53, 56	3eqtr4d 2775	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → ((𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅))(⟨𝑋, 𝑌⟩(comp‘𝐶)2_o)𝐹) = ((𝑌 × {1_o})(⟨𝑋, 𝑌⟩(comp‘𝐶)2_o)𝐹))
58	8	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → 𝐶 ∈ Cat)
59	11	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → 𝑋 ∈ (Base‘𝐶))
60	13	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → 𝑌 ∈ (Base‘𝐶))
61	39, 10	eleqtrd 2827	. . . . . . . . . . 11 ⊢ (𝜑 → 2_o ∈ (Base‘𝐶))
62	61	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → 2_o ∈ (Base‘𝐶))
63		simpr 483	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → 𝐹 ∈ (𝑋𝐸𝑌))
64	6, 36, 2, 38, 40	elsetchom 18069	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → ((𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)) ∈ (𝑌(Hom ‘𝐶)2_o) ↔ (𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)):𝑌⟶2_o))
65	52, 64	mpbird 256	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → (𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)) ∈ (𝑌(Hom ‘𝐶)2_o))
66	6, 36, 2, 38, 40	elsetchom 18069	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → ((𝑌 × {1_o}) ∈ (𝑌(Hom ‘𝐶)2_o) ↔ (𝑌 × {1_o}):𝑌⟶2_o))
67	55, 66	mpbird 256	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → (𝑌 × {1_o}) ∈ (𝑌(Hom ‘𝐶)2_o))
68	1, 2, 3, 4, 58, 59, 60, 62, 63, 65, 67	epii 17725	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → (((𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅))(⟨𝑋, 𝑌⟩(comp‘𝐶)2_o)𝐹) = ((𝑌 × {1_o})(⟨𝑋, 𝑌⟩(comp‘𝐶)2_o)𝐹) ↔ (𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)) = (𝑌 × {1_o})))
69	57, 68	mpbid 231	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → (𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)) = (𝑌 × {1_o}))
70	69, 31	eqtrdi 2781	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → (𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)) = (𝑎 ∈ 𝑌 ↦ 1_o))
71	49	rgenw 3055	. . . . . . . 8 ⊢ ∀𝑎 ∈ 𝑌 if(𝑎 ∈ ran 𝐹, 1_o, ∅) ∈ 2_o
72		mpteqb 7021	. . . . . . . 8 ⊢ (∀𝑎 ∈ 𝑌 if(𝑎 ∈ ran 𝐹, 1_o, ∅) ∈ 2_o → ((𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)) = (𝑎 ∈ 𝑌 ↦ 1_o) ↔ ∀𝑎 ∈ 𝑌 if(𝑎 ∈ ran 𝐹, 1_o, ∅) = 1_o))
73	71, 72	ax-mp 5	. . . . . . 7 ⊢ ((𝑎 ∈ 𝑌 ↦ if(𝑎 ∈ ran 𝐹, 1_o, ∅)) = (𝑎 ∈ 𝑌 ↦ 1_o) ↔ ∀𝑎 ∈ 𝑌 if(𝑎 ∈ ran 𝐹, 1_o, ∅) = 1_o)
74	70, 73	sylib 217	. . . . . 6 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → ∀𝑎 ∈ 𝑌 if(𝑎 ∈ ran 𝐹, 1_o, ∅) = 1_o)
75		1n0 8507	. . . . . . . . . 10 ⊢ 1_o ≠ ∅
76	75	nesymi 2988	. . . . . . . . 9 ⊢ ¬ ∅ = 1_o
77		iffalse 4538	. . . . . . . . . 10 ⊢ (¬ 𝑎 ∈ ran 𝐹 → if(𝑎 ∈ ran 𝐹, 1_o, ∅) = ∅)
78	77	eqeq1d 2727	. . . . . . . . 9 ⊢ (¬ 𝑎 ∈ ran 𝐹 → (if(𝑎 ∈ ran 𝐹, 1_o, ∅) = 1_o ↔ ∅ = 1_o))
79	76, 78	mtbiri 326	. . . . . . . 8 ⊢ (¬ 𝑎 ∈ ran 𝐹 → ¬ if(𝑎 ∈ ran 𝐹, 1_o, ∅) = 1_o)
80	79	con4i 114	. . . . . . 7 ⊢ (if(𝑎 ∈ ran 𝐹, 1_o, ∅) = 1_o → 𝑎 ∈ ran 𝐹)
81	80	ralimi 3073	. . . . . 6 ⊢ (∀𝑎 ∈ 𝑌 if(𝑎 ∈ ran 𝐹, 1_o, ∅) = 1_o → ∀𝑎 ∈ 𝑌 𝑎 ∈ ran 𝐹)
82	74, 81	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → ∀𝑎 ∈ 𝑌 𝑎 ∈ ran 𝐹)
83		dfss3 3966	. . . . 5 ⊢ (𝑌 ⊆ ran 𝐹 ↔ ∀𝑎 ∈ 𝑌 𝑎 ∈ ran 𝐹)
84	82, 83	sylibr 233	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → 𝑌 ⊆ ran 𝐹)
85	19, 84	eqssd 3995	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → ran 𝐹 = 𝑌)
86		dffo2 6812	. . 3 ⊢ (𝐹:𝑋–onto→𝑌 ↔ (𝐹:𝑋⟶𝑌 ∧ ran 𝐹 = 𝑌))
87	18, 85, 86	sylanbrc 581	. 2 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝐸𝑌)) → 𝐹:𝑋–onto→𝑌)
88		fof 6808	. . . . 5 ⊢ (𝐹:𝑋–onto→𝑌 → 𝐹:𝑋⟶𝑌)
89	88	adantl 480	. . . 4 ⊢ ((𝜑 ∧ 𝐹:𝑋–onto→𝑌) → 𝐹:𝑋⟶𝑌)
90	16	biimpar 476	. . . 4 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶𝑌) → 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
91	89, 90	syldan 589	. . 3 ⊢ ((𝜑 ∧ 𝐹:𝑋–onto→𝑌) → 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
92	10	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ 𝐹:𝑋–onto→𝑌) → 𝑈 = (Base‘𝐶))
93	92	eleq2d 2811	. . . . 5 ⊢ ((𝜑 ∧ 𝐹:𝑋–onto→𝑌) → (𝑧 ∈ 𝑈 ↔ 𝑧 ∈ (Base‘𝐶)))
94	5	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → 𝑈 ∈ 𝑉)
95	9	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → 𝑋 ∈ 𝑈)
96	12	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → 𝑌 ∈ 𝑈)
97		simprl 769	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → 𝑧 ∈ 𝑈)
98	89	adantr 479	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → 𝐹:𝑋⟶𝑌)
99		simprrl 779	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → 𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧))
100	6, 94, 2, 96, 97	elsetchom 18069	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ↔ 𝑔:𝑌⟶𝑧))
101	99, 100	mpbid 231	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → 𝑔:𝑌⟶𝑧)
102	6, 94, 3, 95, 96, 97, 98, 101	setcco 18071	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → (𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) = (𝑔 ∘ 𝐹))
103		simprrr 780	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → ℎ ∈ (𝑌(Hom ‘𝐶)𝑧))
104	6, 94, 2, 96, 97	elsetchom 18069	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → (ℎ ∈ (𝑌(Hom ‘𝐶)𝑧) ↔ ℎ:𝑌⟶𝑧))
105	103, 104	mpbid 231	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → ℎ:𝑌⟶𝑧)
106	6, 94, 3, 95, 96, 97, 98, 105	setcco 18071	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → (ℎ(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) = (ℎ ∘ 𝐹))
107	102, 106	eqeq12d 2741	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → ((𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) = (ℎ(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) ↔ (𝑔 ∘ 𝐹) = (ℎ ∘ 𝐹)))
108		simplr 767	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → 𝐹:𝑋–onto→𝑌)
109	101	ffnd 6722	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → 𝑔 Fn 𝑌)
110	105	ffnd 6722	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → ℎ Fn 𝑌)
111		cocan2 7299	. . . . . . . . . . 11 ⊢ ((𝐹:𝑋–onto→𝑌 ∧ 𝑔 Fn 𝑌 ∧ ℎ Fn 𝑌) → ((𝑔 ∘ 𝐹) = (ℎ ∘ 𝐹) ↔ 𝑔 = ℎ))
112	108, 109, 110, 111	syl3anc 1368	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → ((𝑔 ∘ 𝐹) = (ℎ ∘ 𝐹) ↔ 𝑔 = ℎ))
113	112	biimpd 228	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → ((𝑔 ∘ 𝐹) = (ℎ ∘ 𝐹) → 𝑔 = ℎ))
114	107, 113	sylbid 239	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)))) → ((𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) = (ℎ(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) → 𝑔 = ℎ))
115	114	anassrs 466	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝑧 ∈ 𝑈) ∧ (𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧) ∧ ℎ ∈ (𝑌(Hom ‘𝐶)𝑧))) → ((𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) = (ℎ(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) → 𝑔 = ℎ))
116	115	ralrimivva 3191	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝑧 ∈ 𝑈) → ∀𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧)∀ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)((𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) = (ℎ(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) → 𝑔 = ℎ))
117	116	ex 411	. . . . 5 ⊢ ((𝜑 ∧ 𝐹:𝑋–onto→𝑌) → (𝑧 ∈ 𝑈 → ∀𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧)∀ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)((𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) = (ℎ(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) → 𝑔 = ℎ)))
118	93, 117	sylbird 259	. . . 4 ⊢ ((𝜑 ∧ 𝐹:𝑋–onto→𝑌) → (𝑧 ∈ (Base‘𝐶) → ∀𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧)∀ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)((𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) = (ℎ(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) → 𝑔 = ℎ)))
119	118	ralrimiv 3135	. . 3 ⊢ ((𝜑 ∧ 𝐹:𝑋–onto→𝑌) → ∀𝑧 ∈ (Base‘𝐶)∀𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧)∀ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)((𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) = (ℎ(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) → 𝑔 = ℎ))
120	1, 2, 3, 4, 8, 11, 13	isepi2 17723	. . . 4 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝐸𝑌) ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ ∀𝑧 ∈ (Base‘𝐶)∀𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧)∀ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)((𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) = (ℎ(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) → 𝑔 = ℎ))))
121	120	adantr 479	. . 3 ⊢ ((𝜑 ∧ 𝐹:𝑋–onto→𝑌) → (𝐹 ∈ (𝑋𝐸𝑌) ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ ∀𝑧 ∈ (Base‘𝐶)∀𝑔 ∈ (𝑌(Hom ‘𝐶)𝑧)∀ℎ ∈ (𝑌(Hom ‘𝐶)𝑧)((𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) = (ℎ(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑧)𝐹) → 𝑔 = ℎ))))
122	91, 119, 121	mpbir2and 711	. 2 ⊢ ((𝜑 ∧ 𝐹:𝑋–onto→𝑌) → 𝐹 ∈ (𝑋𝐸𝑌))
123	87, 122	impbida 799	1 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝐸𝑌) ↔ 𝐹:𝑋–onto→𝑌))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ∀wral 3051 ⊆ wss 3945 ∅c0 4323 ifcif 4529 {csn 4629 {cpr 4631 ⟨cop 4635 ↦ cmpt 5231 × cxp 5675 ran crn 5678 ∘ ccom 5681 Fn wfn 6542 ⟶wf 6543 –onto→wfo 6545 ‘cfv 6547 (class class class)co 7417 1_oc1o 8478 2_oc2o 8479 Basecbs 17179 Hom chom 17243 compcco 17244 Catccat 17643 Epicepi 17711 SetCatcsetc 18063

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5364 ax-pr 5428 ax-un 7739 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3775 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-pss 3965 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4909 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6305 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6499 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-riota 7373 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7870 df-1st 7992 df-2nd 7993 df-tpos 8230 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-2o 8486 df-er 8723 df-map 8845 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-nn 12243 df-2 12305 df-3 12306 df-4 12307 df-5 12308 df-6 12309 df-7 12310 df-8 12311 df-9 12312 df-n0 12503 df-z 12589 df-dec 12708 df-uz 12853 df-fz 13517 df-struct 17115 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17180 df-hom 17256 df-cco 17257 df-cat 17647 df-cid 17648 df-oppc 17691 df-mon 17712 df-epi 17713 df-setc 18064

This theorem is referenced by: (None)

W3C validator