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

Theorem sectmon 17749
Description: If 𝐹 is a section of 𝐺, then 𝐹 is a monomorphism. Proposition 7.35 of [Adamek] p. 110. A monomorphism that arises from a section is also known as a split monomorphism. (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 (𝜑𝑌𝐵)
sectmon.1 (𝜑𝐹(𝑋𝑆𝑌)𝐺)
Assertion
Ref Expression
sectmon (𝜑𝐹 ∈ (𝑋𝑀𝑌))

Proof of Theorem sectmon
Dummy variables 𝑔 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sectmon.1 . . . 4 (𝜑𝐹(𝑋𝑆𝑌)𝐺)
2 sectmon.b . . . . 5 𝐵 = (Base‘𝐶)
3 eqid 2737 . . . . 5 (Hom ‘𝐶) = (Hom ‘𝐶)
4 eqid 2737 . . . . 5 (comp‘𝐶) = (comp‘𝐶)
5 eqid 2737 . . . . 5 (Id‘𝐶) = (Id‘𝐶)
6 sectmon.s . . . . 5 𝑆 = (Sect‘𝐶)
7 sectmon.c . . . . 5 (𝜑𝐶 ∈ Cat)
8 sectmon.x . . . . 5 (𝜑𝑋𝐵)
9 sectmon.y . . . . 5 (𝜑𝑌𝐵)
102, 3, 4, 5, 6, 7, 8, 9issect 17720 . . . 4 (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))))
111, 10mpbid 232 . . 3 (𝜑 → (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))
1211simp1d 1143 . 2 (𝜑𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
13 oveq2 7375 . . . . 5 ((𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)) → (𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔)) = (𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌))))
1411simp3d 1145 . . . . . . . . 9 (𝜑 → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))
1514ad2antrr 727 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))
1615oveq1d 7382 . . . . . . 7 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → ((𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)𝑔) = (((Id‘𝐶)‘𝑋)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)𝑔))
177ad2antrr 727 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → 𝐶 ∈ Cat)
18 simplr 769 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → 𝑥𝐵)
198ad2antrr 727 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → 𝑋𝐵)
209ad2antrr 727 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → 𝑌𝐵)
21 simprl 771 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → 𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋))
2212ad2antrr 727 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
2311simp2d 1144 . . . . . . . . 9 (𝜑𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋))
2423ad2antrr 727 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋))
252, 3, 4, 17, 18, 19, 20, 21, 22, 19, 24catass 17652 . . . . . . 7 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → ((𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)𝑔) = (𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔)))
262, 3, 5, 17, 18, 4, 19, 21catlid 17649 . . . . . . 7 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → (((Id‘𝐶)‘𝑋)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)𝑔) = 𝑔)
2716, 25, 263eqtr3d 2780 . . . . . 6 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → (𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔)) = 𝑔)
2815oveq1d 7382 . . . . . . 7 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → ((𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)) = (((Id‘𝐶)‘𝑋)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)))
29 simprr 773 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → ∈ (𝑥(Hom ‘𝐶)𝑋))
302, 3, 4, 17, 18, 19, 20, 29, 22, 19, 24catass 17652 . . . . . . 7 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → ((𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)) = (𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌))))
312, 3, 5, 17, 18, 4, 19, 29catlid 17649 . . . . . . 7 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → (((Id‘𝐶)‘𝑋)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)) = )
3228, 30, 313eqtr3d 2780 . . . . . 6 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → (𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌))) = )
3327, 32eqeq12d 2753 . . . . 5 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → ((𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔)) = (𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌))) ↔ 𝑔 = ))
3413, 33imbitrid 244 . . . 4 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → ((𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)) → 𝑔 = ))
3534ralrimivva 3181 . . 3 ((𝜑𝑥𝐵) → ∀𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋)∀ ∈ (𝑥(Hom ‘𝐶)𝑋)((𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)) → 𝑔 = ))
3635ralrimiva 3130 . 2 (𝜑 → ∀𝑥𝐵𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋)∀ ∈ (𝑥(Hom ‘𝐶)𝑋)((𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)) → 𝑔 = ))
37 sectmon.m . . 3 𝑀 = (Mono‘𝐶)
382, 3, 4, 37, 7, 8, 9ismon2 17701 . 2 (𝜑 → (𝐹 ∈ (𝑋𝑀𝑌) ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ ∀𝑥𝐵𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋)∀ ∈ (𝑥(Hom ‘𝐶)𝑋)((𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)) → 𝑔 = ))))
3912, 36, 38mpbir2and 714 1 (𝜑𝐹 ∈ (𝑋𝑀𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3052  cop 4574   class class class wbr 5086  cfv 6499  (class class class)co 7367  Basecbs 17179  Hom chom 17231  compcco 17232  Catccat 17630  Idccid 17631  Monocmon 17695  Sectcsect 17711
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5308  ax-pr 5376  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6455  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-cat 17634  df-cid 17635  df-mon 17697  df-sect 17714
This theorem is referenced by:  sectepi  17751
  Copyright terms: Public domain W3C validator