Intuitionistic Logic Explorer Most Recent Proofs Mirrors  >  Home  >  ILE Home  >  Th. List  >  Recent MPE Most Recent             Other  >  MM 100

Most recent proofs    These are the 100 (Unicode, GIF) or 1000 (Unicode, GIF) most recent proofs in the iset.mm database for the Intuitionistic Logic Explorer. The iset.mm database is maintained on GitHub with master (stable) and develop (development) versions. This page was created from the commit given on the MPE Most Recent Proofs page. The database from that commit is also available here: iset.mm.

See the MPE Most Recent Proofs page for news and some useful links.

 Color key: Intuitionistic Logic Explorer User Mathboxes

Last updated on 25-Oct-2021 at 2:44 PM ET.
Recent Additions to the Intuitionistic Logic Explorer
DateLabelDescription
Theorem

24-Oct-2021ax-ddkcomp 10114 Axiom of Dedekind completeness for Dedekind real numbers: every nonempty upper-bounded located set of reals has a real upper bound. Ideally, this axiom should be "proved" as "axddkcomp" for the real numbers constructed from IZF, and then the axiom ax-ddkcomp 10114 should be used in place of construction specific results. In particular, axcaucvg 6974 should be proved from it. (Contributed by BJ, 24-Oct-2021.)

20-Oct-2021onunsnss 6355 Adding a singleton to create an ordinal. (Contributed by Jim Kingdon, 20-Oct-2021.)

19-Oct-2021snon0 6356 An ordinal which is a singleton is . (Contributed by Jim Kingdon, 19-Oct-2021.)

18-Oct-2021qdencn 10124 The set of complex numbers whose real and imaginary parts are rational is dense in the complex plane. This is a two dimensional analogue to qdenre 9798 (and also would hold for with the usual metric; this is not about complex numbers in particular). (Contributed by Jim Kingdon, 18-Oct-2021.)

18-Oct-2021modqmulnn 9184 Move a positive integer in and out of a floor in the first argument of a modulo operation. (Contributed by Jim Kingdon, 18-Oct-2021.)

18-Oct-2021intqfrac 9181 Break a number into its integer part and its fractional part. (Contributed by Jim Kingdon, 18-Oct-2021.)

18-Oct-2021flqmod 9180 The floor function expressed in terms of the modulo operation. (Contributed by Jim Kingdon, 18-Oct-2021.)

18-Oct-2021modqfrac 9179 The fractional part of a number is the number modulo 1. (Contributed by Jim Kingdon, 18-Oct-2021.)

18-Oct-2021modqdifz 9178 The modulo operation differs from by an integer multiple of . (Contributed by Jim Kingdon, 18-Oct-2021.)

18-Oct-2021modqdiffl 9177 The modulo operation differs from by an integer multiple of . (Contributed by Jim Kingdon, 18-Oct-2021.)

18-Oct-2021modqelico 9176 Modular reduction produces a half-open interval. (Contributed by Jim Kingdon, 18-Oct-2021.)

18-Oct-2021modqlt 9175 The modulo operation is less than its second argument. (Contributed by Jim Kingdon, 18-Oct-2021.)

18-Oct-2021modqge0 9174 The modulo operation is nonnegative. (Contributed by Jim Kingdon, 18-Oct-2021.)

18-Oct-2021negqmod0 9173 is divisible by iff its negative is. (Contributed by Jim Kingdon, 18-Oct-2021.)

18-Oct-2021mulqmod0 9172 The product of an integer and a positive rational number is 0 modulo the positive real number. (Contributed by Jim Kingdon, 18-Oct-2021.)

18-Oct-2021flqdiv 9163 Cancellation of the embedded floor of a real divided by an integer. (Contributed by Jim Kingdon, 18-Oct-2021.)

18-Oct-2021intqfrac2 9161 Decompose a real into integer and fractional parts. (Contributed by Jim Kingdon, 18-Oct-2021.)

17-Oct-2021modq0 9171 is zero iff is evenly divisible by . (Contributed by Jim Kingdon, 17-Oct-2021.)

16-Oct-2021modqcld 9170 Closure law for the modulo operation. (Contributed by Jim Kingdon, 16-Oct-2021.)

16-Oct-2021flqpmodeq 9169 Partition of a division into its integer part and the remainder. (Contributed by Jim Kingdon, 16-Oct-2021.)

16-Oct-2021modqcl 9168 Closure law for the modulo operation. (Contributed by Jim Kingdon, 16-Oct-2021.)

16-Oct-2021modqvalr 9167 The value of the modulo operation (multiplication in reversed order). (Contributed by Jim Kingdon, 16-Oct-2021.)

16-Oct-2021modqval 9166 The value of the modulo operation. The modulo congruence notation of number theory, (modulo ), can be expressed in our notation as . Definition 1 in Knuth, The Art of Computer Programming, Vol. I (1972), p. 38. Knuth uses "mod" for the operation and "modulo" for the congruence. Unlike Knuth, we restrict the second argument to positive numbers to simplify certain theorems. (This also gives us future flexibility to extend it to any one of several different conventions for a zero or negative second argument, should there be an advantage in doing so.) As with flqcl 9117 we only prove this for rationals although other particular kinds of real numbers may be possible. (Contributed by Jim Kingdon, 16-Oct-2021.)

15-Oct-2021qdenre 9798 The rational numbers are dense in : any real number can be approximated with arbitrary precision by a rational number. For order theoretic density, see qbtwnre 9111. (Contributed by BJ, 15-Oct-2021.)

14-Oct-2021qbtwnrelemcalc 9110 Lemma for qbtwnre 9111. Calculations involved in showing the constructed rational number is less than . (Contributed by Jim Kingdon, 14-Oct-2021.)

13-Oct-2021rebtwn2z 9109 A real number can be bounded by integers above and below which are two apart.

The proof starts by finding two integers which are less than and greater than the given real number. Then this range can be shrunk by choosing an integer in between the endpoints of the range and then deciding which half of the range to keep based on weak linearity, and iterating until the range consists of integers which are two apart. (Contributed by Jim Kingdon, 13-Oct-2021.)

13-Oct-2021rebtwn2zlemshrink 9108 Lemma for rebtwn2z 9109. Shrinking the range around the given real number. (Contributed by Jim Kingdon, 13-Oct-2021.)

13-Oct-2021rebtwn2zlemstep 9107 Lemma for rebtwn2z 9109. Induction step. (Contributed by Jim Kingdon, 13-Oct-2021.)

11-Oct-2021flqeqceilz 9160 A rational number is an integer iff its floor equals its ceiling. (Contributed by Jim Kingdon, 11-Oct-2021.)

11-Oct-2021flqleceil 9159 The floor of a rational number is less than or equal to its ceiling. (Contributed by Jim Kingdon, 11-Oct-2021.)

11-Oct-2021ceilqidz 9158 A rational number equals its ceiling iff it is an integer. (Contributed by Jim Kingdon, 11-Oct-2021.)

11-Oct-2021ceilqle 9156 The ceiling of a real number is the smallest integer greater than or equal to it. (Contributed by Jim Kingdon, 11-Oct-2021.)

11-Oct-2021ceiqle 9155 The ceiling of a real number is the smallest integer greater than or equal to it. (Contributed by Jim Kingdon, 11-Oct-2021.)

11-Oct-2021ceilqm1lt 9154 One less than the ceiling of a real number is strictly less than that number. (Contributed by Jim Kingdon, 11-Oct-2021.)

11-Oct-2021ceiqm1l 9153 One less than the ceiling of a real number is strictly less than that number. (Contributed by Jim Kingdon, 11-Oct-2021.)

11-Oct-2021ceilqge 9152 The ceiling of a real number is greater than or equal to that number. (Contributed by Jim Kingdon, 11-Oct-2021.)

11-Oct-2021ceiqge 9151 The ceiling of a real number is greater than or equal to that number. (Contributed by Jim Kingdon, 11-Oct-2021.)

11-Oct-2021ceilqcl 9150 Closure of the ceiling function. (Contributed by Jim Kingdon, 11-Oct-2021.)

11-Oct-2021ceiqcl 9149 The ceiling function returns an integer (closure law). (Contributed by Jim Kingdon, 11-Oct-2021.)

11-Oct-2021qdceq 9102 Equality of rationals is decidable. (Contributed by Jim Kingdon, 11-Oct-2021.)
DECID

11-Oct-2021qltlen 8575 Rational 'Less than' expressed in terms of 'less than or equal to'. Also see ltleap 7621 which is a similar result for real numbers. (Contributed by Jim Kingdon, 11-Oct-2021.)

10-Oct-2021ceilqval 9148 The value of the ceiling function. (Contributed by Jim Kingdon, 10-Oct-2021.)

10-Oct-2021flqmulnn0 9141 Move a nonnegative integer in and out of a floor. (Contributed by Jim Kingdon, 10-Oct-2021.)

10-Oct-2021flqzadd 9140 An integer can be moved in and out of the floor of a sum. (Contributed by Jim Kingdon, 10-Oct-2021.)

10-Oct-2021flqaddz 9139 An integer can be moved in and out of the floor of a sum. (Contributed by Jim Kingdon, 10-Oct-2021.)

10-Oct-2021flqge1nn 9136 The floor of a number greater than or equal to 1 is a positive integer. (Contributed by Jim Kingdon, 10-Oct-2021.)

10-Oct-2021flqge0nn0 9135 The floor of a number greater than or equal to 0 is a nonnegative integer. (Contributed by Jim Kingdon, 10-Oct-2021.)

10-Oct-20214ap0 8015 The number 4 is apart from zero. (Contributed by Jim Kingdon, 10-Oct-2021.)
#

10-Oct-20213ap0 8012 The number 3 is apart from zero. (Contributed by Jim Kingdon, 10-Oct-2021.)
#

9-Oct-2021flqbi2 9133 A condition equivalent to floor. (Contributed by Jim Kingdon, 9-Oct-2021.)

9-Oct-2021flqbi 9132 A condition equivalent to floor. (Contributed by Jim Kingdon, 9-Oct-2021.)

9-Oct-2021flqword2 9131 Ordering relationship for the greatest integer function. (Contributed by Jim Kingdon, 9-Oct-2021.)

9-Oct-2021flqwordi 9130 Ordering relationship for the greatest integer function. (Contributed by Jim Kingdon, 9-Oct-2021.)

9-Oct-2021flqltnz 9129 If A is not an integer, then the floor of A is less than A. (Contributed by Jim Kingdon, 9-Oct-2021.)

9-Oct-2021flqidz 9128 A rational number equals its floor iff it is an integer. (Contributed by Jim Kingdon, 9-Oct-2021.)

8-Oct-2021flqidm 9127 The floor function is idempotent. (Contributed by Jim Kingdon, 8-Oct-2021.)

8-Oct-2021flqlt 9125 The floor function value is less than the next integer. (Contributed by Jim Kingdon, 8-Oct-2021.)

8-Oct-2021flqge 9124 The floor function value is the greatest integer less than or equal to its argument. (Contributed by Jim Kingdon, 8-Oct-2021.)

8-Oct-2021qfracge0 9123 The fractional part of a rational number is nonnegative. (Contributed by Jim Kingdon, 8-Oct-2021.)

8-Oct-2021qfraclt1 9122 The fractional part of a rational number is less than one. (Contributed by Jim Kingdon, 8-Oct-2021.)

8-Oct-2021flqltp1 9121 A basic property of the floor (greatest integer) function. (Contributed by Jim Kingdon, 8-Oct-2021.)

8-Oct-2021flqle 9120 A basic property of the floor (greatest integer) function. (Contributed by Jim Kingdon, 8-Oct-2021.)

8-Oct-2021flqcld 9119 The floor (greatest integer) function is an integer (closure law). (Contributed by Jim Kingdon, 8-Oct-2021.)

8-Oct-2021flqlelt 9118 A basic property of the floor (greatest integer) function. (Contributed by Jim Kingdon, 8-Oct-2021.)

8-Oct-2021flqcl 9117 The floor (greatest integer) function yields an integer when applied to a rational (closure law). It would presumably be possible to prove a similar result for some real numbers (for example, those apart from any integer), but not real numbers in general. (Contributed by Jim Kingdon, 8-Oct-2021.)

8-Oct-2021qbtwnz 9106 There is a unique greatest integer less than or equal to a rational number. (Contributed by Jim Kingdon, 8-Oct-2021.)

8-Oct-2021qbtwnzlemex 9105 Lemma for qbtwnz 9106. Existence of the integer.

The proof starts by finding two integers which are less than and greater than the given rational number. Then this range can be shrunk by choosing an integer in between the endpoints of the range and then deciding which half of the range to keep based on rational number trichotomy, and iterating until the range consists of two consecutive integers. (Contributed by Jim Kingdon, 8-Oct-2021.)

8-Oct-2021qbtwnzlemshrink 9104 Lemma for qbtwnz 9106. Shrinking the range around the given rational number. (Contributed by Jim Kingdon, 8-Oct-2021.)

8-Oct-2021qbtwnzlemstep 9103 Lemma for qbtwnz 9106. Induction step. (Contributed by Jim Kingdon, 8-Oct-2021.)

8-Oct-2021qltnle 9101 'Less than' expressed in terms of 'less than or equal to'. (Contributed by Jim Kingdon, 8-Oct-2021.)

7-Oct-2021qlelttric 9100 Rational trichotomy. (Contributed by Jim Kingdon, 7-Oct-2021.)

6-Oct-2021qletric 9099 Rational trichotomy. (Contributed by Jim Kingdon, 6-Oct-2021.)

6-Oct-2021qtri3or 9098 Rational trichotomy. (Contributed by Jim Kingdon, 6-Oct-2021.)

3-Oct-2021reg3exmid 4304 If any inhabited set satisfying df-wetr 4071 for has a minimal element, excluded middle follows. (Contributed by Jim Kingdon, 3-Oct-2021.)

3-Oct-2021reg3exmidlemwe 4303 Lemma for reg3exmid 4304. Our counterexample satisfies . (Contributed by Jim Kingdon, 3-Oct-2021.)

2-Oct-2021reg2exmid 4261 If any inhabited set has a minimal element (when expressed by ), excluded middle follows. (Contributed by Jim Kingdon, 2-Oct-2021.)

2-Oct-2021reg2exmidlema 4259 Lemma for reg2exmid 4261. If has a minimal element (expressed by ), excluded middle follows. (Contributed by Jim Kingdon, 2-Oct-2021.)

30-Sep-2021fin0or 6343 A finite set is either empty or inhabited. (Contributed by Jim Kingdon, 30-Sep-2021.)

30-Sep-2021wessep 4302 A subset of a set well-ordered by set membership is well-ordered by set membership. (Contributed by Jim Kingdon, 30-Sep-2021.)

28-Sep-2021frind 4089 Induction over a well-founded set. (Contributed by Jim Kingdon, 28-Sep-2021.)

26-Sep-2021wetriext 4301 A trichotomous well-order is extensional. (Contributed by Jim Kingdon, 26-Sep-2021.)

25-Sep-2021nnwetri 6354 A natural number is well-ordered by . More specifically, this order both satisfies and is trichotomous. (Contributed by Jim Kingdon, 25-Sep-2021.)

23-Sep-2021wepo 4096 A well-ordering is a partial ordering. (Contributed by Jim Kingdon, 23-Sep-2021.)

23-Sep-2021df-wetr 4071 Define the well-ordering predicate. It is unusual to define "well-ordering" in the absence of excluded middle, but we mean an ordering which is like the ordering which we have for ordinals (for example, it does not entail trichotomy because ordinals don't have that as seen at ordtriexmid 4247). Given excluded middle, well-ordering is usually defined to require trichotomy (and the defintion of is typically also different). (Contributed by Mario Carneiro and Jim Kingdon, 23-Sep-2021.)

22-Sep-2021frforeq3 4084 Equality theorem for the well-founded predicate. (Contributed by Jim Kingdon, 22-Sep-2021.)
FrFor FrFor

22-Sep-2021frforeq2 4082 Equality theorem for the well-founded predicate. (Contributed by Jim Kingdon, 22-Sep-2021.)
FrFor FrFor

22-Sep-2021frforeq1 4080 Equality theorem for the well-founded predicate. (Contributed by Jim Kingdon, 22-Sep-2021.)
FrFor FrFor

22-Sep-2021df-frfor 4068 Define the well-founded relation predicate where might be a proper class. By passing in we allow it potentially to be a proper class rather than a set. (Contributed by Jim Kingdon and Mario Carneiro, 22-Sep-2021.)
FrFor

21-Sep-2021frirrg 4087 A well-founded relation is irreflexive. This is the case where exists. (Contributed by Jim Kingdon, 21-Sep-2021.)

21-Sep-2021df-frind 4069 Define the well-founded relation predicate. In the presence of excluded middle, there are a variety of equivalent ways to define this. In our case, this definition, in terms of an inductive principle, works better than one along the lines of "there is an element which is minimal when A is ordered by R". Because is constrained to be a set (not a proper class) here, sometimes it may be necessary to use FrFor directly rather than via . (Contributed by Jim Kingdon and Mario Carneiro, 21-Sep-2021.)
FrFor

17-Sep-2021ontr2exmid 4250 An ordinal transitivity law which implies excluded middle. (Contributed by Jim Kingdon, 17-Sep-2021.)

16-Sep-2021nnsseleq 6079 For natural numbers, inclusion is equivalent to membership or equality. (Contributed by Jim Kingdon, 16-Sep-2021.)

15-Sep-2021fientri3 6353 Trichotomy of dominance for finite sets. (Contributed by Jim Kingdon, 15-Sep-2021.)

15-Sep-2021nntri2or2 6076 A trichotomy law for natural numbers. (Contributed by Jim Kingdon, 15-Sep-2021.)

14-Sep-2021findcard2sd 6349 Deduction form of finite set induction . (Contributed by Jim Kingdon, 14-Sep-2021.)

13-Sep-2021php5fin 6339 A finite set is not equinumerous to a set which adds one element. (Contributed by Jim Kingdon, 13-Sep-2021.)

13-Sep-2021fiunsnnn 6338 Adding one element to a finite set which is equinumerous to a natural number. (Contributed by Jim Kingdon, 13-Sep-2021.)

12-Sep-2021fisbth 6340 Schroeder-Bernstein Theorem for finite sets. (Contributed by Jim Kingdon, 12-Sep-2021.)

11-Sep-2021diffisn 6350 Subtracting a singleton from a finite set produces a finite set. (Contributed by Jim Kingdon, 11-Sep-2021.)

10-Sep-2021fin0 6342 A nonempty finite set has at least one element. (Contributed by Jim Kingdon, 10-Sep-2021.)

 Copyright terms: Public domain W3C HTML validation [external]