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

Theorem eqfnfv3 5595
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 5594 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( F  =  G  <-> 
( A  =  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) ) )
2 eqss 3162 . . . . 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 455 . . 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 3137 . . . . . . 7  |-  ( A 
C_  B  <->  A. x  e.  A  x  e.  B )
87anbi1i 455 . . . . . 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 2596 . . . . . 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 454 . . . 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 1348    e. wcel 2141   A.wral 2448    C_ wss 3121    Fn wfn 5193   ` cfv 5198
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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-sbc 2956  df-csb 3050  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-mpt 4052  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-iota 5160  df-fun 5200  df-fn 5201  df-fv 5206
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator