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

Theorem monsect 17476
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 2739 . . . . . . . . 9 (Hom ‘𝐶) = (Hom ‘𝐶)
4 eqid 2739 . . . . . . . . 9 (comp‘𝐶) = (comp‘𝐶)
5 eqid 2739 . . . . . . . . 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 17446 . . . . . . . 8 (𝜑 → (𝐺(𝑌𝑆𝑋)𝐹 ↔ (𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐺) = ((Id‘𝐶)‘𝑌))))
111, 10mpbid 231 . . . . . . 7 (𝜑 → (𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐺) = ((Id‘𝐶)‘𝑌)))
1211simp3d 1142 . . . . . 6 (𝜑 → (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐺) = ((Id‘𝐶)‘𝑌))
1312oveq1d 7283 . . . . 5 (𝜑 → ((𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐺)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐹) = (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐹))
1411simp2d 1141 . . . . . 6 (𝜑𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
1511simp1d 1140 . . . . . 6 (𝜑𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋))
162, 3, 4, 7, 9, 8, 9, 14, 15, 8, 14catass 17376 . . . . 5 (𝜑 → ((𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐺)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐹) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)))
172, 3, 5, 7, 9, 4, 8, 14catlid 17373 . . . . . 6 (𝜑 → (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐹) = 𝐹)
182, 3, 5, 7, 9, 4, 8, 14catrid 17374 . . . . . 6 (𝜑 → (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)) = 𝐹)
1917, 18eqtr4d 2782 . . . . 5 (𝜑 → (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐹) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)))
2013, 16, 193eqtr3d 2787 . . . 4 (𝜑 → (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)))
21 sectmon.m . . . . 5 𝑀 = (Mono‘𝐶)
22 monsect.1 . . . . 5 (𝜑𝐹 ∈ (𝑋𝑀𝑌))
232, 3, 4, 7, 9, 8, 9, 14, 15catcocl 17375 . . . . 5 (𝜑 → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) ∈ (𝑋(Hom ‘𝐶)𝑋))
242, 3, 5, 7, 9catidcl 17372 . . . . 5 (𝜑 → ((Id‘𝐶)‘𝑋) ∈ (𝑋(Hom ‘𝐶)𝑋))
252, 3, 4, 21, 7, 9, 8, 9, 22, 23, 24moni 17429 . . . 4 (𝜑 → ((𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)) ↔ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))
2620, 25mpbid 231 . . 3 (𝜑 → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))
272, 3, 4, 5, 6, 7, 9, 8, 14, 15issect2 17447 . . 3 (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))
2826, 27mpbird 256 . 2 (𝜑𝐹(𝑋𝑆𝑌)𝐺)
29 monsect.n . . 3 𝑁 = (Inv‘𝐶)
302, 29, 7, 9, 8, 6isinv 17453 . 2 (𝜑 → (𝐹(𝑋𝑁𝑌)𝐺 ↔ (𝐹(𝑋𝑆𝑌)𝐺𝐺(𝑌𝑆𝑋)𝐹)))
3128, 1, 30mpbir2and 709 1 (𝜑𝐹(𝑋𝑁𝑌)𝐺)
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1085   = wceq 1541  wcel 2109  cop 4572   class class class wbr 5078  cfv 6430  (class class class)co 7268  Basecbs 16893  Hom chom 16954  compcco 16955  Catccat 17354  Idccid 17355  Monocmon 17421  Sectcsect 17437  Invcinv 17438
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-rep 5213  ax-sep 5226  ax-nul 5233  ax-pow 5291  ax-pr 5355  ax-un 7579
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ne 2945  df-ral 3070  df-rex 3071  df-reu 3072  df-rmo 3073  df-rab 3074  df-v 3432  df-sbc 3720  df-csb 3837  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-nul 4262  df-if 4465  df-pw 4540  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4845  df-iun 4931  df-br 5079  df-opab 5141  df-mpt 5162  df-id 5488  df-xp 5594  df-rel 5595  df-cnv 5596  df-co 5597  df-dm 5598  df-rn 5599  df-res 5600  df-ima 5601  df-iota 6388  df-fun 6432  df-fn 6433  df-f 6434  df-f1 6435  df-fo 6436  df-f1o 6437  df-fv 6438  df-riota 7225  df-ov 7271  df-oprab 7272  df-mpo 7273  df-1st 7817  df-2nd 7818  df-cat 17358  df-cid 17359  df-mon 17423  df-sect 17440  df-inv 17441
This theorem is referenced by:  episect  17478
  Copyright terms: Public domain W3C validator