How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
For an indexed family the collection of functions with domain and for every is a set
Statement
Let be an indexed family. Then there is a set whose elements are exactly the functions with and for every , and it is a subset of where .
Facts & Assumptions
Given: an indexed family , and .
An indexed family with index set is a function with (An indexed family is a function with domain ; is its range).
holds if and only if for some (, and for ).
holds if and only if (The set of all functions ).
We write , and say is a function from to , when is a function with and (A function is a relation with and implying ; , the value , domain and codomain).
For any parameters and any set , there is a set whose elements are exactly the elements of for which holds (The Axiom Schema of Separation: for each formula , ).
means that every element of is an element of (Subset , proper subset , and the separation notation ).
Proof
Let be a function with and for every . Every element of is for some , hence lies in and therefore in ; so and , that is, .
Separating inside with the formula saying that for every , with parameters and the family, gives a set whose elements are exactly the members of with that property; by step 1.1 every function of the kind described already lies in , so this set has exactly the intended elements and is included in .
Depends on
- An indexed family $(A_i)_{i \in I}$ is a function with domain $I$; $\{A_i : i \in I\}$ is its range
- $\bigcup_{i \in I} A_i := \bigcup \{A_i : i \in I\}$, and $\bigcap_{i \in I} A_i := \bigcap \{A_i : i \in I\}$ for $I \neq \varnothing$
- The set $B^{A}$ of all functions $A \to B$
- The Axiom Schema of Separation: for each formula $\varphi$, $\forall \bar p\,\forall x\,\exists y\,\forall z\,(z \in y \leftrightarrow (z \in x \wedge \varphi(z,\bar p)))$
- A function is a relation $f$ with $(a,b) \in f$ and $(a,c) \in f$ implying $b = c$; $f : A \to B$, the value $f(a)$, domain and codomain
- Subset $x \subseteq y$, proper subset $x \subsetneq y$, and the separation notation $\{\, z \in x : \varphi(z) \,\}$
- Relation, $\operatorname{dom} R$, $\operatorname{ran} R$, $\operatorname{fld} R$, and the specialisations "relation from $A$ to $B$" and "relation on $A$"
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 25 results over 10 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- B. Kaya, MATH 320 Set Theory (METU), Def. 21 (standard reference, not scraped)
- Cartesian product (Wikipedia) (standard reference, not scraped)
- Indexed family (Wikipedia) (standard reference, not scraped)