![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ndxid | Structured version Visualization version GIF version |
Description: A structure component
extractor is defined by its own index. This
theorem, together with strfv 16523 below, is useful for avoiding direct
reference to the hard-coded numeric index in component extractor
definitions, such as the 1 in df-base 16481 and the ;10 in
df-ple 16577, 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.) |
Ref | Expression |
---|---|
ndxarg.1 | ⊢ 𝐸 = Slot 𝑁 |
ndxarg.2 | ⊢ 𝑁 ∈ ℕ |
Ref | Expression |
---|---|
ndxid | ⊢ 𝐸 = Slot (𝐸‘ndx) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ndxarg.1 | . . . 4 ⊢ 𝐸 = Slot 𝑁 | |
2 | ndxarg.2 | . . . 4 ⊢ 𝑁 ∈ ℕ | |
3 | 1, 2 | ndxarg 16500 | . . 3 ⊢ (𝐸‘ndx) = 𝑁 |
4 | 3 | eqcomi 2807 | . 2 ⊢ 𝑁 = (𝐸‘ndx) |
5 | sloteq 16480 | . . 3 ⊢ (𝑁 = (𝐸‘ndx) → Slot 𝑁 = Slot (𝐸‘ndx)) | |
6 | 1, 5 | syl5eq 2845 | . 2 ⊢ (𝑁 = (𝐸‘ndx) → 𝐸 = Slot (𝐸‘ndx)) |
7 | 4, 6 | ax-mp 5 | 1 ⊢ 𝐸 = Slot (𝐸‘ndx) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1538 ∈ wcel 2111 ‘cfv 6324 ℕcn 11625 ndxcnx 16472 Slot cslot 16474 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-1cn 10584 ax-addcl 10586 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 df-om 7561 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-nn 11626 df-ndx 16478 df-slot 16479 |
This theorem is referenced by: strndxid 16502 setsidvald 16506 baseid 16535 resslem 16549 plusgid 16588 2strop 16596 2strop1 16599 mulrid 16608 starvid 16616 scaid 16625 vscaid 16627 ipid 16634 tsetid 16652 pleid 16659 ocid 16666 dsid 16668 unifid 16670 homid 16680 ccoid 16682 oppglem 18470 mgplem 19237 opprlem 19374 sralem 19942 zlmlem 20210 znbaslem 20230 opsrbaslem 20717 tnglem 23246 itvid 26236 lngid 26237 ttglem 26670 cchhllem 26681 edgfid 26784 resvlem 30955 hlhilslem 39234 mnringnmulrd 40922 |
Copyright terms: Public domain | W3C validator |