P. 170 of Theorem List - Intuitionistic Logic Explorer

Home	Intuitionistic Logic Explorer Theorem List (p. 170 of 174)	< Previous Next >
		Browser slow? Try the Unicode version.
Mirrors > Metamath Home Page > ILE Home Page > Theorem List Contents > Recent Proofs This page: Page List

Theorem List for Intuitionistic Logic Explorer - 16901-17000 *Has distinct variable group(s)

Type

Label

Description

Statement

Definition

df-eupth 16901*

Define the set of all Eulerian paths on an arbitrary graph. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 18-Feb-2021.)

EulerPaths

Trails

$/\$

..^

♯

iEdg

Theorem

releupth 16902

The set

EulerPaths

of all Eulerian paths on

is a set of pairs by our definition of an Eulerian path, and so is a relation. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 18-Feb-2021.)

EulerPaths

Theorem

eupthsg 16903*

The Eulerian paths on the graph

. (Contributed by AV, 18-Feb-2021.) (Revised by AV, 29-Oct-2021.)

iEdg

EulerPaths

Trails

$/\$

..^

♯

Theorem

eupthv 16904

The classes involved in a Eulerian path are sets. (Contributed by Jim Kingdon, 13-Mar-2026.)

EulerPaths

$/\$

Theorem

iseupth 16905

The property "

is an Eulerian path on the graph

". An Eulerian path is defined as bijection

from the edges to a set

and a function

into the vertices such that for each

is an edge from

. (Since the edges are undirected and there are possibly many edges between any two given vertices, we need to list both the edges and the vertices of the path separately.) (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by Mario Carneiro, 3-May-2015.) (Revised by AV, 18-Feb-2021.) (Revised by AV, 30-Oct-2021.)

iEdg

EulerPaths

Trails

$/\$

..^

♯

Theorem

iseupthf1o 16906

The property "

is an Eulerian path on the graph

". An Eulerian path is defined as bijection

from the edges to a set

and a function

into the vertices such that for each

is an edge from

iEdg

EulerPaths

Walks

$/\$

..^

♯

Theorem

eupthi 16907

Properties of an Eulerian path. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 18-Feb-2021.) (Proof shortened by AV, 30-Oct-2021.)

iEdg

EulerPaths

Walks

$/\$

..^

♯

Theorem

eupthf1o 16908

The

function in an Eulerian path is a bijection from a half-open range of nonnegative integers to the set of edges. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 18-Feb-2021.)

iEdg

EulerPaths

..^

♯

Theorem

eupthfi 16909

Any graph with an Eulerian path is of finite size, i.e. with a finite number of edges. (Contributed by Mario Carneiro, 7-Apr-2015.) (Revised by AV, 18-Feb-2021.)

iEdg

EulerPaths

Theorem

eupthseg 16910

The

-th edge in an eulerian path is the edge having

and

as endpoints . (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 18-Feb-2021.)

iEdg

EulerPaths

$/\$

..^

♯

Theorem

eupthcl 16911

An Eulerian path has length ♯

, which is an integer. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 18-Feb-2021.)

EulerPaths

♯

Theorem

eupthistrl 16912

An Eulerian path is a trail. (Contributed by Alexander van der Vekens, 24-Nov-2017.) (Revised by AV, 18-Feb-2021.)

EulerPaths

Trails

Theorem

eupthiswlk 16913

An Eulerian path is a walk. (Contributed by AV, 6-Apr-2021.)

EulerPaths

Walks

Theorem

eupthpf 16914

The

function in an Eulerian path is a function from a finite sequence of nonnegative integers to the vertices. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 18-Feb-2021.)

EulerPaths

♯

Vtx

Theorem

eupthres 16915

The restriction

of an Eulerian path

to an initial segment of the path (of length

) forms an Eulerian path on the subgraph

consisting of the edges in the initial segment. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by Mario Carneiro, 3-May-2015.) (Revised by AV, 6-Mar-2021.) Hypothesis revised using the prefix operation. (Revised by AV, 30-Nov-2022.)

Vtx

iEdg

EulerPaths

..^

♯

iEdg

..^

prefix

Vtx

EulerPaths

Theorem

eupth2lem1 16916

Lemma for eupth2 . (Contributed by Mario Carneiro, 8-Apr-2015.)

$/\$

$\/$

Theorem

eupth2lem2dc 16917

Lemma for eupth2 . (Contributed by Mario Carneiro, 8-Apr-2015.)

DECID

Theorem

trlsegvdeglem1 16918

Lemma for trlsegvdeg . (Contributed by AV, 20-Feb-2021.)

Vtx

iEdg

..^

♯

Trails

$/\$

Theorem

trlsegvdeglem2 16919

Lemma for trlsegvdeg . (Contributed by AV, 20-Feb-2021.)

Vtx

iEdg

..^

♯

Trails

Vtx

iEdg

..^

iEdg

Theorem

trlsegvdeglem3 16920

Lemma for trlsegvdeg . (Contributed by AV, 20-Feb-2021.)

Vtx

iEdg

..^

♯

Trails

Vtx

iEdg

..^

iEdg

Theorem

trlsegvdeglem4 16921

Lemma for trlsegvdeg . (Contributed by AV, 21-Feb-2021.)

Vtx

iEdg

..^

♯

Trails

Vtx

iEdg

..^

iEdg

..^

Theorem

trlsegvdeglem5 16922

Lemma for trlsegvdeg . (Contributed by AV, 21-Feb-2021.)

Vtx

iEdg

..^

♯

Trails

Vtx

iEdg

..^

iEdg

Theorem

trlsegvdeglem6 16923

Lemma for trlsegvdeg . (Contributed by AV, 21-Feb-2021.)

Vtx

iEdg

..^

♯

Trails

Vtx

iEdg

..^

iEdg

Theorem

trlsegvdeglem7 16924

Lemma for trlsegvdeg . (Contributed by AV, 21-Feb-2021.)

Vtx

iEdg

..^

♯

Trails

Vtx

iEdg

..^

iEdg

Theorem

trlsegvdegfi 16925

The effect on vertex degree of adding one edge to a trail. In the following, a subgraph induced by a segment of a trail is called a "subtrail": For any subtrail

of a trail

in a pseudograph

which is composed of subtrails

and

, where

consists of a single edge, the vertex degree of any vertex

within

is the sum of the vertex degree of

within

and the vertex degree of

within

. Note that this theorem would not hold for arbitrary walks (if the last edge was identical with a previous edge, the degree of the vertices incident with this edge would not be increased because of this edge). (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 20-Feb-2021.)

Vtx

iEdg

..^

♯

Trails

Vtx

iEdg

..^

iEdg

UPGraph

VtxDeg

Theorem

eupth2lem3lem1fi 16926

Lemma for eupth2lem3fi 16934. (Contributed by AV, 21-Feb-2021.)

Vtx

iEdg

..^

♯

Trails

Vtx

iEdg

..^

iEdg

UPGraph

VtxDeg

Theorem

eupth2lem3lem2fi 16927

Lemma for eupth2lem3fi 16934. (Contributed by AV, 21-Feb-2021.)

Vtx

iEdg

..^

♯

Trails

Vtx

iEdg

..^

iEdg

UPGraph

VtxDeg

Theorem

eupth2lem3lem3fi 16928*

Lemma for eupth2lem3fi 16934. If a loop

is added to a trail, the degree of the vertices with odd degree remains odd (regarding the subgraphs induced by the involved trails). (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 21-Feb-2021.)

Vtx

iEdg

..^

♯

Trails

Vtx

iEdg

..^

iEdg

UPGraph

VtxDeg

if-

$/\$

VtxDeg

Theorem

eupth2lem3lem6fi 16929*

If an edge (not a loop) is added to a trail, the degree of vertices not being end vertices of this edge remains odd if it was odd before (regarding the subgraphs induced by the involved trails). Remark: This seems to be not valid for hyperedges joining more vertices than

and

: if there is a third vertex in the edge, and this vertex is already contained in the trail, then the degree of this vertex could be affected by this edge! (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 25-Feb-2021.)

Vtx

iEdg

..^

♯

Trails

Vtx

iEdg

..^

iEdg

UPGraph

VtxDeg

$/\$

VtxDeg

Theorem

eupth2lem3lem5 16930

Lemma for eupth2fi 16937. (Contributed by AV, 25-Feb-2021.)

Vtx

iEdg

..^

♯

Trails

Vtx

iEdg

..^

iEdg

VtxDeg

Theorem

eupth2lem3lem4fi 16931*

Lemma for eupth2lem3fi 16934. If an edge (not a loop) is added to a trail, the degree of the end vertices of this edge remains odd if it was odd before (regarding the subgraphs induced by the involved trails). (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 25-Feb-2021.)

Vtx

iEdg

..^

♯

Trails

Vtx

iEdg

..^

iEdg

UMGraph

VtxDeg

if-

$/\$

$\/$

VtxDeg

Theorem

eupth2lem3lem7fi 16932*

Lemma for eupth2lem3fi 16934: Combining trlsegvdegfi 16925, eupth2lem3lem3fi 16928, eupth2lem3lem4fi 16931 and eupth2lem3lem6fi 16929. (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 27-Feb-2021.)

Vtx

iEdg

..^

♯

Trails

Vtx

iEdg

..^

iEdg

UMGraph

VtxDeg

Theorem

eupthvdres 16933

The vertex degree remains the same for all vertices if the edges are restricted to the edges of an Eulerian path. (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 26-Feb-2021.)

Vtx

iEdg

EulerPaths

..^

♯

VtxDeg

Theorem

eupth2lem3fi 16934*

Lemma for eupth2fi 16937. (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 26-Feb-2021.)

Vtx

iEdg

UMGraph

EulerPaths

..^

♯

VtxDeg

Theorem

eupth2lembfi 16935*

Lemma for eupth2fi 16937 (induction basis): There are no vertices of odd degree in an Eulerian path of length 0, having no edge and identical endpoints (the single vertex of the Eulerian path). (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 26-Feb-2021.)

Vtx

iEdg

UMGraph

EulerPaths

VtxDeg

..^

Theorem

eupth2lemsfi 16936*

Lemma for eupth2fi 16937 (induction step): The only vertices of odd degree in a graph with an Eulerian path are the endpoints, and then only if the endpoints are distinct, if the Eulerian path shortened by one edge has this property. (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 26-Feb-2021.)

Vtx

iEdg

UMGraph

EulerPaths

$/\$

♯

VtxDeg

..^

♯

VtxDeg

..^

Theorem

eupth2fi 16937*

The only vertices of odd degree in a graph with an Eulerian path are the endpoints, and then only if the endpoints are distinct. (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 26-Feb-2021.)

Vtx

iEdg

UMGraph

EulerPaths

VtxDeg

♯

Theorem

eulerpathprum 16938*

A graph with an Eulerian path has either zero or two vertices of odd degree. (Contributed by Mario Carneiro, 7-Apr-2015.) (Revised by AV, 26-Feb-2021.)

Vtx

UMGraph $/\$

EulerPaths

$/\$

♯

VtxDeg

Theorem

eulerpathum 16939*

A multigraph with an Eulerian path has either zero or two vertices of odd degree. (Contributed by Mario Carneiro, 7-Apr-2015.) (Revised by AV, 26-Feb-2021.)

Vtx

UMGraph $/\$

EulerPaths

$/\$

♯

VtxDeg

12.4.2 The Königsberg Bridge problem

