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

Theorem divsfval 13651
Description: Value of the function in qusval 13646. (Contributed by Mario Carneiro, 24-Feb-2015.) (Revised by Mario Carneiro, 12-Aug-2015.) (Revised by AV, 12-Jul-2024.)
Hypotheses
Ref Expression
ercpbl.r  |-  ( ph  ->  .~  Er  V )
ercpbl.v  |-  ( ph  ->  V  e.  W )
ercpbl.f  |-  F  =  ( x  e.  V  |->  [ x ]  .~  )
Assertion
Ref Expression
divsfval  |-  ( ph  ->  ( F `  A
)  =  [ A ]  .~  )
Distinct variable groups:    x,  .~    x, A   
x, V    ph, x
Allowed substitution hints:    F( x)    W( x)

Proof of Theorem divsfval
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 ercpbl.f . . . . 5  |-  F  =  ( x  e.  V  |->  [ x ]  .~  )
21mptrcl 5788 . . . 4  |-  ( y  e.  ( F `  A )  ->  A  e.  V )
32a1i 9 . . 3  |-  ( ph  ->  ( y  e.  ( F `  A )  ->  A  e.  V
) )
4 19.8a 1643 . . . 4  |-  ( y  e.  [ A ]  .~  ->  E. y  y  e. 
[ A ]  .~  )
5 ecdmn0m 6851 . . . . . 6  |-  ( A  e.  dom  .~  <->  E. y 
y  e.  [ A ]  .~  )
65biimpri 133 . . . . 5  |-  ( E. y  y  e.  [ A ]  .~  ->  A  e.  dom  .~  )
7 ercpbl.r . . . . . . 7  |-  ( ph  ->  .~  Er  V )
8 erdm 6817 . . . . . . 7  |-  (  .~  Er  V  ->  dom  .~  =  V )
97, 8syl 14 . . . . . 6  |-  ( ph  ->  dom  .~  =  V )
109eleq2d 2308 . . . . 5  |-  ( ph  ->  ( A  e.  dom  .~  <->  A  e.  V ) )
116, 10imbitrid 154 . . . 4  |-  ( ph  ->  ( E. y  y  e.  [ A ]  .~  ->  A  e.  V
) )
124, 11syl5 32 . . 3  |-  ( ph  ->  ( y  e.  [ A ]  .~  ->  A  e.  V ) )
13 eceq1 6842 . . . . . 6  |-  ( x  =  A  ->  [ x ]  .~  =  [ A ]  .~  )
14 simpr 110 . . . . . 6  |-  ( (
ph  /\  A  e.  V )  ->  A  e.  V )
15 ercpbl.v . . . . . . . 8  |-  ( ph  ->  V  e.  W )
167ecss 6850 . . . . . . . 8  |-  ( ph  ->  [ A ]  .~  C_  V )
1715, 16ssexd 4273 . . . . . . 7  |-  ( ph  ->  [ A ]  .~  e.  _V )
1817adantr 276 . . . . . 6  |-  ( (
ph  /\  A  e.  V )  ->  [ A ]  .~  e.  _V )
191, 13, 14, 18fvmptd3 5799 . . . . 5  |-  ( (
ph  /\  A  e.  V )  ->  ( F `  A )  =  [ A ]  .~  )
2019eleq2d 2308 . . . 4  |-  ( (
ph  /\  A  e.  V )  ->  (
y  e.  ( F `
 A )  <->  y  e.  [ A ]  .~  )
)
2120ex 115 . . 3  |-  ( ph  ->  ( A  e.  V  ->  ( y  e.  ( F `  A )  <-> 
y  e.  [ A ]  .~  ) ) )
223, 12, 21pm5.21ndd 717 . 2  |-  ( ph  ->  ( y  e.  ( F `  A )  <-> 
y  e.  [ A ]  .~  ) )
2322eqrdv 2236 1  |-  ( ph  ->  ( F `  A
)  =  [ A ]  .~  )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402   E.wex 1545    e. wcel 2209   _Vcvv 2821    |-> cmpt 4192   dom cdm 4774   ` cfv 5377    Er wer 6804   [cec 6805
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fv 5385  df-er 6807  df-ec 6809
This theorem is used by:  qusrhm  14867
  Copyright terms: Public domain W3C validator