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

Theorem eqfnfv3 5520
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 5519 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( F  =  G  <-> 
( A  =  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) ) )
2 eqss 3112 . . . . 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 453 . . 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 398 . . . 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 3087 . . . . . . 7  |-  ( A 
C_  B  <->  A. x  e.  A  x  e.  B )
87anbi1i 453 . . . . . 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 2558 . . . . . 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 452 . . . 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, 13syl6bb 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 1331    e. wcel 1480   A.wral 2416    C_ wss 3071    Fn wfn 5118   ` cfv 5123
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-sbc 2910  df-csb 3004  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-iota 5088  df-fun 5125  df-fn 5126  df-fv 5131
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator