Home Metamath Proof ExplorerTheorem List (p. 423 of 424) < 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-27159) Hilbert Space Explorer (27160-28684) Users' Mathboxes (28685-42360)

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

Theorem0dig1 42201 The 0 th digit of 1 is 1 in any positional system. (Contributed by AV, 28-May-2020.)
(𝐵 ∈ (ℤ‘2) → (0(digit‘𝐵)1) = 1)

Theorem0dig2pr01 42202 The integers 0 and 1 correspond to their last bit. (Contributed by AV, 28-May-2010.)
(𝑁 ∈ {0, 1} → (0(digit‘2)𝑁) = 𝑁)

Theoremdig2nn0 42203 A digit of a nonnegative integer 𝑁 in a binary system is either 0 or 1. (Contributed by AV, 24-May-2020.)
((𝑁 ∈ ℕ0𝐾 ∈ ℤ) → (𝐾(digit‘2)𝑁) ∈ {0, 1})

Theorem0dig2nn0e 42204 The last bit of an even integer is 0. (Contributed by AV, 3-Jun-2010.)
((𝑁 ∈ ℕ0 ∧ (𝑁 / 2) ∈ ℕ0) → (0(digit‘2)𝑁) = 0)

Theorem0dig2nn0o 42205 The last bit of an odd integer is 1. (Contributed by AV, 3-Jun-2010.)
((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → (0(digit‘2)𝑁) = 1)

Theoremdig2bits 42206 The 𝐾 th digit of a nonnegative integer 𝑁 in a binary system is its 𝐾 th bit. (Contributed by AV, 24-May-2020.)
((𝑁 ∈ ℕ0𝐾 ∈ ℕ0) → ((𝐾(digit‘2)𝑁) = 1 ↔ 𝐾 ∈ (bits‘𝑁)))

21.34.15.11  Nonnegative integer as sum of its shifted digits

Theoremdignn0flhalflem1 42207 Lemma 1 for dignn0flhalf 42210. (Contributed by AV, 7-Jun-2012.)
((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ) → (⌊‘((𝐴 / (2↑𝑁)) − 1)) < (⌊‘((𝐴 − 1) / (2↑𝑁))))

Theoremdignn0flhalflem2 42208 Lemma 2 for dignn0flhalf 42210. (Contributed by AV, 7-Jun-2012.)
((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ0) → (⌊‘(𝐴 / (2↑(𝑁 + 1)))) = (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))))

Theoremdignn0ehalf 42209 The digits of the half of an even nonnegative integer are the digits of the integer shifted by 1. (Contributed by AV, 3-Jun-2010.)
(((𝐴 / 2) ∈ ℕ0𝐴 ∈ ℕ0𝐼 ∈ ℕ0) → ((𝐼 + 1)(digit‘2)𝐴) = (𝐼(digit‘2)(𝐴 / 2)))

Theoremdignn0flhalf 42210 The digits of the rounded half of a nonnegative integer are the digits of the integer shifted by 1. (Contributed by AV, 7-Jun-2010.)
((𝐴 ∈ (ℤ‘2) ∧ 𝐼 ∈ ℕ0) → ((𝐼 + 1)(digit‘2)𝐴) = (𝐼(digit‘2)(⌊‘(𝐴 / 2))))

Theoremnn0sumshdiglemA 42211* Lemma for nn0sumshdig 42215 (induction step, even multiplier). (Contributed by AV, 3-Jun-2020.)
(((𝑎 ∈ ℕ ∧ (𝑎 / 2) ∈ ℕ) ∧ 𝑦 ∈ ℕ) → (∀𝑥 ∈ ℕ0 ((#b𝑥) = 𝑦𝑥 = Σ𝑘 ∈ (0..^𝑦)((𝑘(digit‘2)𝑥) · (2↑𝑘))) → ((#b𝑎) = (𝑦 + 1) → 𝑎 = Σ𝑘 ∈ (0..^(𝑦 + 1))((𝑘(digit‘2)𝑎) · (2↑𝑘)))))

Theoremnn0sumshdiglemB 42212* Lemma for nn0sumshdig 42215 (induction step, odd multiplier). (Contributed by AV, 7-Jun-2020.)
(((𝑎 ∈ ℕ ∧ ((𝑎 − 1) / 2) ∈ ℕ0) ∧ 𝑦 ∈ ℕ) → (∀𝑥 ∈ ℕ0 ((#b𝑥) = 𝑦𝑥 = Σ𝑘 ∈ (0..^𝑦)((𝑘(digit‘2)𝑥) · (2↑𝑘))) → ((#b𝑎) = (𝑦 + 1) → 𝑎 = Σ𝑘 ∈ (0..^(𝑦 + 1))((𝑘(digit‘2)𝑎) · (2↑𝑘)))))

Theoremnn0sumshdiglem1 42213* Lemma 1 for nn0sumshdig 42215 (induction step). (Contributed by AV, 7-Jun-2020.)
(𝑦 ∈ ℕ → (∀𝑎 ∈ ℕ0 ((#b𝑎) = 𝑦𝑎 = Σ𝑘 ∈ (0..^𝑦)((𝑘(digit‘2)𝑎) · (2↑𝑘))) → ∀𝑎 ∈ ℕ0 ((#b𝑎) = (𝑦 + 1) → 𝑎 = Σ𝑘 ∈ (0..^(𝑦 + 1))((𝑘(digit‘2)𝑎) · (2↑𝑘)))))

Theoremnn0sumshdiglem2 42214* Lemma 2 for nn0sumshdig 42215. (Contributed by AV, 7-Jun-2020.)
(𝐿 ∈ ℕ → ∀𝑎 ∈ ℕ0 ((#b𝑎) = 𝐿𝑎 = Σ𝑘 ∈ (0..^𝐿)((𝑘(digit‘2)𝑎) · (2↑𝑘))))

Theoremnn0sumshdig 42215* A nonnegative integer can be represented as sum of its shifted bits. (Contributed by AV, 7-Jun-2020.)
(𝐴 ∈ ℕ0𝐴 = Σ𝑘 ∈ (0..^(#b𝐴))((𝑘(digit‘2)𝐴) · (2↑𝑘)))

21.34.15.12  Algorithms for the multiplication of nonnegative integers

Theoremnn0mulfsum 42216* Trivial algorithm to calculate the product of two nonnegative integers 𝑎 and 𝑏 by adding up 𝑏 𝑎 times. (Contributed by AV, 17-May-2020.)
((𝐴 ∈ ℕ0𝐵 ∈ ℕ0) → (𝐴 · 𝐵) = Σ𝑘 ∈ (1...𝐴)𝐵)

Theoremnn0mullong 42217* Standard algorithm (also known as "long multiplication" or "grade-school multiplication") to calculate the product of two nonnegative integers 𝑎 and 𝑏 by multiplying the multiplicand 𝑏 by each digit of the multiplier 𝑎 and then add up all the properly shifted results. Here, the binary representation of the multiplier 𝑎 is used, i.e. the above mentioned "digits" are 0 or 1. This is a similar result as provided by smumul 15053. (Contributed by AV, 7-Jun-2020.)
((𝐴 ∈ ℕ0𝐵 ∈ ℕ0) → (𝐴 · 𝐵) = Σ𝑘 ∈ (0..^(#b𝐴))(((𝑘(digit‘2)𝐴) · (2↑𝑘)) · 𝐵))

21.35  Mathbox for Emmett Weisz

21.35.1  Miscellaneous Theorems

Some of these theorems are used in the series of lemmas and theorems proving the defining properties of setrecs.

Theoremnfintd 42218 Bound-variable hypothesis builder for intersection. (Contributed by Emmett Weisz, 16-Jan-2020.)
(𝜑𝑥𝐴)       (𝜑𝑥 𝐴)

Theoremnfiund 42219 Bound-variable hypothesis builder for indexed union. (Contributed by Emmett Weisz, 6-Dec-2019.)
𝑥𝜑    &   (𝜑𝑦𝐴)    &   (𝜑𝑦𝐵)       (𝜑𝑦 𝑥𝐴 𝐵)

Theoremiunord 42220* The indexed union of a collection of ordinal numbers 𝐵(𝑥) is ordinal. This proof is based on the proof of ssorduni 6877, but does not use it directly, since ssorduni 6877 does not work when 𝐵 is a proper class. (Contributed by Emmett Weisz, 3-Nov-2019.)
(∀𝑥𝐴 Ord 𝐵 → Ord 𝑥𝐴 𝐵)

Theoremiunordi 42221* The indexed union of a collection of ordinal numbers 𝐵(𝑥) is ordinal. (Contributed by Emmett Weisz, 3-Nov-2019.)
Ord 𝐵       Ord 𝑥𝐴 𝐵

Theoremrspcdf 42222* Restricted specialization, using implicit substitution. (Contributed by Emmett Weisz, 16-Jan-2020.)
𝑥𝜑    &   𝑥𝜒    &   (𝜑𝐴𝐵)    &   ((𝜑𝑥 = 𝐴) → (𝜓𝜒))       (𝜑 → (∀𝑥𝐵 𝜓𝜒))

Theoremspd 42223 Specialization deduction, using implicit substitution. Based on the proof of spimed 2243. (Contributed by Emmett Weisz, 17-Jan-2020.)
(𝜒 → Ⅎ𝑥𝜓)    &   (𝑥 = 𝑦 → (𝜑𝜓))       (𝜒 → (∀𝑥𝜑𝜓))

Theoremspcdvw 42224* A version of spcdv 3264 where 𝜓 and 𝜒 are direct substitutions of each other. This theorem is useful because it does not require 𝜑 and 𝑥 to be distinct variables. (Contributed by Emmett Weisz, 12-Apr-2020.)
(𝜑𝐴𝐵)    &   (𝑥 = 𝐴 → (𝜓𝜒))       (𝜑 → (∀𝑥𝜓𝜒))

Theoremtfis2d 42225* Transfinite Induction Schema, using implicit substitution. (Contributed by Emmett Weisz, 3-May-2020.)
(𝜑 → (𝑥 = 𝑦 → (𝜓𝜒)))    &   (𝜑 → (𝑥 ∈ On → (∀𝑦𝑥 𝜒𝜓)))       (𝜑 → (𝑥 ∈ On → 𝜓))

Theorembnd2d 42226* Deduction form of bnd2 8639. (Contributed by Emmett Weisz, 19-Jan-2021.)
(𝜑𝐴 ∈ V)    &   (𝜑 → ∀𝑥𝐴𝑦𝐵 𝜓)       (𝜑 → ∃𝑧(𝑧𝐵 ∧ ∀𝑥𝐴𝑦𝑧 𝜓))

Theoremdffun3f 42227* Alternate definition of function, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Emmett Weisz, 14-Mar-2021.)
𝑥𝐴    &   𝑦𝐴    &   𝑧𝐴       (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥𝑧𝑦(𝑥𝐴𝑦𝑦 = 𝑧)))

Theoremssdifsn 42228 Subset of a set with an element removed. (Contributed by Emmett Weisz, 7-Jul-2021.)
(𝐴 ⊆ (𝐵 ∖ {𝐶}) ↔ (𝐴𝐵 ∧ ¬ 𝐶𝐴))

21.35.2  Set Recursion

21.35.2.1  Basic Properties of Set Recursion

Symbols in this section:

All the symbols used in the definition of setrecs(𝐹) are explained in the comment of df-setrecs 42230. The class 𝑌 is explained in the comment of setrec1lem1 42233. Glossaries of symbols used in individual proofs, or used differently in different proofs, are in the comments of those proofs.

Syntaxcsetrecs 42229 Extend class notation to include a set defined by transfinite recursion.
class setrecs(𝐹)

Definitiondf-setrecs 42230* Define a class setrecs(𝐹) by transfinite recursion, where (𝐹𝑥) is the set of new elements to add to the class given the set 𝑥 of elements in the class so far. We do not need a base case, because we can start with the empty set, which is vacuously a subset of setrecs(𝐹). The goal of this definition is to construct a class fulfilling theorems setrec1 42237 and setrec2v 42242, which give a more intuitive idea of the meaning of setrecs. Unlike wrecs, setrecs is well-defined for any 𝐹 and meaningful for any function 𝐹.

For example, see theorem onsetrec 42250 for how the class On is defined recursively using the successor function.

The definition works by building subsets of the desired class and taking the union of those subsets. To find such a collection of subsets, consider an arbitrary set 𝑧, and consider the result when applying 𝐹 to any subset 𝑤𝑧. Remember that 𝐹 can be any function, and in general we are interested in functions that give outputs that are larger than their inputs, so we have no reason to expect the outputs to be within 𝑧. However, if we restrict the domain of 𝐹 to a given set 𝑦, the resulting range will be a set. Therefore, with this restricted 𝐹, it makes sense to consider sets 𝑧 that are closed under 𝐹 applied to its subsets. Now we can test whether a given set 𝑦 is recursively generated by 𝐹. If every set 𝑧 that is closed under 𝐹 contains 𝑦, that means that every member of 𝑦 must eventually be generated by 𝐹. On the other hand, if some such 𝑧 does not contain a certain element of 𝑦, then that element can be avoided even if we apply 𝐹 in every possible way to previously generated elements.

Note that such an omitted element might be eventually recursively generated by 𝐹, but not through the elements of 𝑦. In this case, 𝑦 would fail the condition in the definition, but the omitted element would still be included in some larger 𝑦. For example, if 𝐹 is the successor function, the set {∅, 2𝑜} would fail the condition since 2𝑜 is not an element of the successor of or {∅}. Remember that we are applying 𝐹 to subsets of 𝑦, not elements of 𝑦. In fact, even the set {1𝑜} fails the condition, since the only subset of previously generated elements is , and suc ∅ does not have 1𝑜 as an element. However, we can let 𝑦 be any ordinal, since each of its elements is generated by starting with and repeatedly applying the successor function.

A similar definition I initially used for setrecs(𝐹) was setrecs(𝐹) = ran recs((𝑔 ∈ V ↦ (𝐹 ran 𝑔))). I had initially tried and failed to find an elementary definition, and I had proven theorems analogous to setrec1 42237 and setrec2v 42242 using the old definition before I found the new one. I decided to change definitions for two reasons. First, as John Conway noted in the Appendix to Part Zero of ONAG, mathematicians should not be caught up in any particular formalization, such as ZF set theory. Instead, they should work under whatever framework best suits the problem, and the formal bases used for different problems can be shown to be equivalent. Thus, Conway preferred defining surreal numbers as equivalence classes of surreal number forms, rather than sign-expansions. Although sign-expansions are easier to implement in ZF set theory, Conway argued that "formalisation within some particular axiomatic set theory is irrelevant." Furthermore, one of the most remarkable properties of the theory of surreal numbers is that it generates so much from almost nothing. Using sign-expansions as the formal definition destroys the beauty of surreal numbers, because ordinals are already built in. For this reason, I replaced the old definition of setrecs, which also relied heavily on ordinal numbers. On the other hand, both surreal numbers and the elementary definition of setrecs immediately generate the ordinal numbers from a (relatively) very simple set-theoretical basis.

Second, although it is still complicated to formalize the theory of recursively generated sets within ZF set theory, it is actually simpler and more natural to do so with set theory directly than with the theory of ordinal numbers. As Conway wrote, indexing the "birthdays" of sets is and should be unnecessary. Using an elementary definition for setrecs removes the reliance on the previously developed theory of ordinal numbers, allowing proofs to be simpler and more direct.

Formalizing surreal numbers within metamath is probably still not in the spirit of Conway. He said that "attempts to force arbitrary theories into a single formal straitjacket... produce unnecessarily cumbrous and inelegant contortions." Nevertheless, metamath has proven to be much more versatile than it seems at first, and I think the theory of surreal numbers can be natural while fitting well into the metamath framework.

The difficulty in writing a definition in metamath for setrecs(𝐹) is that the necessary properties to prove are self-referential (see setrec1 42237 and setrec2v 42242), so we cannot simply write the properties we want inside a class abstraction as with most definitions. As noted in the comment of df-rdg 7393, this is not actually a requirement of the metamath language, but we would like to be able to eliminate all definitions by direct mechanical substitution.

We cannot define setrecs using a class abstraction directly, because nothing about its individual elements tells us whether they are in the set. We need to know about previous elements first. One way of getting around this problem without indexing is by defining setrecs(𝐹) as a union or intersection of suitable sets. Thus, instead of using a class abstraction for the elements of setrecs(𝐹), which seems to be impossible, we can use a class abstraction for supersets or subsets of setrecs(𝐹), which "know" about multiple individual elements at a time.

Note that we cannot define setrecs(𝐹) as an intersection of sets, because in general it is a proper class, so any supersets would also be proper classes. However, a proper class can be a union of sets, as long as the collection of such sets is a proper class. Therefore, it is feasible to define setrecs(𝐹) as a union of a class abstraction.

If setrecs(𝐹) = 𝐴, the elements of A must be subsets of setrecs(𝐹) which together include everything recursively generated by 𝐹. We can do this by letting 𝐴 be the class of sets 𝑥 whose elements are all recursively generated by 𝐹.

One necessary condition is that each element of a given 𝑥𝐴 must be generated by 𝐹 when applied to a previous element 𝑦𝐴. In symbols, 𝑥𝐴𝑦𝐴(𝑦𝑥𝑥 ⊆ (𝐹𝑦))}. However, this is not sufficient. All fixed points 𝑥 of 𝐹 will satisfy this condition whether they should be in setrecs(𝐹) or not. If we replace the subset relation with the proper subset relation, 𝑥 cannot be the empty set, even though the empty set should be in 𝐴. Therefore this condition cannot be used in the definition, even if we can find a way to avoid making it circular.

A better strategy is to find a necessary and sufficient condition for all the elements of a set 𝑦𝐴 to be generated by 𝐹 when applied only to sets of previously generated elements within 𝑦. For example, taking 𝐹 to be the successor function, we can let 𝐴 = On rather than 𝒫 On, and we will still have 𝐴 = On as required. This gets rid of the circularity of the definition, since we should have a condition to test whether a given set 𝑦 is in 𝐴 without knowing about any of the other elements of 𝐴.

The definition I ended up using accomplishes this using induction: 𝐴 is defined as the class of sets 𝑦 for which a sort of induction on the elements of 𝑦 holds. However, when creating a definition for setrecs that did not rely on ordinal numbers, I tried at first to write a definition using the well-founded relation predicate, Fr. I thought that this would be simple to do once I found a suitable definition using induction, just as the least- element principle is equivalent to induction on the positive integers. If we let 𝑅 = {⟨𝑎, 𝑏⟩ ∣ (𝐹𝑎) ⊆ 𝑏}, then (𝑅 Fr 𝐴 ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥¬ (𝐹𝑧) ⊆ 𝑦)).

On 22-Jul-2020 I came up with the following definition (Version 1) phrased in terms of induction: {𝑦 ∣ ∀𝑧 (∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ∈ 𝑧)) → 𝑦𝑧)}

In Aug-2020 I came up with an equivalent definition with the goal of phrasing it in terms of the relation Fr. It is the contrapositive of the previous one with 𝑧 replaced by its complement. {𝑦 ∣ ∀𝑧 (𝑦𝑧 → ∃𝑤(𝑤𝑦 ∧ (𝐹𝑤) ∈ 𝑧 ∧ ¬ 𝑤𝑧))}

These definitions didn't work because the induction didn't "get off the ground." If 𝑧 does not contain the empty set, the condition (∀𝑤...𝑦𝑧 fails, so 𝑦 = ∅ doesn't get included in 𝐴 even though it should. This could be fixed by adding the base case as a separate requirement, but the subtler problem would remain that rather than a set of "acceptable" sets, what we really need is a collection 𝑧 of all individuals that have been generated so far. So one approach is to replace every occurence of 𝑧 with 𝑧, making 𝑧 a set of individuals rather than a family of sets. That solves this problem, but it complicates the foundedness version of the definition, which looked cleaner in Version 1.

There was another problem with Version 1. If we let 𝐹 be the power set function, then the induction in the inductive version works for 𝑧 being the class of transitive sets, restricted to subsets of 𝑦. Therefore, 𝑦 must be transitive by definition of 𝑧. This doesn't affect the union of all such 𝑦, but it may or may not be desirable. The problem is that 𝐹 is only applied to transitive sets, because of the strong requirement 𝑤𝑧, so the definition requires the additional constraint (𝑎𝑏 → (𝐹 a ) C_ ( F 𝑏)) in order to work. This issue can also be avoided by replacing 𝑧 with 𝑧. The induction version of the result is used in the final definition.

Version 2: (18-Aug-2020) Induction: {𝑦 ∣ ∀𝑧 (∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)} Foundedness: {𝑦 ∣ ∀𝑧(𝑦𝑧 ≠ ∅ → 𝑤(𝑤𝑦𝑤𝑧 = ∅ ∧ (𝐹𝑤) ∩ 𝑧 ≠ ∅))}

In the induction version, not only does 𝑧 include all the elements of 𝑦, but it must include the elements of (𝐹𝑤) for 𝑤 ⊆ (𝑦𝑧) even if those elements of (𝐹𝑤) are not in 𝑦. We shouldn't care about any of the elements of 𝑧 outside 𝑦, but this detail doesn't affect the correctness of the definition. If we replaced (𝐹𝑤) in the definition by ((𝐹𝑤) ∩ 𝑦), we would get the same class for setrecs(𝐹). Suppose we could find a 𝑧 for which the condition fails for a given 𝑦 under the changed definition. Then the antecedent would be true, but 𝑦𝑧 would be false. We could then simply add all elements of (𝐹𝑤) outside of 𝑦 for any 𝑤𝑦, which we can do because all the classes involved are sets. This is not trivial and requires the axioms of union, power set, and replacement. However, the expanded 𝑧 fails the condition under the metamath definition. The other direction is easier. If a certain 𝑧 fails the metamath definition, then all (𝐹𝑤) ⊆ 𝑧 for 𝑤 ⊆ (𝑦𝑧), and in particular ((𝐹𝑤) ∩ 𝑦) ⊆ 𝑧.

The foundedness version is starting to look more like ax-reg 8380! We want to take advantage of the preexisting relation Fr, which seems closely related to our foundedness definition. Since we only care about the elements of 𝑧 which are subsets of 𝑦, we can restrict 𝑧 to 𝑦 in the foundedness definition. Furthermore, instead of quantifying over 𝑤, quantify over the elements 𝑣𝑧 overlapping with 𝑤. Versions 3, 4, and 5 are all equivalent to Version 2.

Version 3 - Foundedness (5-Sep-2020): {𝑦 ∣ ∀𝑧((𝑧𝑦𝑧 ≠ ∅) → ∃𝑣𝑧𝑤(𝑤𝑦𝑤𝑧 = ∅ ∧ 𝑣 ∈ (𝐹𝑤)))}

Now, if we replace (𝐹𝑤) by ((𝐹𝑤) ∩ 𝑦), we do not change the definition. We already know that 𝑣𝑦 since 𝑣𝑧 and 𝑧𝑦. All we need to show in order to prove that this change leads to an equivalent definition is to find

To make our definition look exactly like df-fr 4997, we add another variable 𝑢 representing the nonexistent element of 𝑤 in 𝑧.

Version 4 - Foundedness (6-Sep-2020): {𝑦 ∣ ∀𝑧((𝑧𝑦𝑧 ≠ ∅) → 𝑣𝑧𝑤𝑢𝑧(𝑤𝑦 ∧ ¬ 𝑢𝑤𝑣 ∈ (𝐹𝑤))

This is so close to df-fr 4997; the only change needed is to switch 𝑤 with 𝑢𝑧. Unfortunately, I couldn't find any way to switch the quantifiers without interfering with the definition. Maybe there is a definition equivalent to this one that uses Fr, but I couldn't find one. Yet, we can still find a remarkable similarity between Foundedness Version 2 and ax-reg 8380. Rather than a disjoint element of 𝑧, there's a disjoint coverer of an element of 𝑧.

Finally, here's a different dead end I followed:

To clean up our foundedness definition, we keep 𝑧 as a family of sets 𝑦 but allow 𝑤 to be any subset of 𝑧 in the induction. With this stronger induction, we can also allow for the stronger requirement 𝒫 𝑦𝑧 rather than only 𝑦𝑧. This will help improve the foundedness version.

Version 1.1 (28-Aug-2020) Induction: {𝑦 ∣ ∀𝑧(∀𝑤 (𝑤𝑦 → (𝑤 𝑧 → (𝐹𝑤) ∈ 𝑧)) → 𝒫 𝑦𝑧)} Foundedness: {𝑦 ∣ ∀𝑧(∃𝑎(𝑎𝑦𝑎𝑧) → ∃𝑤(𝑤𝑦𝑤 𝑧 = ∅ ∧ (𝐹𝑤) ∈ 𝑧))}

( Edit (Aug 31) - this isn't true! Nothing forces the subset of an element of 𝑧 to be in 𝑧. Version 2 does not have this issue. )

Similarly, we could allow 𝑤 to be any subset of any element of 𝑧 rather than any subset of 𝑧. I think this has the same problem.

We want to take advantage of the preexisting relation Fr, which seems closely related to our foundedness definition. Since we only care about the elements of 𝑧 which are subsets of 𝑦, we can restrict 𝑧 to 𝒫 𝑦 in the foundedness definition:

Version 1.2 (31-Aug-2020) Foundedness: {𝑦 ∣ ∀𝑧((𝑧 ⊆ 𝒫 𝑦𝑧 ≠ ∅) → ∃𝑤(𝑤 ∈ 𝒫 𝑦𝑤 𝑧 = ∅ ∧ (𝐹𝑤) ∈ 𝑧))}

Now this looks more like df-fr 4997! The last step necessary to be able to use Fr directly in our definition is to replace (𝐹𝑤) with its own setvar variable, corresponding to 𝑦 in df-fr 4997.

This definition is incorrect, though, since there's nothing forcing the subset of an element of 𝑧 to be in 𝑧.

Version 1.3 (31-Aug-2020) Induction: {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤 𝑧 → (𝑤𝑧 ∧ (𝐹𝑤) ∈ 𝑧))) → 𝒫 𝑦𝑧)} Foundedness: {𝑦 ∣ ∀𝑧((𝑧 ⊆ 𝒫 𝑦𝑧 ≠ ∅) → ∃𝑤(𝑤 ∈ 𝒫 𝑦 𝑤 𝑧 = ∅ ∧ (𝑤𝑧 ∨ (𝐹𝑤) ∈ 𝑧)))}

𝑧 must contain the supersets of each of its elements in the foundedness version, and we can't make any restrictions on 𝑧 or 𝐹, so this doesn't work.

Let's try letting R be the covering relation 𝑅 = {⟨𝑎, 𝑏⟩ ∣ 𝑏 ∈ (𝐹𝑎)} to solve the transitivity issue (i.e. that if 𝐹 is the power set relation, 𝐴 consists only of transitive sets). The set (𝐹𝑤) corresponds to the variable 𝑦 in df-fr 4997. Thus, in our case, df-fr 4997 is equivalent to (𝑅 Fr 𝐴 ↔ ∀𝑧((𝑧𝐴𝑧 ≠ ∅) → ∃𝑤((𝐹𝑤) ∈ 𝑧 ∧ ¬ ∃𝑣𝑧𝑣𝑅(𝐹𝑤))). Substituting our relation 𝑅 gives (𝑅 Fr 𝐴 ↔ ∀𝑧((𝑧𝐴𝑧 ≠ ∅) → 𝑤((𝐹𝑤) ∈ 𝑧 ∧ ¬ ∃𝑣𝑧(𝐹𝑤) ∈ (𝐹𝑣)))

This doesn't work for non-injective 𝐹 because we need all 𝑧 to be straddlers, but we don't necessarily need all-straddlers; loops within z are fine for non-injective F.

Consider the foundedness form of Version 1. We want to show ¬ 𝑤𝑧 ↔ ∀𝑣𝑧¬ 𝑣𝑅(𝐹𝑤) so we can replace one with the other. Negate both sides: 𝑤𝑧 ↔ ∃𝑣𝑧𝑣𝑅(𝐹𝑤)

If 𝐹 is injective, then we should be able to pick a suitable R, being careful about the above problem for some F (for example z = transitivity) when changing the antecedent y e. z' to z =/= (/). If we're clever, we can get rid of the injectivity requirement. The forward direction of the above equivalence always holds, but the key is that although the backwards direction doesn't hold in general, we can always find some z' where it doesn't work for 𝑤 itself. If there exists a z' where the version with the w condition fails, then there exists a z' where the version with the v condition also fails. However, Version 1 is not a correct definition, so this doesn't work either. (Contributed by Emmett Weisz, 18-Aug-2020.) (New usage is discouraged.)

setrecs(𝐹) = {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}

Theoremsetrecseq 42231 Equality theorem for set recursion. (Contributed by Emmett Weisz, 17-Feb-2021.)
(𝐹 = 𝐺 → setrecs(𝐹) = setrecs(𝐺))

Theoremnfsetrecs 42232 Bound-variable hypothesis builder for setrecs. (Contributed by Emmett Weisz, 21-Oct-2021.)
𝑥𝐹       𝑥setrecs(𝐹)

Theoremsetrec1lem1 42233* Lemma for setrec1 42237. This is a utility theorem showing the equivalence of the statement 𝑋𝑌 and its expanded form. The proof uses elabg 3320 and equivalence theorems.

Variable 𝑌 is the class of sets 𝑦 that are recursively generated by the function 𝐹. In other words, 𝑦𝑌 iff by starting with the empty set and repeatedly applying 𝐹 to subsets 𝑤 of our set, we will eventually generate all the elements of 𝑌. In this theorem, 𝑋 is any element of 𝑌, and 𝑉 is any class. (Contributed by Emmett Weisz, 16-Oct-2020.) (New usage is discouraged.)

𝑌 = {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}    &   (𝜑𝑋𝑉)       (𝜑 → (𝑋𝑌 ↔ ∀𝑧(∀𝑤(𝑤𝑋 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑋𝑧)))

Theoremsetrec1lem2 42234* Lemma for setrec1 42237. If a family of sets are all recursively generated by 𝐹, so is their union. In this theorem, 𝑋 is a family of sets which are all elements of 𝑌, and 𝑉 is any class. Use dfss3 3558, equivalence and equality theorems, and unissb at the end. Sandwich with applications of setrec1lem1. (Contributed by Emmett Weisz, 24-Jan-2021.) (New usage is discouraged.)
𝑌 = {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}    &   (𝜑𝑋𝑉)    &   (𝜑𝑋𝑌)       (𝜑 𝑋𝑌)

Theoremsetrec1lem3 42235* Lemma for setrec1 42237. If each element 𝑎 of 𝐴 is covered by a set 𝑥 recursively generated by 𝐹, then there is a single such set covering all of 𝐴. The set is constructed explicitly using setrec1lem2 42234. It turns out that 𝑥 = 𝐴 also works, i.e., given the hypotheses it is possible to prove that 𝐴𝑌. I don't know if proving this fact directly using setrec1lem1 42233 would be any easier than the current proof using setrec1lem2 42234, and it would only slightly simplify the proof of setrec1 42237. Other than the use of bnd2d 42226, this is a purely technical theorem for rearranging notation from that of setrec1lem2 42234 to that of setrec1 42237. (Contributed by Emmett Weisz, 20-Jan-2021.) (New usage is discouraged.)
𝑌 = {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}    &   (𝜑𝐴 ∈ V)    &   (𝜑 → ∀𝑎𝐴𝑥(𝑎𝑥𝑥𝑌))       (𝜑 → ∃𝑥(𝐴𝑥𝑥𝑌))

Theoremsetrec1lem4 42236* Lemma for setrec1 42237. If 𝑋 is recursively generated by 𝐹, then so is 𝑋 ∪ (𝐹𝐴).

In the proof of setrec1 42237, the following is substituted for this theorem's 𝜑: (𝜑 ∧ (𝐴𝑥𝑥 ∈ {𝑦 ∣ ∀𝑧(∀𝑤 (𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)})) Therefore, we cannot declare 𝑧 to be a distinct variable from 𝜑, since we need it to appear as a bound variable in 𝜑. This theorem can be proven without the hypothesis 𝑧𝜑, but the proof would be harder to read because theorems in deduction form would be interrupted by theorems like eximi 1752, making the antecedent of each line something more complicated than 𝜑. The proof of setrec1lem2 42234 could similarly be made easier to read by adding the hypothesis 𝑧𝜑, but I had already finished the proof and decided to leave it as is. (Contributed by Emmett Weisz, 26-Nov-2020.) (New usage is discouraged.)

𝑧𝜑    &   𝑌 = {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}    &   (𝜑𝐴 ∈ V)    &   (𝜑𝐴𝑋)    &   (𝜑𝑋𝑌)       (𝜑 → (𝑋 ∪ (𝐹𝐴)) ∈ 𝑌)

Theoremsetrec1 42237 This is the first of two fundamental theorems about set recursion from which all other facts will be derived. It states that the class setrecs(𝐹) is closed under 𝐹. This effectively sets the actual value of setrecs(𝐹) as a lower bound for setrecs(𝐹), as it implies that any set generated by successive applications of 𝐹 is a member of 𝐵. This theorem "gets off the ground" because we can start by letting 𝐴 = ∅, and the hypotheses of the theorem will hold trivially.

Variable 𝐵 represents an abbreviation of setrecs(𝐹) or another name of setrecs(𝐹) (for an example of the latter, see theorem setrecon).

Proof summary: Assume that 𝐴𝐵, meaning that all elements of 𝐴 are in some set recursively generated by 𝐹. Then by setrec1lem3 42235, 𝐴 is a subset of some set recursively generated by 𝐹. (It turns out that 𝐴 itself is recursively generated by 𝐹, but we don't need this fact. See the comment to setrec1lem3 42235.) Therefore, by setrec1lem4 42236, (𝐹𝐴) is a subset of some set recursively generated by 𝐹. Thus, by ssuni 4395, it is a subset of the union of all sets recursively generated by 𝐹.

See df-setrecs 42230 for a detailed description of how the setrecs definition works.

(Contributed by Emmett Weisz, 9-Oct-2020.)

𝐵 = setrecs(𝐹)    &   (𝜑𝐴 ∈ V)    &   (𝜑𝐴𝐵)       (𝜑 → (𝐹𝐴) ⊆ 𝐵)

Theoremsetrec2fun 42238* This is the second of two fundamental theorems about set recursion from which all other facts will be derived. It states that the class setrecs(𝐹) is a subclass of all classes 𝐶 that are closed under 𝐹. Taken together, theorems setrec1 42237 and setrec2v 42242 say that setrecs(𝐹) is the minimal class closed under 𝐹.

We express this by saying that if 𝐹 respects the relation and 𝐶 is closed under 𝐹, then 𝐵𝐶. By substituting strategically constructed classes for 𝐶, we can easily prove many useful properties. Although this theorem cannot show equality between 𝐵 and 𝐶, if we intend to prove equality between 𝐵 and some particular class (such as On), we first apply this theorem, then the relevant induction theorem (such as tfi 6945) to the other class.

(Contributed by Emmett Weisz, 15-Feb-2021.) (New usage is discouraged.)

𝑎𝐹    &   𝐵 = setrecs(𝐹)    &   Fun 𝐹    &   (𝜑 → ∀𝑎(𝑎𝐶 → (𝐹𝑎) ⊆ 𝐶))       (𝜑𝐵𝐶)

Theoremsetrec2lem1 42239* Lemma for setrec2 42241. The functional part of 𝐹 has the same values as 𝐹. (Contributed by Emmett Weisz, 4-Mar-2021.) (New usage is discouraged.)
((𝐹 ↾ {𝑥 ∣ ∃!𝑦 𝑥𝐹𝑦})‘𝑎) = (𝐹𝑎)

Theoremsetrec2lem2 42240* Lemma for setrec2 42241. The functional part of 𝐹 is a function. (Contributed by Emmett Weisz, 6-Mar-2021.) (New usage is discouraged.)
Fun (𝐹 ↾ {𝑥 ∣ ∃!𝑦 𝑥𝐹𝑦})

Theoremsetrec2 42241* This is the second of two fundamental theorems about set recursion from which all other facts will be derived. It states that the class setrecs(𝐹) is a subclass of all classes 𝐶 that are closed under 𝐹. Taken together, theorems setrec1 42237 and setrec2v 42242 uniquely determine setrecs(𝐹) to be the minimal class closed under 𝐹.

We express this by saying that if 𝐹 respects the relation and 𝐶 is closed under 𝐹, then 𝐵𝐶. By substituting strategically constructed classes for 𝐶, we can easily prove many useful properties. Although this theorem cannot show equality between 𝐵 and 𝐶, if we intend to prove equality between 𝐵 and some particular class (such as On), we first apply this theorem, then the relevant induction theorem (such as tfi 6945) to the other class.

(Contributed by Emmett Weisz, 2-Sep-2021.)

𝑎𝐹    &   𝐵 = setrecs(𝐹)    &   (𝜑 → ∀𝑎(𝑎𝐶 → (𝐹𝑎) ⊆ 𝐶))       (𝜑𝐵𝐶)

Theoremsetrec2v 42242* Version of setrec2 42241 with a dv condition instead of a non-freeness hypothesis. (Contributed by Emmett Weisz, 6-Mar-2021.)
𝐵 = setrecs(𝐹)    &   (𝜑 → ∀𝑎(𝑎𝐶 → (𝐹𝑎) ⊆ 𝐶))       (𝜑𝐵𝐶)

21.35.2.2  Examples and properties of set recursion

Theoremelsetrecslem 42243* Lemma for elsetrecs 42244. Any element of setrecs(𝐹) is generated by some subset of setrecs(𝐹). This is much weaker than setrec2v 42242. To see why this lemma also requires setrec1 42237, consider what would happen if we replaced 𝐵 with {𝐴}. The antecedent would still hold, but the consequent would fail in general. Consider dispensing with the deduction form. (Contributed by Emmett Weisz, 11-Jul-2021.) (New usage is discouraged.)
𝐵 = setrecs(𝐹)       (𝐴𝐵 → ∃𝑥(𝑥𝐵𝐴 ∈ (𝐹𝑥)))

Theoremelsetrecs 42244* A set 𝐴 is an element of setrecs(𝐹) iff 𝐴 is generated by some subset of setrecs(𝐹). The proof requires both setrec1 42237 and setrec2 42241, but this theorem is not strong enough to uniquely determine setrecs(𝐹). If 𝐹 respects the subset relation, the theorem still holds if both occurrences of are replaced by for a stronger version of the theorem. (Contributed by Emmett Weisz, 12-Jul-2021.)
𝐵 = setrecs(𝐹)       (𝐴𝐵 ↔ ∃𝑥(𝑥𝐵𝐴 ∈ (𝐹𝑥)))

Theoremvsetrec 42245 Construct V using set recursion. The proof indirectly uses trcl 8487, which relies on rec, but theoretically 𝐶 in trcl 8487 could be constructed using setrecs instead. The proof of this theorem uses the dummy variable 𝑎 rather than 𝑥 to avoid a distinct variable requirement between 𝐹 and 𝑥. (Contributed by Emmett Weisz, 23-Jun-2021.)
𝐹 = (𝑥 ∈ V ↦ 𝒫 𝑥)       setrecs(𝐹) = V

Theorem0setrec 42246 If a function sends the empty set to itself, the function will not recursively generate any sets, regardless of its other values. (Contributed by Emmett Weisz, 23-Jun-2021.)
(𝜑 → (𝐹‘∅) = ∅)       (𝜑 → setrecs(𝐹) = ∅)

Theoremonsetreclem1 42247* Lemma for onsetrec 42250. (Contributed by Emmett Weisz, 22-Jun-2021.) (New usage is discouraged.)
𝐹 = (𝑥 ∈ V ↦ { 𝑥, suc 𝑥})       (𝐹𝑎) = { 𝑎, suc 𝑎}

Theoremonsetreclem2 42248* Lemma for onsetrec 42250. (Contributed by Emmett Weisz, 22-Jun-2021.) (New usage is discouraged.)
𝐹 = (𝑥 ∈ V ↦ { 𝑥, suc 𝑥})       (𝑎 ⊆ On → (𝐹𝑎) ⊆ On)

Theoremonsetreclem3 42249* Lemma for onsetrec 42250. (Contributed by Emmett Weisz, 22-Jun-2021.) (New usage is discouraged.)
𝐹 = (𝑥 ∈ V ↦ { 𝑥, suc 𝑥})       (𝑎 ∈ On → 𝑎 ∈ (𝐹𝑎))

Theoremonsetrec 42250 Construct On using set recursion. When 𝑥 ∈ On, the function 𝐹 constructs the least ordinal greater than any of the elements of 𝑥, which is 𝑥 for a limit ordinal and suc 𝑥 for a successor ordinal.

For example, (𝐹‘{1𝑜, 2𝑜}) = { {1𝑜, 2𝑜}, suc {1𝑜, 2𝑜}} = {2𝑜, 3𝑜} which contains 3𝑜, and (𝐹‘ω) = { ω, suc ω} = {ω, ω +𝑜 1𝑜}, which contains ω. If we start with the empty set and keep applying 𝐹 transfinitely many times, all ordinal numbers will be generated.

Any function 𝐹 fulfilling lemmas onsetreclem2 42248 and onsetreclem3 42249 will recursively generate On; for example, 𝐹 = (𝑥 ∈ V ↦ suc suc 𝑥}) also works. Whether this function or the function in the theorem is used, taking this theorem as a definition of On is unsatisfying because it relies on the different properties of limit and successor ordinals. A different approach could be to let 𝐹 = (𝑥 ∈ V ↦ {𝑦 ∈ 𝒫 𝑥 ∣ Tr 𝑦}), based on dfon2 30941.

The proof of this theorem uses the dummy variable 𝑎 rather than 𝑥 to avoid a distinct variable condition between 𝐹 and 𝑥. (Contributed by Emmett Weisz, 22-Jun-2021.)

𝐹 = (𝑥 ∈ V ↦ { 𝑥, suc 𝑥})       setrecs(𝐹) = On

21.35.3  Construction of Games and Surreal Numbers

Model organization after organization of reals - see TOC

Syntaxcpg 42251 Extend class notation to include the class of partizan game forms.
class Pg

Definitiondf-pg 42252 Define the class of partizan games. More precisely, this is the class of partizan game forms, many of which represent equal partisan games. In metamath, equality between partizan games is represented by a different equivalence relation than class equality. (Contributed by Emmett Weisz, 22-Aug-2021.)
Pg = setrecs((𝑥 ∈ V ↦ (𝒫 𝑥 × 𝒫 𝑥)))

Theoremelpglem1 42253* Lemma for elpg 42256. (Contributed by Emmett Weisz, 28-Aug-2021.)
(∃𝑥(𝑥 ⊆ Pg ∧ ((1st𝐴) ∈ 𝒫 𝑥 ∧ (2nd𝐴) ∈ 𝒫 𝑥)) → ((1st𝐴) ⊆ Pg ∧ (2nd𝐴) ⊆ Pg))

Theoremelpglem2 42254* Lemma for elpg 42256. (Contributed by Emmett Weisz, 28-Aug-2021.)
(((1st𝐴) ⊆ Pg ∧ (2nd𝐴) ⊆ Pg) → ∃𝑥(𝑥 ⊆ Pg ∧ ((1st𝐴) ∈ 𝒫 𝑥 ∧ (2nd𝐴) ∈ 𝒫 𝑥)))

Theoremelpglem3 42255* Lemma for elpg 42256. (Contributed by Emmett Weisz, 28-Aug-2021.)
(∃𝑥(𝑥 ⊆ Pg ∧ 𝐴 ∈ ((𝑦 ∈ V ↦ (𝒫 𝑦 × 𝒫 𝑦))‘𝑥)) ↔ (𝐴 ∈ (V × V) ∧ ∃𝑥(𝑥 ⊆ Pg ∧ ((1st𝐴) ∈ 𝒫 𝑥 ∧ (2nd𝐴) ∈ 𝒫 𝑥))))

Theoremelpg 42256 Membership in the class of partizan games. In ONAG this is stated as "If 𝐿 and 𝑅 are any two sets of games, then there is a game {𝐿𝑅}. All games are constructed in this way." The first sentence corresponds to the backward direction of our theorem, and the second to the forward direction. (Contributed by Emmett Weisz, 27-Aug-2021.)
(𝐴 ∈ Pg ↔ (𝐴 ∈ (V × V) ∧ (1st𝐴) ⊆ Pg ∧ (2nd𝐴) ⊆ Pg))

21.36  Mathbox for David A. Wheeler

This is the mathbox of David A. Wheeler, dwheeler at dwheeler dot com. Among other things, I have added a number of formal definitions for widely-used functions, e.g., those defined in ISO 80000-2:2009(E) Quantities and units - Part 2: Mathematical signs and symbols used in the natural sciences and technology and the NIST Digital Library of Mathematical Functions http://dlmf.nist.gov/.

21.36.1  Natural deduction

Theorem19.8ad 42257 If a wff is true, it is true for at least one instance. Deductive form of 19.8a 2039. (Contributed by DAW, 13-Feb-2017.)
(𝜑𝜓)       (𝜑 → ∃𝑥𝜓)

Theoremsbidd 42258 An identity theorem for substitution. See sbid 2100. See Remark 9.1 in [Megill] p. 447 (p. 15 of the preprint). (Contributed by DAW, 18-Feb-2017.)
(𝜑 → [𝑥 / 𝑥]𝜓)       (𝜑𝜓)

Theoremsbidd-misc 42259 An identity theorem for substitution. See sbid 2100. See Remark 9.1 in [Megill] p. 447 (p. 15 of the preprint). (Contributed by DAW, 18-Feb-2017.)
((𝜑 → [𝑥 / 𝑥]𝜓) ↔ (𝜑𝜓))

21.36.2  Greater than, greater than or equal to.

As a stylistic issue, set.mm prefers 'less than' instead of 'greater than' to reduce the number of conversion steps. Here we formally define the widely-used relations 'greater than' and 'greater than or equal to', so that we have formal definitions of them, as well as a few related theorems.

Syntaxcge-real 42260 Extend wff notation to include the 'greater than or equal to' relation, see df-gte 42262.
class

Syntaxcgt 42261 Extend wff notation to include the 'greater than' relation, see df-gt 42263.
class >

Definitiondf-gte 42262 Define the 'greater than or equal' predicate over the reals. Defined in ISO 80000-2:2009(E) operation 2-7.10. It is used as a primitive in the "NIST Digital Library of Mathematical Functions" , front introduction, "Common Notations and Definitions" section at http://dlmf.nist.gov/front/introduction#Sx4. This relation is merely the converse of the 'less than or equal to' relation defined by df-le 9959.

We do not write this as (𝑥𝑦𝑦𝑥), and similarly we do not write ` > ` as (𝑥 > 𝑦𝑦 < 𝑥), because these are not definitional axioms as understood by mmj2 (those definitions will be flagged as being "potentially non-conservative"). We could write them this way: > = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) ∧ 𝑦 < 𝑥)} and ≥ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) ∧ 𝑦𝑥)} but these are very complicated. This definition of , and the similar one for > (df-gt 42263), are a bit strange when you see them for the first time, but these definitions are much simpler for us to process and are clearly conservative definitions. (My thanks to Mario Carneiro for pointing out this simpler approach.) See gte-lte 42264 for a more conventional expression of the relationship between < and >. As a stylistic issue, set.mm prefers 'less than' instead of 'greater than' to reduce the number of conversion steps. Thus, we discourage its use, but include its definition so that there is a formal definition of this symbol.

(Contributed by David A. Wheeler, 10-May-2015.) (New usage is discouraged.)

≥ =

Definitiondf-gt 42263 The 'greater than' relation is merely the converse of the 'less than or equal to' relation defined by df-lt 9828. Defined in ISO 80000-2:2009(E) operation 2-7.12. See df-gte 42262 for a discussion on why this approach is used for the definition. See gt-lt 42265 and gt-lth 42267 for more conventional expression of the relationship between < and >.

As a stylistic issue, set.mm prefers 'less than or equal' instead of 'greater than or equal' to reduce the number of conversion steps. Thus, we discourage its use, but include its definition so that there is a formal definition of this symbol.

(Contributed by David A. Wheeler, 19-Apr-2015.) (New usage is discouraged.)

> = <

Theoremgte-lte 42264 Simple relationship between and . (Contributed by David A. Wheeler, 10-May-2015.) (New usage is discouraged.)
((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝐵𝐵𝐴))

Theoremgt-lt 42265 Simple relationship between < and >. (Contributed by David A. Wheeler, 19-Apr-2015.) (New usage is discouraged.)
((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 > 𝐵𝐵 < 𝐴))

Theoremgte-lteh 42266 Relationship between and using hypotheses. (Contributed by David A. Wheeler, 10-May-2015.) (New usage is discouraged.)
𝐴 ∈ V    &   𝐵 ∈ V       (𝐴𝐵𝐵𝐴)

Theoremgt-lth 42267 Relationship between < and > using hypotheses. (Contributed by David A. Wheeler, 19-Apr-2015.) (New usage is discouraged.)
𝐴 ∈ V    &   𝐵 ∈ V       (𝐴 > 𝐵𝐵 < 𝐴)

Theoremex-gt 42268 Simple example of >, in this case, 0 is not greater than 0. This is useful as an example, and helps us gain confidence that we've correctly defined the symbol. (Contributed by David A. Wheeler, 1-Jan-2017.) (New usage is discouraged.)
¬ 0 > 0

Theoremex-gte 42269 Simple example of , in this case, 0 is greater than or equal to 0. This is useful as an example, and helps us gain confidence that we've correctly defined the symbol. (Contributed by David A. Wheeler, 1-Jan-2017.) (New usage is discouraged.)
0 ≥ 0

21.36.3  Hyperbolic trigonometric functions

It is a convention of set.mm to not use sinh and so on directly, and instead of use expansions such as (cos‘(i · 𝑥)). However, I believe it's important to give formal definitions for these conventional functions as they are typically used, so here they are. A few related identities are also proved.

Syntaxcsinh 42270 Extend class notation to include the hyperbolic sine function, see df-sinh 42273.
class sinh

Syntaxccosh 42271 Extend class notation to include the hyperbolic cosine function. see df-cosh 42274.
class cosh

Syntaxctanh 42272 Extend class notation to include the hyperbolic tangent function, see df-tanh 42275.
class tanh

Definitiondf-sinh 42273 Define the hyperbolic sine function (sinh). We define it this way for cmpt 4643, which requires the form (𝑥𝐴𝐵). See sinhval-named 42276 for a simple way to evaluate it. We define this function by dividing by i, which uses fewer operations than many conventional definitions (and thus is more convenient to use in metamath). See sinh-conventional 42279 for a justification that our definition is the same as the conventional definition of sinh used in other sources. (Contributed by David A. Wheeler, 20-Apr-2015.)
sinh = (𝑥 ∈ ℂ ↦ ((sin‘(i · 𝑥)) / i))

Definitiondf-cosh 42274 Define the hyperbolic cosine function (cosh). We define it this way for cmpt 4643, which requires the form (𝑥𝐴𝐵). (Contributed by David A. Wheeler, 10-May-2015.)
cosh = (𝑥 ∈ ℂ ↦ (cos‘(i · 𝑥)))

Definitiondf-tanh 42275 Define the hyperbolic tangent function (tanh). We define it this way for cmpt 4643, which requires the form (𝑥𝐴𝐵). (Contributed by David A. Wheeler, 10-May-2015.)
tanh = (𝑥 ∈ (cosh “ (ℂ ∖ {0})) ↦ ((tan‘(i · 𝑥)) / i))

Theoremsinhval-named 42276 Value of the named sinh function. Here we show the simple conversion to the conventional form used in set.mm, using the definition given by df-sinh 42273. See sinhval 14723 for a theorem to convert this further. See sinh-conventional 42279 for a justification that our definition is the same as the conventional definition of sinh used in other sources. (Contributed by David A. Wheeler, 20-Apr-2015.)
(𝐴 ∈ ℂ → (sinh‘𝐴) = ((sin‘(i · 𝐴)) / i))

Theoremcoshval-named 42277 Value of the named cosh function. Here we show the simple conversion to the conventional form used in set.mm, using the definition given by df-cosh 42274. See coshval 14724 for a theorem to convert this further. (Contributed by David A. Wheeler, 10-May-2015.)
(𝐴 ∈ ℂ → (cosh‘𝐴) = (cos‘(i · 𝐴)))

Theoremtanhval-named 42278 Value of the named tanh function. Here we show the simple conversion to the conventional form used in set.mm, using the definition given by df-tanh 42275. (Contributed by David A. Wheeler, 10-May-2015.)
(𝐴 ∈ (cosh “ (ℂ ∖ {0})) → (tanh‘𝐴) = ((tan‘(i · 𝐴)) / i))

Theoremsinh-conventional 42279 Conventional definition of sinh. Here we show that the sinh definition we're using has the same meaning as the conventional definition used in some other sources. We choose a slightly different definition of sinh because it has fewer operations, and thus is more convenient to manipulate using metamath. (Contributed by David A. Wheeler, 10-May-2015.)
(𝐴 ∈ ℂ → (sinh‘𝐴) = (-i · (sin‘(i · 𝐴))))

Theoremsinhpcosh 42280 Prove that (sinh‘𝐴) + (cosh‘𝐴) = (exp‘𝐴) using the conventional hyperbolic trigonometric functions. (Contributed by David A. Wheeler, 27-May-2015.)
(𝐴 ∈ ℂ → ((sinh‘𝐴) + (cosh‘𝐴)) = (exp‘𝐴))

21.36.4  Reciprocal trigonometric functions (sec, csc, cot)

Define the traditional reciprocal trigonometric functions secant (sec), cosecant (csc), and cotangent (cos), along with various identities involving them.

Syntaxcsec 42281 Extend class notation to include the secant function, see df-sec 42284.
class sec

Syntaxccsc 42282 Extend class notation to include the cosecant function, see df-csc 42285.
class csc

Syntaxccot 42283 Extend class notation to include the cotangent function, see df-cot 42286.
class cot

Definitiondf-sec 42284* Define the secant function. We define it this way for cmpt 4643, which requires the form (𝑥𝐴𝐵). The sec function is defined in ISO 80000-2:2009(E) operation 2-13.6 and "NIST Digital Library of Mathematical Functions" section on "Trigonometric Functions" http://dlmf.nist.gov/4.14 (Contributed by David A. Wheeler, 14-Mar-2014.)
sec = (𝑥 ∈ {𝑦 ∈ ℂ ∣ (cos‘𝑦) ≠ 0} ↦ (1 / (cos‘𝑥)))

Definitiondf-csc 42285* Define the cosecant function. We define it this way for cmpt 4643, which requires the form (𝑥𝐴𝐵). The csc function is defined in ISO 80000-2:2009(E) operation 2-13.7 and "NIST Digital Library of Mathematical Functions" section on "Trigonometric Functions" http://dlmf.nist.gov/4.14 (Contributed by David A. Wheeler, 14-Mar-2014.)
csc = (𝑥 ∈ {𝑦 ∈ ℂ ∣ (sin‘𝑦) ≠ 0} ↦ (1 / (sin‘𝑥)))

Definitiondf-cot 42286* Define the cotangent function. We define it this way for cmpt 4643, which requires the form (𝑥𝐴𝐵). The cot function is defined in ISO 80000-2:2009(E) operation 2-13.5 and "NIST Digital Library of Mathematical Functions" section on "Trigonometric Functions" http://dlmf.nist.gov/4.14 (Contributed by David A. Wheeler, 14-Mar-2014.)
cot = (𝑥 ∈ {𝑦 ∈ ℂ ∣ (sin‘𝑦) ≠ 0} ↦ ((cos‘𝑥) / (sin‘𝑥)))

Theoremsecval 42287 Value of the secant function. (Contributed by David A. Wheeler, 14-Mar-2014.)
((𝐴 ∈ ℂ ∧ (cos‘𝐴) ≠ 0) → (sec‘𝐴) = (1 / (cos‘𝐴)))

Theoremcscval 42288 Value of the cosecant function. (Contributed by David A. Wheeler, 14-Mar-2014.)
((𝐴 ∈ ℂ ∧ (sin‘𝐴) ≠ 0) → (csc‘𝐴) = (1 / (sin‘𝐴)))

Theoremcotval 42289 Value of the cotangent function. (Contributed by David A. Wheeler, 14-Mar-2014.)
((𝐴 ∈ ℂ ∧ (sin‘𝐴) ≠ 0) → (cot‘𝐴) = ((cos‘𝐴) / (sin‘𝐴)))

Theoremseccl 42290 The closure of the secant function with a complex argument. (Contributed by David A. Wheeler, 14-Mar-2014.)
((𝐴 ∈ ℂ ∧ (cos‘𝐴) ≠ 0) → (sec‘𝐴) ∈ ℂ)

Theoremcsccl 42291 The closure of the cosecant function with a complex argument. (Contributed by David A. Wheeler, 14-Mar-2014.)
((𝐴 ∈ ℂ ∧ (sin‘𝐴) ≠ 0) → (csc‘𝐴) ∈ ℂ)

Theoremcotcl 42292 The closure of the cotangent function with a complex argument. (Contributed by David A. Wheeler, 15-Mar-2014.)
((𝐴 ∈ ℂ ∧ (sin‘𝐴) ≠ 0) → (cot‘𝐴) ∈ ℂ)

Theoremreseccl 42293 The closure of the secant function with a real argument. (Contributed by David A. Wheeler, 15-Mar-2014.)
((𝐴 ∈ ℝ ∧ (cos‘𝐴) ≠ 0) → (sec‘𝐴) ∈ ℝ)

Theoremrecsccl 42294 The closure of the cosecant function with a real argument. (Contributed by David A. Wheeler, 15-Mar-2014.)
((𝐴 ∈ ℝ ∧ (sin‘𝐴) ≠ 0) → (csc‘𝐴) ∈ ℝ)

Theoremrecotcl 42295 The closure of the cotangent function with a real argument. (Contributed by David A. Wheeler, 15-Mar-2014.)
((𝐴 ∈ ℝ ∧ (sin‘𝐴) ≠ 0) → (cot‘𝐴) ∈ ℝ)

Theoremrecsec 42296 The reciprocal of secant is cosine. (Contributed by David A. Wheeler, 14-Mar-2014.)
((𝐴 ∈ ℂ ∧ (cos‘𝐴) ≠ 0) → (cos‘𝐴) = (1 / (sec‘𝐴)))

Theoremreccsc 42297 The reciprocal of cosecant is sine. (Contributed by David A. Wheeler, 14-Mar-2014.)
((𝐴 ∈ ℂ ∧ (sin‘𝐴) ≠ 0) → (sin‘𝐴) = (1 / (csc‘𝐴)))

Theoremreccot 42298 The reciprocal of cotangent is tangent. (Contributed by David A. Wheeler, 21-Mar-2014.)
((𝐴 ∈ ℂ ∧ (sin‘𝐴) ≠ 0 ∧ (cos‘𝐴) ≠ 0) → (tan‘𝐴) = (1 / (cot‘𝐴)))

Theoremrectan 42299 The reciprocal of tangent is cotangent. (Contributed by David A. Wheeler, 21-Mar-2014.)
((𝐴 ∈ ℂ ∧ (sin‘𝐴) ≠ 0 ∧ (cos‘𝐴) ≠ 0) → (cot‘𝐴) = (1 / (tan‘𝐴)))

Theoremsec0 42300 The value of the secant function at zero is one. (Contributed by David A. Wheeler, 16-Mar-2014.)
(sec‘0) = 1

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-42360
 Copyright terms: Public domain < Previous  Next >