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

Theorem fvmptt 5653
Description: Closed theorem form of fvmpt 5638. (Contributed by Scott Fenton, 21-Feb-2013.) (Revised by Mario Carneiro, 11-Sep-2015.)
Assertion
Ref Expression
fvmptt  |-  ( ( A. x ( x  =  A  ->  B  =  C )  /\  F  =  ( x  e.  D  |->  B )  /\  ( A  e.  D  /\  C  e.  V
) )  ->  ( F `  A )  =  C )
Distinct variable groups:    x, A    x, C    x, D
Allowed substitution hints:    B( x)    F( x)    V( x)

Proof of Theorem fvmptt
StepHypRef Expression
1 simp2 1000 . . 3  |-  ( ( A. x ( x  =  A  ->  B  =  C )  /\  F  =  ( x  e.  D  |->  B )  /\  ( A  e.  D  /\  C  e.  V
) )  ->  F  =  ( x  e.  D  |->  B ) )
21fveq1d 5560 . 2  |-  ( ( A. x ( x  =  A  ->  B  =  C )  /\  F  =  ( x  e.  D  |->  B )  /\  ( A  e.  D  /\  C  e.  V
) )  ->  ( F `  A )  =  ( ( x  e.  D  |->  B ) `
 A ) )
3 risset 2525 . . . . 5  |-  ( A  e.  D  <->  E. x  e.  D  x  =  A )
4 elex 2774 . . . . . 6  |-  ( C  e.  V  ->  C  e.  _V )
5 nfa1 1555 . . . . . . 7  |-  F/ x A. x ( x  =  A  ->  B  =  C )
6 nfv 1542 . . . . . . . 8  |-  F/ x  C  e.  _V
7 nffvmpt1 5569 . . . . . . . . 9  |-  F/_ x
( ( x  e.  D  |->  B ) `  A )
87nfeq1 2349 . . . . . . . 8  |-  F/ x
( ( x  e.  D  |->  B ) `  A )  =  C
96, 8nfim 1586 . . . . . . 7  |-  F/ x
( C  e.  _V  ->  ( ( x  e.  D  |->  B ) `  A )  =  C )
10 simprl 529 . . . . . . . . . . . . 13  |-  ( ( ( x  =  A  /\  B  =  C )  /\  ( x  e.  D  /\  C  e.  _V ) )  ->  x  e.  D )
11 simplr 528 . . . . . . . . . . . . . 14  |-  ( ( ( x  =  A  /\  B  =  C )  /\  ( x  e.  D  /\  C  e.  _V ) )  ->  B  =  C )
12 simprr 531 . . . . . . . . . . . . . 14  |-  ( ( ( x  =  A  /\  B  =  C )  /\  ( x  e.  D  /\  C  e.  _V ) )  ->  C  e.  _V )
1311, 12eqeltrd 2273 . . . . . . . . . . . . 13  |-  ( ( ( x  =  A  /\  B  =  C )  /\  ( x  e.  D  /\  C  e.  _V ) )  ->  B  e.  _V )
14 eqid 2196 . . . . . . . . . . . . . 14  |-  ( x  e.  D  |->  B )  =  ( x  e.  D  |->  B )
1514fvmpt2 5645 . . . . . . . . . . . . 13  |-  ( ( x  e.  D  /\  B  e.  _V )  ->  ( ( x  e.  D  |->  B ) `  x )  =  B )
1610, 13, 15syl2anc 411 . . . . . . . . . . . 12  |-  ( ( ( x  =  A  /\  B  =  C )  /\  ( x  e.  D  /\  C  e.  _V ) )  -> 
( ( x  e.  D  |->  B ) `  x )  =  B )
17 simpll 527 . . . . . . . . . . . . 13  |-  ( ( ( x  =  A  /\  B  =  C )  /\  ( x  e.  D  /\  C  e.  _V ) )  ->  x  =  A )
1817fveq2d 5562 . . . . . . . . . . . 12  |-  ( ( ( x  =  A  /\  B  =  C )  /\  ( x  e.  D  /\  C  e.  _V ) )  -> 
( ( x  e.  D  |->  B ) `  x )  =  ( ( x  e.  D  |->  B ) `  A
) )
1916, 18, 113eqtr3d 2237 . . . . . . . . . . 11  |-  ( ( ( x  =  A  /\  B  =  C )  /\  ( x  e.  D  /\  C  e.  _V ) )  -> 
( ( x  e.  D  |->  B ) `  A )  =  C )
2019exp43 372 . . . . . . . . . 10  |-  ( x  =  A  ->  ( B  =  C  ->  ( x  e.  D  -> 
( C  e.  _V  ->  ( ( x  e.  D  |->  B ) `  A )  =  C ) ) ) )
2120a2i 11 . . . . . . . . 9  |-  ( ( x  =  A  ->  B  =  C )  ->  ( x  =  A  ->  ( x  e.  D  ->  ( C  e.  _V  ->  ( (
x  e.  D  |->  B ) `  A )  =  C ) ) ) )
2221com23 78 . . . . . . . 8  |-  ( ( x  =  A  ->  B  =  C )  ->  ( x  e.  D  ->  ( x  =  A  ->  ( C  e. 
_V  ->  ( ( x  e.  D  |->  B ) `
 A )  =  C ) ) ) )
2322sps 1551 . . . . . . 7  |-  ( A. x ( x  =  A  ->  B  =  C )  ->  (
x  e.  D  -> 
( x  =  A  ->  ( C  e. 
_V  ->  ( ( x  e.  D  |->  B ) `
 A )  =  C ) ) ) )
245, 9, 23rexlimd 2611 . . . . . 6  |-  ( A. x ( x  =  A  ->  B  =  C )  ->  ( E. x  e.  D  x  =  A  ->  ( C  e.  _V  ->  ( ( x  e.  D  |->  B ) `  A
)  =  C ) ) )
254, 24syl7 69 . . . . 5  |-  ( A. x ( x  =  A  ->  B  =  C )  ->  ( E. x  e.  D  x  =  A  ->  ( C  e.  V  -> 
( ( x  e.  D  |->  B ) `  A )  =  C ) ) )
263, 25biimtrid 152 . . . 4  |-  ( A. x ( x  =  A  ->  B  =  C )  ->  ( A  e.  D  ->  ( C  e.  V  -> 
( ( x  e.  D  |->  B ) `  A )  =  C ) ) )
2726imp32 257 . . 3  |-  ( ( A. x ( x  =  A  ->  B  =  C )  /\  ( A  e.  D  /\  C  e.  V )
)  ->  ( (
x  e.  D  |->  B ) `  A )  =  C )
28273adant2 1018 . 2  |-  ( ( A. x ( x  =  A  ->  B  =  C )  /\  F  =  ( x  e.  D  |->  B )  /\  ( A  e.  D  /\  C  e.  V
) )  ->  (
( x  e.  D  |->  B ) `  A
)  =  C )
292, 28eqtrd 2229 1  |-  ( ( A. x ( x  =  A  ->  B  =  C )  /\  F  =  ( x  e.  D  |->  B )  /\  ( A  e.  D  /\  C  e.  V
) )  ->  ( F `  A )  =  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 980   A.wal 1362    = wceq 1364    e. wcel 2167   E.wrex 2476   _Vcvv 2763    |-> cmpt 4094   ` cfv 5258
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-iota 5219  df-fun 5260  df-fv 5266
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator