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

Theorem caofid0r 6255
Description: Transfer a right 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 )
caofid0r.5  |-  ( (
ph  /\  x  e.  S )  ->  (
x R B )  =  x )
Assertion
Ref Expression
caofid0r  |-  ( ph  ->  ( F  oF R ( A  X.  { B } ) )  =  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 caofid0r
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 caofref.1 . 2  |-  ( ph  ->  A  e.  V )
2 caofref.2 . . 3  |-  ( ph  ->  F : A --> S )
32ffnd 5477 . 2  |-  ( ph  ->  F  Fn  A )
4 caofid0.3 . . 3  |-  ( ph  ->  B  e.  W )
5 fnconstg 5528 . . 3  |-  ( B  e.  W  ->  ( A  X.  { B }
)  Fn  A )
64, 5syl 14 . 2  |-  ( ph  ->  ( A  X.  { B } )  Fn  A
)
7 eqidd 2230 . 2  |-  ( (
ph  /\  w  e.  A )  ->  ( F `  w )  =  ( F `  w ) )
8 fvconst2g 5860 . . 3  |-  ( ( B  e.  W  /\  w  e.  A )  ->  ( ( A  X.  { B } ) `  w )  =  B )
94, 8sylan 283 . 2  |-  ( (
ph  /\  w  e.  A )  ->  (
( A  X.  { B } ) `  w
)  =  B )
10 caofid0r.5 . . . 4  |-  ( (
ph  /\  x  e.  S )  ->  (
x R B )  =  x )
1110ralrimiva 2603 . . 3  |-  ( ph  ->  A. x  e.  S  ( x R B )  =  x )
122ffvelcdmda 5775 . . 3  |-  ( (
ph  /\  w  e.  A )  ->  ( F `  w )  e.  S )
13 oveq1 6017 . . . . 5  |-  ( x  =  ( F `  w )  ->  (
x R B )  =  ( ( F `
 w ) R B ) )
14 id 19 . . . . 5  |-  ( x  =  ( F `  w )  ->  x  =  ( F `  w ) )
1513, 14eqeq12d 2244 . . . 4  |-  ( x  =  ( F `  w )  ->  (
( x R B )  =  x  <->  ( ( F `  w ) R B )  =  ( F `  w ) ) )
1615rspccva 2906 . . 3  |-  ( ( A. x  e.  S  ( x R B )  =  x  /\  ( F `  w )  e.  S )  -> 
( ( F `  w ) R B )  =  ( F `
 w ) )
1711, 12, 16syl2an2r 597 . 2  |-  ( (
ph  /\  w  e.  A )  ->  (
( F `  w
) R B )  =  ( F `  w ) )
181, 3, 6, 3, 7, 9, 17offveq 6248 1  |-  ( ph  ->  ( F  oF R ( A  X.  { B } ) )  =  F )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200   A.wral 2508   {csn 3666    X. cxp 4718    Fn wfn 5316   -->wf 5317   ` cfv 5321  (class class class)co 6010    oFcof 6225
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-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4259  ax-pr 4294  ax-setind 4630
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4385  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-f1o 5328  df-fv 5329  df-ov 6013  df-oprab 6014  df-mpo 6015  df-of 6227
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator