Theorem sectcan 17768

Description: If 𝐺 is a section of 𝐹 and 𝐹 is a section of 𝐻, then 𝐺 = 𝐻. Proposition 3.10 of [Adamek] p. 28. (Contributed by Mario Carneiro, 2-Jan-2017.)

Hypotheses

Ref	Expression
sectcan.b	⊢ 𝐵 = (Base‘𝐶)
sectcan.s	⊢ 𝑆 = (Sect‘𝐶)
sectcan.c	⊢ (𝜑 → 𝐶 ∈ Cat)
sectcan.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
sectcan.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
sectcan.1	⊢ (𝜑 → 𝐺(𝑋𝑆𝑌)𝐹)
sectcan.2	⊢ (𝜑 → 𝐹(𝑌𝑆𝑋)𝐻)

Assertion

Ref	Expression
sectcan	⊢ (𝜑 → 𝐺 = 𝐻)

Proof of Theorem sectcan

Step	Hyp	Ref	Expression
1		sectcan.b	. . . 4 ⊢ 𝐵 = (Base‘𝐶)
2		eqid 2735	. . . 4 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
3		eqid 2735	. . . 4 ⊢ (comp‘𝐶) = (comp‘𝐶)
4		sectcan.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat)
5		sectcan.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
6		sectcan.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
7		sectcan.1	. . . . . 6 ⊢ (𝜑 → 𝐺(𝑋𝑆𝑌)𝐹)
8		eqid 2735	. . . . . . 7 ⊢ (Id‘𝐶) = (Id‘𝐶)
9		sectcan.s	. . . . . . 7 ⊢ 𝑆 = (Sect‘𝐶)
10	1, 2, 3, 8, 9, 4, 5, 6	issect 17766	. . . . . 6 ⊢ (𝜑 → (𝐺(𝑋𝑆𝑌)𝐹 ↔ (𝐺 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐹 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐹(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐺) = ((Id‘𝐶)‘𝑋))))
11	7, 10	mpbid 232	. . . . 5 ⊢ (𝜑 → (𝐺 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐹 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐹(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐺) = ((Id‘𝐶)‘𝑋)))
12	11	simp1d 1142	. . . 4 ⊢ (𝜑 → 𝐺 ∈ (𝑋(Hom ‘𝐶)𝑌))
13		sectcan.2	. . . . . 6 ⊢ (𝜑 → 𝐹(𝑌𝑆𝑋)𝐻)
14	1, 2, 3, 8, 9, 4, 6, 5	issect 17766	. . . . . 6 ⊢ (𝜑 → (𝐹(𝑌𝑆𝑋)𝐻 ↔ (𝐹 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ 𝐻 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ (𝐻(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹) = ((Id‘𝐶)‘𝑌))))
15	13, 14	mpbid 232	. . . . 5 ⊢ (𝜑 → (𝐹 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ 𝐻 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ (𝐻(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹) = ((Id‘𝐶)‘𝑌)))
16	15	simp1d 1142	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝑌(Hom ‘𝐶)𝑋))
17	15	simp2d 1143	. . . 4 ⊢ (𝜑 → 𝐻 ∈ (𝑋(Hom ‘𝐶)𝑌))
18	1, 2, 3, 4, 5, 6, 5, 12, 16, 6, 17	catass 17698	. . 3 ⊢ (𝜑 → ((𝐻(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐺) = (𝐻(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝐹(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐺)))
19	15	simp3d 1144	. . . 4 ⊢ (𝜑 → (𝐻(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹) = ((Id‘𝐶)‘𝑌))
20	19	oveq1d 7420	. . 3 ⊢ (𝜑 → ((𝐻(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐺) = (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐺))
21	11	simp3d 1144	. . . 4 ⊢ (𝜑 → (𝐹(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐺) = ((Id‘𝐶)‘𝑋))
22	21	oveq2d 7421	. . 3 ⊢ (𝜑 → (𝐻(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝐹(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐺)) = (𝐻(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)))
23	18, 20, 22	3eqtr3d 2778	. 2 ⊢ (𝜑 → (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐺) = (𝐻(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)))
24	1, 2, 8, 4, 5, 3, 6, 12	catlid 17695	. 2 ⊢ (𝜑 → (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐺) = 𝐺)
25	1, 2, 8, 4, 5, 3, 6, 17	catrid 17696	. 2 ⊢ (𝜑 → (𝐻(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)) = 𝐻)
26	23, 24, 25	3eqtr3d 2778	1 ⊢ (𝜑 → 𝐺 = 𝐻)

Syntax hints:   → wi 4   ∧ w3a 1086   = wceq 1540   ∈ wcel 2108  ⟨cop 4607   class class class wbr 5119  ‘cfv 6531  (class class class)co 7405  Basecbs 17228  Hom chom 17282  compcco 17283  Catccat 17676  Idccid 17677  Sectcsect 17757

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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729

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 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7362  df-ov 7408  df-oprab 7409  df-mpo 7410  df-1st 7988  df-2nd 7989  df-cat 17680  df-cid 17681  df-sect 17760

This theorem is referenced by:  invfun  17777  inveq  17787