Users' Mathboxes Mathbox for Steve Rodriguez < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  caofcan Unicode version

Theorem caofcan 27643
Description: Transfer a cancellation law like mulcan 9421 to the function operation. (Contributed by Steve Rodriguez, 16-Nov-2015.)
Hypotheses
Ref Expression
caofcan.1  |-  ( ph  ->  A  e.  V )
caofcan.2  |-  ( ph  ->  F : A --> T )
caofcan.3  |-  ( ph  ->  G : A --> S )
caofcan.4  |-  ( ph  ->  H : A --> S )
caofcan.5  |-  ( (
ph  /\  ( x  e.  T  /\  y  e.  S  /\  z  e.  S ) )  -> 
( ( x R y )  =  ( x R z )  <-> 
y  =  z ) )
Assertion
Ref Expression
caofcan  |-  ( ph  ->  ( ( F  o F R G )  =  ( F  o F R H )  <->  G  =  H ) )
Distinct variable groups:    x, y,
z, F    x, G, y, z    x, H, y, z    x, R, y, z    ph, x, y, z   
x, S, y, z   
x, T, y, z
Allowed substitution hints:    A( x, y, z)    V( x, y, z)

Proof of Theorem caofcan
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 caofcan.2 . . . . . . 7  |-  ( ph  ->  F : A --> T )
2 ffn 5405 . . . . . . 7  |-  ( F : A --> T  ->  F  Fn  A )
31, 2syl 15 . . . . . 6  |-  ( ph  ->  F  Fn  A )
4 caofcan.3 . . . . . . 7  |-  ( ph  ->  G : A --> S )
5 ffn 5405 . . . . . . 7  |-  ( G : A --> S  ->  G  Fn  A )
64, 5syl 15 . . . . . 6  |-  ( ph  ->  G  Fn  A )
7 caofcan.1 . . . . . 6  |-  ( ph  ->  A  e.  V )
8 inidm 3391 . . . . . 6  |-  ( A  i^i  A )  =  A
9 eqidd 2297 . . . . . 6  |-  ( (
ph  /\  w  e.  A )  ->  ( F `  w )  =  ( F `  w ) )
10 eqidd 2297 . . . . . 6  |-  ( (
ph  /\  w  e.  A )  ->  ( G `  w )  =  ( G `  w ) )
113, 6, 7, 7, 8, 9, 10ofval 6103 . . . . 5  |-  ( (
ph  /\  w  e.  A )  ->  (
( F  o F R G ) `  w )  =  ( ( F `  w
) R ( G `
 w ) ) )
12 caofcan.4 . . . . . . 7  |-  ( ph  ->  H : A --> S )
13 ffn 5405 . . . . . . 7  |-  ( H : A --> S  ->  H  Fn  A )
1412, 13syl 15 . . . . . 6  |-  ( ph  ->  H  Fn  A )
15 eqidd 2297 . . . . . 6  |-  ( (
ph  /\  w  e.  A )  ->  ( H `  w )  =  ( H `  w ) )
163, 14, 7, 7, 8, 9, 15ofval 6103 . . . . 5  |-  ( (
ph  /\  w  e.  A )  ->  (
( F  o F R H ) `  w )  =  ( ( F `  w
) R ( H `
 w ) ) )
1711, 16eqeq12d 2310 . . . 4  |-  ( (
ph  /\  w  e.  A )  ->  (
( ( F  o F R G ) `  w )  =  ( ( F  o F R H ) `  w )  <->  ( ( F `  w ) R ( G `  w ) )  =  ( ( F `  w ) R ( H `  w ) ) ) )
18 simpl 443 . . . . 5  |-  ( (
ph  /\  w  e.  A )  ->  ph )
19 ffvelrn 5679 . . . . . 6  |-  ( ( F : A --> T  /\  w  e.  A )  ->  ( F `  w
)  e.  T )
201, 19sylan 457 . . . . 5  |-  ( (
ph  /\  w  e.  A )  ->  ( F `  w )  e.  T )
21 ffvelrn 5679 . . . . . 6  |-  ( ( G : A --> S  /\  w  e.  A )  ->  ( G `  w
)  e.  S )
224, 21sylan 457 . . . . 5  |-  ( (
ph  /\  w  e.  A )  ->  ( G `  w )  e.  S )
23 ffvelrn 5679 . . . . . 6  |-  ( ( H : A --> S  /\  w  e.  A )  ->  ( H `  w
)  e.  S )
2412, 23sylan 457 . . . . 5  |-  ( (
ph  /\  w  e.  A )  ->  ( H `  w )  e.  S )
25 caofcan.5 . . . . . 6  |-  ( (
ph  /\  ( x  e.  T  /\  y  e.  S  /\  z  e.  S ) )  -> 
( ( x R y )  =  ( x R z )  <-> 
y  =  z ) )
2625caovcang 6037 . . . . 5  |-  ( (
ph  /\  ( ( F `  w )  e.  T  /\  ( G `  w )  e.  S  /\  ( H `  w )  e.  S ) )  -> 
( ( ( F `
 w ) R ( G `  w
) )  =  ( ( F `  w
) R ( H `
 w ) )  <-> 
( G `  w
)  =  ( H `
 w ) ) )
2718, 20, 22, 24, 26syl13anc 1184 . . . 4  |-  ( (
ph  /\  w  e.  A )  ->  (
( ( F `  w ) R ( G `  w ) )  =  ( ( F `  w ) R ( H `  w ) )  <->  ( G `  w )  =  ( H `  w ) ) )
2817, 27bitrd 244 . . 3  |-  ( (
ph  /\  w  e.  A )  ->  (
( ( F  o F R G ) `  w )  =  ( ( F  o F R H ) `  w )  <->  ( G `  w )  =  ( H `  w ) ) )
2928ralbidva 2572 . 2  |-  ( ph  ->  ( A. w  e.  A  ( ( F  o F R G ) `  w )  =  ( ( F  o F R H ) `  w )  <->  A. w  e.  A  ( G `  w )  =  ( H `  w ) ) )
303, 6, 7, 7, 8offn 6105 . . 3  |-  ( ph  ->  ( F  o F R G )  Fn  A )
313, 14, 7, 7, 8offn 6105 . . 3  |-  ( ph  ->  ( F  o F R H )  Fn  A )
32 eqfnfv 5638 . . 3  |-  ( ( ( F  o F R G )  Fn  A  /\  ( F  o F R H )  Fn  A )  ->  ( ( F  o F R G )  =  ( F  o F R H )  <->  A. w  e.  A  ( ( F  o F R G ) `  w )  =  ( ( F  o F R H ) `  w ) ) )
3330, 31, 32syl2anc 642 . 2  |-  ( ph  ->  ( ( F  o F R G )  =  ( F  o F R H )  <->  A. w  e.  A  ( ( F  o F R G ) `  w )  =  ( ( F  o F R H ) `  w ) ) )
34 eqfnfv 5638 . . 3  |-  ( ( G  Fn  A  /\  H  Fn  A )  ->  ( G  =  H  <->  A. w  e.  A  ( G `  w )  =  ( H `  w ) ) )
356, 14, 34syl2anc 642 . 2  |-  ( ph  ->  ( G  =  H  <->  A. w  e.  A  ( G `  w )  =  ( H `  w ) ) )
3629, 33, 353bitr4d 276 1  |-  ( ph  ->  ( ( F  o F R G )  =  ( F  o F R H )  <->  G  =  H ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    /\ w3a 934    = wceq 1632    e. wcel 1696   A.wral 2556    Fn wfn 5266   -->wf 5267   ` cfv 5271  (class class class)co 5874    o Fcof 6092
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-rep 4147  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-reu 2563  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-of 6094
  Copyright terms: Public domain W3C validator