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

Theorem issect2 16414
Description: Property of being a section. (Contributed by Mario Carneiro, 2-Jan-2017.)
Hypotheses
Ref Expression
issect.b  |-  B  =  ( Base `  C
)
issect.h  |-  H  =  ( Hom  `  C
)
issect.o  |-  .x.  =  (comp `  C )
issect.i  |-  .1.  =  ( Id `  C )
issect.s  |-  S  =  (Sect `  C )
issect.c  |-  ( ph  ->  C  e.  Cat )
issect.x  |-  ( ph  ->  X  e.  B )
issect.y  |-  ( ph  ->  Y  e.  B )
issect.f  |-  ( ph  ->  F  e.  ( X H Y ) )
issect.g  |-  ( ph  ->  G  e.  ( Y H X ) )
Assertion
Ref Expression
issect2  |-  ( ph  ->  ( F ( X S Y ) G  <-> 
( G ( <. X ,  Y >.  .x. 
X ) F )  =  (  .1.  `  X ) ) )

Proof of Theorem issect2
StepHypRef Expression
1 issect.f . . 3  |-  ( ph  ->  F  e.  ( X H Y ) )
2 issect.g . . 3  |-  ( ph  ->  G  e.  ( Y H X ) )
31, 2jca 554 . 2  |-  ( ph  ->  ( F  e.  ( X H Y )  /\  G  e.  ( Y H X ) ) )
4 issect.b . . . . 5  |-  B  =  ( Base `  C
)
5 issect.h . . . . 5  |-  H  =  ( Hom  `  C
)
6 issect.o . . . . 5  |-  .x.  =  (comp `  C )
7 issect.i . . . . 5  |-  .1.  =  ( Id `  C )
8 issect.s . . . . 5  |-  S  =  (Sect `  C )
9 issect.c . . . . 5  |-  ( ph  ->  C  e.  Cat )
10 issect.x . . . . 5  |-  ( ph  ->  X  e.  B )
11 issect.y . . . . 5  |-  ( ph  ->  Y  e.  B )
124, 5, 6, 7, 8, 9, 10, 11issect 16413 . . . 4  |-  ( ph  ->  ( F ( X S Y ) G  <-> 
( F  e.  ( X H Y )  /\  G  e.  ( Y H X )  /\  ( G (
<. X ,  Y >.  .x. 
X ) F )  =  (  .1.  `  X ) ) ) )
13 df-3an 1039 . . . 4  |-  ( ( F  e.  ( X H Y )  /\  G  e.  ( Y H X )  /\  ( G ( <. X ,  Y >.  .x.  X ) F )  =  (  .1.  `  X )
)  <->  ( ( F  e.  ( X H Y )  /\  G  e.  ( Y H X ) )  /\  ( G ( <. X ,  Y >.  .x.  X ) F )  =  (  .1.  `  X )
) )
1412, 13syl6bb 276 . . 3  |-  ( ph  ->  ( F ( X S Y ) G  <-> 
( ( F  e.  ( X H Y )  /\  G  e.  ( Y H X ) )  /\  ( G ( <. X ,  Y >.  .x.  X ) F )  =  (  .1.  `  X )
) ) )
1514baibd 948 . 2  |-  ( (
ph  /\  ( F  e.  ( X H Y )  /\  G  e.  ( Y H X ) ) )  -> 
( F ( X S Y ) G  <-> 
( G ( <. X ,  Y >.  .x. 
X ) F )  =  (  .1.  `  X ) ) )
163, 15mpdan 702 1  |-  ( ph  ->  ( F ( X S Y ) G  <-> 
( G ( <. X ,  Y >.  .x. 
X ) F )  =  (  .1.  `  X ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    /\ w3a 1037    = wceq 1483    e. wcel 1990   <.cop 4183   class class class wbr 4653   ` cfv 5888  (class class class)co 6650   Basecbs 15857   Hom chom 15952  compcco 15953   Catccat 16325   Idccid 16326  Sectcsect 16404
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-sect 16407
This theorem is referenced by:  sectco  16416  dfiso3  16433  monsect  16443  sectid  16446  invcoisoid  16452  isocoinvid  16453  cicref  16461  funcsect  16532  fthsect  16585  fucsect  16632  2initoinv  16660  2termoinv  16667  catcisolem  16756
  Copyright terms: Public domain W3C validator