Theorem strslfv2d 12746

Description: Deduction version of strslfv 12748. (Contributed by Mario Carneiro, 30-Apr-2015.) (Revised by Jim Kingdon, 30-Jan-2023.)

Hypotheses

Ref	Expression
strslfv2d.e	|- ( E = Slot ( E ` ndx ) /\ ( E ` ndx ) e. NN )
strfv2d.s	|- ( ph -> S e. V )
strfv2d.f	|- ( ph -> Fun `' `' S )
strfv2d.n	|- ( ph -> <. ( E ` ndx ) , C >. e. S )
strfv2d.c	|- ( ph -> C e. W )

Assertion

Ref	Expression
strslfv2d	|- ( ph -> C = ( E ` S ) )

Proof of Theorem strslfv2d

Step	Hyp	Ref	Expression
1		strslfv2d.e	. . . 4 |- ( E = Slot ( E ` ndx ) /\ ( E ` ndx ) e. NN )
2	1	simpli 111	. . 3 |- E = Slot ( E ` ndx )
3		strfv2d.s	. . 3 |- ( ph -> S e. V )
4	1	simpri 113	. . . 4 |- ( E ` ndx ) e. NN
5	4	a1i 9	. . 3 |- ( ph -> ( E ` ndx ) e. NN )
6	2, 3, 5	strnfvnd 12723	. 2 |- ( ph -> ( E ` S ) = ( S ` ( E ` ndx ) ) )
7		cnvcnv2 5124	. . . 4 |- `' `' S = ( S |` _V )
8	7	fveq1i 5562	. . 3 |- ( `' `' S ` ( E ` ndx ) ) = ( ( S |` _V ) ` ( E ` ndx ) )
9	5	elexd 2776	. . . 4 |- ( ph -> ( E ` ndx ) e. _V )
10		fvres 5585	. . . 4 |- ( ( E ` ndx ) e. _V -> ( ( S |` _V ) ` ( E ` ndx ) ) = ( S ` ( E ` ndx ) ) )
11	9, 10	syl 14	. . 3 |- ( ph -> ( ( S |` _V ) ` ( E ` ndx ) ) = ( S ` ( E ` ndx ) ) )
12	8, 11	eqtrid 2241	. 2 |- ( ph -> ( `' `' S ` ( E ` ndx ) ) = ( S ` ( E ` ndx ) ) )
13		strfv2d.f	. . 3 |- ( ph -> Fun `' `' S )
14		strfv2d.n	. . . . 5 |- ( ph -> <. ( E ` ndx ) , C >. e. S )
15		strfv2d.c	. . . . . . 7 |- ( ph -> C e. W )
16	15	elexd 2776	. . . . . 6 |- ( ph -> C e. _V )
17	9, 16	opelxpd 4697	. . . . 5 |- ( ph -> <. ( E ` ndx ) , C >. e. ( _V X. _V ) )
18	14, 17	elind 3349	. . . 4 |- ( ph -> <. ( E ` ndx ) , C >. e. ( S i^i ( _V X. _V ) ) )
19		cnvcnv 5123	. . . 4 |- `' `' S = ( S i^i ( _V X. _V ) )
20	18, 19	eleqtrrdi 2290	. . 3 |- ( ph -> <. ( E ` ndx ) , C >. e. `' `' S )
21		funopfv 5603	. . 3 |- ( Fun `' `' S -> ( <. ( E ` ndx ) , C >. e. `' `' S -> ( `' `' S ` ( E ` ndx ) ) = C ) )
22	13, 20, 21	sylc 62	. 2 |- ( ph -> ( `' `' S ` ( E ` ndx ) ) = C )
23	6, 12, 22	3eqtr2rd 2236	1 |- ( ph -> C = ( E ` S ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1364   e. wcel 2167   _Vcvv 2763   i^i cin 3156   <.cop 3626   X. cxp 4662   `'ccnv 4663   |` cres 4666   Fun wfun 5253   ` cfv 5259   NNcn 9007   ndxcnx 12700  Slot cslot 12702

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-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469

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-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-iota 5220  df-fun 5261  df-fv 5267  df-slot 12707

This theorem is referenced by:  strslfv2  12747  strslfv  12748  strslfv3  12749  opelstrsl  12817