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

Theorem eqfnfv3 5779
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 5778 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( F  =  G  <-> 
( A  =  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) ) )
2 eqss 3255 . . . . 5  |-  ( A  =  B  <->  ( A  C_  B  /\  B  C_  A ) )
3 ancom 266 . . . . 5  |-  ( ( A  C_  B  /\  B  C_  A )  <->  ( B  C_  A  /\  A  C_  B ) )
42, 3bitri 184 . . . 4  |-  ( A  =  B  <->  ( B  C_  A  /\  A  C_  B ) )
54anbi1i 458 . . 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 401 . . . 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 3229 . . . . . . 7  |-  ( A 
C_  B  <->  A. x  e.  A  x  e.  B )
87anbi1i 458 . . . . . 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 2671 . . . . . 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 187 . . . . 5  |-  ( ( A  C_  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) )  <->  A. x  e.  A  ( x  e.  B  /\  ( F `  x )  =  ( G `  x ) ) )
1110anbi2i 457 . . . 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 184 . . 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 184 . 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 196 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 104    <-> wb 105    = wceq 1398    e. wcel 2205   A.wral 2522    C_ wss 3213    Fn wfn 5349   ` cfv 5354
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-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-sep 4230  ax-pow 4289  ax-pr 4324
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  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-ral 2527  df-rex 2528  df-v 2817  df-sbc 3045  df-csb 3141  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-iota 5314  df-fun 5356  df-fn 5357  df-fv 5362
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator