Theorem strnfvn 11969

Description: Value of a structure component extractor 𝐸. Normally, 𝐸 is a defined constant symbol such as Base (df-base 11954) and 𝑁 is a fixed integer such as 1. 𝑆 is a structure, i.e. a specific member of a class of structures.

Note: Normally, this theorem shouldn't be used outside of this section, because it requires hard-coded index values. Instead, use strslfv 11992. (Contributed by NM, 9-Sep-2011.) (Revised by Jim Kingdon, 19-Jan-2023.) (New usage is discouraged.)

Hypotheses

Ref	Expression
strnfvn.f	⊢ 𝑆 ∈ V
strnfvn.c	⊢ 𝐸 = Slot 𝑁
strnfvn.n	⊢ 𝑁 ∈ ℕ

Assertion

Ref	Expression
strnfvn	⊢ (𝐸‘𝑆) = (𝑆‘𝑁)

Proof of Theorem strnfvn

Step	Hyp	Ref	Expression
1		strnfvn.c	. . 3 ⊢ 𝐸 = Slot 𝑁
2		strnfvn.f	. . . 4 ⊢ 𝑆 ∈ V
3	2	a1i 9	. . 3 ⊢ (⊤ → 𝑆 ∈ V)
4		strnfvn.n	. . . 4 ⊢ 𝑁 ∈ ℕ
5	4	a1i 9	. . 3 ⊢ (⊤ → 𝑁 ∈ ℕ)
6	1, 3, 5	strnfvnd 11968	. 2 ⊢ (⊤ → (𝐸‘𝑆) = (𝑆‘𝑁))
7	6	mptru 1340	1 ⊢ (𝐸‘𝑆) = (𝑆‘𝑁)

Syntax hints:   = wceq 1331  ⊤wtru 1332   ∈ wcel 1480  Vcvv 2681  ‘cfv 5118  ℕcn 8713  Slot cslot 11947

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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-un 4350

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-sbc 2905  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-mpt 3986  df-id 4210  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-iota 5083  df-fun 5120  df-fv 5126  df-slot 11952

This theorem is referenced by:  ndxarg  11971  strsl0  11996  baseval  12000