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

Theorem strslfvd 12039
Description: Deduction version of strslfv 12042. (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 110 . . 3  |-  E  = Slot  ( E `  ndx )
3 strfvd.s . . 3  |-  ( ph  ->  S  e.  V )
41simpri 112 . . . 4  |-  ( E `
 ndx )  e.  NN
54a1i 9 . . 3  |-  ( ph  ->  ( E `  ndx )  e.  NN )
62, 3, 5strnfvnd 12018 . 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 5469 . . 3  |-  ( Fun 
S  ->  ( <. ( E `  ndx ) ,  C >.  e.  S  ->  ( S `  ( E `  ndx ) )  =  C ) )
107, 8, 9sylc 62 . 2  |-  ( ph  ->  ( S `  ( E `  ndx ) )  =  C )
116, 10eqtr2d 2174 1  |-  ( ph  ->  C  =  ( E `
 S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1332    e. wcel 1481   <.cop 3535   Fun wfun 5125   ` cfv 5131   NNcn 8744   ndxcnx 11995  Slot cslot 11997
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 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-sbc 2914  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-mpt 3999  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-iota 5096  df-fun 5133  df-fv 5139  df-slot 12002
This theorem is referenced by:  strslssd  12044  1strbas  12097  2strbasg  12099  2stropg  12100
  Copyright terms: Public domain W3C validator