According to Wikipedia ("Seven Bridges of Königsberg", 9-Mar-2021, https://en.wikipedia.org/wiki/Seven_Bridges_of_Koenigsberg): "The Seven Bridges of Königsberg is a historically notable problem in mathematics. Its negative resolution by Leonhard Euler in 1736 laid the foundations of graph theory and prefigured the idea of topology. The city of Königsberg in [East] Prussia (now Kaliningrad, Russia) was set on both sides of the Pregel River, and included two large islands - Kneiphof and Lomse - which were connected to each other, or to the two mainland portions of the city, by seven bridges. The problem was to devise a walk through the city that would cross each of those bridges once and only once.". Euler proved that the problem has no solution by applying Euler's theorem to the Königsberg graph, which is obtained by replacing each land mass with an abstract "vertex" or node, and each bridge with an abstract connection, an "edge", which connects two land masses/vertices. The Königsberg graph is a multigraph consisting of 4 vertices and 7 edges, represented by the following ordered pair: , see konigsbergumgr 16945. konigsberg 16951 shows that the Königsberg graph has no Eulerian path, thus the Königsberg Bridge problem has no solution.

Theorem

konigsbergvtx 16940

The set of vertices of the Königsberg graph

. (Contributed by AV, 28-Feb-2021.)

Vtx

Theorem

konigsbergiedg 16941

The indexed edges of the Königsberg graph

. (Contributed by AV, 28-Feb-2021.)

iEdg

Theorem

konigsbergiedgwen 16942*

The indexed edges of the Königsberg graph

is a word over the pairs of vertices. (Contributed by AV, 28-Feb-2021.)

Word

Theorem

konigsbergssiedgwpren 16943*

Each subset of the indexed edges of the Königsberg graph

is a word over the pairs of vertices. (Contributed by AV, 28-Feb-2021.)

Word

$/\$

Word

$/\$

Word

Theorem

konigsbergssiedgwen 16944*

Each subset of the indexed edges of the Königsberg graph

is a word over the pairs of vertices. (Contributed by AV, 28-Feb-2021.)

Word

$/\$

Word

$/\$

Word

$\/$

Theorem

konigsbergumgr 16945

The Königsberg graph

is a multigraph. (Contributed by AV, 28-Feb-2021.) (Revised by AV, 9-Mar-2021.)

UMGraph

Theorem

konigsberglem1 16946

Lemma 1 for konigsberg 16951: Vertex

has degree three. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by Mario Carneiro, 28-Feb-2016.) (Revised by AV, 4-Mar-2021.)

VtxDeg

Theorem

konigsberglem2 16947

Lemma 2 for konigsberg 16951: Vertex

has degree three. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by Mario Carneiro, 28-Feb-2016.) (Revised by AV, 4-Mar-2021.)

VtxDeg

Theorem

konigsberglem3 16948

Lemma 3 for konigsberg 16951: Vertex

has degree three. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by Mario Carneiro, 28-Feb-2016.) (Revised by AV, 4-Mar-2021.)

VtxDeg

Theorem

konigsberglem4 16949*

Lemma 4 for konigsberg 16951: Vertices

are vertices of odd degree. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by AV, 28-Feb-2021.)

VtxDeg

Theorem

konigsberglem5 16950*

Lemma 5 for konigsberg 16951: The set of vertices of odd degree is greater than 2. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by AV, 28-Feb-2021.)

♯

VtxDeg

Theorem

konigsberg 16951

The Königsberg Bridge problem. If

is the Königsberg graph, i.e. a graph on four vertices

, with edges

, then vertices

each have degree three, and

has degree five, so there are four vertices of odd degree and thus by eulerpathum 16939 the graph cannot have an Eulerian path. It is sufficient to show that there are 3 vertices of odd degree, since a graph having an Eulerian path can only have 0 or 2 vertices of odd degree. This is Metamath 100 proof #54. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by Mario Carneiro, 28-Feb-2016.) (Revised by AV, 9-Mar-2021.)

EulerPaths

PART 13 GUIDES AND MISCELLANEA

13.1 Guides (conventions, explanations, and examples)

13.1.1 Conventions

This section describes the conventions we use. These conventions often refer to existing mathematical practices, which are discussed in more detail in other references. The following sources lay out how mathematics is developed without the law of the excluded middle. Of course, there are a greater number of sources which assume excluded middle and most of what is in them applies here too (especially in a treatment such as ours which is built on first-order logic and set theory, rather than, say, type theory). Studying how a topic is treated in the Metamath Proof Explorer and the references therein is often a good place to start (and is easy to compare with the Intuitionistic Logic Explorer). The textbooks provide a motivation for what we are doing, whereas Metamath lets you see in detail all hidden and implicit steps. Most standard theorems are accompanied by citations. Some closely followed texts include the following:

Axioms of propositional calculus - Stanford Encyclopedia of Philosophy or [Heyting].
Axioms of predicate calculus - our axioms are adapted from the ones in the Metamath Proof Explorer.
Theorems of propositional calculus - [Heyting].
Theorems of pure predicate calculus - Metamath Proof Explorer.
Theorems of equality and substitution - Metamath Proof Explorer.
Axioms of set theory - [Crosilla].
Development of set theory - Chapter 10 of [HoTT].
Construction of real and complex numbers - Chapter 11 of [HoTT]; [BauerTaylor].
Theorems about real numbers - [Geuvers].

Theorem

conventions 16952

Unless there is a reason to diverge, we follow the conventions of the Metamath Proof Explorer (MPE, set.mm). This list of conventions is intended to be read in conjunction with the corresponding conventions in the Metamath Proof Explorer, and only the differences are described below.

Minimizing axioms and the axiom of choice. We prefer proofs that depend on fewer and/or weaker axioms, even if the proofs are longer. In particular, our choice of IZF (Intuitionistic Zermelo-Fraenkel) over CZF (Constructive Zermelo-Fraenkel, a weaker system) was just an expedient choice because IZF is easier to formalize in Metamath. You can find some development using CZF in BJ's mathbox starting at wbd 17055 (and the section header just above it). As for the axiom of choice, the full axiom of choice implies excluded middle as seen at acexmid 6087, although some authors will use countable choice or dependent choice. For example, countable choice or excluded middle is needed to show that the Cauchy reals coincide with the Dedekind reals - Corollary 11.4.3 of [HoTT], p. (varies).
Junk/undefined results. Much of the discussion of this topic in the Metamath Proof Explorer applies except that certain techniques are not available to us. For example, the Metamath Proof Explorer will often say "if a function is evaluated within its domain, a certain result follows; if the function is evaluated outside its domain, the same result follows. Since the function must be evaluated within its domain or outside it, the result follows unconditionally" (the use of excluded middle in this argument is perhaps obvious when stated this way). Often, the easiest fix will be to prove we are evaluating functions within their domains, other times it will be possible to use a theorem like relelfvdm 5730 which says that if a function value produces an inhabited set, then the function is being evaluated within its domain.
Bibliography references. The bibliography for the Intuitionistic Logic Explorer is separate from the one for the Metamath Proof Explorer but feel free to copy-paste a citation in either direction in order to cite it.

Label naming conventions

Here are a few of the label naming conventions:

Suffixes. We follow the conventions of the Metamath Proof Explorer with a few additions. A biconditional in set.mm which is an implication in iset.mm should have a "r" (for the reverse direction), or "i"/"im" (for the forward direction) appended. A theorem in set.mm which has a decidability condition added should add "dc" to the theorem name. A theorem in set.mm where "nonempty class" is changed to "inhabited class" should add "m" (for member) to the theorem name.
iset.mm versus set.mm names
Theorems which are the same as in set.mm should be named the same (that is, where the statement of the theorem is the same; the proof can differ without a new name being called for). Theorems which are different should be named differently (we do have a small number of intentional exceptions to this rule but on the whole it serves us well).

As for how to choose names so they are different between iset.mm and set.mm, when possible choose a name which reflect the difference in the theorems. For example, if a theorem in set.mm is an equality and the iset.mm analogue is a subset, add "ss" to the iset.mm name. If need be, add "i" to the iset.mm name (usually as a prefix to some portion of the name).

As with set.mm, we welcome suggestions for better names (such as names which are more consistent with naming conventions).

We do try to keep set.mm and iset.mm similar where we can. For example, if a theorem exists in both places but the name in set.mm isn't great, we tend to keep that name for iset.mm, or change it in both files together. This is mainly to make it easier to copy theorems, but also to generally help people browse proofs, find theorems, write proofs, etc.

The following table shows some commonly-used abbreviations in labels which are not found in the Metamath Proof Explorer, in alphabetical order. For each abbreviation we provide a mnenomic to help you remember it, the source theorem/assumption defining it, an expression showing what it looks like, whether or not it is a "syntax fragment" (an abbreviation that indicates a particular kind of syntax), and hyperlinks to label examples that use the abbreviation. The abbreviation is bolded if there is a df-NAME definition but the label fragment is not NAME.

For the "g" abbreviation, this is related to the set.mm usage, in which "is a set" conditions are converted from hypotheses to antecedents, but is also used where "is a set" conditions are added relative to similar set.mm theorems.

Abbreviation	Mnenomic/Meaning	Source	Expression	Syntax?	Example(s)
ap	apart	df-ap 8919	#	Yes	apadd1 8945, apne 8960
g	with "is a set" condition			No	1stvalg 6380, brtposg 6529, setsmsbasg 15717
m	inhabited (from "member")			No	r19.2m 3614, negm 10032, ctm 7456, basmex 13471
pap	apartness predicate	df-pap 7615	Ap	Yes	papeq1 7616, papirr 7618
seq3, sum3	recursive sequence	df-seqfrec 10907		Yes	seq3-1 10921, fsum3 12180
tap	tight apartness	df-tap 7622	TAp	Yes	df-tap 7622

Community. The Metamath mailing list also covers the Intuitionistic Logic Explorer and is at: https://groups.google.com/g/metamath 7622.

(Contributed by Jim Kingdon, 24-Feb-2020.) (New usage is discouraged.)

13.1.2 Definitional examples

Theorem

ex-or 16953

Example for ax-io 721. Example by David A. Wheeler. (Contributed by Mario Carneiro, 9-May-2015.)

$\/$

Theorem

ex-an 16954

Example for ax-ia1 106. Example by David A. Wheeler. (Contributed by Mario Carneiro, 9-May-2015.)

$/\$

Theorem

1kp2ke3k 16955

Example for df-dec 9790, 1000 + 2000 = 3000.

This proof disproves (by counterexample) the assertion of Hao Wang, who stated, "There is a theorem in the primitive notation of set theory that corresponds to the arithmetic theorem 1000 + 2000 = 3000. The formula would be forbiddingly long... even if (one) knows the definitions and is asked to simplify the long formula according to them, chances are he will make errors and arrive at some incorrect result." (Hao Wang, "Theory and practice in mathematics" , In Thomas Tymoczko, editor, New Directions in the Philosophy of Mathematics, pp 129-152, Birkauser Boston, Inc., Boston, 1986. (QA8.6.N48). The quote itself is on page 140.)

This is noted in Metamath: A Computer Language for Pure Mathematics by Norman Megill (2007) section 1.1.3. Megill then states, "A number of writers have conveyed the impression that the kind of absolute rigor provided by Metamath is an impossible dream, suggesting that a complete, formal verification of a typical theorem would take millions of steps in untold volumes of books... These writers assume, however, that in order to achieve the kind of complete formal verification they desire one must break down a proof into individual primitive steps that make direct reference to the axioms. This is not necessary. There is no reason not to make use of previously proved theorems rather than proving them over and over... A hierarchy of theorems and definitions permits an exponential growth in the formula sizes and primitive proof steps to be described with only a linear growth in the number of symbols used. Of course, this is how ordinary informal mathematics is normally done anyway, but with Metamath it can be done with absolute rigor and precision."

The proof here starts with , commutes it, and repeatedly multiplies both sides by ten. This is certainly longer than traditional mathematical proofs, e.g., there are a number of steps explicitly shown here to show that we're allowed to do operations such as multiplication. However, while longer, the proof is clearly a manageable size - even though every step is rigorously derived all the way back to the primitive notions of set theory and logic. And while there's a risk of making errors, the many independent verifiers make it much less likely that an incorrect result will be accepted.

This proof heavily relies on the decimal constructor df-dec 9790 developed by Mario Carneiro in 2015. The underlying Metamath language has an intentionally very small set of primitives; it doesn't even have a built-in construct for numbers. Instead, the digits are defined using these primitives, and the decimal constructor is used to make it easy to express larger numbers as combinations of digits.

(Contributed by David A. Wheeler, 29-Jun-2016.) (Shortened by Mario Carneiro using the arithmetic algorithm in mmj2, 30-Jun-2016.)

;;;

Theorem

ex-fl 16956

Example for df-fl 10723. Example by David A. Wheeler. (Contributed by Mario Carneiro, 18-Jun-2015.)

$/\$

Theorem

ex-ceil 16957

Example for df-ceil 10724. (Contributed by AV, 4-Sep-2021.)

⌈

$/\$

⌈

Theorem

ex-exp 16958

Example for df-exp 10998. (Contributed by AV, 4-Sep-2021.)

;

$/\$

Theorem

ex-fac 16959

Example for df-fac 11187. (Contributed by AV, 4-Sep-2021.)

;;

Theorem

ex-bc 16960

Example for df-bc 11209. (Contributed by AV, 4-Sep-2021.)

;

Theorem

ex-dvds 16961

Example for df-dvds 12581: 3 divides into 6. (Contributed by David A. Wheeler, 19-May-2015.)

Theorem

ex-gcd 16962

Example for df-gcd 12757. (Contributed by AV, 5-Sep-2021.)

PART 14 SUPPLEMENTARY MATERIAL (USERS' MATHBOXES)

14.1 Mathboxes for user contributions

14.1.1 Mathbox guidelines

Theorem

mathbox 16963

(This theorem is a dummy placeholder for these guidelines. The label of this theorem, "mathbox", is hard-coded into the Metamath program to identify the start of the mathbox section for web page generation.)

A "mathbox" is a user-contributed section that is maintained by its contributor independently from the main part of iset.mm.

For contributors:

By making a contribution, you agree to release it into the public domain, according to the statement at the beginning of iset.mm.

Guidelines:

Mathboxes in iset.mm follow the same practices as in set.mm, so refer to the mathbox guidelines there for more details.

(Contributed by NM, 20-Feb-2007.) (Revised by the Metamath team, 9-Sep-2023.) (New usage is discouraged.)

14.2 Mathbox for Matthew House

Theorem

depindlem1 16964*

Lemma for depind 16967. (Contributed by Matthew House, 14-Apr-2026.)

$/\$

Theorem

depindlem2 16965*

Lemma for depind 16967. (Contributed by Matthew House, 14-Apr-2026.)

Theorem

depindlem3 16966*

Lemma for depind 16967. (Contributed by Matthew House, 14-Apr-2026.)

$/\$

Theorem

depind 16967*

Theorem related to a dependently typed induction principle in type theory. (Contributed by Matthew House, 14-Apr-2026.)

$/\$

Theorem

lealltlt1 16968*

Alternative definition for

on real numbers. (Contributed by Matthew House, 29-Jun-2026.)

$/\$

Theorem

lealltlt2 16969*

Alternative definition for

on real numbers. (Contributed by Matthew House, 29-Jun-2026.)

$/\$

Theorem

dichmul0orlem1 16970