Theorem strslfv 13456

Description: Extract a structure component 𝐶 (such as the base set) from a structure 𝑆 with a component extractor 𝐸 (such as the base set extractor df-base 13417). By virtue of ndxslid 13436, this can be done without having to refer to the hard-coded numeric index of 𝐸. (Contributed by Mario Carneiro, 6-Oct-2013.) (Revised by Jim Kingdon, 30-Jan-2023.)

Hypotheses

Ref	Expression
strfv.s	⊢ 𝑆 Struct 𝑋
strslfv.e	⊢ (𝐸 = Slot (𝐸‘ndx) ∧ (𝐸‘ndx) ∈ ℕ)
strfv.n	⊢ {⟨(𝐸‘ndx), 𝐶⟩} ⊆ 𝑆

Assertion

Ref	Expression
strslfv	⊢ (𝐶 ∈ 𝑉 → 𝐶 = (𝐸‘𝑆))

Proof of Theorem strslfv

Step	Hyp	Ref	Expression
1		strslfv.e	. 2 ⊢ (𝐸 = Slot (𝐸‘ndx) ∧ (𝐸‘ndx) ∈ ℕ)
2		strfv.s	. . 3 ⊢ 𝑆 Struct 𝑋
3		structex 13423	. . 3 ⊢ (𝑆 Struct 𝑋 → 𝑆 ∈ V)
4	2, 3	mp1i 10	. 2 ⊢ (𝐶 ∈ 𝑉 → 𝑆 ∈ V)
5	2	structfun 13429	. . 3 ⊢ Fun ◡◡𝑆
6	5	a1i 9	. 2 ⊢ (𝐶 ∈ 𝑉 → Fun ◡◡𝑆)
7		strfv.n	. . 3 ⊢ {⟨(𝐸‘ndx), 𝐶⟩} ⊆ 𝑆
8	1	simpri 113	. . . . 5 ⊢ (𝐸‘ndx) ∈ ℕ
9		opexg 4370	. . . . 5 ⊢ (((𝐸‘ndx) ∈ ℕ ∧ 𝐶 ∈ 𝑉) → ⟨(𝐸‘ndx), 𝐶⟩ ∈ V)
10	8, 9	mpan 428	. . . 4 ⊢ (𝐶 ∈ 𝑉 → ⟨(𝐸‘ndx), 𝐶⟩ ∈ V)
11		snssg 3849	. . . 4 ⊢ (⟨(𝐸‘ndx), 𝐶⟩ ∈ V → (⟨(𝐸‘ndx), 𝐶⟩ ∈ 𝑆 ↔ {⟨(𝐸‘ndx), 𝐶⟩} ⊆ 𝑆))
12	10, 11	syl 14	. . 3 ⊢ (𝐶 ∈ 𝑉 → (⟨(𝐸‘ndx), 𝐶⟩ ∈ 𝑆 ↔ {⟨(𝐸‘ndx), 𝐶⟩} ⊆ 𝑆))
13	7, 12	mpbiri 168	. 2 ⊢ (𝐶 ∈ 𝑉 → ⟨(𝐸‘ndx), 𝐶⟩ ∈ 𝑆)
14		id 19	. 2 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ 𝑉)
15	1, 4, 6, 13, 14	strslfv2d 13454	1 ⊢ (𝐶 ∈ 𝑉 → 𝐶 = (𝐸‘𝑆))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  Vcvv 2821   ⊆ wss 3220  {csn 3709  ⟨cop 3712   class class class wbr 4131  ^◡ccnv 4775  Fun wfun 5374  ‘cfv 5380  ℕcn 9314   Struct cstr 13407  ndxcnx 13408  Slot cslot 13410

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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 4251  ax-pow 4313  ax-pr 4348  ax-un 4580

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-iota 5340  df-fun 5382  df-fv 5388  df-struct 13413  df-slot 13415

This theorem is used by:  cnfldbas  15007  mpocnfldadd  15008  mpocnfldmul  15010  cnfldcj  15012  cnfldtset  15013  cnfldle  15014  cnfldds  15015