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

Theorem caofid0r 6303
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 5514 . 2  |-  ( ph  ->  F  Fn  A )
4 caofid0.3 . . 3  |-  ( ph  ->  B  e.  W )
5 fnconstg 5570 . . 3  |-  ( B  e.  W  ->  ( A  X.  { B }
)  Fn  A )
64, 5syl 14 . 2  |-  ( ph  ->  ( A  X.  { B } )  Fn  A
)
7 eqidd 2235 . 2  |-  ( (
ph  /\  w  e.  A )  ->  ( F `  w )  =  ( F `  w ) )
8 fvconst2g 5903 . . 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 2617 . . 3  |-  ( ph  ->  A. x  e.  S  ( x R B )  =  x )
122ffvelcdmda 5817 . . 3  |-  ( (
ph  /\  w  e.  A )  ->  ( F `  w )  e.  S )
13 oveq1 6065 . . . . 5  |-  ( x  =  ( F `  w )  ->  (
x R B )  =  ( ( F `
 w ) R B ) )
14 id 19 . . . . 5  |-  ( x  =  ( F `  w )  ->  x  =  ( F `  w ) )
1513, 14eqeq12d 2249 . . . 4  |-  ( x  =  ( F `  w )  ->  (
( x R B )  =  x  <->  ( ( F `  w ) R B )  =  ( F `  w ) ) )
1615rspccva 2922 . . 3  |-  ( ( A. x  e.  S  ( x R B )  =  x  /\  ( F `  w )  e.  S )  -> 
( ( F `  w ) R B )  =  ( F `
 w ) )
1711, 12, 16syl2an2r 599 . 2  |-  ( (
ph  /\  w  e.  A )  ->  (
( F `  w
) R B )  =  ( F `  w ) )
181, 3, 6, 3, 7, 9, 17offveq 6296 1  |-  ( ph  ->  ( F  oF R ( A  X.  { B } ) )  =  F )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2205   A.wral 2522   {csn 3694    X. cxp 4752    Fn wfn 5352   -->wf 5353   ` cfv 5357  (class class class)co 6058    oFcof 6273
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-setind 4664
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-of 6275
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator