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

Theorem sectmon 17494
Description: If 𝐹 is a section of 𝐺, then 𝐹 is a monomorphism. 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 2738 . . . . 5 (Hom ‘𝐶) = (Hom ‘𝐶)
4 eqid 2738 . . . . 5 (comp‘𝐶) = (comp‘𝐶)
5 eqid 2738 . . . . 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 17465 . . . 4 (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))))
111, 10mpbid 231 . . 3 (𝜑 → (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))
1211simp1d 1141 . 2 (𝜑𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
13 oveq2 7283 . . . . 5 ((𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)) → (𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔)) = (𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌))))
1411simp3d 1143 . . . . . . . . 9 (𝜑 → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))
1514ad2antrr 723 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))
1615oveq1d 7290 . . . . . . 7 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → ((𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)𝑔) = (((Id‘𝐶)‘𝑋)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)𝑔))
177ad2antrr 723 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → 𝐶 ∈ Cat)
18 simplr 766 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → 𝑥𝐵)
198ad2antrr 723 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → 𝑋𝐵)
209ad2antrr 723 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → 𝑌𝐵)
21 simprl 768 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → 𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋))
2212ad2antrr 723 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
2311simp2d 1142 . . . . . . . . 9 (𝜑𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋))
2423ad2antrr 723 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋))
252, 3, 4, 17, 18, 19, 20, 21, 22, 19, 24catass 17395 . . . . . . 7 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → ((𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)𝑔) = (𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔)))
262, 3, 5, 17, 18, 4, 19, 21catlid 17392 . . . . . . 7 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → (((Id‘𝐶)‘𝑋)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)𝑔) = 𝑔)
2716, 25, 263eqtr3d 2786 . . . . . 6 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → (𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔)) = 𝑔)
2815oveq1d 7290 . . . . . . 7 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → ((𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)) = (((Id‘𝐶)‘𝑋)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)))
29 simprr 770 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → ∈ (𝑥(Hom ‘𝐶)𝑋))
302, 3, 4, 17, 18, 19, 20, 29, 22, 19, 24catass 17395 . . . . . . 7 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → ((𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)) = (𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌))))
312, 3, 5, 17, 18, 4, 19, 29catlid 17392 . . . . . . 7 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → (((Id‘𝐶)‘𝑋)(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑋)) = )
3228, 30, 313eqtr3d 2786 . . . . . 6 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → (𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌))) = )
3327, 32eqeq12d 2754 . . . . 5 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → ((𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔)) = (𝐺(⟨𝑥, 𝑌⟩(comp‘𝐶)𝑋)(𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌))) ↔ 𝑔 = ))
3413, 33syl5ib 243 . . . 4 (((𝜑𝑥𝐵) ∧ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋) ∧ ∈ (𝑥(Hom ‘𝐶)𝑋))) → ((𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)) → 𝑔 = ))
3534ralrimivva 3123 . . 3 ((𝜑𝑥𝐵) → ∀𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋)∀ ∈ (𝑥(Hom ‘𝐶)𝑋)((𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)) → 𝑔 = ))
3635ralrimiva 3103 . 2 (𝜑 → ∀𝑥𝐵𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋)∀ ∈ (𝑥(Hom ‘𝐶)𝑋)((𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)) → 𝑔 = ))
37 sectmon.m . . 3 𝑀 = (Mono‘𝐶)
382, 3, 4, 37, 7, 8, 9ismon2 17446 . 2 (𝜑 → (𝐹 ∈ (𝑋𝑀𝑌) ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ ∀𝑥𝐵𝑔 ∈ (𝑥(Hom ‘𝐶)𝑋)∀ ∈ (𝑥(Hom ‘𝐶)𝑋)((𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑥, 𝑋⟩(comp‘𝐶)𝑌)) → 𝑔 = ))))
3912, 36, 38mpbir2and 710 1 (𝜑𝐹 ∈ (𝑋𝑀𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1086   = wceq 1539  wcel 2106  wral 3064  cop 4567   class class class wbr 5074  cfv 6433  (class class class)co 7275  Basecbs 16912  Hom chom 16973  compcco 16974  Catccat 17373  Idccid 17374  Monocmon 17440  Sectcsect 17456
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-1st 7831  df-2nd 7832  df-cat 17377  df-cid 17378  df-mon 17442  df-sect 17459
This theorem is referenced by:  sectepi  17496
  Copyright terms: Public domain W3C validator