MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  caofid0l Structured version   Unicode version

Theorem caofid0l 6333
Description: Transfer a left identity law to the function operation. (Contributed by NM, 21-Oct-2014.)
Hypotheses
Ref Expression
caofref.1  |-  ( ph  ->  A  e.  V )
caofref.2  |-  ( ph  ->  F : A --> S )
caofid0.3  |-  ( ph  ->  B  e.  W )
caofid0l.5  |-  ( (
ph  /\  x  e.  S )  ->  ( B R x )  =  x )
Assertion
Ref Expression
caofid0l  |-  ( ph  ->  ( ( A  X.  { B } )  o F R F )  =  F )
Distinct variable groups:    x, B    x, F    ph, x    x, R    x, S
Allowed substitution hints:    A( x)    V( x)    W( x)

Proof of Theorem caofid0l
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 caofref.1 . 2  |-  ( ph  ->  A  e.  V )
2 caofid0.3 . . 3  |-  ( ph  ->  B  e.  W )
3 fnconstg 5632 . . 3  |-  ( B  e.  W  ->  ( A  X.  { B }
)  Fn  A )
42, 3syl 16 . 2  |-  ( ph  ->  ( A  X.  { B } )  Fn  A
)
5 caofref.2 . . 3  |-  ( ph  ->  F : A --> S )
6 ffn 5592 . . 3  |-  ( F : A --> S  ->  F  Fn  A )
75, 6syl 16 . 2  |-  ( ph  ->  F  Fn  A )
8 fvconst2g 5946 . . 3  |-  ( ( B  e.  W  /\  w  e.  A )  ->  ( ( A  X.  { B } ) `  w )  =  B )
92, 8sylan 459 . 2  |-  ( (
ph  /\  w  e.  A )  ->  (
( A  X.  { B } ) `  w
)  =  B )
10 eqidd 2438 . 2  |-  ( (
ph  /\  w  e.  A )  ->  ( F `  w )  =  ( F `  w ) )
115ffvelrnda 5871 . . 3  |-  ( (
ph  /\  w  e.  A )  ->  ( F `  w )  e.  S )
12 caofid0l.5 . . . . 5  |-  ( (
ph  /\  x  e.  S )  ->  ( B R x )  =  x )
1312ralrimiva 2790 . . . 4  |-  ( ph  ->  A. x  e.  S  ( B R x )  =  x )
14 oveq2 6090 . . . . . 6  |-  ( x  =  ( F `  w )  ->  ( B R x )  =  ( B R ( F `  w ) ) )
15 id 21 . . . . . 6  |-  ( x  =  ( F `  w )  ->  x  =  ( F `  w ) )
1614, 15eqeq12d 2451 . . . . 5  |-  ( x  =  ( F `  w )  ->  (
( B R x )  =  x  <->  ( B R ( F `  w ) )  =  ( F `  w
) ) )
1716rspccva 3052 . . . 4  |-  ( ( A. x  e.  S  ( B R x )  =  x  /\  ( F `  w )  e.  S )  ->  ( B R ( F `  w ) )  =  ( F `  w
) )
1813, 17sylan 459 . . 3  |-  ( (
ph  /\  ( F `  w )  e.  S
)  ->  ( B R ( F `  w ) )  =  ( F `  w
) )
1911, 18syldan 458 . 2  |-  ( (
ph  /\  w  e.  A )  ->  ( B R ( F `  w ) )  =  ( F `  w
) )
201, 4, 7, 7, 9, 10, 19offveq 6326 1  |-  ( ph  ->  ( ( A  X.  { B } )  o F R F )  =  F )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 360    = wceq 1653    e. wcel 1726   A.wral 2706   {csn 3815    X. cxp 4877    Fn wfn 5450   -->wf 5451   ` cfv 5455  (class class class)co 6082    o Fcof 6304
This theorem is referenced by:  psr0lid  16460  psrlmod  16466  mndvlid  27426  mendlmod  27479  lfladd0l  29873
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-13 1728  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2418  ax-rep 4321  ax-sep 4331  ax-nul 4339  ax-pow 4378  ax-pr 4404
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2286  df-mo 2287  df-clab 2424  df-cleq 2430  df-clel 2433  df-nfc 2562  df-ne 2602  df-ral 2711  df-rex 2712  df-reu 2713  df-rab 2715  df-v 2959  df-sbc 3163  df-csb 3253  df-dif 3324  df-un 3326  df-in 3328  df-ss 3335  df-nul 3630  df-if 3741  df-sn 3821  df-pr 3822  df-op 3824  df-uni 4017  df-iun 4096  df-br 4214  df-opab 4268  df-mpt 4269  df-id 4499  df-xp 4885  df-rel 4886  df-cnv 4887  df-co 4888  df-dm 4889  df-rn 4890  df-res 4891  df-ima 4892  df-iota 5419  df-fun 5457  df-fn 5458  df-f 5459  df-f1 5460  df-fo 5461  df-f1o 5462  df-fv 5463  df-ov 6085  df-oprab 6086  df-mpt2 6087  df-of 6306
  Copyright terms: Public domain W3C validator