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

Theorem monsect 17840
Description: If 𝐹 is a monomorphism and 𝐺 is a section of 𝐹, then 𝐺 is an inverse of 𝐹 and they are both isomorphisms. This is also stated as "a monomorphism which is also a split epimorphism is an isomorphism". (Contributed by Mario Carneiro, 3-Jan-2017.)
Hypotheses
Ref Expression
sectmon.b 𝐵 = (Base‘𝐶)
sectmon.m 𝑀 = (Mono‘𝐶)
sectmon.s 𝑆 = (Sect‘𝐶)
sectmon.c (𝜑𝐶 ∈ Cat)
sectmon.x (𝜑𝑋𝐵)
sectmon.y (𝜑𝑌𝐵)
monsect.n 𝑁 = (Inv‘𝐶)
monsect.1 (𝜑𝐹 ∈ (𝑋𝑀𝑌))
monsect.2 (𝜑𝐺(𝑌𝑆𝑋)𝐹)
Assertion
Ref Expression
monsect (𝜑𝐹(𝑋𝑁𝑌)𝐺)

Proof of Theorem monsect
StepHypRef Expression
1 monsect.2 . . . . . . . 8 (𝜑𝐺(𝑌𝑆𝑋)𝐹)
2 sectmon.b . . . . . . . . 9 𝐵 = (Base‘𝐶)
3 eqid 2769 . . . . . . . . 9 (Hom ‘𝐶) = (Hom ‘𝐶)
4 eqid 2769 . . . . . . . . 9 (comp‘𝐶) = (comp‘𝐶)
5 eqid 2769 . . . . . . . . 9 (Id‘𝐶) = (Id‘𝐶)
6 sectmon.s . . . . . . . . 9 𝑆 = (Sect‘𝐶)
7 sectmon.c . . . . . . . . 9 (𝜑𝐶 ∈ Cat)
8 sectmon.y . . . . . . . . 9 (𝜑𝑌𝐵)
9 sectmon.x . . . . . . . . 9 (𝜑𝑋𝐵)
102, 3, 4, 5, 6, 7, 8, 9issect 17810 . . . . . . . 8 (𝜑 → (𝐺(𝑌𝑆𝑋)𝐹 ↔ (𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐺) = ((Id‘𝐶)‘𝑌))))
111, 10mpbid 235 . . . . . . 7 (𝜑 → (𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐺) = ((Id‘𝐶)‘𝑌)))
1211simp3d 1160 . . . . . 6 (𝜑 → (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐺) = ((Id‘𝐶)‘𝑌))
1312oveq1d 7426 . . . . 5 (𝜑 → ((𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐺)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐹) = (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐹))
1411simp2d 1159 . . . . . 6 (𝜑𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
1511simp1d 1158 . . . . . 6 (𝜑𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋))
162, 3, 4, 7, 9, 8, 9, 14, 15, 8, 14catass 17742 . . . . 5 (𝜑 → ((𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐺)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐹) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)))
172, 3, 5, 7, 9, 4, 8, 14catlid 17739 . . . . . 6 (𝜑 → (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐹) = 𝐹)
182, 3, 5, 7, 9, 4, 8, 14catrid 17740 . . . . . 6 (𝜑 → (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)) = 𝐹)
1917, 18eqtr4d 2807 . . . . 5 (𝜑 → (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐹) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)))
2013, 16, 193eqtr3d 2812 . . . 4 (𝜑 → (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)))
21 sectmon.m . . . . 5 𝑀 = (Mono‘𝐶)
22 monsect.1 . . . . 5 (𝜑𝐹 ∈ (𝑋𝑀𝑌))
232, 3, 4, 7, 9, 8, 9, 14, 15catcocl 17741 . . . . 5 (𝜑 → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) ∈ (𝑋(Hom ‘𝐶)𝑋))
242, 3, 5, 7, 9catidcl 17738 . . . . 5 (𝜑 → ((Id‘𝐶)‘𝑋) ∈ (𝑋(Hom ‘𝐶)𝑋))
252, 3, 4, 21, 7, 9, 8, 9, 22, 23, 24moni 17793 . . . 4 (𝜑 → ((𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)) ↔ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))
2620, 25mpbid 235 . . 3 (𝜑 → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))
272, 3, 4, 5, 6, 7, 9, 8, 14, 15issect2 17811 . . 3 (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))
2826, 27mpbird 260 . 2 (𝜑𝐹(𝑋𝑆𝑌)𝐺)
29 monsect.n . . 3 𝑁 = (Inv‘𝐶)
302, 29, 7, 9, 8, 6isinv 17817 . 2 (𝜑 → (𝐹(𝑋𝑁𝑌)𝐺 ↔ (𝐹(𝑋𝑆𝑌)𝐺𝐺(𝑌𝑆𝑋)𝐹)))
3128, 1, 30mpbir2and 725 1 (𝜑𝐹(𝑋𝑁𝑌)𝐺)
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1101   = wceq 1567  wcel 2149  cop 4598   class class class wbr 5111  cfv 6537  (class class class)co 7411  Basecbs 17269  Hom chom 17321  compcco 17322  Catccat 17720  Idccid 17721  Monocmon 17785  Sectcsect 17801  Invcinv 17802
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3375  df-reu 3376  df-rab 3423  df-v 3463  df-sbc 3752  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  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 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-1st 7986  df-2nd 7987  df-cat 17724  df-cid 17725  df-mon 17787  df-sect 17804  df-inv 17805
This theorem is referenced by:  episect  17842
  Copyright terms: Public domain W3C validator