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

Theorem ndxid 17167
Description: A structure component extractor is defined by its own index. This theorem, together with strfv 17173 below, is useful for avoiding direct reference to the hard-coded numeric index in component extractor definitions, such as the 1 in df-base 17180 and the 10 in df-ple 17240, 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 17166 . . 3 (𝐸‘ndx) = 𝑁
43eqcomi 2745 . 2 𝑁 = (𝐸‘ndx)
5 sloteq 17153 . . 3 (𝑁 = (𝐸‘ndx) → Slot 𝑁 = Slot (𝐸‘ndx))
61, 5eqtrid 2783 . 2 (𝑁 = (𝐸‘ndx) → 𝐸 = Slot (𝐸‘ndx))
74, 6ax-mp 5 1 𝐸 = Slot (𝐸‘ndx)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1542  wcel 2114  cfv 6498  cn 12174  Slot cslot 17151  ndxcnx 17163
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-1cn 11096  ax-addcl 11098
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-nn 12175  df-slot 17152  df-ndx 17164
This theorem is referenced by:  strndxid  17168  baseid  17182  2strop  17199  plusgid  17247  mulridx  17258  starvid  17266  scaid  17278  vscaid  17283  ipid  17294  tsetid  17316  pleid  17330  ocid  17345  dsid  17349  unifid  17359  homid  17375  ccoid  17377  itvid  28507  lngid  28508  edgfid  29059  eufid  33352
  Copyright terms: Public domain W3C validator