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

Theorem eqfnfv3 5585
Description: Derive equality of functions from equality of their values. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
eqfnfv3  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( F  =  G  <-> 
( B  C_  A  /\  A. x  e.  A  ( x  e.  B  /\  ( F `  x
)  =  ( G `
 x ) ) ) ) )
Distinct variable groups:    x, A    x, F    x, G    x, B

Proof of Theorem eqfnfv3
StepHypRef Expression
1 eqfnfv2 5584 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( F  =  G  <-> 
( A  =  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) ) )
2 eqss 3157 . . . . 5  |-  ( A  =  B  <->  ( A  C_  B  /\  B  C_  A ) )
3 ancom 264 . . . . 5  |-  ( ( A  C_  B  /\  B  C_  A )  <->  ( B  C_  A  /\  A  C_  B ) )
42, 3bitri 183 . . . 4  |-  ( A  =  B  <->  ( B  C_  A  /\  A  C_  B ) )
54anbi1i 454 . . 3  |-  ( ( A  =  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) )  <->  ( ( B  C_  A  /\  A  C_  B )  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) )
6 anass 399 . . . 4  |-  ( ( ( B  C_  A  /\  A  C_  B )  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) )  <->  ( B  C_  A  /\  ( A  C_  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) ) )
7 dfss3 3132 . . . . . . 7  |-  ( A 
C_  B  <->  A. x  e.  A  x  e.  B )
87anbi1i 454 . . . . . 6  |-  ( ( A  C_  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) )  <->  ( A. x  e.  A  x  e.  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) )
9 r19.26 2592 . . . . . 6  |-  ( A. x  e.  A  (
x  e.  B  /\  ( F `  x )  =  ( G `  x ) )  <->  ( A. x  e.  A  x  e.  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) )
108, 9bitr4i 186 . . . . 5  |-  ( ( A  C_  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) )  <->  A. x  e.  A  ( x  e.  B  /\  ( F `  x )  =  ( G `  x ) ) )
1110anbi2i 453 . . . 4  |-  ( ( B  C_  A  /\  ( A  C_  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) )  <-> 
( B  C_  A  /\  A. x  e.  A  ( x  e.  B  /\  ( F `  x
)  =  ( G `
 x ) ) ) )
126, 11bitri 183 . . 3  |-  ( ( ( B  C_  A  /\  A  C_  B )  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) )  <->  ( B  C_  A  /\  A. x  e.  A  ( x  e.  B  /\  ( F `
 x )  =  ( G `  x
) ) ) )
135, 12bitri 183 . 2  |-  ( ( A  =  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) )  <->  ( B  C_  A  /\  A. x  e.  A  ( x  e.  B  /\  ( F `  x )  =  ( G `  x ) ) ) )
141, 13bitrdi 195 1  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( F  =  G  <-> 
( B  C_  A  /\  A. x  e.  A  ( x  e.  B  /\  ( F `  x
)  =  ( G `
 x ) ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1343    e. wcel 2136   A.wral 2444    C_ wss 3116    Fn wfn 5183   ` cfv 5188
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-sbc 2952  df-csb 3046  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-iota 5153  df-fun 5190  df-fn 5191  df-fv 5196
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator