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

Theorem ofc12 6326
Description: Function operation on two constant functions. (Contributed by Mario Carneiro, 28-Jul-2014.)
Hypotheses
Ref Expression
ofc12.1  |-  ( ph  ->  A  e.  V )
ofc12.2  |-  ( ph  ->  B  e.  W )
ofc12.3  |-  ( ph  ->  C  e.  X )
Assertion
Ref Expression
ofc12  |-  ( ph  ->  ( ( A  X.  { B } )  oF R ( A  X.  { C }
) )  =  ( A  X.  { ( B R C ) } ) )

Proof of Theorem ofc12
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 ofc12.1 . . 3  |-  ( ph  ->  A  e.  V )
2 ofc12.2 . . . 4  |-  ( ph  ->  B  e.  W )
32adantr 276 . . 3  |-  ( (
ph  /\  x  e.  A )  ->  B  e.  W )
4 ofc12.3 . . . 4  |-  ( ph  ->  C  e.  X )
54adantr 276 . . 3  |-  ( (
ph  /\  x  e.  A )  ->  C  e.  X )
6 fconstmpt 4822 . . . 4  |-  ( A  X.  { B }
)  =  ( x  e.  A  |->  B )
76a1i 9 . . 3  |-  ( ph  ->  ( A  X.  { B } )  =  ( x  e.  A  |->  B ) )
8 fconstmpt 4822 . . . 4  |-  ( A  X.  { C }
)  =  ( x  e.  A  |->  C )
98a1i 9 . . 3  |-  ( ph  ->  ( A  X.  { C } )  =  ( x  e.  A  |->  C ) )
101, 3, 5, 7, 9offval2 6318 . 2  |-  ( ph  ->  ( ( A  X.  { B } )  oF R ( A  X.  { C }
) )  =  ( x  e.  A  |->  ( B R C ) ) )
11 fconstmpt 4822 . 2  |-  ( A  X.  { ( B R C ) } )  =  ( x  e.  A  |->  ( B R C ) )
1210, 11eqtr4di 2289 1  |-  ( ph  ->  ( ( A  X.  { B } )  oF R ( A  X.  { C }
) )  =  ( A  X.  { ( B R C ) } ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209   {csn 3709    |-> cmpt 4192    X. cxp 4772  (class class class)co 6085    oFcof 6300
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-setind 4684
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-of 6302
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator