HomeHome Metamath Proof Explorer
Theorem List (p. 95 of 479)
< 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  Metamath Proof Explorer
(1-30171)
  Hilbert Space Explorer  Hilbert Space Explorer
(30172-31694)
  Users' Mathboxes  Users' Mathboxes
(31695-47852)
 

Theorem List for Metamath Proof Explorer - 9401-9500   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremmapfienlem2 9401* Lemma 2 for mapfien 9403. (Contributed by AV, 3-Jul-2019.) (Revised by AV, 28-Jul-2024.)
𝑆 = {π‘₯ ∈ (𝐡 ↑m 𝐴) ∣ π‘₯ finSupp 𝑍}    &   π‘‡ = {π‘₯ ∈ (𝐷 ↑m 𝐢) ∣ π‘₯ finSupp π‘Š}    &   π‘Š = (πΊβ€˜π‘)    &   (πœ‘ β†’ 𝐹:𝐢–1-1-onto→𝐴)    &   (πœ‘ β†’ 𝐺:𝐡–1-1-onto→𝐷)    &   (πœ‘ β†’ 𝐴 ∈ π‘ˆ)    &   (πœ‘ β†’ 𝐡 ∈ 𝑉)    &   (πœ‘ β†’ 𝐢 ∈ 𝑋)    &   (πœ‘ β†’ 𝐷 ∈ π‘Œ)    &   (πœ‘ β†’ 𝑍 ∈ 𝐡)    β‡’   ((πœ‘ ∧ 𝑔 ∈ 𝑇) β†’ ((◑𝐺 ∘ 𝑔) ∘ ◑𝐹) finSupp 𝑍)
 
Theoremmapfienlem3 9402* Lemma 3 for mapfien 9403. (Contributed by AV, 3-Jul-2019.) (Revised by AV, 28-Jul-2024.)
𝑆 = {π‘₯ ∈ (𝐡 ↑m 𝐴) ∣ π‘₯ finSupp 𝑍}    &   π‘‡ = {π‘₯ ∈ (𝐷 ↑m 𝐢) ∣ π‘₯ finSupp π‘Š}    &   π‘Š = (πΊβ€˜π‘)    &   (πœ‘ β†’ 𝐹:𝐢–1-1-onto→𝐴)    &   (πœ‘ β†’ 𝐺:𝐡–1-1-onto→𝐷)    &   (πœ‘ β†’ 𝐴 ∈ π‘ˆ)    &   (πœ‘ β†’ 𝐡 ∈ 𝑉)    &   (πœ‘ β†’ 𝐢 ∈ 𝑋)    &   (πœ‘ β†’ 𝐷 ∈ π‘Œ)    &   (πœ‘ β†’ 𝑍 ∈ 𝐡)    β‡’   ((πœ‘ ∧ 𝑔 ∈ 𝑇) β†’ ((◑𝐺 ∘ 𝑔) ∘ ◑𝐹) ∈ 𝑆)
 
Theoremmapfien 9403* A bijection of the base sets induces a bijection on the set of finitely supported functions. (Contributed by Mario Carneiro, 30-May-2015.) (Revised by AV, 3-Jul-2019.) (Revised by AV, 28-Jul-2024.)
𝑆 = {π‘₯ ∈ (𝐡 ↑m 𝐴) ∣ π‘₯ finSupp 𝑍}    &   π‘‡ = {π‘₯ ∈ (𝐷 ↑m 𝐢) ∣ π‘₯ finSupp π‘Š}    &   π‘Š = (πΊβ€˜π‘)    &   (πœ‘ β†’ 𝐹:𝐢–1-1-onto→𝐴)    &   (πœ‘ β†’ 𝐺:𝐡–1-1-onto→𝐷)    &   (πœ‘ β†’ 𝐴 ∈ π‘ˆ)    &   (πœ‘ β†’ 𝐡 ∈ 𝑉)    &   (πœ‘ β†’ 𝐢 ∈ 𝑋)    &   (πœ‘ β†’ 𝐷 ∈ π‘Œ)    &   (πœ‘ β†’ 𝑍 ∈ 𝐡)    β‡’   (πœ‘ β†’ (𝑓 ∈ 𝑆 ↦ (𝐺 ∘ (𝑓 ∘ 𝐹))):𝑆–1-1-onto→𝑇)
 
Theoremmapfien2 9404* Equinumerousity relation for sets of finitely supported functions. (Contributed by Stefan O'Rear, 9-Jul-2015.) (Revised by AV, 7-Jul-2019.)
𝑆 = {π‘₯ ∈ (𝐡 ↑m 𝐴) ∣ π‘₯ finSupp 0 }    &   π‘‡ = {π‘₯ ∈ (𝐷 ↑m 𝐢) ∣ π‘₯ finSupp π‘Š}    &   (πœ‘ β†’ 𝐴 β‰ˆ 𝐢)    &   (πœ‘ β†’ 𝐡 β‰ˆ 𝐷)    &   (πœ‘ β†’ 0 ∈ 𝐡)    &   (πœ‘ β†’ π‘Š ∈ 𝐷)    β‡’   (πœ‘ β†’ 𝑆 β‰ˆ 𝑇)
 
2.4.36  Finite intersections
 
Syntaxcfi 9405 Extend class notation with the function whose value is the class of finite intersections of the elements of a given set.
class fi
 
Definitiondf-fi 9406* Function whose value is the class of finite intersections of the elements of the argument. Note that the empty intersection being the universal class, hence a proper class, it cannot be an element of that class. Therefore, the function value is the class of nonempty finite intersections of elements of the argument (see elfi2 9409). (Contributed by FL, 27-Apr-2008.)
fi = (π‘₯ ∈ V ↦ {𝑧 ∣ βˆƒπ‘¦ ∈ (𝒫 π‘₯ ∩ Fin)𝑧 = ∩ 𝑦})
 
Theoremfival 9407* The set of all the finite intersections of the elements of 𝐴. (Contributed by FL, 27-Apr-2008.) (Revised by Mario Carneiro, 24-Nov-2013.)
(𝐴 ∈ 𝑉 β†’ (fiβ€˜π΄) = {𝑦 ∣ βˆƒπ‘₯ ∈ (𝒫 𝐴 ∩ Fin)𝑦 = ∩ π‘₯})
 
Theoremelfi 9408* Specific properties of an element of (fiβ€˜π΅). (Contributed by FL, 27-Apr-2008.) (Revised by Mario Carneiro, 24-Nov-2013.)
((𝐴 ∈ 𝑉 ∧ 𝐡 ∈ π‘Š) β†’ (𝐴 ∈ (fiβ€˜π΅) ↔ βˆƒπ‘₯ ∈ (𝒫 𝐡 ∩ Fin)𝐴 = ∩ π‘₯))
 
Theoremelfi2 9409* The empty intersection need not be considered in the set of finite intersections. (Contributed by Mario Carneiro, 21-Mar-2015.)
(𝐡 ∈ 𝑉 β†’ (𝐴 ∈ (fiβ€˜π΅) ↔ βˆƒπ‘₯ ∈ ((𝒫 𝐡 ∩ Fin) βˆ– {βˆ…})𝐴 = ∩ π‘₯))
 
Theoremelfir 9410 Sufficient condition for an element of (fiβ€˜π΅). (Contributed by Mario Carneiro, 24-Nov-2013.)
((𝐡 ∈ 𝑉 ∧ (𝐴 βŠ† 𝐡 ∧ 𝐴 β‰  βˆ… ∧ 𝐴 ∈ Fin)) β†’ ∩ 𝐴 ∈ (fiβ€˜π΅))
 
Theoremintrnfi 9411 Sufficient condition for the intersection of the range of a function to be in the set of finite intersections. (Contributed by Mario Carneiro, 30-Aug-2015.)
((𝐡 ∈ 𝑉 ∧ (𝐹:𝐴⟢𝐡 ∧ 𝐴 β‰  βˆ… ∧ 𝐴 ∈ Fin)) β†’ ∩ ran 𝐹 ∈ (fiβ€˜π΅))
 
Theoremiinfi 9412* An indexed intersection of elements of 𝐢 is an element of the finite intersections of 𝐢. (Contributed by Mario Carneiro, 30-Aug-2015.)
((𝐢 ∈ 𝑉 ∧ (βˆ€π‘₯ ∈ 𝐴 𝐡 ∈ 𝐢 ∧ 𝐴 β‰  βˆ… ∧ 𝐴 ∈ Fin)) β†’ ∩ π‘₯ ∈ 𝐴 𝐡 ∈ (fiβ€˜πΆ))
 
Theoreminelfi 9413 The intersection of two sets is a finite intersection. (Contributed by Thierry Arnoux, 6-Jan-2017.)
((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑋 ∧ 𝐡 ∈ 𝑋) β†’ (𝐴 ∩ 𝐡) ∈ (fiβ€˜π‘‹))
 
Theoremssfii 9414 Any element of a set 𝐴 is the intersection of a finite subset of 𝐴. (Contributed by FL, 27-Apr-2008.) (Proof shortened by Mario Carneiro, 21-Mar-2015.)
(𝐴 ∈ 𝑉 β†’ 𝐴 βŠ† (fiβ€˜π΄))
 
Theoremfi0 9415 The set of finite intersections of the empty set. (Contributed by Mario Carneiro, 30-Aug-2015.)
(fiβ€˜βˆ…) = βˆ…
 
Theoremfieq0 9416 A set is empty iff the class of all the finite intersections of that set is empty. (Contributed by FL, 27-Apr-2008.) (Revised by Mario Carneiro, 24-Nov-2013.)
(𝐴 ∈ 𝑉 β†’ (𝐴 = βˆ… ↔ (fiβ€˜π΄) = βˆ…))
 
Theoremfiin 9417 The elements of (fiβ€˜πΆ) are closed under finite intersection. (Contributed by Mario Carneiro, 24-Nov-2013.)
((𝐴 ∈ (fiβ€˜πΆ) ∧ 𝐡 ∈ (fiβ€˜πΆ)) β†’ (𝐴 ∩ 𝐡) ∈ (fiβ€˜πΆ))
 
Theoremdffi2 9418* The set of finite intersections is the smallest set that contains 𝐴 and is closed under pairwise intersection. (Contributed by Mario Carneiro, 24-Nov-2013.)
(𝐴 ∈ 𝑉 β†’ (fiβ€˜π΄) = ∩ {𝑧 ∣ (𝐴 βŠ† 𝑧 ∧ βˆ€π‘₯ ∈ 𝑧 βˆ€π‘¦ ∈ 𝑧 (π‘₯ ∩ 𝑦) ∈ 𝑧)})
 
Theoremfiss 9419 Subset relationship for function fi. (Contributed by Jeff Hankins, 7-Oct-2009.) (Revised by Mario Carneiro, 24-Nov-2013.)
((𝐡 ∈ 𝑉 ∧ 𝐴 βŠ† 𝐡) β†’ (fiβ€˜π΄) βŠ† (fiβ€˜π΅))
 
Theoreminficl 9420* A set which is closed under pairwise intersection is closed under finite intersection. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 24-Nov-2013.)
(𝐴 ∈ 𝑉 β†’ (βˆ€π‘₯ ∈ 𝐴 βˆ€π‘¦ ∈ 𝐴 (π‘₯ ∩ 𝑦) ∈ 𝐴 ↔ (fiβ€˜π΄) = 𝐴))
 
Theoremfipwuni 9421 The set of finite intersections of a set is contained in the powerset of the union of the elements of 𝐴. (Contributed by Mario Carneiro, 24-Nov-2013.) (Proof shortened by Mario Carneiro, 21-Mar-2015.)
(fiβ€˜π΄) βŠ† 𝒫 βˆͺ 𝐴
 
Theoremfisn 9422 A singleton is closed under finite intersections. (Contributed by Mario Carneiro, 3-Sep-2015.)
(fiβ€˜{𝐴}) = {𝐴}
 
Theoremfiuni 9423 The union of the finite intersections of a set is simply the union of the set itself. (Contributed by Jeff Hankins, 5-Sep-2009.) (Revised by Mario Carneiro, 24-Nov-2013.)
(𝐴 ∈ 𝑉 β†’ βˆͺ 𝐴 = βˆͺ (fiβ€˜π΄))
 
Theoremfipwss 9424 If a set is a family of subsets of some base set, then so is its finite intersection. (Contributed by Stefan O'Rear, 2-Aug-2015.)
(𝐴 βŠ† 𝒫 𝑋 β†’ (fiβ€˜π΄) βŠ† 𝒫 𝑋)
 
Theoremelfiun 9425* A finite intersection of elements taken from a union of collections. (Contributed by Jeff Hankins, 15-Nov-2009.) (Proof shortened by Mario Carneiro, 26-Nov-2013.)
((𝐡 ∈ 𝐷 ∧ 𝐢 ∈ 𝐾) β†’ (𝐴 ∈ (fiβ€˜(𝐡 βˆͺ 𝐢)) ↔ (𝐴 ∈ (fiβ€˜π΅) ∨ 𝐴 ∈ (fiβ€˜πΆ) ∨ βˆƒπ‘₯ ∈ (fiβ€˜π΅)βˆƒπ‘¦ ∈ (fiβ€˜πΆ)𝐴 = (π‘₯ ∩ 𝑦))))
 
Theoremdffi3 9426* The set of finite intersections can be "constructed" inductively by iterating binary intersection Ο‰-many times. (Contributed by Mario Carneiro, 21-Mar-2015.)
𝑅 = (𝑒 ∈ V ↦ ran (𝑦 ∈ 𝑒, 𝑧 ∈ 𝑒 ↦ (𝑦 ∩ 𝑧)))    β‡’   (𝐴 ∈ 𝑉 β†’ (fiβ€˜π΄) = βˆͺ (rec(𝑅, 𝐴) β€œ Ο‰))
 
Theoremfifo 9427* Describe a surjection from nonempty finite sets to finite intersections. (Contributed by Mario Carneiro, 18-May-2015.)
𝐹 = (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) βˆ– {βˆ…}) ↦ ∩ 𝑦)    β‡’   (𝐴 ∈ 𝑉 β†’ 𝐹:((𝒫 𝐴 ∩ Fin) βˆ– {βˆ…})–ontoβ†’(fiβ€˜π΄))
 
2.4.37  Hall's marriage theorem
 
Theoremmarypha1lem 9428* Core induction for Philip Hall's marriage theorem. (Contributed by Stefan O'Rear, 19-Feb-2015.)
(𝐴 ∈ Fin β†’ (𝑏 ∈ Fin β†’ βˆ€π‘ ∈ 𝒫 (𝐴 Γ— 𝑏)(βˆ€π‘‘ ∈ 𝒫 𝐴𝑑 β‰Ό (𝑐 β€œ 𝑑) β†’ βˆƒπ‘’ ∈ 𝒫 𝑐𝑒:𝐴–1-1β†’V)))
 
Theoremmarypha1 9429* (Philip) Hall's marriage theorem, sufficiency: a finite relation contains an injection if there is no subset of its domain which would be forced to violate the pigeonhole principle. (Contributed by Stefan O'Rear, 20-Feb-2015.)
(πœ‘ β†’ 𝐴 ∈ Fin)    &   (πœ‘ β†’ 𝐡 ∈ Fin)    &   (πœ‘ β†’ 𝐢 βŠ† (𝐴 Γ— 𝐡))    &   ((πœ‘ ∧ 𝑑 βŠ† 𝐴) β†’ 𝑑 β‰Ό (𝐢 β€œ 𝑑))    β‡’   (πœ‘ β†’ βˆƒπ‘“ ∈ 𝒫 𝐢𝑓:𝐴–1-1→𝐡)
 
Theoremmarypha2lem1 9430* Lemma for marypha2 9434. Properties of the used relation. (Contributed by Stefan O'Rear, 20-Feb-2015.)
𝑇 = βˆͺ π‘₯ ∈ 𝐴 ({π‘₯} Γ— (πΉβ€˜π‘₯))    β‡’   π‘‡ βŠ† (𝐴 Γ— βˆͺ ran 𝐹)
 
Theoremmarypha2lem2 9431* Lemma for marypha2 9434. Properties of the used relation. (Contributed by Stefan O'Rear, 20-Feb-2015.)
𝑇 = βˆͺ π‘₯ ∈ 𝐴 ({π‘₯} Γ— (πΉβ€˜π‘₯))    β‡’   π‘‡ = {⟨π‘₯, π‘¦βŸ© ∣ (π‘₯ ∈ 𝐴 ∧ 𝑦 ∈ (πΉβ€˜π‘₯))}
 
Theoremmarypha2lem3 9432* Lemma for marypha2 9434. Properties of the used relation. (Contributed by Stefan O'Rear, 20-Feb-2015.)
𝑇 = βˆͺ π‘₯ ∈ 𝐴 ({π‘₯} Γ— (πΉβ€˜π‘₯))    β‡’   ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) β†’ (𝐺 βŠ† 𝑇 ↔ βˆ€π‘₯ ∈ 𝐴 (πΊβ€˜π‘₯) ∈ (πΉβ€˜π‘₯)))
 
Theoremmarypha2lem4 9433* Lemma for marypha2 9434. Properties of the used relation. (Contributed by Stefan O'Rear, 20-Feb-2015.)
𝑇 = βˆͺ π‘₯ ∈ 𝐴 ({π‘₯} Γ— (πΉβ€˜π‘₯))    β‡’   ((𝐹 Fn 𝐴 ∧ 𝑋 βŠ† 𝐴) β†’ (𝑇 β€œ 𝑋) = βˆͺ (𝐹 β€œ 𝑋))
 
Theoremmarypha2 9434* Version of marypha1 9429 using a functional family of sets instead of a relation. (Contributed by Stefan O'Rear, 20-Feb-2015.)
(πœ‘ β†’ 𝐴 ∈ Fin)    &   (πœ‘ β†’ 𝐹:𝐴⟢Fin)    &   ((πœ‘ ∧ 𝑑 βŠ† 𝐴) β†’ 𝑑 β‰Ό βˆͺ (𝐹 β€œ 𝑑))    β‡’   (πœ‘ β†’ βˆƒπ‘”(𝑔:𝐴–1-1β†’V ∧ βˆ€π‘₯ ∈ 𝐴 (π‘”β€˜π‘₯) ∈ (πΉβ€˜π‘₯)))
 
2.4.38  Supremum and infimum
 
Syntaxcsup 9435 Extend class notation to include supremum of class 𝐴. Here 𝑅 is ordinarily a relation that strictly orders class 𝐡. For example, 𝑅 could be 'less than' and 𝐡 could be the set of real numbers.
class sup(𝐴, 𝐡, 𝑅)
 
Syntaxcinf 9436 Extend class notation to include infimum of class 𝐴. Here 𝑅 is ordinarily a relation that strictly orders class 𝐡. For example, 𝑅 could be 'less than' and 𝐡 could be the set of real numbers.
class inf(𝐴, 𝐡, 𝑅)
 
Definitiondf-sup 9437* Define the supremum of class 𝐴. It is meaningful when 𝑅 is a relation that strictly orders 𝐡 and when the supremum exists. For example, 𝑅 could be 'less than', 𝐡 could be the set of real numbers, and 𝐴 could be the set of all positive reals whose square is less than 2; in this case the supremum is defined as the square root of 2 per sqrtval 15184. See dfsup2 9439 for alternate definition not requiring dummy variables. (Contributed by NM, 22-May-1999.)
sup(𝐴, 𝐡, 𝑅) = βˆͺ {π‘₯ ∈ 𝐡 ∣ (βˆ€π‘¦ ∈ 𝐴 Β¬ π‘₯𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐡 (𝑦𝑅π‘₯ β†’ βˆƒπ‘§ ∈ 𝐴 𝑦𝑅𝑧))}
 
Definitiondf-inf 9438 Define the infimum of class 𝐴. It is meaningful when 𝑅 is a relation that strictly orders 𝐡 and when the infimum exists. For example, 𝑅 could be 'less than', 𝐡 could be the set of real numbers, and 𝐴 could be the set of all positive reals; in this case the infimum is 0. The infimum is defined as the supremum using the converse ordering relation. In the given example, 0 is the supremum of all reals (greatest real number) for which all positive reals are greater. (Contributed by AV, 2-Sep-2020.)
inf(𝐴, 𝐡, 𝑅) = sup(𝐴, 𝐡, ◑𝑅)
 
Theoremdfsup2 9439 Quantifier-free definition of supremum. (Contributed by Scott Fenton, 19-Feb-2013.)
sup(𝐡, 𝐴, 𝑅) = βˆͺ (𝐴 βˆ– ((◑𝑅 β€œ 𝐡) βˆͺ (𝑅 β€œ (𝐴 βˆ– (◑𝑅 β€œ 𝐡)))))
 
Theoremsupeq1 9440 Equality theorem for supremum. (Contributed by NM, 22-May-1999.)
(𝐡 = 𝐢 β†’ sup(𝐡, 𝐴, 𝑅) = sup(𝐢, 𝐴, 𝑅))
 
Theoremsupeq1d 9441 Equality deduction for supremum. (Contributed by Paul Chapman, 22-Jun-2011.)
(πœ‘ β†’ 𝐡 = 𝐢)    β‡’   (πœ‘ β†’ sup(𝐡, 𝐴, 𝑅) = sup(𝐢, 𝐴, 𝑅))
 
Theoremsupeq1i 9442 Equality inference for supremum. (Contributed by Paul Chapman, 22-Jun-2011.)
𝐡 = 𝐢    β‡’   sup(𝐡, 𝐴, 𝑅) = sup(𝐢, 𝐴, 𝑅)
 
Theoremsupeq2 9443 Equality theorem for supremum. (Contributed by Jeff Madsen, 2-Sep-2009.)
(𝐡 = 𝐢 β†’ sup(𝐴, 𝐡, 𝑅) = sup(𝐴, 𝐢, 𝑅))
 
Theoremsupeq3 9444 Equality theorem for supremum. (Contributed by Scott Fenton, 13-Jun-2018.)
(𝑅 = 𝑆 β†’ sup(𝐴, 𝐡, 𝑅) = sup(𝐴, 𝐡, 𝑆))
 
Theoremsupeq123d 9445 Equality deduction for supremum. (Contributed by Stefan O'Rear, 20-Jan-2015.)
(πœ‘ β†’ 𝐴 = 𝐷)    &   (πœ‘ β†’ 𝐡 = 𝐸)    &   (πœ‘ β†’ 𝐢 = 𝐹)    β‡’   (πœ‘ β†’ sup(𝐴, 𝐡, 𝐢) = sup(𝐷, 𝐸, 𝐹))
 
Theoremnfsup 9446 Hypothesis builder for supremum. (Contributed by Mario Carneiro, 20-Mar-2014.)
β„²π‘₯𝐴    &   β„²π‘₯𝐡    &   β„²π‘₯𝑅    β‡’   β„²π‘₯sup(𝐴, 𝐡, 𝑅)
 
Theoremsupmo 9447* Any class 𝐡 has at most one supremum in 𝐴 (where 𝑅 is interpreted as 'less than'). (Contributed by NM, 5-May-1999.) (Revised by Mario Carneiro, 24-Dec-2016.)
(πœ‘ β†’ 𝑅 Or 𝐴)    β‡’   (πœ‘ β†’ βˆƒ*π‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ π‘₯𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐴 (𝑦𝑅π‘₯ β†’ βˆƒπ‘§ ∈ 𝐡 𝑦𝑅𝑧)))
 
Theoremsupexd 9448 A supremum is a set. (Contributed by NM, 22-May-1999.) (Revised by Mario Carneiro, 24-Dec-2016.)
(πœ‘ β†’ 𝑅 Or 𝐴)    β‡’   (πœ‘ β†’ sup(𝐡, 𝐴, 𝑅) ∈ V)
 
Theoremsupeu 9449* A supremum is unique. Similar to Theorem I.26 of [Apostol] p. 24 (but for suprema in general). (Contributed by NM, 12-Oct-2004.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ π‘₯𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐴 (𝑦𝑅π‘₯ β†’ βˆƒπ‘§ ∈ 𝐡 𝑦𝑅𝑧)))    β‡’   (πœ‘ β†’ βˆƒ!π‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ π‘₯𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐴 (𝑦𝑅π‘₯ β†’ βˆƒπ‘§ ∈ 𝐡 𝑦𝑅𝑧)))
 
Theoremsupval2 9450* Alternate expression for the supremum. (Contributed by Mario Carneiro, 24-Dec-2016.) (Revised by Thierry Arnoux, 24-Sep-2017.)
(πœ‘ β†’ 𝑅 Or 𝐴)    β‡’   (πœ‘ β†’ sup(𝐡, 𝐴, 𝑅) = (β„©π‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ π‘₯𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐴 (𝑦𝑅π‘₯ β†’ βˆƒπ‘§ ∈ 𝐡 𝑦𝑅𝑧))))
 
Theoremeqsup 9451* Sufficient condition for an element to be equal to the supremum. (Contributed by Mario Carneiro, 21-Apr-2015.)
(πœ‘ β†’ 𝑅 Or 𝐴)    β‡’   (πœ‘ β†’ ((𝐢 ∈ 𝐴 ∧ βˆ€π‘¦ ∈ 𝐡 Β¬ 𝐢𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐴 (𝑦𝑅𝐢 β†’ βˆƒπ‘§ ∈ 𝐡 𝑦𝑅𝑧)) β†’ sup(𝐡, 𝐴, 𝑅) = 𝐢))
 
Theoremeqsupd 9452* Sufficient condition for an element to be equal to the supremum. (Contributed by Mario Carneiro, 21-Apr-2015.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ 𝐢 ∈ 𝐴)    &   ((πœ‘ ∧ 𝑦 ∈ 𝐡) β†’ Β¬ 𝐢𝑅𝑦)    &   ((πœ‘ ∧ (𝑦 ∈ 𝐴 ∧ 𝑦𝑅𝐢)) β†’ βˆƒπ‘§ ∈ 𝐡 𝑦𝑅𝑧)    β‡’   (πœ‘ β†’ sup(𝐡, 𝐴, 𝑅) = 𝐢)
 
Theoremsupcl 9453* A supremum belongs to its base class (closure law). See also supub 9454 and suplub 9455. (Contributed by NM, 12-Oct-2004.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ π‘₯𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐴 (𝑦𝑅π‘₯ β†’ βˆƒπ‘§ ∈ 𝐡 𝑦𝑅𝑧)))    β‡’   (πœ‘ β†’ sup(𝐡, 𝐴, 𝑅) ∈ 𝐴)
 
Theoremsupub 9454* A supremum is an upper bound. See also supcl 9453 and suplub 9455.

This proof demonstrates how to expand an iota-based definition (df-iota 6496) using riotacl2 7382.

(Contributed by NM, 12-Oct-2004.) (Proof shortened by Mario Carneiro, 24-Dec-2016.)

(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ π‘₯𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐴 (𝑦𝑅π‘₯ β†’ βˆƒπ‘§ ∈ 𝐡 𝑦𝑅𝑧)))    β‡’   (πœ‘ β†’ (𝐢 ∈ 𝐡 β†’ Β¬ sup(𝐡, 𝐴, 𝑅)𝑅𝐢))
 
Theoremsuplub 9455* A supremum is the least upper bound. See also supcl 9453 and supub 9454. (Contributed by NM, 13-Oct-2004.) (Revised by Mario Carneiro, 24-Dec-2016.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ π‘₯𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐴 (𝑦𝑅π‘₯ β†’ βˆƒπ‘§ ∈ 𝐡 𝑦𝑅𝑧)))    β‡’   (πœ‘ β†’ ((𝐢 ∈ 𝐴 ∧ 𝐢𝑅sup(𝐡, 𝐴, 𝑅)) β†’ βˆƒπ‘§ ∈ 𝐡 𝐢𝑅𝑧))
 
Theoremsuplub2 9456* Bidirectional form of suplub 9455. (Contributed by Mario Carneiro, 6-Sep-2014.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ π‘₯𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐴 (𝑦𝑅π‘₯ β†’ βˆƒπ‘§ ∈ 𝐡 𝑦𝑅𝑧)))    &   (πœ‘ β†’ 𝐡 βŠ† 𝐴)    β‡’   ((πœ‘ ∧ 𝐢 ∈ 𝐴) β†’ (𝐢𝑅sup(𝐡, 𝐴, 𝑅) ↔ βˆƒπ‘§ ∈ 𝐡 𝐢𝑅𝑧))
 
Theoremsupnub 9457* An upper bound is not less than the supremum. (Contributed by NM, 13-Oct-2004.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ π‘₯𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐴 (𝑦𝑅π‘₯ β†’ βˆƒπ‘§ ∈ 𝐡 𝑦𝑅𝑧)))    β‡’   (πœ‘ β†’ ((𝐢 ∈ 𝐴 ∧ βˆ€π‘§ ∈ 𝐡 Β¬ 𝐢𝑅𝑧) β†’ Β¬ 𝐢𝑅sup(𝐡, 𝐴, 𝑅)))
 
Theoremsupex 9458 A supremum is a set. (Contributed by NM, 22-May-1999.)
𝑅 Or 𝐴    β‡’   sup(𝐡, 𝐴, 𝑅) ∈ V
 
Theoremsup00 9459 The supremum under an empty base set is always the empty set. (Contributed by AV, 4-Sep-2020.)
sup(𝐡, βˆ…, 𝑅) = βˆ…
 
Theoremsup0riota 9460* The supremum of an empty set is the smallest element of the base set. (Contributed by AV, 4-Sep-2020.)
(𝑅 Or 𝐴 β†’ sup(βˆ…, 𝐴, 𝑅) = (β„©π‘₯ ∈ 𝐴 βˆ€π‘¦ ∈ 𝐴 Β¬ 𝑦𝑅π‘₯))
 
Theoremsup0 9461* The supremum of an empty set under a base set which has a unique smallest element is the smallest element of the base set. (Contributed by AV, 4-Sep-2020.)
((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ βˆ€π‘¦ ∈ 𝐴 Β¬ 𝑦𝑅𝑋) ∧ βˆƒ!π‘₯ ∈ 𝐴 βˆ€π‘¦ ∈ 𝐴 Β¬ 𝑦𝑅π‘₯) β†’ sup(βˆ…, 𝐴, 𝑅) = 𝑋)
 
Theoremsupmax 9462* The greatest element of a set is its supremum. Note that the converse is not true; the supremum might not be an element of the set considered. (Contributed by Jeff Hoffman, 17-Jun-2008.) (Proof shortened by OpenAI, 30-Mar-2020.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ 𝐢 ∈ 𝐴)    &   (πœ‘ β†’ 𝐢 ∈ 𝐡)    &   ((πœ‘ ∧ 𝑦 ∈ 𝐡) β†’ Β¬ 𝐢𝑅𝑦)    β‡’   (πœ‘ β†’ sup(𝐡, 𝐴, 𝑅) = 𝐢)
 
Theoremfisup2g 9463* A finite set satisfies the conditions to have a supremum. (Contributed by Mario Carneiro, 28-Apr-2015.)
((𝑅 Or 𝐴 ∧ (𝐡 ∈ Fin ∧ 𝐡 β‰  βˆ… ∧ 𝐡 βŠ† 𝐴)) β†’ βˆƒπ‘₯ ∈ 𝐡 (βˆ€π‘¦ ∈ 𝐡 Β¬ π‘₯𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐴 (𝑦𝑅π‘₯ β†’ βˆƒπ‘§ ∈ 𝐡 𝑦𝑅𝑧)))
 
Theoremfisupcl 9464 A nonempty finite set contains its supremum. (Contributed by Jeff Madsen, 9-May-2011.)
((𝑅 Or 𝐴 ∧ (𝐡 ∈ Fin ∧ 𝐡 β‰  βˆ… ∧ 𝐡 βŠ† 𝐴)) β†’ sup(𝐡, 𝐴, 𝑅) ∈ 𝐡)
 
Theoremsupgtoreq 9465 The supremum of a finite set is greater than or equal to all the elements of the set. (Contributed by AV, 1-Oct-2019.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ 𝐡 βŠ† 𝐴)    &   (πœ‘ β†’ 𝐡 ∈ Fin)    &   (πœ‘ β†’ 𝐢 ∈ 𝐡)    &   (πœ‘ β†’ 𝑆 = sup(𝐡, 𝐴, 𝑅))    β‡’   (πœ‘ β†’ (𝐢𝑅𝑆 ∨ 𝐢 = 𝑆))
 
Theoremsuppr 9466 The supremum of a pair. (Contributed by NM, 17-Jun-2007.) (Proof shortened by Mario Carneiro, 24-Dec-2016.)
((𝑅 Or 𝐴 ∧ 𝐡 ∈ 𝐴 ∧ 𝐢 ∈ 𝐴) β†’ sup({𝐡, 𝐢}, 𝐴, 𝑅) = if(𝐢𝑅𝐡, 𝐡, 𝐢))
 
Theoremsupsn 9467 The supremum of a singleton. (Contributed by NM, 2-Oct-2007.)
((𝑅 Or 𝐴 ∧ 𝐡 ∈ 𝐴) β†’ sup({𝐡}, 𝐴, 𝑅) = 𝐡)
 
Theoremsupisolem 9468* Lemma for supiso 9470. (Contributed by Mario Carneiro, 24-Dec-2016.)
(πœ‘ β†’ 𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐡))    &   (πœ‘ β†’ 𝐢 βŠ† 𝐴)    β‡’   ((πœ‘ ∧ 𝐷 ∈ 𝐴) β†’ ((βˆ€π‘¦ ∈ 𝐢 Β¬ 𝐷𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐴 (𝑦𝑅𝐷 β†’ βˆƒπ‘§ ∈ 𝐢 𝑦𝑅𝑧)) ↔ (βˆ€π‘€ ∈ (𝐹 β€œ 𝐢) Β¬ (πΉβ€˜π·)𝑆𝑀 ∧ βˆ€π‘€ ∈ 𝐡 (𝑀𝑆(πΉβ€˜π·) β†’ βˆƒπ‘£ ∈ (𝐹 β€œ 𝐢)𝑀𝑆𝑣))))
 
Theoremsupisoex 9469* Lemma for supiso 9470. (Contributed by Mario Carneiro, 24-Dec-2016.)
(πœ‘ β†’ 𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐡))    &   (πœ‘ β†’ 𝐢 βŠ† 𝐴)    &   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐢 Β¬ π‘₯𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐴 (𝑦𝑅π‘₯ β†’ βˆƒπ‘§ ∈ 𝐢 𝑦𝑅𝑧)))    β‡’   (πœ‘ β†’ βˆƒπ‘’ ∈ 𝐡 (βˆ€π‘€ ∈ (𝐹 β€œ 𝐢) Β¬ 𝑒𝑆𝑀 ∧ βˆ€π‘€ ∈ 𝐡 (𝑀𝑆𝑒 β†’ βˆƒπ‘£ ∈ (𝐹 β€œ 𝐢)𝑀𝑆𝑣)))
 
Theoremsupiso 9470* Image of a supremum under an isomorphism. (Contributed by Mario Carneiro, 24-Dec-2016.)
(πœ‘ β†’ 𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐡))    &   (πœ‘ β†’ 𝐢 βŠ† 𝐴)    &   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐢 Β¬ π‘₯𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐴 (𝑦𝑅π‘₯ β†’ βˆƒπ‘§ ∈ 𝐢 𝑦𝑅𝑧)))    &   (πœ‘ β†’ 𝑅 Or 𝐴)    β‡’   (πœ‘ β†’ sup((𝐹 β€œ 𝐢), 𝐡, 𝑆) = (πΉβ€˜sup(𝐢, 𝐴, 𝑅)))
 
Theoreminfeq1 9471 Equality theorem for infimum. (Contributed by AV, 2-Sep-2020.)
(𝐡 = 𝐢 β†’ inf(𝐡, 𝐴, 𝑅) = inf(𝐢, 𝐴, 𝑅))
 
Theoreminfeq1d 9472 Equality deduction for infimum. (Contributed by AV, 2-Sep-2020.)
(πœ‘ β†’ 𝐡 = 𝐢)    β‡’   (πœ‘ β†’ inf(𝐡, 𝐴, 𝑅) = inf(𝐢, 𝐴, 𝑅))
 
Theoreminfeq1i 9473 Equality inference for infimum. (Contributed by AV, 2-Sep-2020.)
𝐡 = 𝐢    β‡’   inf(𝐡, 𝐴, 𝑅) = inf(𝐢, 𝐴, 𝑅)
 
Theoreminfeq2 9474 Equality theorem for infimum. (Contributed by AV, 2-Sep-2020.)
(𝐡 = 𝐢 β†’ inf(𝐴, 𝐡, 𝑅) = inf(𝐴, 𝐢, 𝑅))
 
Theoreminfeq3 9475 Equality theorem for infimum. (Contributed by AV, 2-Sep-2020.)
(𝑅 = 𝑆 β†’ inf(𝐴, 𝐡, 𝑅) = inf(𝐴, 𝐡, 𝑆))
 
Theoreminfeq123d 9476 Equality deduction for infimum. (Contributed by AV, 2-Sep-2020.)
(πœ‘ β†’ 𝐴 = 𝐷)    &   (πœ‘ β†’ 𝐡 = 𝐸)    &   (πœ‘ β†’ 𝐢 = 𝐹)    β‡’   (πœ‘ β†’ inf(𝐴, 𝐡, 𝐢) = inf(𝐷, 𝐸, 𝐹))
 
Theoremnfinf 9477 Hypothesis builder for infimum. (Contributed by AV, 2-Sep-2020.)
β„²π‘₯𝐴    &   β„²π‘₯𝐡    &   β„²π‘₯𝑅    β‡’   β„²π‘₯inf(𝐴, 𝐡, 𝑅)
 
Theoreminfexd 9478 An infimum is a set. (Contributed by AV, 2-Sep-2020.)
(πœ‘ β†’ 𝑅 Or 𝐴)    β‡’   (πœ‘ β†’ inf(𝐡, 𝐴, 𝑅) ∈ V)
 
Theoremeqinf 9479* Sufficient condition for an element to be equal to the infimum. (Contributed by AV, 2-Sep-2020.)
(πœ‘ β†’ 𝑅 Or 𝐴)    β‡’   (πœ‘ β†’ ((𝐢 ∈ 𝐴 ∧ βˆ€π‘¦ ∈ 𝐡 Β¬ 𝑦𝑅𝐢 ∧ βˆ€π‘¦ ∈ 𝐴 (𝐢𝑅𝑦 β†’ βˆƒπ‘§ ∈ 𝐡 𝑧𝑅𝑦)) β†’ inf(𝐡, 𝐴, 𝑅) = 𝐢))
 
Theoremeqinfd 9480* Sufficient condition for an element to be equal to the infimum. (Contributed by AV, 3-Sep-2020.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ 𝐢 ∈ 𝐴)    &   ((πœ‘ ∧ 𝑦 ∈ 𝐡) β†’ Β¬ 𝑦𝑅𝐢)    &   ((πœ‘ ∧ (𝑦 ∈ 𝐴 ∧ 𝐢𝑅𝑦)) β†’ βˆƒπ‘§ ∈ 𝐡 𝑧𝑅𝑦)    β‡’   (πœ‘ β†’ inf(𝐡, 𝐴, 𝑅) = 𝐢)
 
Theoreminfval 9481* Alternate expression for the infimum. (Contributed by AV, 2-Sep-2020.)
(πœ‘ β†’ 𝑅 Or 𝐴)    β‡’   (πœ‘ β†’ inf(𝐡, 𝐴, 𝑅) = (β„©π‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ 𝑦𝑅π‘₯ ∧ βˆ€π‘¦ ∈ 𝐴 (π‘₯𝑅𝑦 β†’ βˆƒπ‘§ ∈ 𝐡 𝑧𝑅𝑦))))
 
Theoreminfcllem 9482* Lemma for infcl 9483, inflb 9484, infglb 9485, etc. (Contributed by AV, 3-Sep-2020.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ 𝑦𝑅π‘₯ ∧ βˆ€π‘¦ ∈ 𝐴 (π‘₯𝑅𝑦 β†’ βˆƒπ‘§ ∈ 𝐡 𝑧𝑅𝑦)))    β‡’   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ π‘₯◑𝑅𝑦 ∧ βˆ€π‘¦ ∈ 𝐴 (𝑦◑𝑅π‘₯ β†’ βˆƒπ‘§ ∈ 𝐡 𝑦◑𝑅𝑧)))
 
Theoreminfcl 9483* An infimum belongs to its base class (closure law). See also inflb 9484 and infglb 9485. (Contributed by AV, 3-Sep-2020.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ 𝑦𝑅π‘₯ ∧ βˆ€π‘¦ ∈ 𝐴 (π‘₯𝑅𝑦 β†’ βˆƒπ‘§ ∈ 𝐡 𝑧𝑅𝑦)))    β‡’   (πœ‘ β†’ inf(𝐡, 𝐴, 𝑅) ∈ 𝐴)
 
Theoreminflb 9484* An infimum is a lower bound. See also infcl 9483 and infglb 9485. (Contributed by AV, 3-Sep-2020.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ 𝑦𝑅π‘₯ ∧ βˆ€π‘¦ ∈ 𝐴 (π‘₯𝑅𝑦 β†’ βˆƒπ‘§ ∈ 𝐡 𝑧𝑅𝑦)))    β‡’   (πœ‘ β†’ (𝐢 ∈ 𝐡 β†’ Β¬ 𝐢𝑅inf(𝐡, 𝐴, 𝑅)))
 
Theoreminfglb 9485* An infimum is the greatest lower bound. See also infcl 9483 and inflb 9484. (Contributed by AV, 3-Sep-2020.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ 𝑦𝑅π‘₯ ∧ βˆ€π‘¦ ∈ 𝐴 (π‘₯𝑅𝑦 β†’ βˆƒπ‘§ ∈ 𝐡 𝑧𝑅𝑦)))    β‡’   (πœ‘ β†’ ((𝐢 ∈ 𝐴 ∧ inf(𝐡, 𝐴, 𝑅)𝑅𝐢) β†’ βˆƒπ‘§ ∈ 𝐡 𝑧𝑅𝐢))
 
Theoreminfglbb 9486* Bidirectional form of infglb 9485. (Contributed by AV, 3-Sep-2020.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ 𝑦𝑅π‘₯ ∧ βˆ€π‘¦ ∈ 𝐴 (π‘₯𝑅𝑦 β†’ βˆƒπ‘§ ∈ 𝐡 𝑧𝑅𝑦)))    &   (πœ‘ β†’ 𝐡 βŠ† 𝐴)    β‡’   ((πœ‘ ∧ 𝐢 ∈ 𝐴) β†’ (inf(𝐡, 𝐴, 𝑅)𝑅𝐢 ↔ βˆƒπ‘§ ∈ 𝐡 𝑧𝑅𝐢))
 
Theoreminfnlb 9487* A lower bound is not greater than the infimum. (Contributed by AV, 3-Sep-2020.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ 𝑦𝑅π‘₯ ∧ βˆ€π‘¦ ∈ 𝐴 (π‘₯𝑅𝑦 β†’ βˆƒπ‘§ ∈ 𝐡 𝑧𝑅𝑦)))    β‡’   (πœ‘ β†’ ((𝐢 ∈ 𝐴 ∧ βˆ€π‘§ ∈ 𝐡 Β¬ 𝑧𝑅𝐢) β†’ Β¬ inf(𝐡, 𝐴, 𝑅)𝑅𝐢))
 
Theoreminfex 9488 An infimum is a set. (Contributed by AV, 3-Sep-2020.)
𝑅 Or 𝐴    β‡’   inf(𝐡, 𝐴, 𝑅) ∈ V
 
Theoreminfmin 9489* The smallest element of a set is its infimum. Note that the converse is not true; the infimum might not be an element of the set considered. (Contributed by AV, 3-Sep-2020.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ 𝐢 ∈ 𝐴)    &   (πœ‘ β†’ 𝐢 ∈ 𝐡)    &   ((πœ‘ ∧ 𝑦 ∈ 𝐡) β†’ Β¬ 𝑦𝑅𝐢)    β‡’   (πœ‘ β†’ inf(𝐡, 𝐴, 𝑅) = 𝐢)
 
Theoreminfmo 9490* Any class 𝐡 has at most one infimum in 𝐴 (where 𝑅 is interpreted as 'less than'). (Contributed by AV, 6-Oct-2020.)
(πœ‘ β†’ 𝑅 Or 𝐴)    β‡’   (πœ‘ β†’ βˆƒ*π‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ 𝑦𝑅π‘₯ ∧ βˆ€π‘¦ ∈ 𝐴 (π‘₯𝑅𝑦 β†’ βˆƒπ‘§ ∈ 𝐡 𝑧𝑅𝑦)))
 
Theoreminfeu 9491* An infimum is unique. (Contributed by AV, 6-Oct-2020.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ 𝑦𝑅π‘₯ ∧ βˆ€π‘¦ ∈ 𝐴 (π‘₯𝑅𝑦 β†’ βˆƒπ‘§ ∈ 𝐡 𝑧𝑅𝑦)))    β‡’   (πœ‘ β†’ βˆƒ!π‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐡 Β¬ 𝑦𝑅π‘₯ ∧ βˆ€π‘¦ ∈ 𝐴 (π‘₯𝑅𝑦 β†’ βˆƒπ‘§ ∈ 𝐡 𝑧𝑅𝑦)))
 
Theoremfimin2g 9492* A finite set has a minimum under a total order. (Contributed by AV, 6-Oct-2020.)
((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 β‰  βˆ…) β†’ βˆƒπ‘₯ ∈ 𝐴 βˆ€π‘¦ ∈ 𝐴 Β¬ 𝑦𝑅π‘₯)
 
Theoremfiming 9493* A finite set has a minimum under a total order. (Contributed by AV, 6-Oct-2020.)
((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 β‰  βˆ…) β†’ βˆƒπ‘₯ ∈ 𝐴 βˆ€π‘¦ ∈ 𝐴 (π‘₯ β‰  𝑦 β†’ π‘₯𝑅𝑦))
 
Theoremfiinfg 9494* Lemma showing existence and closure of infimum of a finite set. (Contributed by AV, 6-Oct-2020.)
((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 β‰  βˆ…) β†’ βˆƒπ‘₯ ∈ 𝐴 (βˆ€π‘¦ ∈ 𝐴 Β¬ 𝑦𝑅π‘₯ ∧ βˆ€π‘¦ ∈ 𝐴 (π‘₯𝑅𝑦 β†’ βˆƒπ‘§ ∈ 𝐴 𝑧𝑅𝑦)))
 
Theoremfiinf2g 9495* A finite set satisfies the conditions to have an infimum. (Contributed by AV, 6-Oct-2020.)
((𝑅 Or 𝐴 ∧ (𝐡 ∈ Fin ∧ 𝐡 β‰  βˆ… ∧ 𝐡 βŠ† 𝐴)) β†’ βˆƒπ‘₯ ∈ 𝐡 (βˆ€π‘¦ ∈ 𝐡 Β¬ 𝑦𝑅π‘₯ ∧ βˆ€π‘¦ ∈ 𝐴 (π‘₯𝑅𝑦 β†’ βˆƒπ‘§ ∈ 𝐡 𝑧𝑅𝑦)))
 
Theoremfiinfcl 9496 A nonempty finite set contains its infimum. (Contributed by AV, 3-Sep-2020.)
((𝑅 Or 𝐴 ∧ (𝐡 ∈ Fin ∧ 𝐡 β‰  βˆ… ∧ 𝐡 βŠ† 𝐴)) β†’ inf(𝐡, 𝐴, 𝑅) ∈ 𝐡)
 
Theoreminfltoreq 9497 The infimum of a finite set is less than or equal to all the elements of the set. (Contributed by AV, 4-Sep-2020.)
(πœ‘ β†’ 𝑅 Or 𝐴)    &   (πœ‘ β†’ 𝐡 βŠ† 𝐴)    &   (πœ‘ β†’ 𝐡 ∈ Fin)    &   (πœ‘ β†’ 𝐢 ∈ 𝐡)    &   (πœ‘ β†’ 𝑆 = inf(𝐡, 𝐴, 𝑅))    β‡’   (πœ‘ β†’ (𝑆𝑅𝐢 ∨ 𝐢 = 𝑆))
 
Theoreminfpr 9498 The infimum of a pair. (Contributed by AV, 4-Sep-2020.)
((𝑅 Or 𝐴 ∧ 𝐡 ∈ 𝐴 ∧ 𝐢 ∈ 𝐴) β†’ inf({𝐡, 𝐢}, 𝐴, 𝑅) = if(𝐡𝑅𝐢, 𝐡, 𝐢))
 
Theoreminfsupprpr 9499 The infimum of a proper pair is less than the supremum of this pair. (Contributed by AV, 13-Mar-2023.)
((𝑅 Or 𝐴 ∧ (𝐡 ∈ 𝐴 ∧ 𝐢 ∈ 𝐴 ∧ 𝐡 β‰  𝐢)) β†’ inf({𝐡, 𝐢}, 𝐴, 𝑅)𝑅sup({𝐡, 𝐢}, 𝐴, 𝑅))
 
Theoreminfsn 9500 The infimum of a singleton. (Contributed by NM, 2-Oct-2007.)
((𝑅 Or 𝐴 ∧ 𝐡 ∈ 𝐴) β†’ inf({𝐡}, 𝐴, 𝑅) = 𝐡)
    < Previous  Next >

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-42900 430 42901-43000 431 43001-43100 432 43101-43200 433 43201-43300 434 43301-43400 435 43401-43500 436 43501-43600 437 43601-43700 438 43701-43800 439 43801-43900 440 43901-44000 441 44001-44100 442 44101-44200 443 44201-44300 444 44301-44400 445 44401-44500 446 44501-44600 447 44601-44700 448 44701-44800 449 44801-44900 450 44901-45000 451 45001-45100 452 45101-45200 453 45201-45300 454 45301-45400 455 45401-45500 456 45501-45600 457 45601-45700 458 45701-45800 459 45801-45900 460 45901-46000 461 46001-46100 462 46101-46200 463 46201-46300 464 46301-46400 465 46401-46500 466 46501-46600 467 46601-46700 468 46701-46800 469 46801-46900 470 46901-47000 471 47001-47100 472 47101-47200 473 47201-47300 474 47301-47400 475 47401-47500 476 47501-47600 477 47601-47700 478 47701-47800 479 47801-47852
  Copyright terms: Public domain < Previous  Next >