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

Definition df-slot 17112
Description: Define the slot extractor for extensible structures. The class Slot 𝐴 is a function whose argument can be any set, although it is meaningful only if that set is a member of an extensible structure (such as a partially ordered set (df-poset 18263) or a group (df-grp 18819)).

Note that Slot 𝐴 is implemented as "evaluation at 𝐴". That is, (Slot π΄β€˜π‘†) is defined to be (π‘†β€˜π΄), where 𝐴 will typically be an index (which is implemented as a small natural number) of a component of an extensible structure 𝑆. Each extensible structure is a function defined on specific (natural number) "slots", and the function Slot 𝐴 extracts the structure's component as a function value at a particular slot (with index 𝐴).

The special "structure" ndx, defined as the identity function restricted to β„•, can be used to extract the number 𝐴 from a slot, since (Slot π΄β€˜ndx) = 𝐴 (see ndxarg 17126). This is typically used to refer to the number of a slot when defining structures without having to expose the detail of what that number is (for instance, we use the expression (Baseβ€˜ndx) in theorems and proofs instead of its hard-coded, numeric value 1), and discourage using the specific definition of slot extractors like Base = Slot 1 (see df-base 17142). Actually, these definitions are used in two basic theorems named *id (theorems of the form 𝐢 = Slot (πΆβ€˜ndx)) and *ndx (theorems of the form (πΆβ€˜ndx) = 𝑁) only (see, for example, baseid 17144 and basendx 17150), except additionally in the discouraged theorem baseval 17143 to demonstrate the representations of the value of the base set extractor. The *id theorems are implementation independent equivalents of the definitions by the means of ndxid 17127, but the *ndx theorems still depend on the hard-coded values of the indices. Therefore, the usage of these *ndx theorems is also discouraged (for more details see the section header comment mmtheorems.html#cnx 17127).

Example: The group operation is the second component, i.e., the component in the second slot, of a group-like structure 𝐺 = {⟨(Baseβ€˜ndx), 𝐡⟩, ⟨(+gβ€˜ndx), + ⟩} (see grpstr 17226). The slot extractor +g = Slot 2 (see df-plusg 17207) applied on the structure 𝐺 provides the group operation + = (+gβ€˜πΊ). Expanding the defintions, we get + = (Slot 2β€˜πΊ) = (πΊβ€˜2) = (πΊβ€˜(+gβ€˜ndx)) (for the last equation, see plusgndx 17220).

The class Slot cannot be defined as (π‘₯ ∈ V ↦ (𝑓 ∈ V ↦ (π‘“β€˜π‘₯))) because each Slot 𝐴 is a function on the proper class V so is itself a proper class, and the values of functions are sets (fvex 6902). It is necessary to allow proper classes as values of Slot 𝐴 since for instance the class of all (base sets of) groups is proper. (Contributed by Mario Carneiro, 22-Sep-2015.)

Assertion
Ref Expression
df-slot Slot 𝐴 = (π‘₯ ∈ V ↦ (π‘₯β€˜π΄))
Distinct variable group:   π‘₯,𝐴

Detailed syntax breakdown of Definition df-slot
StepHypRef Expression
1 cA . . 3 class 𝐴
21cslot 17111 . 2 class Slot 𝐴
3 vx . . 3 setvar π‘₯
4 cvv 3475 . . 3 class V
53cv 1541 . . . 4 class π‘₯
61, 5cfv 6541 . . 3 class (π‘₯β€˜π΄)
73, 4, 6cmpt 5231 . 2 class (π‘₯ ∈ V ↦ (π‘₯β€˜π΄))
82, 7wceq 1542 1 wff Slot 𝐴 = (π‘₯ ∈ V ↦ (π‘₯β€˜π΄))
Colors of variables: wff setvar class
This definition is referenced by:  sloteq  17113  slotfn  17114  strfvnd  17115  bj-evaleq  35942  bj-evalfun  35943  bj-evalfn  35944  bj-evalval  35945
  Copyright terms: Public domain W3C validator