MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ndxid Structured version   Visualization version   GIF version

Theorem ndxid 17253
Description: A structure component extractor is defined by its own index. This theorem, together with strfv 17259 below, is useful for avoiding direct reference to the hard-coded numeric index in component extractor definitions, such as the 1 in df-base 17266 and the 10 in df-ple 17326, making it easier to change should the need arise.

For example, we can refer to a specific poset with base set 𝐵 and order relation 𝐿 using {⟨(Base‘ndx), 𝐵⟩, ⟨(le‘ndx), 𝐿⟩} rather than {⟨1, 𝐵⟩, 10, 𝐿⟩}. The latter, while shorter to state, requires revision if we later change 10 to some other number, and it may also be harder to remember. (Contributed by NM, 19-Oct-2012.) (Revised by Mario Carneiro, 6-Oct-2013.) (Proof shortened by BJ, 27-Dec-2021.)

Hypotheses
Ref Expression
ndxarg.e 𝐸 = Slot 𝑁
ndxarg.n 𝑁 ∈ ℕ
Assertion
Ref Expression
ndxid 𝐸 = Slot (𝐸‘ndx)

Proof of Theorem ndxid
StepHypRef Expression
1 ndxarg.e . . . 4 𝐸 = Slot 𝑁
2 ndxarg.n . . . 4 𝑁 ∈ ℕ
31, 2ndxarg 17252 . . 3 (𝐸‘ndx) = 𝑁
43eqcomi 2778 . 2 𝑁 = (𝐸‘ndx)
5 sloteq 17239 . . 3 (𝑁 = (𝐸‘ndx) → Slot 𝑁 = Slot (𝐸‘ndx))
61, 5eqtrid 2816 . 2 (𝑁 = (𝐸‘ndx) → 𝐸 = Slot (𝐸‘ndx))
74, 6ax-mp 5 1 𝐸 = Slot (𝐸‘ndx)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1567  wcel 2149  cfv 6533  cn 12229  Slot cslot 17237  ndxcnx 17249
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730  ax-cnex 11152  ax-1cn 11154  ax-addcl 11156
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7411  df-om 7859  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-nn 12230  df-slot 17238  df-ndx 17250
This theorem is referenced by:  strndxid  17254  baseid  17268  2strop  17285  plusgid  17333  mulridx  17344  starvid  17352  scaid  17364  vscaid  17369  ipid  17380  tsetid  17402  pleid  17416  ocid  17431  dsid  17435  unifid  17445  homid  17461  ccoid  17463  itvid  28670  lngid  28671  edgfid  29277  eufid  33551
  Copyright terms: Public domain W3C validator