P. 106 of Theorem List - Intuitionistic Logic Explorer

Type

Label

Description

Statement

Theorem

isprm4 10501*

The predicate "is a prime number". A prime number is an integer greater than or equal to 2 whose only divisor greater than or equal to 2 is itself. (Contributed by Paul Chapman, 26-Oct-2012.)

|- ( P e. Prime <-> ( P e. ( ZZ>= ` 2 ) /\ A. z e. ( ZZ>= ` 2 ) ( z || P -> z = P ) ) )

Theorem

prmind2 10502*

A variation on prmind 10503 assuming complete induction for primes. (Contributed by Mario Carneiro, 20-Jun-2015.)

|- ( x = 1 -> ( ph <-> ps ) )   &    |- ( x = y -> ( ph <-> ch ) )   &    |- ( x = z -> ( ph <-> th ) )   &    |- ( x = ( y x. z ) -> ( ph <-> ta ) )   &    |- ( x = A -> ( ph <-> et ) )   &    |- ps   &    |- ( ( x e. Prime /\ A. y e. ( 1 ... ( x - 1 ) ) ch ) -> ph )   &    |- ( ( y e. ( ZZ>= ` 2 ) /\ z e. ( ZZ>= ` 2 ) ) -> ( ( ch /\ th ) -> ta ) )   =>    |- ( A e. NN -> et )

Theorem

prmind 10503*

Perform induction over the multiplicative structure of NN. If a property ph ( x ) holds for the primes and 1 and is preserved under multiplication, then it holds for every positive integer. (Contributed by Mario Carneiro, 20-Jun-2015.)

|- ( x = 1 -> ( ph <-> ps ) )   &    |- ( x = y -> ( ph <-> ch ) )   &    |- ( x = z -> ( ph <-> th ) )   &    |- ( x = ( y x. z ) -> ( ph <-> ta ) )   &    |- ( x = A -> ( ph <-> et ) )   &    |- ps   &    |- ( x e. Prime -> ph )   &    |- ( ( y e. ( ZZ>= ` 2 ) /\ z e. ( ZZ>= ` 2 ) ) -> ( ( ch /\ th ) -> ta ) )   =>    |- ( A e. NN -> et )

Theorem

dvdsprime 10504

If M divides a prime, then M is either the prime or one. (Contributed by Scott Fenton, 8-Apr-2014.)

|- ( ( P e. Prime /\ M e. NN ) -> ( M || P <-> ( M = P \/ M = 1 ) ) )

Theorem

nprm 10505

A product of two integers greater than one is composite. (Contributed by Mario Carneiro, 20-Jun-2015.)

|- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> -. ( A x. B ) e. Prime )

Theorem

nprmi 10506

An inference for compositeness. (Contributed by Mario Carneiro, 18-Feb-2014.) (Revised by Mario Carneiro, 20-Jun-2015.)

|- A e. NN   &    |- B e. NN   &    |- 1 < A   &    |- 1 < B   &    |- ( A x. B ) = N   =>    |- -. N e. Prime

Theorem

dvdsnprmd 10507

If a number is divisible by an integer greater than 1 and less then the number, the number is not prime. (Contributed by AV, 24-Jul-2021.)

|- ( ph -> 1 < A )   &    |- ( ph -> A < N )   &    |- ( ph -> A || N )   =>    |- ( ph -> -. N e. Prime )

Theorem

prm2orodd 10508

A prime number is either 2 or odd. (Contributed by AV, 19-Jun-2021.)

|- ( P e. Prime -> ( P = 2 \/ -. 2 || P ) )

Theorem

2prm 10509

2 is a prime number. (Contributed by Paul Chapman, 22-Jun-2011.) (Proof shortened by Fan Zheng, 16-Jun-2016.)

|- 2 e. Prime

Theorem

3prm 10510

3 is a prime number. (Contributed by Paul Chapman, 22-Jun-2011.)

|- 3 e. Prime

Theorem

4nprm 10511

4 is not a prime number. (Contributed by Paul Chapman, 22-Jun-2011.) (Proof shortened by Mario Carneiro, 18-Feb-2014.)

|- -. 4 e. Prime

Theorem

prmuz2 10512

A prime number is an integer greater than or equal to 2. (Contributed by Paul Chapman, 17-Nov-2012.)

|- ( P e. Prime -> P e. ( ZZ>= ` 2 ) )

Theorem

prmgt1 10513

A prime number is an integer greater than 1. (Contributed by Alexander van der Vekens, 17-May-2018.)

|- ( P e. Prime -> 1 < P )

Theorem

prmm2nn0 10514

Subtracting 2 from a prime number results in a nonnegative integer. (Contributed by Alexander van der Vekens, 30-Aug-2018.)

|- ( P e. Prime -> ( P - 2 ) e. NN0 )

Theorem

oddprmgt2 10515

An odd prime is greater than 2. (Contributed by AV, 20-Aug-2021.)

|- ( P e. ( Prime \ { 2 } ) -> 2 < P )

Theorem

oddprmge3 10516

An odd prime is greater than or equal to 3. (Contributed by Alexander van der Vekens, 7-Oct-2018.) (Revised by AV, 20-Aug-2021.)

|- ( P e. ( Prime \ { 2 } ) -> P e. ( ZZ>= ` 3 ) )

Theorem

sqnprm 10517

A square is never prime. (Contributed by Mario Carneiro, 20-Jun-2015.)

|- ( A e. ZZ -> -. ( A ^ 2 ) e. Prime )

Theorem

dvdsprm 10518

An integer greater than or equal to 2 divides a prime number iff it is equal to it. (Contributed by Paul Chapman, 26-Oct-2012.)

|- ( ( N e. ( ZZ>= ` 2 ) /\ P e. Prime ) -> ( N || P <-> N = P ) )

Theorem

exprmfct 10519*

Every integer greater than or equal to 2 has a prime factor. (Contributed by Paul Chapman, 26-Oct-2012.) (Proof shortened by Mario Carneiro, 20-Jun-2015.)

|- ( N e. ( ZZ>= ` 2 ) -> E. p e. Prime p || N )

Theorem

prmdvdsfz 10520*

Each integer greater than 1 and less then or equal to a fixed number is divisible by a prime less then or equal to this fixed number. (Contributed by AV, 15-Aug-2020.)

|- ( ( N e. NN /\ I e. ( 2 ... N ) ) -> E. p e. Prime ( p <_ N /\ p || I ) )

Theorem

nprmdvds1 10521

No prime number divides 1. (Contributed by Paul Chapman, 17-Nov-2012.) (Proof shortened by Mario Carneiro, 2-Jul-2015.)

|- ( P e. Prime -> -. P || 1 )

Theorem

divgcdodd 10522

Either A / ( A gcd B ) is odd or B / ( A gcd B ) is odd. (Contributed by Scott Fenton, 19-Apr-2014.)

|- ( ( A e. NN /\ B e. NN ) -> ( -. 2 || ( A / ( A gcd B ) ) \/ -. 2 || ( B / ( A gcd B ) ) ) )

4.2.2  Coprimality and Euclid's lemma (cont.)

This section is about coprimality with respect to primes, and a special version of Euclid's lemma for primes is provided, see euclemma 10525.

Theorem

coprm 10523

A prime number either divides an integer or is coprime to it, but not both. Theorem 1.8 in [ApostolNT] p. 17. (Contributed by Paul Chapman, 22-Jun-2011.)

|- ( ( P e. Prime /\ N e. ZZ ) -> ( -. P || N <-> ( P gcd N ) = 1 ) )

Theorem

prmrp 10524

Unequal prime numbers are relatively prime. (Contributed by Mario Carneiro, 23-Feb-2014.)

|- ( ( P e. Prime /\ Q e. Prime ) -> ( ( P gcd Q ) = 1 <-> P =/= Q ) )

Theorem

euclemma 10525

Euclid's lemma. A prime number divides the product of two integers iff it divides at least one of them. Theorem 1.9 in [ApostolNT] p. 17. (Contributed by Paul Chapman, 17-Nov-2012.)

|- ( ( P e. Prime /\ M e. ZZ /\ N e. ZZ ) -> ( P || ( M x. N ) <-> ( P || M \/ P || N ) ) )

Theorem

isprm6 10526*

A number is prime iff it satisfies Euclid's lemma euclemma 10525. (Contributed by Mario Carneiro, 6-Sep-2015.)

|- ( P e. Prime <-> ( P e. ( ZZ>= ` 2 ) /\ A. x e. ZZ A. y e. ZZ ( P || ( x x. y ) -> ( P || x \/ P || y ) ) ) )

Theorem

prmdvdsexp 10527

A prime divides a positive power of an integer iff it divides the integer. (Contributed by Mario Carneiro, 24-Feb-2014.) (Revised by Mario Carneiro, 17-Jul-2014.)

|- ( ( P e. Prime /\ A e. ZZ /\ N e. NN ) -> ( P || ( A ^ N ) <-> P || A ) )

Theorem

prmdvdsexpb 10528

A prime divides a positive power of another iff they are equal. (Contributed by Paul Chapman, 30-Nov-2012.) (Revised by Mario Carneiro, 24-Feb-2014.)

|- ( ( P e. Prime /\ Q e. Prime /\ N e. NN ) -> ( P || ( Q ^ N ) <-> P = Q ) )

Theorem

prmdvdsexpr 10529

If a prime divides a nonnegative power of another, then they are equal. (Contributed by Mario Carneiro, 16-Jan-2015.)

|- ( ( P e. Prime /\ Q e. Prime /\ N e. NN0 ) -> ( P || ( Q ^ N ) -> P = Q ) )

Theorem

prmexpb 10530

Two positive prime powers are equal iff the primes and the powers are equal. (Contributed by Paul Chapman, 30-Nov-2012.)

|- ( ( ( P e. Prime /\ Q e. Prime ) /\ ( M e. NN /\ N e. NN ) ) -> ( ( P ^ M ) = ( Q ^ N ) <-> ( P = Q /\ M = N ) ) )

Theorem

prmfac1 10531

The factorial of a number only contains primes less than the base. (Contributed by Mario Carneiro, 6-Mar-2014.)

|- ( ( N e. NN0 /\ P e. Prime /\ P || ( ! ` N ) ) -> P <_ N )

Theorem

rpexp 10532

If two numbers A and B are relatively prime, then they are still relatively prime if raised to a power. (Contributed by Mario Carneiro, 24-Feb-2014.)

|- ( ( A e. ZZ /\ B e. ZZ /\ N e. NN ) -> ( ( ( A ^ N ) gcd B ) = 1 <-> ( A gcd B ) = 1 ) )

Theorem

rpexp1i 10533

Relative primality passes to asymmetric powers. (Contributed by Stefan O'Rear, 27-Sep-2014.)

|- ( ( A e. ZZ /\ B e. ZZ /\ M e. NN0 ) -> ( ( A gcd B ) = 1 -> ( ( A ^ M ) gcd B ) = 1 ) )

Theorem

rpexp12i 10534

Relative primality passes to symmetric powers. (Contributed by Stefan O'Rear, 27-Sep-2014.)

|- ( ( A e. ZZ /\ B e. ZZ /\ ( M e. NN0 /\ N e. NN0 ) ) -> ( ( A gcd B ) = 1 -> ( ( A ^ M ) gcd ( B ^ N ) ) = 1 ) )

Theorem

prmndvdsfaclt 10535

A prime number does not divide the factorial of a nonnegative integer less than the prime number. (Contributed by AV, 13-Jul-2021.)

|- ( ( P e. Prime /\ N e. NN0 ) -> ( N < P -> -. P || ( ! ` N ) ) )

Theorem

cncongrprm 10536

Corollary 2 of Cancellability of Congruences: Two products with a common factor are congruent modulo a prime number not dividing the common factor iff the other factors are congruent modulo the prime number. (Contributed by AV, 13-Jul-2021.)

|- ( ( ( A e. ZZ /\ B e. ZZ /\ C e. ZZ ) /\ ( P e. Prime /\ -. P || C ) ) -> ( ( ( A x. C ) mod P ) = ( ( B x. C ) mod P ) <-> ( A mod P ) = ( B mod P ) ) )

Theorem

isevengcd2 10537

The predicate "is an even number". An even number and 2 have 2 as greatest common divisor. (Contributed by AV, 1-Jul-2020.) (Revised by AV, 8-Aug-2021.)

|- ( Z e. ZZ -> ( 2 || Z <-> ( 2 gcd Z ) = 2 ) )

Theorem

isoddgcd1 10538

The predicate "is an odd number". An odd number and 2 have 1 as greatest common divisor. (Contributed by AV, 1-Jul-2020.) (Revised by AV, 8-Aug-2021.)

|- ( Z e. ZZ -> ( -. 2 || Z <-> ( 2 gcd Z ) = 1 ) )

Theorem

3lcm2e6 10539

The least common multiple of three and two is six. The operands are unequal primes and thus coprime, so the result is (the absolute value of) their product. (Contributed by Steve Rodriguez, 20-Jan-2020.) (Proof shortened by AV, 27-Aug-2020.)

|- ( 3 lcm 2 ) = 6

4.2.3  Non-rationality of square root of 2

Theorem

sqrt2irrlem 10540

Lemma for sqrt2irr 10541. This is the core of the proof: - if A / B = sqr ( 2 ), then A and B are even, so A / 2 and B / 2 are smaller representatives, which is absurd by the method of infinite descent (here implemented by strong induction). (Contributed by NM, 20-Aug-2001.) (Revised by Mario Carneiro, 12-Sep-2015.)

|- ( ph -> A e. ZZ )   &    |- ( ph -> B e. NN )   &    |- ( ph -> ( sqr ` 2 ) = ( A / B ) )   =>    |- ( ph -> ( ( A / 2 ) e. ZZ /\ ( B / 2 ) e. NN ) )

Theorem

sqrt2irr 10541

The square root of 2 is not rational. That is, for any rational number, ( sqr ` 2 ) does not equal it. However, if we were to say "the square root of 2 is irrational" that would mean something stronger: "for any rational number, ( sqr ` 2 ) is apart from it" (the two statements are equivalent given excluded middle). See sqrt2irrap 10558 for the proof that the square root of two is irrational.

The proof's core is proven in sqrt2irrlem 10540, which shows that if A / B = sqr ( 2 ), then A and B are even, so A / 2 and B / 2 are smaller representatives, which is absurd. (Contributed by NM, 8-Jan-2002.) (Proof shortened by Mario Carneiro, 12-Sep-2015.)

|- ( sqr ` 2 ) e/ QQ

Theorem

sqrt2re 10542

The square root of 2 exists and is a real number. (Contributed by NM, 3-Dec-2004.)

|- ( sqr ` 2 ) e. RR

Theorem

pw2dvdslemn 10543*

Lemma for pw2dvds 10544. If a natural number has some power of two which does not divide it, there is a highest power of two which does divide it. (Contributed by Jim Kingdon, 14-Nov-2021.)

|- ( ( N e. NN /\ A e. NN /\ -. ( 2 ^ A ) || N ) -> E. m e. NN0 ( ( 2 ^ m ) || N /\ -. ( 2 ^ ( m + 1 ) ) || N ) )

Theorem

pw2dvds 10544*

A natural number has a highest power of two which divides it. (Contributed by Jim Kingdon, 14-Nov-2021.)

|- ( N e. NN -> E. m e. NN0 ( ( 2 ^ m ) || N /\ -. ( 2 ^ ( m + 1 ) ) || N ) )

Theorem

pw2dvdseulemle 10545

Lemma for pw2dvdseu 10546. Powers of two which do and do not divide a natural number. (Contributed by Jim Kingdon, 17-Nov-2021.)

|- ( ph -> N e. NN )   &    |- ( ph -> A e. NN0 )   &    |- ( ph -> B e. NN0 )   &    |- ( ph -> ( 2 ^ A ) || N )   &    |- ( ph -> -. ( 2 ^ ( B + 1 ) ) || N )   =>    |- ( ph -> A <_ B )

Theorem

pw2dvdseu 10546*

A natural number has a unique highest power of two which divides it. (Contributed by Jim Kingdon, 16-Nov-2021.)

|- ( N e. NN -> E! m e. NN0 ( ( 2 ^ m ) || N /\ -. ( 2 ^ ( m + 1 ) ) || N ) )

Theorem

oddpwdclemxy 10547*

Lemma for oddpwdc 10552. Another way of stating that decomposing a natural number into a power of two and an odd number is unique. (Contributed by Jim Kingdon, 16-Nov-2021.)

|- ( ( ( ( X e. NN /\ -. 2 || X ) /\ Y e. NN0 ) /\ A = ( ( 2 ^ Y ) x. X ) ) -> ( X = ( A / ( 2 ^ ( iota_ z e. NN0 ( ( 2 ^ z ) || A /\ -. ( 2 ^ ( z + 1 ) ) || A ) ) ) ) /\ Y = ( iota_ z e. NN0 ( ( 2 ^ z ) || A /\ -. ( 2 ^ ( z + 1 ) ) || A ) ) ) )

Theorem

oddpwdclemdvds 10548*

Lemma for oddpwdc 10552. A natural number is divisible by the highest power of two which divides it. (Contributed by Jim Kingdon, 17-Nov-2021.)

|- ( A e. NN -> ( 2 ^ ( iota_ z e. NN0 ( ( 2 ^ z ) || A /\ -. ( 2 ^ ( z + 1 ) ) || A ) ) ) || A )

Theorem

oddpwdclemndvds 10549*

Lemma for oddpwdc 10552. A natural number is not divisible by one more than the highest power of two which divides it. (Contributed by Jim Kingdon, 17-Nov-2021.)

|- ( A e. NN -> -. ( 2 ^ ( ( iota_ z e. NN0 ( ( 2 ^ z ) || A /\ -. ( 2 ^ ( z + 1 ) ) || A ) ) + 1 ) ) || A )

Theorem

oddpwdclemodd 10550*

Lemma for oddpwdc 10552. Removing the powers of two from a natural number produces an odd number. (Contributed by Jim Kingdon, 16-Nov-2021.)

|- ( A e. NN -> -. 2 || ( A / ( 2 ^ ( iota_ z e. NN0 ( ( 2 ^ z ) || A /\ -. ( 2 ^ ( z + 1 ) ) || A ) ) ) ) )

Theorem

oddpwdclemdc 10551*

Lemma for oddpwdc 10552. Decomposing a number into odd and even parts. (Contributed by Jim Kingdon, 16-Nov-2021.)

|- ( ( ( ( X e. NN /\ -. 2 || X ) /\ Y e. NN0 ) /\ A = ( ( 2 ^ Y ) x. X ) ) <-> ( A e. NN /\ ( X = ( A / ( 2 ^ ( iota_ z e. NN0 ( ( 2 ^ z ) || A /\ -. ( 2 ^ ( z + 1 ) ) || A ) ) ) ) /\ Y = ( iota_ z e. NN0 ( ( 2 ^ z ) || A /\ -. ( 2 ^ ( z + 1 ) ) || A ) ) ) ) )

Theorem

oddpwdc 10552*

The function F that decomposes a number into its "odd" and "even" parts, which is to say the largest power of two and largest odd divisor of a number, is a bijection from pairs of a nonnegative integer and an odd number to positive integers. (Contributed by Thierry Arnoux, 15-Aug-2017.)

|- J = { z e. NN | -. 2 || z }   &    |- F = ( x e. J , y e. NN0 |-> ( ( 2 ^ y ) x. x ) )   =>    |- F : ( J X. NN0 ) -1-1-onto-> NN

Theorem

sqpweven 10553*

The greatest power of two dividing the square of an integer is an even power of two. (Contributed by Jim Kingdon, 17-Nov-2021.)

|- J = { z e. NN | -. 2 || z }   &    |- F = ( x e. J , y e. NN0 |-> ( ( 2 ^ y ) x. x ) )   =>    |- ( A e. NN -> 2 || ( 2nd ` ( `' F ` ( A ^ 2 ) ) ) )

Theorem

2sqpwodd 10554*

The greatest power of two dividing twice the square of an integer is an odd power of two. (Contributed by Jim Kingdon, 17-Nov-2021.)

|- J = { z e. NN | -. 2 || z }   &    |- F = ( x e. J , y e. NN0 |-> ( ( 2 ^ y ) x. x ) )   =>    |- ( A e. NN -> -. 2 || ( 2nd ` ( `' F ` ( 2 x. ( A ^ 2 ) ) ) ) )

Theorem

sqne2sq 10555

The square of a natural number can never be equal to two times the square of a natural number. (Contributed by Jim Kingdon, 17-Nov-2021.)

|- ( ( A e. NN /\ B e. NN ) -> ( A ^ 2 ) =/= ( 2 x. ( B ^ 2 ) ) )

Theorem

znege1 10556

The absolute value of the difference between two unequal integers is at least one. (Contributed by Jim Kingdon, 31-Jan-2022.)

|- ( ( A e. ZZ /\ B e. ZZ /\ A =/= B ) -> 1 <_ ( abs ` ( A - B ) ) )

Theorem

sqrt2irraplemnn 10557

Lemma for sqrt2irrap 10558. The square root of 2 is apart from a positive rational expressed as a numerator and denominator. (Contributed by Jim Kingdon, 2-Oct-2021.)

|- ( ( A e. NN /\ B e. NN ) -> ( sqr ` 2 ) # ( A / B ) )

Theorem

sqrt2irrap 10558

The square root of 2 is irrational. That is, for any rational number, ( sqr ` 2 ) is apart from it. In the absence of excluded middle, we can distinguish between this and "the square root of 2 is not rational" which is sqrt2irr 10541. (Contributed by Jim Kingdon, 2-Oct-2021.)

|- ( Q e. QQ -> ( sqr ` 2 ) # Q )

PART 5  GUIDES AND MISCELLANEA

5.1  Guides (conventions, explanations, and examples)

5.1.1  Conventions

This section describes the conventions we use. However, 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 10559

Unless there is a reason to diverge, we follow the conventions of the Metamath Proof Explorer (aka "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 10603 (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 5531, 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). For this reason, we generally need to prove we are evaluating functions within their domains and avoid the reverse closure theorems of the Metamath Proof Explorer.
• 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.

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.

Abbreviation	Mnenomic	Source	Expression	Syntax?	Example(s)
ap	apart	df-ap 7682		Yes	apadd1 7708, apne 7723

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

(Contributed by Jim Kingdon, 24-Feb-2020.)

|- ph   =>    |- ph

5.1.2  Definitional examples

Theorem

ex-or 10560

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

|- ( 2 = 3 \/ 4 = 4 )

Theorem

ex-an 10561

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

|- ( 2 = 2 /\ 3 = 3 )

Theorem

1kp2ke3k 10562

Example for df-dec 8478, 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 ( 2 + 1 ) = 3, 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 8478 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.)

|- (;;; 1 0 0 0 + ;;; 2 0 0 0 ) = ;;; 3 0 0 0

Theorem

ex-fl 10563

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

|- ( ( |_ ` ( 3 / 2 ) ) = 1 /\ ( |_ ` -u ( 3 / 2 ) ) = -u 2 )

Theorem

ex-ceil 10564

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

|- ( (⌈ ` ( 3 / 2 ) ) = 2 /\ (⌈ ` -u ( 3 / 2 ) ) = -u 1 )

Theorem

ex-fac 10565

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

|- ( ! ` 5 ) = ;; 1 2 0

Theorem

ex-bc 10566

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

|- ( 5 _C 3 ) = ; 1 0

Theorem

ex-dvds 10567

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

|- 3 || 6

Theorem

ex-gcd 10568

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

|- ( -u 6 gcd 9 ) = 3

PART 6  SUPPLEMENTARY MATERIAL (USER'S MATHBOXES)

6.1  Mathboxes for user contributions

6.1.1  Mathbox guidelines

Theorem

mathbox 10569

(This theorem is a dummy placeholder for these guidelines. The name 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 set.mm.

For contributors:

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

Mathboxes are provided to help keep your work synchronized with changes in set.mm, but they shouldn't be depended on as a permanent archive. If you want to preserve your original contribution, it is your responsibility to keep your own copy of it along with the version of set.mm that works with it.

Guidelines:

1. If at all possible, please use only nullary class constants for new definitions.

2. Try to follow the style of the rest of set.mm. Each $p and $a statement must be immediately preceded with the comment that will be shown on its web page description. The metamath program command "write source set.mm /rewrap" will take care of wrapping comment lines and indentation conventions. All mathbox content will be on public display and should hopefully reflect the overall quality of the website.

3. Before submitting a revised mathbox, please make sure it verifies against the current set.mm.

4. Mathboxes should be independent i.e. the proofs should verify with all other mathboxes removed. If you need a theorem from another mathbox, that is fine (and encouraged), but let me know, so I can move the theorem to the main section. One way avoid undesired accidental use of other mathbox theorems is to develop your mathbox using a modified set.mm that has mathboxes removed.

Notes:

1. We may decide to move some theorems to the main part of set.mm for general use.

2. We may make changes to mathboxes to maintain the overall quality of set.mm. Normally we will let you know if a change might impact what you are working on.

3. If you use theorems from another user's mathbox, we don't provide assurance that they are based on correct or consistent $a statements. (If you find such a problem, please let us know so it can be corrected.) (Contributed by NM, 20-Feb-2007.) (New usage is discouraged.)

|- ph   =>    |- ph

6.2  Mathbox for BJ

6.2.1  Propositional calculus

Theorem

nnexmid 10570

Double negation of excluded middle. Intuitionistic logic refutes the negation of excluded middle (but, of course, does not prove excluded middle) for any formula. (Contributed by BJ, 9-Oct-2019.)

|- -. -. ( ph \/ -. ph )

Theorem

nndc 10571

Double negation of decidability of a formula. Intuitionistic logic refutes undecidability (but, of course, does not prove decidability) of any formula. (Contributed by BJ, 9-Oct-2019.)

|- -. -. DECID ph

Theorem

dcdc 10572

Decidability of a proposition is decidable if and only if that proposition is decidable. DECID is idempotent. (Contributed by BJ, 9-Oct-2019.)

|- (DECID DECID ph <-> DECID ph )

6.2.2  Predicate calculus

Theorem

bj-ex 10573*

Existential generalization. (Contributed by BJ, 8-Dec-2019.) Proof modification is discouraged because there are shorter proofs, but using less basic results (like exlimiv 1529 and 19.9ht 1572 or 19.23ht 1426). (Proof modification is discouraged.)

|- ( E. x ph -> ph )

Theorem

bj-hbalt 10574

Closed form of hbal 1406 (copied from set.mm). (Contributed by BJ, 2-May-2019.)

|- ( A. y ( ph -> A. x ph ) -> ( A. y ph -> A. x A. y ph ) )

Theorem

bj-nfalt 10575

Closed form of nfal 1508 (copied from set.mm). (Contributed by BJ, 2-May-2019.)

|- ( A. x F/ y ph -> F/ y A. x ph )

Theorem

spimd 10576

Deduction form of spim 1666. (Contributed by BJ, 17-Oct-2019.)

|- ( ph -> F/ x ch )   &    |- ( ph -> A. x ( x = y -> ( ps -> ch ) ) )   =>    |- ( ph -> ( A. x ps -> ch ) )

Theorem

2spim 10577*

Double substitution, as in spim 1666. (Contributed by BJ, 17-Oct-2019.)

|- F/ x ch   &    |- F/ z ch   &    |- ( ( x = y /\ z = t ) -> ( ps -> ch ) )   =>    |- ( A. z A. x ps -> ch )

Theorem

ch2var 10578*

Implicit substitution of y for x and t for z into a theorem. (Contributed by BJ, 17-Oct-2019.)

|- F/ x ps   &    |- F/ z ps   &    |- ( ( x = y /\ z = t ) -> ( ph <-> ps ) )   &    |- ph   =>    |- ps

Theorem

ch2varv 10579*

Version of ch2var 10578 with non-freeness hypotheses replaced by DV conditions. (Contributed by BJ, 17-Oct-2019.)

|- ( ( x = y /\ z = t ) -> ( ph <-> ps ) )   &    |- ph   =>    |- ps

Theorem

bj-exlimmp 10580

Lemma for bj-vtoclgf 10586. (Contributed by BJ, 21-Nov-2019.) (Proof modification is discouraged.)

|- F/ x ps   &    |- ( ch -> ph )   =>    |- ( A. x ( ch -> ( ph -> ps ) ) -> ( E. x ch -> ps ) )

Theorem

bj-exlimmpi 10581

Lemma for bj-vtoclgf 10586. (Contributed by BJ, 21-Nov-2019.) (Proof modification is discouraged.)

|- F/ x ps   &    |- ( ch -> ph )   &    |- ( ch -> ( ph -> ps ) )   =>    |- ( E. x ch -> ps )

Theorem

bj-sbimedh 10582

A strengthening of sbiedh 1710 (same proof). (Contributed by BJ, 16-Dec-2019.)

|- ( ph -> A. x ph )   &    |- ( ph -> ( ch -> A. x ch ) )   &    |- ( ph -> ( x = y -> ( ps -> ch ) ) )   =>    |- ( ph -> ( [ y / x ] ps -> ch ) )

Theorem

bj-sbimeh 10583

A strengthening of sbieh 1713 (same proof). (Contributed by BJ, 16-Dec-2019.)

|- ( ps -> A. x ps )   &    |- ( x = y -> ( ph -> ps ) )   =>    |- ( [ y / x ] ph -> ps )

Theorem

bj-sbime 10584

A strengthening of sbie 1714 (same proof). (Contributed by BJ, 16-Dec-2019.)

|- F/ x ps   &    |- ( x = y -> ( ph -> ps ) )   =>    |- ( [ y / x ] ph -> ps )

6.2.3  Extensionality

Various utility theorems using FOL and extensionality.

Theorem

bj-vtoclgft 10585

Weakening two hypotheses of vtoclgf 2657. (Contributed by BJ, 21-Nov-2019.)

|- F/_ x A   &    |- F/ x ps   &    |- ( x = A -> ph )   =>    |- ( A. x ( x = A -> ( ph -> ps ) ) -> ( A e. V -> ps ) )

Theorem

bj-vtoclgf 10586

Weakening two hypotheses of vtoclgf 2657. (Contributed by BJ, 21-Nov-2019.)

|- F/_ x A   &    |- F/ x ps   &    |- ( x = A -> ph )   &    |- ( x = A -> ( ph -> ps ) )   =>    |- ( A e. V -> ps )

Theorem

elabgf0 10587

Lemma for elabgf 2736. (Contributed by BJ, 21-Nov-2019.)

|- ( x = A -> ( A e. { x | ph } <-> ph ) )

Theorem

elabgft1 10588

One implication of elabgf 2736, in closed form. (Contributed by BJ, 21-Nov-2019.)

|- F/_ x A   &    |- F/ x ps   =>    |- ( A. x ( x = A -> ( ph -> ps ) ) -> ( A e. { x | ph } -> ps ) )

Theorem

elabgf1 10589

One implication of elabgf 2736. (Contributed by BJ, 21-Nov-2019.)

|- F/_ x A   &    |- F/ x ps   &    |- ( x = A -> ( ph -> ps ) )   =>    |- ( A e. { x | ph } -> ps )

Theorem

elabgf2 10590

One implication of elabgf 2736. (Contributed by BJ, 21-Nov-2019.)

|- F/_ x A   &    |- F/ x ps   &    |- ( x = A -> ( ps -> ph ) )   =>    |- ( A e. B -> ( ps -> A e. { x | ph } ) )

Theorem

elabf1 10591*

One implication of elabf 2737. (Contributed by BJ, 21-Nov-2019.)

|- F/ x ps   &    |- ( x = A -> ( ph -> ps ) )   =>    |- ( A e. { x | ph } -> ps )

Theorem

elabf2 10592*

One implication of elabf 2737. (Contributed by BJ, 21-Nov-2019.)

|- F/ x ps   &    |- A e. _V   &    |- ( x = A -> ( ps -> ph ) )   =>    |- ( ps -> A e. { x | ph } )

Theorem

elab1 10593*

One implication of elab 2738. (Contributed by BJ, 21-Nov-2019.)

|- ( x = A -> ( ph -> ps ) )   =>    |- ( A e. { x | ph } -> ps )

Theorem

elab2a 10594*

One implication of elab 2738. (Contributed by BJ, 21-Nov-2019.)

|- A e. _V   &    |- ( x = A -> ( ps -> ph ) )   =>    |- ( ps -> A e. { x | ph } )

Theorem

elabg2 10595*

One implication of elabg 2739. (Contributed by BJ, 21-Nov-2019.)

|- ( x = A -> ( ps -> ph ) )   =>    |- ( A e. V -> ( ps -> A e. { x | ph } ) )

Theorem

bj-rspgt 10596

Restricted specialization, generalized. Weakens a hypothesis of rspccv 2698 and seems to have a shorter proof. (Contributed by BJ, 21-Nov-2019.)

|- F/_ x A   &    |- F/_ x B   &    |- F/ x ps   =>    |- ( A. x ( x = A -> ( ph -> ps ) ) -> ( A. x e. B ph -> ( A e. B -> ps ) ) )

Theorem

bj-rspg 10597

Restricted specialization, generalized. Weakens a hypothesis of rspccv 2698 and seems to have a shorter proof. (Contributed by BJ, 21-Nov-2019.)

|- F/_ x A   &    |- F/_ x B   &    |- F/ x ps   &    |- ( x = A -> ( ph -> ps ) )   =>    |- ( A. x e. B ph -> ( A e. B -> ps ) )

Theorem

cbvrald 10598*

Rule used to change bound variables, using implicit substitution. (Contributed by BJ, 22-Nov-2019.)

|- F/ x ph   &    |- F/ y ph   &    |- ( ph -> F/ y ps )   &    |- ( ph -> F/ x ch )   &    |- ( ph -> ( x = y -> ( ps <-> ch ) ) )   =>    |- ( ph -> ( A. x e. A ps <-> A. y e. A ch ) )

Theorem

bj-intabssel 10599

Version of intss1 3651 using a class abstraction and explicit substitution. (Contributed by BJ, 29-Nov-2019.)

|- F/_ x A   =>    |- ( A e. V -> ( [. A / x ]. ph -> |^| { x | ph } C_ A ) )

Theorem

bj-intabssel1 10600

Version of intss1 3651 using a class abstraction and implicit substitution. Closed form of intmin3 3663. (Contributed by BJ, 29-Nov-2019.)

|- F/_ x A   &    |- F/ x ps   &    |- ( x = A -> ( ps -> ph ) )   =>    |- ( A e. V -> ( ps -> |^| { x | ph } C_ A ) )