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 16903 below, is useful for avoiding direct
reference to the hard-coded numeric index in component extractor
definitions, such as the 1 in df-base 16911 and the ;10 in
df-ple 16980, 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.e | ⊢ 𝐸 = Slot 𝑁 |
ndxarg.n | ⊢ 𝑁 ∈ ℕ |
Ref | Expression |
---|---|
ndxid | ⊢ 𝐸 = Slot (𝐸‘ndx) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ndxarg.e | . . . 4 ⊢ 𝐸 = Slot 𝑁 | |
2 | ndxarg.n | . . . 4 ⊢ 𝑁 ∈ ℕ | |
3 | 1, 2 | ndxarg 16895 | . . 3 ⊢ (𝐸‘ndx) = 𝑁 |
4 | 3 | eqcomi 2749 | . 2 ⊢ 𝑁 = (𝐸‘ndx) |
5 | sloteq 16882 | . . 3 ⊢ (𝑁 = (𝐸‘ndx) → Slot 𝑁 = Slot (𝐸‘ndx)) | |
6 | 1, 5 | eqtrid 2792 | . 2 ⊢ (𝑁 = (𝐸‘ndx) → 𝐸 = Slot (𝐸‘ndx)) |
7 | 4, 6 | ax-mp 5 | 1 ⊢ 𝐸 = Slot (𝐸‘ndx) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1542 ∈ wcel 2110 ‘cfv 6432 ℕcn 11973 Slot cslot 16880 ndxcnx 16892 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-sep 5227 ax-nul 5234 ax-pow 5292 ax-pr 5356 ax-un 7582 ax-cnex 10928 ax-1cn 10930 ax-addcl 10932 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ne 2946 df-ral 3071 df-rex 3072 df-reu 3073 df-rab 3075 df-v 3433 df-sbc 3721 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4846 df-iun 4932 df-br 5080 df-opab 5142 df-mpt 5163 df-tr 5197 df-id 5490 df-eprel 5496 df-po 5504 df-so 5505 df-fr 5545 df-we 5547 df-xp 5596 df-rel 5597 df-cnv 5598 df-co 5599 df-dm 5600 df-rn 5601 df-res 5602 df-ima 5603 df-pred 6201 df-ord 6268 df-on 6269 df-lim 6270 df-suc 6271 df-iota 6390 df-fun 6434 df-fn 6435 df-f 6436 df-f1 6437 df-fo 6438 df-f1o 6439 df-fv 6440 df-ov 7274 df-om 7707 df-2nd 7825 df-frecs 8088 df-wrecs 8119 df-recs 8193 df-rdg 8232 df-nn 11974 df-slot 16881 df-ndx 16893 |
This theorem is referenced by: strndxid 16897 setsidvaldOLD 16899 baseid 16913 2strop 16934 2strop1 16938 resslemOLD 16950 plusgid 16987 mulrid 17002 starvid 17011 scaid 17023 vscaid 17028 ipid 17039 tsetid 17061 pleid 17075 ocid 17090 dsid 17094 unifid 17104 homid 17120 ccoid 17122 oppglemOLD 18953 mgplemOLD 19723 opprlemOLD 19866 sralemOLD 20438 zlmlemOLD 20717 znbaslemOLD 20741 opsrbaslemOLD 21249 tnglemOLD 23795 itvid 26798 lngid 26799 ttglemOLD 27237 cchhllemOLD 27253 edgfid 27356 resvlemOLD 31527 hlhilslemOLD 39949 mnringnmulrdOLD 41798 |
Copyright terms: Public domain | W3C validator |