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

Theorem monsect 17047
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 2821 . . . . . . . . 9 (Hom ‘𝐶) = (Hom ‘𝐶)
4 eqid 2821 . . . . . . . . 9 (comp‘𝐶) = (comp‘𝐶)
5 eqid 2821 . . . . . . . . 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 17017 . . . . . . . 8 (𝜑 → (𝐺(𝑌𝑆𝑋)𝐹 ↔ (𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐺) = ((Id‘𝐶)‘𝑌))))
111, 10mpbid 234 . . . . . . 7 (𝜑 → (𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐺) = ((Id‘𝐶)‘𝑌)))
1211simp3d 1140 . . . . . 6 (𝜑 → (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐺) = ((Id‘𝐶)‘𝑌))
1312oveq1d 7165 . . . . 5 (𝜑 → ((𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐺)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐹) = (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐹))
1411simp2d 1139 . . . . . 6 (𝜑𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
1511simp1d 1138 . . . . . 6 (𝜑𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋))
162, 3, 4, 7, 9, 8, 9, 14, 15, 8, 14catass 16951 . . . . 5 (𝜑 → ((𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐺)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐹) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)))
172, 3, 5, 7, 9, 4, 8, 14catlid 16948 . . . . . 6 (𝜑 → (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐹) = 𝐹)
182, 3, 5, 7, 9, 4, 8, 14catrid 16949 . . . . . 6 (𝜑 → (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)) = 𝐹)
1917, 18eqtr4d 2859 . . . . 5 (𝜑 → (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)𝐹) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)))
2013, 16, 193eqtr3d 2864 . . . 4 (𝜑 → (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)))
21 sectmon.m . . . . 5 𝑀 = (Mono‘𝐶)
22 monsect.1 . . . . 5 (𝜑𝐹 ∈ (𝑋𝑀𝑌))
232, 3, 4, 7, 9, 8, 9, 14, 15catcocl 16950 . . . . 5 (𝜑 → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) ∈ (𝑋(Hom ‘𝐶)𝑋))
242, 3, 5, 7, 9catidcl 16947 . . . . 5 (𝜑 → ((Id‘𝐶)‘𝑋) ∈ (𝑋(Hom ‘𝐶)𝑋))
252, 3, 4, 21, 7, 9, 8, 9, 22, 23, 24moni 17000 . . . 4 (𝜑 → ((𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)) ↔ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))
2620, 25mpbid 234 . . 3 (𝜑 → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))
272, 3, 4, 5, 6, 7, 9, 8, 14, 15issect2 17018 . . 3 (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))
2826, 27mpbird 259 . 2 (𝜑𝐹(𝑋𝑆𝑌)𝐺)
29 monsect.n . . 3 𝑁 = (Inv‘𝐶)
302, 29, 7, 9, 8, 6isinv 17024 . 2 (𝜑 → (𝐹(𝑋𝑁𝑌)𝐺 ↔ (𝐹(𝑋𝑆𝑌)𝐺𝐺(𝑌𝑆𝑋)𝐹)))
3128, 1, 30mpbir2and 711 1 (𝜑𝐹(𝑋𝑁𝑌)𝐺)
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1083   = wceq 1533  wcel 2110  cop 4566   class class class wbr 5058  cfv 6349  (class class class)co 7150  Basecbs 16477  Hom chom 16570  compcco 16571  Catccat 16929  Idccid 16930  Monocmon 16992  Sectcsect 17008  Invcinv 17009
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5182  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-iun 4913  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-1st 7683  df-2nd 7684  df-cat 16933  df-cid 16934  df-mon 16994  df-sect 17011  df-inv 17012
This theorem is referenced by:  episect  17049
  Copyright terms: Public domain W3C validator