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

Theorem fcompt 5763
Description: Express composition of two functions as a maps-to applying both in sequence. (Contributed by Stefan O'Rear, 5-Oct-2014.) (Proof shortened by Mario Carneiro, 27-Dec-2014.)
Assertion
Ref Expression
fcompt  |-  ( ( A : D --> E  /\  B : C --> D )  ->  ( A  o.  B )  =  ( x  e.  C  |->  ( A `  ( B `
 x ) ) ) )
Distinct variable groups:    x, A    x, B    x, C    x, D    x, E

Proof of Theorem fcompt
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 ffvelcdm 5726 . . 3  |-  ( ( B : C --> D  /\  x  e.  C )  ->  ( B `  x
)  e.  D )
21adantll 476 . 2  |-  ( ( ( A : D --> E  /\  B : C --> D )  /\  x  e.  C )  ->  ( B `  x )  e.  D )
3 ffn 5435 . . . 4  |-  ( B : C --> D  ->  B  Fn  C )
43adantl 277 . . 3  |-  ( ( A : D --> E  /\  B : C --> D )  ->  B  Fn  C
)
5 dffn5im 5637 . . 3  |-  ( B  Fn  C  ->  B  =  ( x  e.  C  |->  ( B `  x ) ) )
64, 5syl 14 . 2  |-  ( ( A : D --> E  /\  B : C --> D )  ->  B  =  ( x  e.  C  |->  ( B `  x ) ) )
7 ffn 5435 . . . 4  |-  ( A : D --> E  ->  A  Fn  D )
87adantr 276 . . 3  |-  ( ( A : D --> E  /\  B : C --> D )  ->  A  Fn  D
)
9 dffn5im 5637 . . 3  |-  ( A  Fn  D  ->  A  =  ( y  e.  D  |->  ( A `  y ) ) )
108, 9syl 14 . 2  |-  ( ( A : D --> E  /\  B : C --> D )  ->  A  =  ( y  e.  D  |->  ( A `  y ) ) )
11 fveq2 5589 . 2  |-  ( y  =  ( B `  x )  ->  ( A `  y )  =  ( A `  ( B `  x ) ) )
122, 6, 10, 11fmptco 5759 1  |-  ( ( A : D --> E  /\  B : C --> D )  ->  ( A  o.  B )  =  ( x  e.  C  |->  ( A `  ( B `
 x ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1373    e. wcel 2177    |-> cmpt 4113    o. ccom 4687    Fn wfn 5275   -->wf 5276   ` cfv 5280
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2180  ax-ext 2188  ax-sep 4170  ax-pow 4226  ax-pr 4261
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-un 3174  df-in 3176  df-ss 3183  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3857  df-br 4052  df-opab 4114  df-mpt 4115  df-id 4348  df-xp 4689  df-rel 4690  df-cnv 4691  df-co 4692  df-dm 4693  df-rn 4694  df-res 4695  df-ima 4696  df-iota 5241  df-fun 5282  df-fn 5283  df-f 5284  df-fv 5288
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator