Home Metamath Proof ExplorerTheorem List (p. 161 of 429) < Previous  Next > Bad symbols? Try the GIF version. Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

 Color key: Metamath Proof Explorer (1-27903) Hilbert Space Explorer (27904-29428) Users' Mathboxes (29429-42879)

Theorem List for Metamath Proof Explorer - 16001-16100   *Has distinct variable group(s)
TypeLabelDescription
Statement

Definitiondf-plusg 16001 Define group operation. (Contributed by NM, 4-Sep-2011.) (Revised by Mario Carneiro, 14-Aug-2015.)
+g = Slot 2

Definitiondf-mulr 16002 Define ring multiplication. (Contributed by NM, 4-Sep-2011.) (Revised by Mario Carneiro, 14-Aug-2015.)
.r = Slot 3

Definitiondf-starv 16003 Define the involution function of a *-ring. (Contributed by NM, 4-Sep-2011.) (Revised by Mario Carneiro, 14-Aug-2015.)
*𝑟 = Slot 4

Definitiondf-sca 16004 Define scalar field component of a vector space 𝑣. (Contributed by NM, 4-Sep-2011.) (Revised by Mario Carneiro, 14-Aug-2015.)
Scalar = Slot 5

Definitiondf-vsca 16005 Define scalar product. (Contributed by NM, 4-Sep-2011.) (Revised by Mario Carneiro, 14-Aug-2015.)
·𝑠 = Slot 6

Definitiondf-ip 16006 Define Hermitian form (inner product). (Contributed by NM, 4-Sep-2011.) (Revised by Mario Carneiro, 14-Aug-2015.)
·𝑖 = Slot 8

Definitiondf-tset 16007 Define the topology component of a topological space (structure). (Contributed by NM, 4-Sep-2011.) (Revised by Mario Carneiro, 14-Aug-2015.)
TopSet = Slot 9

Definitiondf-ple 16008 Define less-than-or-equal ordering extractor for posets and related structures. We use 10 for the index to avoid conflict with 1 through 9 used for other purposes. (Contributed by NM, 4-Sep-2011.) (Revised by Mario Carneiro, 14-Aug-2015.) (Revised by AV, 9-Sep-2021.)
le = Slot 10

TheoremdfpleOLD 16009 Obsolete version of df-ple 16008 as of 9-Sep-2021. (Contributed by NM, 4-Sep-2011.) (Revised by Mario Carneiro, 14-Aug-2015.) (Proof modification is discouraged.) (New usage is discouraged.)
le = Slot 10

Definitiondf-ocomp 16010 Define the orthocomplementation extractor for posets and related structures. (Contributed by NM, 4-Sep-2011.) (Revised by Mario Carneiro, 14-Aug-2015.)
oc = Slot 11

Definitiondf-ds 16011 Define the distance function component of a metric space (structure). (Contributed by NM, 4-Sep-2011.) (Revised by Mario Carneiro, 14-Aug-2015.)
dist = Slot 12

Definitiondf-unif 16012 Define the uniform structure component of a uniform space. (Contributed by Mario Carneiro, 14-Aug-2015.)
UnifSet = Slot 13

Definitiondf-hom 16013 Define the hom-set component of a category. (Contributed by Mario Carneiro, 2-Jan-2017.)
Hom = Slot 14

Definitiondf-cco 16014 Define the composition operation of a category. (Contributed by Mario Carneiro, 2-Jan-2017.)
comp = Slot 15

Theoremstrlemor0OLD 16015 Structure definition utility lemma. To prove that an explicit function is a function using O(n) steps, exploit the order properties of the index set. Zero-pair case. Obsolete as of 26-Nov-2021. Theorems strlemor0OLD 16015, strlemor1OLD 16016, strlemor2OLD 16017, strlemor3OLD 16018 were replaced by strleun 16019, strle1 16020, strle2 16021, strle3 16022 following the introduction df-struct 15906. (Contributed by Stefan O'Rear, 3-Jan-2015.) (Proof modification is discouraged.) (New usage is discouraged.)
(Fun ∅ ∧ dom ∅ ⊆ (1...0))

Theoremstrlemor1OLD 16016 Add one element to the end of a structure. Obsolete as of 26-Nov-2021. See comment of strlemor0OLD 16015. (Contributed by Stefan O'Rear, 3-Jan-2015.) (Revised by Mario Carneiro, 30-Apr-2015.) (Proof modification is discouraged.) (New usage is discouraged.)
(Fun 𝐹 ∧ dom 𝐹 ⊆ (1...𝐼))    &   𝐼 ∈ ℕ0    &   𝐼 < 𝐽    &   𝐽 ∈ ℕ    &   𝐴 = 𝐽    &   𝐺 = (𝐹 ∪ {⟨𝐴, 𝑋⟩})       (Fun 𝐺 ∧ dom 𝐺 ⊆ (1...𝐽))

Theoremstrlemor2OLD 16017 Add two elements to the end of a structure. Obsolete as of 26-Nov-2021. See comment of strlemor0OLD 16015. (Contributed by Stefan O'Rear, 3-Jan-2015.) (Revised by Mario Carneiro, 30-Apr-2015.) (Proof modification is discouraged.) (New usage is discouraged.)
(Fun 𝐹 ∧ dom 𝐹 ⊆ (1...𝐼))    &   𝐼 ∈ ℕ0    &   𝐼 < 𝐽    &   𝐽 ∈ ℕ    &   𝐴 = 𝐽    &   𝐽 < 𝐾    &   𝐾 ∈ ℕ    &   𝐵 = 𝐾    &   𝐺 = (𝐹 ∪ {⟨𝐴, 𝑋⟩, ⟨𝐵, 𝑌⟩})       (Fun 𝐺 ∧ dom 𝐺 ⊆ (1...𝐾))

Theoremstrlemor3OLD 16018 Add three elements to the end of a structure. Obsolete as of 26-Nov-2021. See comment of strlemor0OLD 16015. (Contributed by Stefan O'Rear, 3-Jan-2015.) (Revised by Mario Carneiro, 30-Apr-2015.) (Proof modification is discouraged.) (New usage is discouraged.)
(Fun 𝐹 ∧ dom 𝐹 ⊆ (1...𝐼))    &   𝐼 ∈ ℕ0    &   𝐼 < 𝐽    &   𝐽 ∈ ℕ    &   𝐴 = 𝐽    &   𝐽 < 𝐾    &   𝐾 ∈ ℕ    &   𝐵 = 𝐾    &   𝐾 < 𝐿    &   𝐿 ∈ ℕ    &   𝐶 = 𝐿    &   𝐺 = (𝐹 ∪ {⟨𝐴, 𝑋⟩, ⟨𝐵, 𝑌⟩, ⟨𝐶, 𝑍⟩})       (Fun 𝐺 ∧ dom 𝐺 ⊆ (1...𝐿))

Theoremstrleun 16019 Combine two structures into one. (Contributed by Mario Carneiro, 29-Aug-2015.)
𝐹 Struct ⟨𝐴, 𝐵    &   𝐺 Struct ⟨𝐶, 𝐷    &   𝐵 < 𝐶       (𝐹𝐺) Struct ⟨𝐴, 𝐷

Theoremstrle1 16020 Make a structure from a singleton. (Contributed by Mario Carneiro, 29-Aug-2015.)
𝐼 ∈ ℕ    &   𝐴 = 𝐼       {⟨𝐴, 𝑋⟩} Struct ⟨𝐼, 𝐼

Theoremstrle2 16021 Make a structure from a pair. (Contributed by Mario Carneiro, 29-Aug-2015.)
𝐼 ∈ ℕ    &   𝐴 = 𝐼    &   𝐼 < 𝐽    &   𝐽 ∈ ℕ    &   𝐵 = 𝐽       {⟨𝐴, 𝑋⟩, ⟨𝐵, 𝑌⟩} Struct ⟨𝐼, 𝐽

Theoremstrle3 16022 Make a structure from a triple. (Contributed by Mario Carneiro, 29-Aug-2015.)
𝐼 ∈ ℕ    &   𝐴 = 𝐼    &   𝐼 < 𝐽    &   𝐽 ∈ ℕ    &   𝐵 = 𝐽    &   𝐽 < 𝐾    &   𝐾 ∈ ℕ    &   𝐶 = 𝐾       {⟨𝐴, 𝑋⟩, ⟨𝐵, 𝑌⟩, ⟨𝐶, 𝑍⟩} Struct ⟨𝐼, 𝐾

Theoremplusgndx 16023 Index value of the df-plusg 16001 slot. (Contributed by Mario Carneiro, 14-Aug-2015.)
(+g‘ndx) = 2

Theoremplusgid 16024 Utility theorem: index-independent form of df-plusg 16001. (Contributed by NM, 20-Oct-2012.)
+g = Slot (+g‘ndx)

Theoremopelstrbas 16025 The base set of a structure with a base set. (Contributed by AV, 10-Nov-2021.)
(𝜑𝑆 Struct 𝑋)    &   (𝜑𝑉𝑌)    &   (𝜑 → ⟨(Base‘ndx), 𝑉⟩ ∈ 𝑆)       (𝜑𝑉 = (Base‘𝑆))

Theorem1strstr 16026 A constructed one-slot structure. (Contributed by AV, 27-Mar-2020.)
𝐺 = {⟨(Base‘ndx), 𝐵⟩}       𝐺 Struct ⟨1, 1⟩

Theorem1strbas 16027 The base set of a constructed one-slot structure. (Contributed by AV, 27-Mar-2020.)
𝐺 = {⟨(Base‘ndx), 𝐵⟩}       (𝐵𝑉𝐵 = (Base‘𝐺))

Theorem1strwunbndx 16028 A constructed one-slot structure in a weak universe containing the index of the base set extractor. (Contributed by AV, 27-Mar-2020.)
𝐺 = {⟨(Base‘ndx), 𝐵⟩}    &   (𝜑𝑈 ∈ WUni)    &   (𝜑 → (Base‘ndx) ∈ 𝑈)       ((𝜑𝐵𝑈) → 𝐺𝑈)

Theorem1strwun 16029 A constructed one-slot structure in a weak universe. (Contributed by AV, 27-Mar-2020.)
𝐺 = {⟨(Base‘ndx), 𝐵⟩}    &   (𝜑𝑈 ∈ WUni)    &   (𝜑 → ω ∈ 𝑈)       ((𝜑𝐵𝑈) → 𝐺𝑈)

Theorem2strstr 16030 A constructed two-slot structure. (Contributed by Mario Carneiro, 29-Aug-2015.)
𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(𝐸‘ndx), + ⟩}    &   𝐸 = Slot 𝑁    &   1 < 𝑁    &   𝑁 ∈ ℕ       𝐺 Struct ⟨1, 𝑁

Theorem2strbas 16031 The base set of a constructed two-slot structure. (Contributed by Mario Carneiro, 29-Aug-2015.)
𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(𝐸‘ndx), + ⟩}    &   𝐸 = Slot 𝑁    &   1 < 𝑁    &   𝑁 ∈ ℕ       (𝐵𝑉𝐵 = (Base‘𝐺))

Theorem2strop 16032 The other slot of a constructed two-slot structure. (Contributed by Mario Carneiro, 29-Aug-2015.)
𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(𝐸‘ndx), + ⟩}    &   𝐸 = Slot 𝑁    &   1 < 𝑁    &   𝑁 ∈ ℕ       ( +𝑉+ = (𝐸𝐺))

Theorem2strstr1 16033 A constructed two-slot structure. Version of 2strstr 16030 not depending on the hard-coded index value of the base set. (Contributed by AV, 22-Sep-2020.)
𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨𝑁, + ⟩}    &   (Base‘ndx) < 𝑁    &   𝑁 ∈ ℕ       𝐺 Struct ⟨(Base‘ndx), 𝑁

Theorem2strbas1 16034 The base set of a constructed two-slot structure. Version of 2strbas 16031 not depending on the hard-coded index value of the base set. (Contributed by AV, 22-Sep-2020.)
𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨𝑁, + ⟩}    &   (Base‘ndx) < 𝑁    &   𝑁 ∈ ℕ       (𝐵𝑉𝐵 = (Base‘𝐺))

Theorem2strop1 16035 The other slot of a constructed two-slot structure. Version of 2strop 16032 not depending on the hard-coded index value of the base set. (Contributed by AV, 22-Sep-2020.)
𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨𝑁, + ⟩}    &   (Base‘ndx) < 𝑁    &   𝑁 ∈ ℕ    &   𝐸 = Slot 𝑁       ( +𝑉+ = (𝐸𝐺))

Theorembasendxnplusgndx 16036 The slot for the base set is not the slot for the group operation in an extensible structure. (Contributed by AV, 14-Nov-2021.)
(Base‘ndx) ≠ (+g‘ndx)

Theoremgrpstr 16037 A constructed group is a structure on 1...2. (Contributed by Mario Carneiro, 28-Sep-2013.) (Revised by Mario Carneiro, 30-Apr-2015.)
𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩}       𝐺 Struct ⟨1, 2⟩

Theoremgrpbase 16038 The base set of a constructed group. (Contributed by Mario Carneiro, 2-Aug-2013.) (Revised by Mario Carneiro, 30-Apr-2015.)
𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩}       (𝐵𝑉𝐵 = (Base‘𝐺))

Theoremgrpplusg 16039 The operation of a constructed group. (Contributed by Mario Carneiro, 2-Aug-2013.) (Revised by Mario Carneiro, 30-Apr-2015.)
𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩}       ( +𝑉+ = (+g𝐺))

Theoremressplusg 16040 +g is unaffected by restriction. (Contributed by Stefan O'Rear, 27-Nov-2014.)
𝐻 = (𝐺s 𝐴)    &    + = (+g𝐺)       (𝐴𝑉+ = (+g𝐻))

Theoremgrpbasex 16041 The base of an explicitly given group. Note: This theorem has hard-coded structure indices for demonstration purposes. It is not intended for general use; use grpbase 16038 instead. (New usage is discouraged.) (Contributed by NM, 17-Oct-2012.)
𝐵 ∈ V    &    + ∈ V    &   𝐺 = {⟨1, 𝐵⟩, ⟨2, + ⟩}       𝐵 = (Base‘𝐺)

Theoremgrpplusgx 16042 The operation of an explicitly given group. Note: This theorem has hard-coded structure indices for demonstration purposes. It is not intended for general use; use grpplusg 16039 instead. (New usage is discouraged.) (Contributed by NM, 17-Oct-2012.)
𝐵 ∈ V    &    + ∈ V    &   𝐺 = {⟨1, 𝐵⟩, ⟨2, + ⟩}        + = (+g𝐺)

Theoremmulrndx 16043 Index value of the df-mulr 16002 slot. (Contributed by Mario Carneiro, 14-Aug-2015.)
(.r‘ndx) = 3

Theoremmulrid 16044 Utility theorem: index-independent form of df-mulr 16002. (Contributed by Mario Carneiro, 8-Jun-2013.)
.r = Slot (.r‘ndx)

Theoremplusgndxnmulrndx 16045 The slot for the group (addition) operation is not the slot for the ring (multiplication) operation in an extensible structure. (Contributed by AV, 16-Feb-2020.)
(+g‘ndx) ≠ (.r‘ndx)

Theorembasendxnmulrndx 16046 The slot for the base set is not the slot for the ring (multiplication) operation in an extensible structure. (Contributed by AV, 16-Feb-2020.)
(Base‘ndx) ≠ (.r‘ndx)

Theoremrngstr 16047 A constructed ring is a structure. (Contributed by Mario Carneiro, 28-Sep-2013.) (Revised by Mario Carneiro, 29-Aug-2015.)
𝑅 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), · ⟩}       𝑅 Struct ⟨1, 3⟩

Theoremrngbase 16048 The base set of a constructed ring. (Contributed by Mario Carneiro, 2-Oct-2013.) (Revised by Mario Carneiro, 30-Apr-2015.)
𝑅 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), · ⟩}       (𝐵𝑉𝐵 = (Base‘𝑅))

Theoremrngplusg 16049 The additive operation of a constructed ring. (Contributed by Mario Carneiro, 2-Oct-2013.) (Revised by Mario Carneiro, 30-Apr-2015.)
𝑅 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), · ⟩}       ( +𝑉+ = (+g𝑅))

Theoremrngmulr 16050 The multiplicative operation of a constructed ring. (Contributed by Mario Carneiro, 2-Oct-2013.) (Revised by Mario Carneiro, 30-Apr-2015.)
𝑅 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), · ⟩}       ( ·𝑉· = (.r𝑅))

Theoremstarvndx 16051 Index value of the df-starv 16003 slot. (Contributed by Mario Carneiro, 14-Aug-2015.)
(*𝑟‘ndx) = 4

Theoremstarvid 16052 Utility theorem: index-independent form of df-starv 16003. (Contributed by Mario Carneiro, 6-Oct-2013.)
*𝑟 = Slot (*𝑟‘ndx)

Theoremressmulr 16053 .r is unaffected by restriction. (Contributed by Stefan O'Rear, 27-Nov-2014.)
𝑆 = (𝑅s 𝐴)    &    · = (.r𝑅)       (𝐴𝑉· = (.r𝑆))

Theoremressstarv 16054 *𝑟 is unaffected by restriction. (Contributed by Mario Carneiro, 9-Oct-2015.)
𝑆 = (𝑅s 𝐴)    &    = (*𝑟𝑅)       (𝐴𝑉 = (*𝑟𝑆))

Theoremsrngfn 16055 A constructed star ring is a function with domain contained in 1 thru 4. (Contributed by Mario Carneiro, 18-Nov-2013.) (Revised by Mario Carneiro, 14-Aug-2015.)
𝑅 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), · ⟩} ∪ {⟨(*𝑟‘ndx), ⟩})       𝑅 Struct ⟨1, 4⟩

Theoremsrngbase 16056 The base set of a constructed star ring. (Contributed by Mario Carneiro, 18-Nov-2013.) (Revised by Mario Carneiro, 6-May-2015.)
𝑅 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), · ⟩} ∪ {⟨(*𝑟‘ndx), ⟩})       (𝐵𝑋𝐵 = (Base‘𝑅))

Theoremsrngplusg 16057 The addition operation of a constructed star ring. (Contributed by Mario Carneiro, 20-Jun-2015.)
𝑅 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), · ⟩} ∪ {⟨(*𝑟‘ndx), ⟩})       ( +𝑋+ = (+g𝑅))

Theoremsrngmulr 16058 The multiplication operation of a constructed star ring. (Contributed by Mario Carneiro, 20-Jun-2015.)
𝑅 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), · ⟩} ∪ {⟨(*𝑟‘ndx), ⟩})       ( ·𝑋· = (.r𝑅))

Theoremsrnginvl 16059 The involution function of a constructed star ring. (Contributed by Mario Carneiro, 20-Jun-2015.)
𝑅 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), · ⟩} ∪ {⟨(*𝑟‘ndx), ⟩})       ( 𝑋 = (*𝑟𝑅))

Theoremscandx 16060 Index value of the df-sca 16004 slot. (Contributed by Mario Carneiro, 14-Aug-2015.)
(Scalar‘ndx) = 5

Theoremscaid 16061 Utility theorem: index-independent form of scalar df-sca 16004. (Contributed by Mario Carneiro, 19-Jun-2014.)
Scalar = Slot (Scalar‘ndx)

Theoremvscandx 16062 Index value of the df-vsca 16005 slot. (Contributed by Mario Carneiro, 14-Aug-2015.)
( ·𝑠 ‘ndx) = 6

Theoremvscaid 16063 Utility theorem: index-independent form of scalar product df-vsca 16005. (Contributed by Mario Carneiro, 2-Oct-2013.) (Revised by Mario Carneiro, 19-Jun-2014.)
·𝑠 = Slot ( ·𝑠 ‘ndx)

Theoremlmodstr 16064 A constructed left module or left vector space is a function. (Contributed by Mario Carneiro, 1-Oct-2013.) (Revised by Mario Carneiro, 29-Aug-2015.)
𝑊 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(Scalar‘ndx), 𝐹⟩} ∪ {⟨( ·𝑠 ‘ndx), · ⟩})       𝑊 Struct ⟨1, 6⟩

Theoremlmodbase 16065 The base set of a constructed left vector space. (Contributed by Mario Carneiro, 2-Oct-2013.) (Revised by Mario Carneiro, 29-Aug-2015.)
𝑊 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(Scalar‘ndx), 𝐹⟩} ∪ {⟨( ·𝑠 ‘ndx), · ⟩})       (𝐵𝑋𝐵 = (Base‘𝑊))

Theoremlmodplusg 16066 The additive operation of a constructed left vector space. (Contributed by Mario Carneiro, 2-Oct-2013.) (Revised by Mario Carneiro, 29-Aug-2015.)
𝑊 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(Scalar‘ndx), 𝐹⟩} ∪ {⟨( ·𝑠 ‘ndx), · ⟩})       ( +𝑋+ = (+g𝑊))

Theoremlmodsca 16067 The set of scalars of a constructed left vector space. (Contributed by Mario Carneiro, 2-Oct-2013.) (Revised by Mario Carneiro, 29-Aug-2015.)
𝑊 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(Scalar‘ndx), 𝐹⟩} ∪ {⟨( ·𝑠 ‘ndx), · ⟩})       (𝐹𝑋𝐹 = (Scalar‘𝑊))

Theoremlmodvsca 16068 The scalar product operation of a constructed left vector space. (Contributed by Mario Carneiro, 2-Oct-2013.) (Revised by Mario Carneiro, 29-Aug-2015.)
𝑊 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(Scalar‘ndx), 𝐹⟩} ∪ {⟨( ·𝑠 ‘ndx), · ⟩})       ( ·𝑋· = ( ·𝑠𝑊))

Theoremipndx 16069 Index value of the df-ip 16006 slot. (Contributed by Mario Carneiro, 14-Aug-2015.)
(·𝑖‘ndx) = 8

Theoremipid 16070 Utility theorem: index-independent form of df-ip 16006. (Contributed by Mario Carneiro, 6-Oct-2013.)
·𝑖 = Slot (·𝑖‘ndx)

Theoremipsstr 16071 Lemma to shorten proofs of ipsbase 16072 through ipsvsca 16076. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Revised by Mario Carneiro, 29-Aug-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.)
𝐴 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), × ⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), 𝐼⟩})       𝐴 Struct ⟨1, 8⟩

Theoremipsbase 16072 The base set of a constructed inner product space. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Revised by Mario Carneiro, 29-Aug-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.)
𝐴 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), × ⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), 𝐼⟩})       (𝐵𝑉𝐵 = (Base‘𝐴))

Theoremipsaddg 16073 The additive operation of a constructed inner product space. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Revised by Mario Carneiro, 29-Aug-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.)
𝐴 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), × ⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), 𝐼⟩})       ( +𝑉+ = (+g𝐴))

Theoremipsmulr 16074 The multiplicative operation of a constructed inner product space. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Revised by Mario Carneiro, 29-Aug-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.)
𝐴 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), × ⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), 𝐼⟩})       ( ×𝑉× = (.r𝐴))

Theoremipssca 16075 The set of scalars of a constructed inner product space. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Revised by Mario Carneiro, 29-Aug-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.)
𝐴 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), × ⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), 𝐼⟩})       (𝑆𝑉𝑆 = (Scalar‘𝐴))

Theoremipsvsca 16076 The scalar product operation of a constructed inner product space. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Revised by Mario Carneiro, 29-Aug-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.)
𝐴 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), × ⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), 𝐼⟩})       ( ·𝑉· = ( ·𝑠𝐴))

Theoremipsip 16077 The multiplicative operation of a constructed inner product space. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Revised by Mario Carneiro, 29-Aug-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.)
𝐴 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), × ⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), 𝐼⟩})       (𝐼𝑉𝐼 = (·𝑖𝐴))

Theoremresssca 16078 Scalar is unaffected by restriction. (Contributed by Mario Carneiro, 7-Dec-2014.)
𝐻 = (𝐺s 𝐴)    &   𝐹 = (Scalar‘𝐺)       (𝐴𝑉𝐹 = (Scalar‘𝐻))

Theoremressvsca 16079 ·𝑠 is unaffected by restriction. (Contributed by Mario Carneiro, 7-Dec-2014.)
𝐻 = (𝐺s 𝐴)    &    · = ( ·𝑠𝐺)       (𝐴𝑉· = ( ·𝑠𝐻))

Theoremressip 16080 The inner product is unaffected by restriction. (Contributed by Thierry Arnoux, 16-Jun-2019.)
𝐻 = (𝐺s 𝐴)    &    , = (·𝑖𝐺)       (𝐴𝑉, = (·𝑖𝐻))

Theoremphlstr 16081 A constructed pre-Hilbert space is a structure. Starting from lmodstr 16064 (which has 4 members), we chain strleun 16019 once more, adding an ordered pair to the function, to get all 5 members. (Contributed by Mario Carneiro, 1-Oct-2013.) (Revised by Mario Carneiro, 29-Aug-2015.)
𝐻 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(Scalar‘ndx), 𝑇⟩} ∪ {⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), , ⟩})       𝐻 Struct ⟨1, 8⟩

Theoremphlbase 16082 The base set of a constructed pre-Hilbert space. (Contributed by Mario Carneiro, 6-Oct-2013.) (Revised by Mario Carneiro, 29-Aug-2015.)
𝐻 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(Scalar‘ndx), 𝑇⟩} ∪ {⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), , ⟩})       (𝐵𝑋𝐵 = (Base‘𝐻))

Theoremphlplusg 16083 The additive operation of a constructed pre-Hilbert space. (Contributed by Mario Carneiro, 6-Oct-2013.) (Revised by Mario Carneiro, 29-Aug-2015.)
𝐻 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(Scalar‘ndx), 𝑇⟩} ∪ {⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), , ⟩})       ( +𝑋+ = (+g𝐻))

Theoremphlsca 16084 The ring of scalars of a constructed pre-Hilbert space. (Contributed by Mario Carneiro, 6-Oct-2013.) (Revised by Mario Carneiro, 29-Aug-2015.)
𝐻 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(Scalar‘ndx), 𝑇⟩} ∪ {⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), , ⟩})       (𝑇𝑋𝑇 = (Scalar‘𝐻))

Theoremphlvsca 16085 The scalar product operation of a constructed pre-Hilbert space. (Contributed by Mario Carneiro, 6-Oct-2013.) (Revised by Mario Carneiro, 29-Aug-2015.)
𝐻 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(Scalar‘ndx), 𝑇⟩} ∪ {⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), , ⟩})       ( ·𝑋· = ( ·𝑠𝐻))

Theoremphlip 16086 The inner product (Hermitian form) operation of a constructed pre-Hilbert space. (Contributed by Mario Carneiro, 6-Oct-2013.) (Revised by Mario Carneiro, 29-Aug-2015.)
𝐻 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(Scalar‘ndx), 𝑇⟩} ∪ {⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), , ⟩})       ( ,𝑋, = (·𝑖𝐻))

Theoremtsetndx 16087 Index value of the df-tset 16007 slot. (Contributed by Mario Carneiro, 14-Aug-2015.)
(TopSet‘ndx) = 9

Theoremtsetid 16088 Utility theorem: index-independent form of df-tset 16007. (Contributed by NM, 20-Oct-2012.)
TopSet = Slot (TopSet‘ndx)

Theoremtopgrpstr 16089 A constructed topological group is a structure. (Contributed by Mario Carneiro, 29-Aug-2015.)
𝑊 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}       𝑊 Struct ⟨1, 9⟩

Theoremtopgrpbas 16090 The base set of a constructed topological group. (Contributed by Mario Carneiro, 29-Aug-2015.)
𝑊 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}       (𝐵𝑋𝐵 = (Base‘𝑊))

Theoremtopgrpplusg 16091 The additive operation of a constructed topological group. (Contributed by Mario Carneiro, 29-Aug-2015.)
𝑊 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}       ( +𝑋+ = (+g𝑊))

Theoremtopgrptset 16092 The topology of a constructed topological group. (Contributed by Mario Carneiro, 29-Aug-2015.)
𝑊 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}       (𝐽𝑋𝐽 = (TopSet‘𝑊))

Theoremresstset 16093 TopSet is unaffected by restriction. (Contributed by Mario Carneiro, 13-Aug-2015.)
𝐻 = (𝐺s 𝐴)    &   𝐽 = (TopSet‘𝐺)       (𝐴𝑉𝐽 = (TopSet‘𝐻))

Theoremplendx 16094 Index value of the df-ple 16008 slot. (Contributed by Mario Carneiro, 14-Aug-2015.) (Revised by AV, 9-Sep-2021.)
(le‘ndx) = 10

TheoremplendxOLD 16095 Obsolete version of df-ple 16008 as of 9-Sep-2021. (Contributed by Mario Carneiro, 14-Aug-2015.) (Proof modification is discouraged.) (New usage is discouraged.)
(le‘ndx) = 10

Theorempleid 16096 Utility theorem: self-referencing, index-independent form of df-ple 16008. (Contributed by NM, 9-Nov-2012.) (Revised by AV, 9-Sep-2021.)
le = Slot (le‘ndx)

TheorempleidOLD 16097 Obsolete version of otpsstr 16098 as of 9-Sep-2021. (Contributed by Mario Carneiro, 9-Nov-2015.) (Proof modification is discouraged.) (New usage is discouraged.)
le = Slot (le‘ndx)

Theoremotpsstr 16098 Functionality of a topological ordered space. (Contributed by Mario Carneiro, 12-Nov-2015.) (Revised by AV, 9-Sep-2021.)
𝐾 = {⟨(Base‘ndx), 𝐵⟩, ⟨(TopSet‘ndx), 𝐽⟩, ⟨(le‘ndx), ⟩}       𝐾 Struct ⟨1, 10⟩

Theoremotpsbas 16099 The base set of a topological ordered space. (Contributed by Mario Carneiro, 12-Nov-2015.) (Revised by AV, 9-Sep-2021.)
𝐾 = {⟨(Base‘ndx), 𝐵⟩, ⟨(TopSet‘ndx), 𝐽⟩, ⟨(le‘ndx), ⟩}       (𝐵𝑉𝐵 = (Base‘𝐾))

Theoremotpstset 16100 The open sets of a topological ordered space. (Contributed by Mario Carneiro, 12-Nov-2015.) (Revised by AV, 9-Sep-2021.)
𝐾 = {⟨(Base‘ndx), 𝐵⟩, ⟨(TopSet‘ndx), 𝐽⟩, ⟨(le‘ndx), ⟩}       (𝐽𝑉𝐽 = (TopSet‘𝐾))

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42400 425 42401-42500 426 42501-42600 427 42601-42700 428 42701-42800 429 42801-42879
 Copyright terms: Public domain < Previous  Next >