ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  f1co Unicode version

Theorem f1co 5605
Description: Composition of one-to-one functions. Exercise 30 of [TakeutiZaring] p. 25. (Contributed by NM, 28-May-1998.)
Assertion
Ref Expression
f1co  |-  ( ( F : B -1-1-> C  /\  G : A -1-1-> B
)  ->  ( F  o.  G ) : A -1-1-> C )

Proof of Theorem f1co
StepHypRef Expression
1 df-f1 5377 . . 3  |-  ( F : B -1-1-> C  <->  ( F : B --> C  /\  Fun  `' F ) )
2 df-f1 5377 . . 3  |-  ( G : A -1-1-> B  <->  ( G : A --> B  /\  Fun  `' G ) )
3 fco 5547 . . . . 5  |-  ( ( F : B --> C  /\  G : A --> B )  ->  ( F  o.  G ) : A --> C )
4 funco 5412 . . . . . . 7  |-  ( ( Fun  `' G  /\  Fun  `' F )  ->  Fun  ( `' G  o.  `' F ) )
5 cnvco 4960 . . . . . . . 8  |-  `' ( F  o.  G )  =  ( `' G  o.  `' F )
65funeqi 5393 . . . . . . 7  |-  ( Fun  `' ( F  o.  G )  <->  Fun  ( `' G  o.  `' F
) )
74, 6sylibr 134 . . . . . 6  |-  ( ( Fun  `' G  /\  Fun  `' F )  ->  Fun  `' ( F  o.  G
) )
87ancoms 268 . . . . 5  |-  ( ( Fun  `' F  /\  Fun  `' G )  ->  Fun  `' ( F  o.  G
) )
93, 8anim12i 338 . . . 4  |-  ( ( ( F : B --> C  /\  G : A --> B )  /\  ( Fun  `' F  /\  Fun  `' G ) )  -> 
( ( F  o.  G ) : A --> C  /\  Fun  `' ( F  o.  G ) ) )
109an4s 596 . . 3  |-  ( ( ( F : B --> C  /\  Fun  `' F
)  /\  ( G : A --> B  /\  Fun  `' G ) )  -> 
( ( F  o.  G ) : A --> C  /\  Fun  `' ( F  o.  G ) ) )
111, 2, 10syl2anb 291 . 2  |-  ( ( F : B -1-1-> C  /\  G : A -1-1-> B
)  ->  ( ( F  o.  G ) : A --> C  /\  Fun  `' ( F  o.  G
) ) )
12 df-f1 5377 . 2  |-  ( ( F  o.  G ) : A -1-1-> C  <->  ( ( F  o.  G ) : A --> C  /\  Fun  `' ( F  o.  G
) ) )
1311, 12sylibr 134 1  |-  ( ( F : B -1-1-> C  /\  G : A -1-1-> B
)  ->  ( F  o.  G ) : A -1-1-> C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104   `'ccnv 4768    o. ccom 4773   Fun wfun 5366   -->wf 5368   -1-1->wf1 5369
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377
This theorem is referenced by:  f1oco  5657  tposf12  6530  domtr  7062  djudom  7423  difinfsn  7430
  Copyright terms: Public domain W3C validator