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

Theorem strslfvd 13035
Description: Deduction version of strslfv 13038. (Contributed by Mario Carneiro, 15-Nov-2014.) (Revised by Jim Kingdon, 30-Jan-2023.)
Hypotheses
Ref Expression
strslfvd.e  |-  ( E  = Slot  ( E `  ndx )  /\  ( E `  ndx )  e.  NN )
strfvd.s  |-  ( ph  ->  S  e.  V )
strfvd.f  |-  ( ph  ->  Fun  S )
strfvd.n  |-  ( ph  -> 
<. ( E `  ndx ) ,  C >.  e.  S )
Assertion
Ref Expression
strslfvd  |-  ( ph  ->  C  =  ( E `
 S ) )

Proof of Theorem strslfvd
StepHypRef Expression
1 strslfvd.e . . . 4  |-  ( E  = Slot  ( E `  ndx )  /\  ( E `  ndx )  e.  NN )
21simpli 111 . . 3  |-  E  = Slot  ( E `  ndx )
3 strfvd.s . . 3  |-  ( ph  ->  S  e.  V )
41simpri 113 . . . 4  |-  ( E `
 ndx )  e.  NN
54a1i 9 . . 3  |-  ( ph  ->  ( E `  ndx )  e.  NN )
62, 3, 5strnfvnd 13013 . 2  |-  ( ph  ->  ( E `  S
)  =  ( S `
 ( E `  ndx ) ) )
7 strfvd.f . . 3  |-  ( ph  ->  Fun  S )
8 strfvd.n . . 3  |-  ( ph  -> 
<. ( E `  ndx ) ,  C >.  e.  S )
9 funopfv 5642 . . 3  |-  ( Fun 
S  ->  ( <. ( E `  ndx ) ,  C >.  e.  S  ->  ( S `  ( E `  ndx ) )  =  C ) )
107, 8, 9sylc 62 . 2  |-  ( ph  ->  ( S `  ( E `  ndx ) )  =  C )
116, 10eqtr2d 2241 1  |-  ( ph  ->  C  =  ( E `
 S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1373    e. wcel 2178   <.cop 3647   Fun wfun 5285   ` cfv 5291   NNcn 9073   ndxcnx 12990  Slot cslot 12992
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4179  ax-pow 4235  ax-pr 4270  ax-un 4499
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2779  df-sbc 3007  df-un 3179  df-in 3181  df-ss 3188  df-pw 3629  df-sn 3650  df-pr 3651  df-op 3653  df-uni 3866  df-br 4061  df-opab 4123  df-mpt 4124  df-id 4359  df-xp 4700  df-rel 4701  df-cnv 4702  df-co 4703  df-dm 4704  df-rn 4705  df-iota 5252  df-fun 5293  df-fv 5299  df-slot 12997
This theorem is referenced by:  strslssd  13040  1strbas  13110  2strbasg  13113  2stropg  13114
  Copyright terms: Public domain W3C validator