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

Theorem sectcan 16238
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
StepHypRef Expression
1 sectcan.b . . . 4 𝐵 = (Base‘𝐶)
2 eqid 2610 . . . 4 (Hom ‘𝐶) = (Hom ‘𝐶)
3 eqid 2610 . . . 4 (comp‘𝐶) = (comp‘𝐶)
4 sectcan.c . . . 4 (𝜑𝐶 ∈ Cat)
5 sectcan.x . . . 4 (𝜑𝑋𝐵)
6 sectcan.y . . . 4 (𝜑𝑌𝐵)
7 sectcan.1 . . . . . 6 (𝜑𝐺(𝑋𝑆𝑌)𝐹)
8 eqid 2610 . . . . . . 7 (Id‘𝐶) = (Id‘𝐶)
9 sectcan.s . . . . . . 7 𝑆 = (Sect‘𝐶)
101, 2, 3, 8, 9, 4, 5, 6issect 16236 . . . . . 6 (𝜑 → (𝐺(𝑋𝑆𝑌)𝐹 ↔ (𝐺 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐹 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐹(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐺) = ((Id‘𝐶)‘𝑋))))
117, 10mpbid 221 . . . . 5 (𝜑 → (𝐺 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐹 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐹(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐺) = ((Id‘𝐶)‘𝑋)))
1211simp1d 1066 . . . 4 (𝜑𝐺 ∈ (𝑋(Hom ‘𝐶)𝑌))
13 sectcan.2 . . . . . 6 (𝜑𝐹(𝑌𝑆𝑋)𝐻)
141, 2, 3, 8, 9, 4, 6, 5issect 16236 . . . . . 6 (𝜑 → (𝐹(𝑌𝑆𝑋)𝐻 ↔ (𝐹 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ 𝐻 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ (𝐻(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹) = ((Id‘𝐶)‘𝑌))))
1513, 14mpbid 221 . . . . 5 (𝜑 → (𝐹 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ 𝐻 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ (𝐻(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹) = ((Id‘𝐶)‘𝑌)))
1615simp1d 1066 . . . 4 (𝜑𝐹 ∈ (𝑌(Hom ‘𝐶)𝑋))
1715simp2d 1067 . . . 4 (𝜑𝐻 ∈ (𝑋(Hom ‘𝐶)𝑌))
181, 2, 3, 4, 5, 6, 5, 12, 16, 6, 17catass 16170 . . 3 (𝜑 → ((𝐻(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐺) = (𝐻(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝐹(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐺)))
1915simp3d 1068 . . . 4 (𝜑 → (𝐻(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹) = ((Id‘𝐶)‘𝑌))
2019oveq1d 6564 . . 3 (𝜑 → ((𝐻(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐺) = (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐺))
2111simp3d 1068 . . . 4 (𝜑 → (𝐹(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐺) = ((Id‘𝐶)‘𝑋))
2221oveq2d 6565 . . 3 (𝜑 → (𝐻(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝐹(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐺)) = (𝐻(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)))
2318, 20, 223eqtr3d 2652 . 2 (𝜑 → (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐺) = (𝐻(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)))
241, 2, 8, 4, 5, 3, 6, 12catlid 16167 . 2 (𝜑 → (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐺) = 𝐺)
251, 2, 8, 4, 5, 3, 6, 17catrid 16168 . 2 (𝜑 → (𝐻(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)) = 𝐻)
2623, 24, 253eqtr3d 2652 1 (𝜑𝐺 = 𝐻)
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1031   = wceq 1475  wcel 1977  cop 4131   class class class wbr 4583  cfv 5804  (class class class)co 6549  Basecbs 15695  Hom chom 15779  compcco 15780  Catccat 16148  Idccid 16149  Sectcsect 16227
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-cat 16152  df-cid 16153  df-sect 16230
This theorem is referenced by:  invfun  16247  inveq  16257
  Copyright terms: Public domain W3C validator