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

Theorem offveqb 5750
Description: Equivalent expressions for equality with a function operation. (Contributed by NM, 9-Oct-2014.) (Proof shortened by Mario Carneiro, 5-Dec-2016.)
Hypotheses
Ref Expression
offveq.1  |-  ( ph  ->  A  e.  V )
offveq.2  |-  ( ph  ->  F  Fn  A )
offveq.3  |-  ( ph  ->  G  Fn  A )
offveq.4  |-  ( ph  ->  H  Fn  A )
offveq.5  |-  ( (
ph  /\  x  e.  A )  ->  ( F `  x )  =  B )
offveq.6  |-  ( (
ph  /\  x  e.  A )  ->  ( G `  x )  =  C )
Assertion
Ref Expression
offveqb  |-  ( ph  ->  ( H  =  ( F  oF R G )  <->  A. x  e.  A  ( H `  x )  =  ( B R C ) ) )
Distinct variable groups:    x, A    x, F    x, G    x, H    ph, x    x, R
Allowed substitution hints:    B( x)    C( x)    V( x)

Proof of Theorem offveqb
StepHypRef Expression
1 offveq.4 . . . 4  |-  ( ph  ->  H  Fn  A )
2 dffn5im 5240 . . . 4  |-  ( H  Fn  A  ->  H  =  ( x  e.  A  |->  ( H `  x ) ) )
31, 2syl 14 . . 3  |-  ( ph  ->  H  =  ( x  e.  A  |->  ( H `
 x ) ) )
4 offveq.2 . . . 4  |-  ( ph  ->  F  Fn  A )
5 offveq.3 . . . 4  |-  ( ph  ->  G  Fn  A )
6 offveq.1 . . . 4  |-  ( ph  ->  A  e.  V )
7 inidm 3175 . . . 4  |-  ( A  i^i  A )  =  A
8 offveq.5 . . . 4  |-  ( (
ph  /\  x  e.  A )  ->  ( F `  x )  =  B )
9 offveq.6 . . . 4  |-  ( (
ph  /\  x  e.  A )  ->  ( G `  x )  =  C )
104, 5, 6, 6, 7, 8, 9offval 5739 . . 3  |-  ( ph  ->  ( F  oF R G )  =  ( x  e.  A  |->  ( B R C ) ) )
113, 10eqeq12d 2095 . 2  |-  ( ph  ->  ( H  =  ( F  oF R G )  <->  ( x  e.  A  |->  ( H `
 x ) )  =  ( x  e.  A  |->  ( B R C ) ) ) )
12 funfvex 5212 . . . . . 6  |-  ( ( Fun  H  /\  x  e.  dom  H )  -> 
( H `  x
)  e.  _V )
1312funfni 5019 . . . . 5  |-  ( ( H  Fn  A  /\  x  e.  A )  ->  ( H `  x
)  e.  _V )
141, 13sylan 277 . . . 4  |-  ( (
ph  /\  x  e.  A )  ->  ( H `  x )  e.  _V )
1514ralrimiva 2434 . . 3  |-  ( ph  ->  A. x  e.  A  ( H `  x )  e.  _V )
16 mpteqb 5282 . . 3  |-  ( A. x  e.  A  ( H `  x )  e.  _V  ->  ( (
x  e.  A  |->  ( H `  x ) )  =  ( x  e.  A  |->  ( B R C ) )  <->  A. x  e.  A  ( H `  x )  =  ( B R C ) ) )
1715, 16syl 14 . 2  |-  ( ph  ->  ( ( x  e.  A  |->  ( H `  x ) )  =  ( x  e.  A  |->  ( B R C ) )  <->  A. x  e.  A  ( H `  x )  =  ( B R C ) ) )
1811, 17bitrd 186 1  |-  ( ph  ->  ( H  =  ( F  oF R G )  <->  A. x  e.  A  ( H `  x )  =  ( B R C ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    = wceq 1284    e. wcel 1433   A.wral 2348   _Vcvv 2601    |-> cmpt 3839    Fn wfn 4917   ` cfv 4922  (class class class)co 5532    oFcof 5730
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-coll 3893  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-setind 4280
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-of 5732
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator