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

Theorem caofdig 6340
Description: Transfer a distributive law to the function operation. (Contributed by Mario Carneiro, 26-Jul-2014.)
Hypotheses
Ref Expression
caofdi.1  |-  ( ph  ->  A  e.  V )
caofdi.2  |-  ( ph  ->  F : A --> K )
caofdi.3  |-  ( ph  ->  G : A --> S )
caofdi.4  |-  ( ph  ->  H : A --> S )
caofdig.r  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x R y )  e.  V )
caofdig.t  |-  ( (
ph  /\  ( x  e.  K  /\  y  e.  S ) )  -> 
( x T y )  e.  W )
caofdi.5  |-  ( (
ph  /\  ( x  e.  K  /\  y  e.  S  /\  z  e.  S ) )  -> 
( x T ( y R z ) )  =  ( ( x T y ) O ( x T z ) ) )
Assertion
Ref Expression
caofdig  |-  ( ph  ->  ( F  oF T ( G  oF R H ) )  =  ( ( F  oF T G )  oF O ( F  oF T H ) ) )
Distinct variable groups:    x, y, z, A    x, F, y, z    x, G, y, z    ph, x, y, z   
x, H, y, z   
x, K, y, z   
x, O, y, z   
x, R, y, z   
x, S, y, z   
x, T, y, z   
x, V, y    x, W, y
Allowed substitution hints:    V( z)    W( z)

Proof of Theorem caofdig
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 caofdi.5 . . . . 5  |-  ( (
ph  /\  ( x  e.  K  /\  y  e.  S  /\  z  e.  S ) )  -> 
( x T ( y R z ) )  =  ( ( x T y ) O ( x T z ) ) )
21adantlr 481 . . . 4  |-  ( ( ( ph  /\  w  e.  A )  /\  (
x  e.  K  /\  y  e.  S  /\  z  e.  S )
)  ->  ( x T ( y R z ) )  =  ( ( x T y ) O ( x T z ) ) )
3 caofdi.2 . . . . 5  |-  ( ph  ->  F : A --> K )
43ffvelcdmda 5846 . . . 4  |-  ( (
ph  /\  w  e.  A )  ->  ( F `  w )  e.  K )
5 caofdi.3 . . . . 5  |-  ( ph  ->  G : A --> S )
65ffvelcdmda 5846 . . . 4  |-  ( (
ph  /\  w  e.  A )  ->  ( G `  w )  e.  S )
7 caofdi.4 . . . . 5  |-  ( ph  ->  H : A --> S )
87ffvelcdmda 5846 . . . 4  |-  ( (
ph  /\  w  e.  A )  ->  ( H `  w )  e.  S )
92, 4, 6, 8caovdid 6268 . . 3  |-  ( (
ph  /\  w  e.  A )  ->  (
( F `  w
) T ( ( G `  w ) R ( H `  w ) ) )  =  ( ( ( F `  w ) T ( G `  w ) ) O ( ( F `  w ) T ( H `  w ) ) ) )
109mpteq2dva 4223 . 2  |-  ( ph  ->  ( w  e.  A  |->  ( ( F `  w ) T ( ( G `  w
) R ( H `
 w ) ) ) )  =  ( w  e.  A  |->  ( ( ( F `  w ) T ( G `  w ) ) O ( ( F `  w ) T ( H `  w ) ) ) ) )
11 caofdi.1 . . 3  |-  ( ph  ->  A  e.  V )
12 oveq2 6096 . . . . 5  |-  ( y  =  ( H `  w )  ->  (
( G `  w
) R y )  =  ( ( G `
 w ) R ( H `  w
) ) )
1312eleq1d 2307 . . . 4  |-  ( y  =  ( H `  w )  ->  (
( ( G `  w ) R y )  e.  V  <->  ( ( G `  w ) R ( H `  w ) )  e.  V ) )
14 oveq1 6095 . . . . . . 7  |-  ( x  =  ( G `  w )  ->  (
x R y )  =  ( ( G `
 w ) R y ) )
1514eleq1d 2307 . . . . . 6  |-  ( x  =  ( G `  w )  ->  (
( x R y )  e.  V  <->  ( ( G `  w ) R y )  e.  V ) )
1615ralbidv 2550 . . . . 5  |-  ( x  =  ( G `  w )  ->  ( A. y  e.  S  ( x R y )  e.  V  <->  A. y  e.  S  ( ( G `  w ) R y )  e.  V ) )
17 caofdig.r . . . . . . 7  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x R y )  e.  V )
1817ralrimivva 2632 . . . . . 6  |-  ( ph  ->  A. x  e.  S  A. y  e.  S  ( x R y )  e.  V )
1918adantr 276 . . . . 5  |-  ( (
ph  /\  w  e.  A )  ->  A. x  e.  S  A. y  e.  S  ( x R y )  e.  V )
2016, 19, 6rspcdva 2934 . . . 4  |-  ( (
ph  /\  w  e.  A )  ->  A. y  e.  S  ( ( G `  w ) R y )  e.  V )
2113, 20, 8rspcdva 2934 . . 3  |-  ( (
ph  /\  w  e.  A )  ->  (
( G `  w
) R ( H `
 w ) )  e.  V )
223feqmptd 5759 . . 3  |-  ( ph  ->  F  =  ( w  e.  A  |->  ( F `
 w ) ) )
235feqmptd 5759 . . . 4  |-  ( ph  ->  G  =  ( w  e.  A  |->  ( G `
 w ) ) )
247feqmptd 5759 . . . 4  |-  ( ph  ->  H  =  ( w  e.  A  |->  ( H `
 w ) ) )
2511, 6, 8, 23, 24offval2 6322 . . 3  |-  ( ph  ->  ( G  oF R H )  =  ( w  e.  A  |->  ( ( G `  w ) R ( H `  w ) ) ) )
2611, 4, 21, 22, 25offval2 6322 . 2  |-  ( ph  ->  ( F  oF T ( G  oF R H ) )  =  ( w  e.  A  |->  ( ( F `  w ) T ( ( G `
 w ) R ( H `  w
) ) ) ) )
27 oveq2 6096 . . . . 5  |-  ( y  =  ( G `  w )  ->  (
( F `  w
) T y )  =  ( ( F `
 w ) T ( G `  w
) ) )
2827eleq1d 2307 . . . 4  |-  ( y  =  ( G `  w )  ->  (
( ( F `  w ) T y )  e.  W  <->  ( ( F `  w ) T ( G `  w ) )  e.  W ) )
29 oveq1 6095 . . . . . . 7  |-  ( x  =  ( F `  w )  ->  (
x T y )  =  ( ( F `
 w ) T y ) )
3029eleq1d 2307 . . . . . 6  |-  ( x  =  ( F `  w )  ->  (
( x T y )  e.  W  <->  ( ( F `  w ) T y )  e.  W ) )
3130ralbidv 2550 . . . . 5  |-  ( x  =  ( F `  w )  ->  ( A. y  e.  S  ( x T y )  e.  W  <->  A. y  e.  S  ( ( F `  w ) T y )  e.  W ) )
32 caofdig.t . . . . . . 7  |-  ( (
ph  /\  ( x  e.  K  /\  y  e.  S ) )  -> 
( x T y )  e.  W )
3332ralrimivva 2632 . . . . . 6  |-  ( ph  ->  A. x  e.  K  A. y  e.  S  ( x T y )  e.  W )
3433adantr 276 . . . . 5  |-  ( (
ph  /\  w  e.  A )  ->  A. x  e.  K  A. y  e.  S  ( x T y )  e.  W )
3531, 34, 4rspcdva 2934 . . . 4  |-  ( (
ph  /\  w  e.  A )  ->  A. y  e.  S  ( ( F `  w ) T y )  e.  W )
3628, 35, 6rspcdva 2934 . . 3  |-  ( (
ph  /\  w  e.  A )  ->  (
( F `  w
) T ( G `
 w ) )  e.  W )
37 oveq2 6096 . . . . 5  |-  ( y  =  ( H `  w )  ->  (
( F `  w
) T y )  =  ( ( F `
 w ) T ( H `  w
) ) )
3837eleq1d 2307 . . . 4  |-  ( y  =  ( H `  w )  ->  (
( ( F `  w ) T y )  e.  W  <->  ( ( F `  w ) T ( H `  w ) )  e.  W ) )
3938, 35, 8rspcdva 2934 . . 3  |-  ( (
ph  /\  w  e.  A )  ->  (
( F `  w
) T ( H `
 w ) )  e.  W )
4011, 4, 6, 22, 23offval2 6322 . . 3  |-  ( ph  ->  ( F  oF T G )  =  ( w  e.  A  |->  ( ( F `  w ) T ( G `  w ) ) ) )
4111, 4, 8, 22, 24offval2 6322 . . 3  |-  ( ph  ->  ( F  oF T H )  =  ( w  e.  A  |->  ( ( F `  w ) T ( H `  w ) ) ) )
4211, 36, 39, 40, 41offval2 6322 . 2  |-  ( ph  ->  ( ( F  oF T G )  oF O ( F  oF T H ) )  =  ( w  e.  A  |->  ( ( ( F `
 w ) T ( G `  w
) ) O ( ( F `  w
) T ( H `
 w ) ) ) ) )
4310, 26, 423eqtr4d 2281 1  |-  ( ph  ->  ( F  oF T ( G  oF R H ) )  =  ( ( F  oF T G )  oF O ( F  oF T H ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    /\ w3a 1009    = wceq 1402    e. wcel 2209   A.wral 2528    |-> cmpt 4193   -->wf 5376   ` cfv 5380  (class class class)co 6088    oFcof 6303
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 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-setind 4686
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 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-of 6305
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator