Definition · Subject of the article ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
In mathematics, the distributive property of binary operations is a generalization of the distributive law, which asserts that the equality x ⋅ (y + z ) = x ⋅ y + x ⋅ z is always true in elementary algebra. Show all
left_distrib more general
theorem left_distrib {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c
Mathlib.Algebra.Ring.Defs · lines 87–89
Why more general: Lean states the identity for any carrier whose multiplication and addition satisfy the left-distributive class, which is the binary-operation setting the passage speaks about.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c6981d40ae43 · pair key 4e6031fcfbbf.
Distrib more general
class Distrib : Type u_1 → Type u_1
Mathlib.Algebra.Ring.Defs · lines 62–66
Why more general: This Lean class is the property of a pair of binary operations on any carrier, and it carries the right-hand law beside the one the passage displays.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2faf2acc23d6 · pair key fe5f421f8be3.
Nat. left_distrib special case
theorem Nat.left_distrib (n m k : Nat) : n * (m + k) = n * m + n * k
Init.Data.Nat.Basic · lines 225–228
Why a special case: Lean fixes the carrier to the natural numbers, where the passage speaks of numbers at large.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 6378940267d0 · pair key 7a59c8c8780b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting ✓ Formalized
Formalized: Lean core states a more general result (proved).
For example, in elementary arithmetic, one has 2 ⋅ (1 + 3) = (2 ⋅ 1) + (2 ⋅ 3). Therefore, one would say that multiplication distributes over addition. Show all
Nat. left_distrib more general
theorem Nat.left_distrib (n m k : Nat) : n * (m + k) = n * m + n * k
Init.Data.Nat.Basic · lines 225–228
Why more general: Lean quantifies over all natural numbers where the example fixes three of them.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 79a150f0ee5c · pair key c9296be05579.
left_distrib more general
theorem left_distrib {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c
Mathlib.Algebra.Ring.Defs · lines 87–89
Why more general: Lean states the law for any carrier carrying the left-distributive class, not for the three numbers of the example.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c56210a8dd9e · pair key a099b00e2393.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting ◔ Partial
Partial: Mathlib states a special case (a definition).
For example, in elementary arithmetic, one has 2 ⋅ (1 + 3) = (2 ⋅ 1) + (2 ⋅ 3). Therefore, one would say that multiplication distributes over addition. Show all
Nat. instDistrib special case
instance Nat.instDistrib : Distrib ℕ
Mathlib.Algebra.Ring.Nat · lines 34–36
Why a special case: Lean records the property for the natural numbers, one of the number systems the passage covers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2d9c20f93857 · pair key 10b95385ac25.
Int. instDistrib special case
instance Int.instDistrib : Distrib ℤ
Mathlib.Algebra.Ring.Int.Defs · line 89
Why a special case: Lean records the property for the integers, another of the number systems the passage covers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key dc2b57a92e6a · pair key 3de3b5e44119.
left_distrib states part
theorem left_distrib {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c
Mathlib.Algebra.Ring.Defs · lines 87–89
Why only part: It gives the law with the sum on the right of the product, and leaves the companion law to right_distrib.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b1d4f3cd44f7 · pair key e11c55e83fde.
right_distrib states part
theorem right_distrib {R : Type v} [Mul R] [Add R] [RightDistribClass R] (a b c : R) : (a + b) * c = a * c + b * c
Mathlib.Algebra.Ring.Defs · lines 93–95
Why only part: It gives the law with the sum on the left of the product, and leaves the companion law to left_distrib.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key bd9647e077d3 · pair key 23eac1dd06a2.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting ✓ Formalized
Formalized by 2 parts together (more general):
inf_sup_left Mathlib (proved) conjunction distributes over disjunction sup_inf_left Mathlib (proved) disjunction distributes over conjunction
It is also encountered in Boolean algebra and mathematical logic, where each of the logical and (denoted ∧ ) and the logical or (denoted ∨ ) distributes over the other. Show all
inf_sup_left states part
theorem inf_sup_left {α : Type u} [DistribLattice α] (a b c : α) : a ⊓ (b ⊔ c) = a ⊓ b ⊔ a ⊓ c
Mathlib.Order.Defs.Lattice · lines 323–329
Why only part: Lean writes the law with lattice meet and join, and the index supplies those instances for Boolean algebras and for Prop.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 57527c2ad949 · pair key 7545cf505e1a.
sup_inf_left states part
theorem sup_inf_left {α : Type u} [DistribLattice α] (a b c : α) : a ⊔ b ⊓ c = (a ⊔ b) ⊓ (a ⊔ c)
Mathlib.Order.Defs.Lattice · lines 316–317
Why only part: Lean writes the companion law with lattice join and meet, over the same class of carriers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2c691086c959 · pair key 288605d628d8.
and_or_left states part
theorem and_or_left {a b c : Prop} : a ∧ (b ∨ c) ↔ a ∧ b ∨ a ∧ c
Init.PropLemmas · lines 120–122
Why only part: Lean states it for propositions only, while the conjunct also speaks of Boolean algebras.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key c93e2c5463c5 · pair key 76f6a826942a.
or_and_left states part
theorem or_and_left {a b c : Prop} : a ∨ b ∧ c ↔ (a ∨ b) ∧ (a ∨ c)
Init.PropLemmas · lines 128–130
Why only part: Lean states it for propositions only, while the conjunct also speaks of Boolean algebras.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 065717d8de59 · pair key 95be8458e4e7.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Definition ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
Given a set S and two binary operators ∗ and + on S , the operation ∗ is left-distributive over (or with respect to) + if, given any elements x , y , and z of S , x ∗ (y + z ) = (x ∗ y ) + (x ∗ z ); Show all
LeftDistribClass exact match
class LeftDistribClass (R : Type*) [Mul R] [Add R] : Prop
Mathlib.Algebra.Ring.Defs · lines 69–71
Note: The Lean class carries the two operations as instances on the carrier type, and its field is the identity the passage displays.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key be17a4b8c705 · pair key 49778473eedb.
left_distrib close match
theorem left_distrib {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c
Mathlib.Algebra.Ring.Defs · lines 87–89
Why close, not exact: It unfolds the Lean class into the equation that the passage uses as its definition.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 50d4d766f787 · pair key 129e0834ffc6.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Definition ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
x ∗ (y + z ) = (x ∗ y ) + (x ∗ z ); the operation ∗ is right-distributive over + if, given any elements x , y , and z of S , (y + z ) ∗ x = (y ∗ x ) + (z ∗ x ); Show all
RightDistribClass exact match
class RightDistribClass (R : Type*) [Mul R] [Add R] : Prop
Mathlib.Algebra.Ring.Defs · lines 74–76
Note: The Lean class carries the two operations as instances on the carrier type, and its field is the identity the passage displays.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f4cccdcbab4c · pair key 49044043cc6e.
right_distrib close match
theorem right_distrib {R : Type v} [Mul R] [Add R] [RightDistribClass R] (a b c : R) : (a + b) * c = a * c + b * c
Mathlib.Algebra.Ring.Defs · lines 93–95
Why close, not exact: It unfolds the Lean class into the equation that the passage uses as its definition.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2bb09d9f778d · pair key 291a27e85433.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Definition ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
(y + z ) ∗ x = (y ∗ x ) + (z ∗ x ); and the operation ∗ is distributive over + if it is left- and right-distributive. Show all
Distrib close match
class Distrib : Type u_1 → Type u_1
Mathlib.Algebra.Ring.Defs · lines 62–66
Why close, not exact: The Lean class bundles the carrier with its two operations and with both one-sided laws, as the passage's definition does.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 599895637581 · pair key 019a2411a5fc.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Definition ✕ Not formalized
When ∗ is commutative, the three conditions above are logically equivalent. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 50d81bbd579f). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Meaning ◔ Partial
Partial: Mathlib states part of this (a definition).
If the operation denoted ⋅ is not commutative, there is a distinction between left-distributivity and right-distributivity: a ⋅ (b ± c ) = a ⋅ b ± a ⋅ c (left-distributive) (a ± b ) ⋅ c = a ⋅ c ± b ⋅ c (right-distributive) . Show all
LeftDistribClass states part
class LeftDistribClass (R : Type*) [Mul R] [Add R] : Prop
Mathlib.Algebra.Ring.Defs · lines 69–71
Why only part: Lean's class is written for the addition case only, so it leaves the minus reading of the first identity to a separate lemma.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d00731432132 · pair key 91b93f5628a7.
RightDistribClass states part
class RightDistribClass (R : Type*) [Mul R] [Add R] : Prop
Mathlib.Algebra.Ring.Defs · lines 74–76
Why only part: As with its left-hand twin, Lean writes the bracket as a sum, so the minus reading of the second identity is a separate lemma.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 104e51d24754 · pair key 24f9a934b470.
mul_sub states part
theorem mul_sub {α : Type u} [NonUnitalNonAssocRing α] (a b c : α) : a * (b - c) = a * b - a * c
Mathlib.Algebra.Ring.Defs · line 348
Why only part: This covers the subtraction half of the first condition, which the distributive class above leaves out.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e3c28869709f · pair key 154384436c21.
sub_mul states part
theorem sub_mul {α : Type u} [NonUnitalNonAssocRing α] (a b c : α) : (a - b) * c = a * c - b * c
Mathlib.Algebra.Ring.Defs · line 353
Why only part: This covers the subtraction half of the second condition, which the right-hand distributive class leaves out.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 15d0821fca59 · pair key b347f087ed0c.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Meaning ◔ Partial
Partial: Mathlib states part of this (proved).
To multiply a sum (or difference) by a factor, each summand (or minuend and subtrahend) is multiplied by this factor and the resulting products are added (or subtracted). Show all
add_mul states part
theorem add_mul {R : Type v} [Mul R] [Add R] [RightDistribClass R] (a b c : R) : (a + b) * c = a * c + b * c
Mathlib.Algebra.Ring.Defs · line 97
Why only part: Lean writes only the sum case, so the difference case the passage also describes is left to its companion lemma.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f9463e731a60 · pair key fc84ff750100.
sub_mul states part
theorem sub_mul {α : Type u} [NonUnitalNonAssocRing α] (a b c : α) : (a - b) * c = a * c - b * c
Mathlib.Algebra.Ring.Defs · line 353
Why only part: This is the minuend-and-subtrahend case of the verbal rule; the sum case is the lemma above.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f67600328e80 · pair key d84e69761595.
mul_add states part
theorem mul_add {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c
Mathlib.Algebra.Ring.Defs · line 91
Why only part: The passage describes the rule without fixing the side of the factor, and this lemma is the sum case with the factor in front.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2ec812ff1e5e · pair key 39087f39ba3f.
mul_sub states part
theorem mul_sub {α : Type u} [NonUnitalNonAssocRing α] (a b c : α) : a * (b - c) = a * b - a * c
Mathlib.Algebra.Ring.Defs · line 348
Why only part: This is the difference case with the factor in front, the fourth of the four readings the verbal rule covers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c7ca3c1b6318 · pair key 9bb1884a1f3e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Meaning ✕ Not formalized
If the operation outside the parentheses (in this case, the multiplication) is commutative, then left-distributivity implies right-distributivity and vice versa , and one talks simply of distributivity. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 933ca9cf2f25). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Meaning ◔ Partial
Partial: Mathlib states part of this (proved).
One example of an operation that is "only" right-distributive is division, which is not commutative: (a ± b ) ÷ c = a ÷ c ± b ÷ c . In this case, left-distributivity does not apply: a ÷ (b ± c ) ≠ a ÷ b ± a ÷ c Show all
add_div states part
theorem add_div {K : Type*} [DivisionSemiring K] (a b c : K) : (a + b) / c = a / c + b / c
Mathlib.Algebra.Field.Basic · line 33
Why only part: Lean writes the sum case; neither the minus reading nor the remark that division is not commutative is part of this lemma.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key bf1f989e5bc2 · pair key 28f998316470.
sub_div states part
theorem sub_div {K : Type*} [DivisionRing K] (a b c : K) : (a - b) / c = a / c - b / c
Mathlib.Algebra.Field.Basic · lines 109–110
Why only part: This completes the two sign readings of the identity, while the non-commutativity of division stays unstated.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b7e114d4f2bf · pair key 34c0c556ce43.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Meaning ✕ Not formalized
One example of an operation that is "only" right-distributive is division, which is not commutative: (a ± b ) ÷ c = a ÷ c ± b ÷ c . In this case, left-distributivity does not apply: a ÷ (b ± c ) ≠ a ÷ b ± a ÷ c Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt a6fd9f755d73). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Meaning ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The distributive laws are among the axioms for rings (like the ring of integers) and fields (like the field of rational numbers). Show all
NonUnitalNonAssocSemiring. toDistrib more general
instance NonUnitalNonAssocSemiring.toDistrib {α : Type u} [self : NonUnitalNonAssocSemiring α] : Distrib α
Mathlib.Algebra.Ring.Defs · line 119
Why more general: Lean records the two laws as an ancestor of the whole ring hierarchy, so they hold for rings and also for carriers weaker than rings.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1f69d2a60bc7 · pair key 94b4fab6dd0e.
Int. instCommRing special case
instance Int.instCommRing : CommRing ℤ
Mathlib.Algebra.Ring.Int.Defs · lines 28–45
Why a special case: Lean fixes the carrier to the integers, the example the passage names, where the passage speaks of rings at large.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 42a89b6a6f2f · pair key fce414f57e1e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Meaning ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The distributive laws are among the axioms for rings (like the ring of integers) and fields (like the field of rational numbers). Show all
NonUnitalNonAssocSemiring. toDistrib more general
instance NonUnitalNonAssocSemiring.toDistrib {α : Type u} [self : NonUnitalNonAssocSemiring α] : Distrib α
Mathlib.Algebra.Ring.Defs · line 119
Why more general: Lean places the two laws below the field hierarchy, so they hold for fields and also for carriers that are not fields.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 703ab42de9ae · pair key 27b0d38ba7ea.
Rat. instField special case
instance Rat.instField : Field ℚ
Mathlib.Algebra.Field.Rat · lines 27–36
Why a special case: Lean fixes the carrier to the rationals, the example the passage names, where the passage speaks of fields at large.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 57ede99825be · pair key 814b1c7f4431.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Meaning ◔ Partial
Partial: Mathlib states part of this (a definition).
Here multiplication is distributive over addition, but addition is not distributive over multiplication. Show all
NonUnitalNonAssocSemiring. toDistrib states part
instance NonUnitalNonAssocSemiring.toDistrib {α : Type u} [self : NonUnitalNonAssocSemiring α] : Distrib α
Mathlib.Algebra.Ring.Defs · line 119
Why only part: Lean states it for carriers wider than rings and fields, and it says nothing about the second conclusion, which concerns addition across a product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1a5bbe84269d · pair key e1c94ed34236.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Meaning ◔ Partial
Partial: Mathlib states part of this (proved).
Examples of structures with two operations that are each distributive over the other are Boolean algebras such as the algebra of sets or the switching algebra. Show all
inf_sup_left states part
theorem inf_sup_left {α : Type u} [DistribLattice α] (a b c : α) : a ⊓ (b ⊔ c) = a ⊓ b ⊔ a ⊓ c
Mathlib.Order.Defs.Lattice · lines 323–329
Why only part: The chain of instances is resolution inside the index, not an extra lemma.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f6468f6dbb87 · pair key e3740a6da94a.
sup_inf_left states part
theorem sup_inf_left {α : Type u} [DistribLattice α] (a b c : α) : a ⊔ b ⊓ c = (a ⊔ b) ⊓ (a ⊔ c)
Mathlib.Order.Defs.Lattice · lines 316–317
Why only part: This is the direction the passage adds when it says the second operation also distributes.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d25351cf7239 · pair key 803d9ea89246.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Meaning ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Multiplying sums can be put into words as follows: When a sum is multiplied by a sum, multiply each summand of a sum with each summand of the other sum (keeping track of signs) then add up all of the resulting products. Show all
Finset. sum_mul_sum more general
theorem Finset.sum_mul_sum {ι : Type*} {κ : Type*} {R : Type*} [NonUnitalNonAssocSemiring R] (s : Finset ι) (t : Finset κ) (f : ι → R) (g : κ → R) : (∑ i ∈ s, f i) * ∑ j ∈ t, g j = ∑ i ∈ s, ∑ j ∈ t, f i * g j
Mathlib.Algebra.BigOperators.Ring.Finset · lines 62–64
Why more general: Subtracted terms enter as negative values of the families, so the sign bookkeeping the passage mentions lives inside the terms themselves.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4986d53555ec · pair key 8e2c23584012.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples › Real numbers ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
From the point of view of algebra, the real numbers form a field, which ensures the validity of the distributive law. Show all
Real. instField exact match
instance Real.instField : Field ℝ
Mathlib.Basic.Real.Basic · lines 481–496
Note: A Field structure on the reals contains the two distributive axioms among its ring components, which is the consequence the passage draws from it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 78eb4e40371a · pair key 52c7da008dbe.
mul_add states part
theorem mul_add {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c
Mathlib.Algebra.Ring.Defs · line 91
Why only part: It gives the law the passage says holds on the reals without saying anything about them being a field.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d168ff2acbe3 · pair key dab097973435.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Examples › Real numbers ✓ Formalized
Formalized: Mathlib states a more general result (proved).
During mental arithmetic, distributivity is often used unconsciously: 6 ⋅ 16 = 6 ⋅ (10 + 6) = 6 ⋅ 10 + 6 ⋅ 6 = 60 + 36 = 96 Thus, to calculate 6 ⋅ 16 in one's head, one first multiplies 6 ⋅ 10 and 6 ⋅ 6 and add the intermediate results. Show all
mul_add more general
theorem mul_add {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c
Mathlib.Algebra.Ring.Defs · line 91
Why more general: The chain the passage writes runs from the product to ninety-six; the declaration supplies its one algebraic move and every other equality is decidable numeral arithmetic.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fbbf32d51e16 · pair key c23caba2b7c7.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Examples › Real numbers ✕ Not formalized
Second example (with variables) 3a 2 b ⋅ (4a − 5b ) = 3a 2 b ⋅ 4a − 3a 2 b ⋅ 5b = 12a 3 b − 15a 2 b 2 Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 75ed01e720bc). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else (1)
mul_sub related
theorem mul_sub {α : Type u} [NonUnitalNonAssocRing α] (a b c : α) : a * (b - c) = a * b - a * c
Mathlib.Algebra.Ring.Defs · line 348
How it differs: It produces the chain's middle term, which R-CHAIN counts as a move and not a clause of the statement.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f7da52dd473f · pair key df9c29f08e1f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Examples › Real numbers ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Third example (with two sums) (a + b ) ⋅ (a − b ) = a ⋅ (a − b ) + b ⋅ (a − b ) = a 2 − ab + ba − b 2 = a 2 − b 2 = (a + b ) ⋅ a − (a + b ) ⋅ b = a 2 + ba − ab − b 2 = a 2 − b 2 Here the distributive law was applied twice, and it does not matter which bracket is first multiplied out. Show all
sq_sub_sq more general
theorem sq_sub_sq {R : Type u} [CommRing R] (a b : R) : a ^ 2 - b ^ 2 = (a + b) * (a - b)
Mathlib.Algebra.Ring.Commute · line 199
Why more general: The two bracket-expansion routes the passage displays are ways of reaching the identity, not further content in it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fcc2d7c089da · pair key 3e0ab893603b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples › Real numbers ✕ Not formalized
Consider 12a 3 b 2 − 30a 4 bc + 18a 2 b 3 c 2 . Since the factor 6a 2 b occurs in all summands, it can be factored out. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt 0528f50bb384). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else (2)
Finset. dvd_sum related
theorem Finset.dvd_sum {ι : Type*} {R : Type*} {s : Finset ι} [NonUnitalSemiring R] {f : ι → R} {a : R} : (∀ i ∈ s, a ∣ f i) → a ∣ ∑ i ∈ s, f i
Mathlib.Algebra.BigOperators.Ring.Finset · lines 91–92
How it differs: Its hypothesis that the divisor divides each term is exactly what the passage has to establish first.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f1a7f6b3acba · pair key 67eeb1983c16.
Finset. mul_sum related
theorem Finset.mul_sum {ι : Type*} {R : Type*} [NonUnitalNonAssocSemiring R] (s : Finset ι) (f : ι → R) (a : R) : a * ∑ i ∈ s, f i = ∑ i ∈ s, a * f i
Mathlib.Algebra.BigOperators.Ring.Finset · lines 59–60
How it differs: It is the general law behind taking a factor out of a sum, stated for an arbitrary semiring.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1a881f957de9 · pair key 8b34cb2c924e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Examples › Real numbers ✕ Not formalized
That is, due to the distributive law one obtains 12a 3 b 2 − 30a 4 bc + 18a 2 b 3 c 2 = 6a 2 b (2ab − 5a 2 c + 3b 2 c 2 ). Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt 3e9cd51d23e5). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else (2)
Finset. mul_sum related
theorem Finset.mul_sum {ι : Type*} {R : Type*} [NonUnitalNonAssocSemiring R] (s : Finset ι) (f : ι → R) (a : R) : a * ∑ i ∈ s, f i = ∑ i ∈ s, a * f i
Mathlib.Algebra.BigOperators.Ring.Finset · lines 59–60
How it differs: It states the law that the displayed factorisation uses, for an arbitrary semiring and an arbitrary finite family.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3a9abae0f386 · pair key 76e24848f57e.
mul_sub related
theorem mul_sub {α : Type u} [NonUnitalNonAssocRing α] (a b c : α) : a * (b - c) = a * b - a * c
Mathlib.Algebra.Ring.Defs · line 348
How it differs: It handles the subtraction sign inside the bracket of the displayed identity.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4ecb0babeebc · pair key 655de4b971d2.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Examples › Matrices ◔ Partial
Partial: Mathlib states a special case (a definition).
The distributive law is valid for matrix multiplication. Show all
Matrix. nonUnitalNonAssocSemiring special case
instance Matrix.nonUnitalNonAssocSemiring {n : Type*} {α : Type v} [NonUnitalNonAssocSemiring α] [Fintype n] : NonUnitalNonAssocSemiring (Matrix n n α)
Mathlib.Data.Matrix.Mul · lines 371–376
Why a special case: The instance speaks of square matrices only, while the passage also covers products of rectangular matrices, and its remaining fields are the other semiring axioms.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key dcf96d2ce016 · pair key 0e009009494c.
Matrix. mul_add states part
theorem Matrix.mul_add {m : Type*} {n : Type*} {o : Type*} {α : Type v} [NonUnitalNonAssocSemiring α] [Fintype n] (L : Matrix m n α) (M N : Matrix n o α) : L * (M + N) = L * M + L * N
Mathlib.Data.Matrix.Mul · lines 361–364
Why only part: It carries the left law alone; the law with the sum on the other side is a separate declaration.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8ca0e9825743 · pair key 7c67499e9899.
Matrix. add_mul states part
theorem Matrix.add_mul {l : Type*} {m : Type*} {n : Type*} {α : Type v} [NonUnitalNonAssocSemiring α] [Fintype m] (L M : Matrix l m α) (N : Matrix m n α) : (L + M) * N = L * N + M * N
Mathlib.Data.Matrix.Mul · lines 366–369
Why only part: It carries the right law alone, so it covers one of the two laws the passage asserts.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a1ef9dbbf40e · pair key a3685e3f75de.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples › Matrices ✓ Formalized
Formalized: Mathlib states a more general result (proved).
More precisely, (A + B ) ⋅ C = A ⋅ C + B ⋅ C for all l × m -matrices A , B and m × n -matrices C , as well as A ⋅ (B + C ) = A ⋅ B + A ⋅ C for all l × m -matrices A and m × n -matrices B , C . Because the commutative property does not hold for matrix multiplication, the second law does… Show all
Matrix. add_mul more general
theorem Matrix.add_mul {l : Type*} {m : Type*} {n : Type*} {α : Type v} [NonUnitalNonAssocSemiring α] [Fintype m] (L M : Matrix l m α) (N : Matrix m n α) : (L + M) * N = L * N + M * N
Mathlib.Data.Matrix.Mul · lines 366–369
Why more general: Mathlib widens the passage twice over: the entries may sit in any non-unital non-associative semiring, and rows and columns may be indexed by arbitrary types with only the shared index required finite.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 422fcf6820e4 · pair key c6007fac863a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples › Matrices ✓ Formalized
Formalized: Mathlib states a more general result (proved).
More precisely, (A + B ) ⋅ C = A ⋅ C + B ⋅ C for all l × m -matrices A , B and m × n -matrices C , as well as A ⋅ (B + C ) = A ⋅ B + A ⋅ C for all l × m -matrices A and m × n -matrices B , C . Because the commutative property does not hold for matrix multiplication, the second law does not follow from the first law. Show all
Matrix. mul_add more general
theorem Matrix.mul_add {m : Type*} {n : Type*} {o : Type*} {α : Type v} [NonUnitalNonAssocSemiring α] [Fintype n] (L : Matrix m n α) (M N : Matrix n o α) : L * (M + N) = L * M + L * N
Mathlib.Data.Matrix.Mul · lines 361–364
Why more general: Mathlib widens the passage twice over: entries lie in any non-unital non-associative semiring and the rows and columns are indexed by arbitrary types, only the shared index being finite.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ac86415eae5c · pair key 3bc53edf56f7.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples › Matrices ✕ Not formalized
…A , B and m × n -matrices C , as well as A ⋅ (B + C ) = A ⋅ B + A ⋅ C for all l × m -matrices A and m × n -matrices B , C . Because the commutative property does not hold for matrix multiplication , the second law does not follow from the first law. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 4 candidates examined (receipt 79ee320b4843). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples › Other examples ◔ Partial
Partial: Mathlib states part of this (proved).
Multiplication of ordinal numbers, in contrast, is only left-distributive, not right-distributive. Show all
Ordinal. leftDistribClass states part
instance Ordinal.leftDistribClass : LeftDistribClass Ordinal
Mathlib.SetTheory.Ordinal.Arithmetic · lines 421–423
Why only part: Mathlib keeps the left-hand ordinal law as a class instance on Ordinal rather than as a named equation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c9757c90fe2c · pair key 0261125c01aa.
left_distrib states part
theorem left_distrib {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c
Mathlib.Algebra.Ring.Defs · lines 87–89
Why only part: Mathlib states this for any type carrying the left-distributivity class, so it generalises the ordinal case the passage speaks of.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2b2e7ac9ff16 · pair key 2304bf4b0d19.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples › Other examples ◔ Partial
Partial: Mathlib states part of this (a definition).
The cross product is left- and right-distributive over vector addition, though not commutative. Show all
crossProduct states part
def crossProduct {R : Type*} [CommRing R] : (Fin 3 → R) →ₗ[R] (Fin 3 → R) →ₗ[R] Fin 3 → R
Mathlib.LinearAlgebra.CrossProduct · lines 47–59
Why only part: Mathlib bundles the cross product as a bilinear map over an arbitrary commutative ring, so it also asserts compatibility with scalars and generalises the real three-dimensional case.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 863597e68ddc · pair key 8601c16c0883.
Cross. lieRing states part
def Cross.lieRing {R : Type*} [CommRing R] : LieRing (Fin 3 → R)
Mathlib.LinearAlgebra.CrossProduct · lines 128–134
Why only part: Beyond the two additivity laws it also asserts the Jacobi identity and the vanishing of the bracket of a vector with itself, and it is stated over an arbitrary commutative ring, so it generalises what the conjunct claims.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d9a9542976d0 · pair key 42e50090160b.
Related, but states something else (1)
cross_anticomm related
theorem cross_anticomm {R : Type*} [CommRing R] (v w : Fin 3 → R) : -(crossProduct v) w = (crossProduct w) v
Mathlib.LinearAlgebra.CrossProduct · lines 69–70
How it differs: It states that exchanging the two arguments negates the product; turning that into the failure of commutativity would also need a pair whose cross product is non-zero and that two is invertible.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8f41a4b15281 · pair key 56e52a8cd331.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples › Other examples ✓ Formalized
Formalized: Mathlib states this exactly (proved).
For sets, the union is distributive over intersection , and intersection is distributive over union. Show all
Set. union_inter_distrib_left exact match
theorem Set.union_inter_distrib_left {α : Type u} (s t u : Set α) : s ∪ t ∩ u = (s ∪ t) ∩ (s ∪ u)
Mathlib.Data.Set.Basic · lines 933–934
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4e78af8e7c35 · pair key 62cc1086b285.
Set. inter_union_distrib_right exact match
theorem Set.inter_union_distrib_right {α : Type u} (s t u : Set α) : s ∩ t ∪ u = (s ∪ u) ∩ (t ∪ u)
Mathlib.Data.Set.Basic · lines 936–937
Note: This is the same law with the two operands of the union exchanged, which for the commutative union is the form the article calls right-distributivity.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key bcd3dcc62c3a · pair key fc8aeeb640ce.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples › Other examples ✓ Formalized
Formalized: Mathlib states this exactly (proved).
For sets, the union is distributive over intersection, and intersection is distributive over union. Show all
Set. inter_union_distrib_left exact match
theorem Set.inter_union_distrib_left {α : Type u} (s t u : Set α) : s ∩ (t ∪ u) = s ∩ t ∪ s ∩ u
Mathlib.Data.Set.Basic · lines 927–928
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a6c64795cfcf · pair key e73a18433439.
Set. union_inter_distrib_right exact match
theorem Set.union_inter_distrib_right {α : Type u} (s t u : Set α) : (s ∪ t) ∩ u = s ∩ u ∪ t ∩ u
Mathlib.Data.Set.Basic · lines 930–931
Note: This is the same law with the two operands of the intersection exchanged, the form the article calls right-distributivity, which for the commutative intersection says the same thing.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key dcc52f1f6d25 · pair key b8904f931115.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples › Other examples ✓ Formalized
Formalized by 2 parts together:
or_and_left Lean core (proved) disjunction distributes over conjunction and_or_left Lean core (proved) conjunction distributes over disjunction
Logical disjunction ("or") is distributive over logical conjunction ("and"), and vice versa. Show all
or_and_left states part
theorem or_and_left {a b c : Prop} : a ∨ b ∧ c ↔ (a ∨ b) ∧ (a ∨ c)
Init.PropLemmas · lines 128–130
Why only part: Lean writes the law as an equivalence of propositions, with the disjunct outside the bracket on the left.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 2ef0aff07cb6 · pair key e0790ff73801.
and_or_left states part
theorem and_or_left {a b c : Prop} : a ∧ (b ∨ c) ↔ a ∧ b ∨ a ∧ c
Init.PropLemmas · lines 120–122
Why only part: Lean writes the companion law as an equivalence of propositions, with the conjunct outside the bracket on the left.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 6eb500a3c35c · pair key 65da4241a356.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples › Other examples ✓ Formalized
Formalized by 2 parts together:
max_min_distrib_left Mathlib (proved) the maximum distributes over the minimum: max(a, min(b,c)) = min(max(a,b), max(a,c)) min_max_distrib_left Mathlib (proved) the minimum distributes over the maximum: min(a, max(b,c)) = max(min(a,b), min(a,c))
For real numbers (and for any totally ordered set), the maximum operation is distributive over the minimum operation, and vice versa: max(a , min(b , c )) = min(max(a , b ), max(a , c )) and min(a , max(b , c )) = max(min(a , b ), min(a , c )). Show all
max_min_distrib_left states part
theorem max_min_distrib_left {α : Type u} [LinearOrder α] (a b c : α) : Max.max a (Min.min b c) = Min.min (Max.max a b) (Max.max a c)
Mathlib.Order.MinMax · lines 64–65
Why only part: Lean's linear-order class is its notion of a totally ordered set, the setting the passage names beside the reals.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e16e883f8f54 · pair key 39db2b67dd24.
min_max_distrib_left states part
theorem min_max_distrib_left {α : Type u} [LinearOrder α] (a b c : α) : Min.min a (Max.max b c) = Max.max (Min.min a b) (Min.min a c)
Mathlib.Order.MinMax · line 63
Why only part: Lean states the companion identity over the same linear-order class, which is its notion of a totally ordered set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0d1456bd8625 · pair key d793c1f16b1a.
Int. max_min_distrib_left special case
theorem Int.max_min_distrib_left (a b c : Int) : Max.max a (Min.min b c) = Min.min (Max.max a b) (Max.max a c)
Init.Data.Int.LemmasAux · line 147
Why a special case: Lean fixes the carrier to the integers, one of the totally ordered sets the passage speaks of.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key e6e5e8658001 · pair key f08a0391bec0.
Int. min_max_distrib_left special case
theorem Int.min_max_distrib_left (a b c : Int) : Min.min a (Max.max b c) = Max.max (Min.min a b) (Min.min a c)
Init.Data.Int.LemmasAux · line 149
Why a special case: Lean fixes the carrier to the integers, again one of the passage's totally ordered sets.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key d83a99b1cb86 · pair key 358f123f374e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples › Other examples ✕ Not formalized
For integers, the greatest common divisor is distributive over the least common multiple, and vice versa: gcd(a , lcm(b , c )) = lcm(gcd(a , b ), gcd(a , c )) and lcm(a , gcd(b , c )) = gcd(lcm(a , b ), lcm(a , c )). Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 6 queries and 5 candidates examined (receipt 9e6f3789fc3f). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples › Other examples ✓ Formalized
Formalized by 2 parts together (more general):
max_add_add_left Mathlib (proved) addition distributes over the maximum: a + max(b,c) = max(a+b, a+c) min_add_add_left Mathlib (proved) addition distributes over the minimum: a + min(b,c) = min(a+b, a+c)
For real numbers, addition distributes over the maximum operation, and also over the minimum operation: a + max(b , c ) = max(a + b , a + c ) and a + min(b , c ) = min(a + b , a + c ). Show all
max_add_add_left states part
theorem max_add_add_left {α : Type*} [LinearOrder α] [Add α] [AddLeftMono α] (a b c : α) : Max.max (a + b) (a + c) = a + Max.max b c
Mathlib.Algebra.Order.Monoid.Unbundled.MinMax · line 58
Why only part: Lean states the identity for every linearly ordered carrier whose addition respects the order, and writes the sum side first.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8f5bea5d95ca · pair key 482c52381743.
min_add_add_left states part
theorem min_add_add_left {α : Type*} [LinearOrder α] [Add α] [AddLeftMono α] (a b c : α) : Min.min (a + b) (a + c) = a + Min.min b c
Mathlib.Algebra.Order.Monoid.Unbundled.MinMax · line 54
Why only part: Lean states the companion identity over the same ordered additive setting, again with the sum side written first.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 36d075ad88a2 · pair key 5c37e710b226.
Int. max_add_left special case
theorem Int.max_add_left (a b c : Int) : Max.max (a + b) (a + c) = a + Max.max b c
Init.Data.Int.Order · lines 464–467
Why a special case: Lean fixes the carrier to the integers, where the passage speaks of the real numbers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 28dec521be8d · pair key fea54e430319.
Int. min_add_left special case
theorem Int.min_add_left (a b c : Int) : Min.min (a + b) (a + c) = a + Min.min b c
Init.Data.Int.Order · lines 421–424
Why a special case: Lean fixes the carrier to the integers, again narrower than the real numbers of the passage.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 54b5caa9c79d · pair key 51e06a56a14b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples › Other examples ◐ Statement only
With community edits: Statement only. As published it is Not formalized.
Statement only, by a community edit: Mathlib states a more general result (statement only: the proof is not finished).
For binomial multiplication, distribution is sometimes referred to as the FOIL Method[2] (First terms ac , Outer ad , Inner bc , and Last bd ) such as: (a + b ) ⋅ (c + d ) = ac + ad + bc + bd . Show all
Finset. sum_mul_sum more general
No module or line: an editor named the declaration, not a place in the source.
Mathlib
Community Agent Added by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026
Why more general: Finset.sum_mul_sum expands a product of two finite sums into the double sum of all pairwise products, in any non-unital non-associative semiring. FOIL is the case of two sums with two terms each: (a+b)(c+d) becomes (ac+ad)+(bc+bd), which is ac+ad+bc+bd once the additions are regrouped.
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 4 candidates examined (receipt 96a095279ac1). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Examples › Other examples ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Formalized by 2 parts together (more general):
mul_add Mathlib (proved) in a semiring, u(v+w) = uv + uw add_mul Mathlib (proved) in a semiring, (u+v)w = uw + vw
… multiplication, distribution is sometimes referred to as the FOIL Method[2] (First terms ac , Outer ad , Inner bc , and Last bd ) such as: (a + b ) ⋅ (c + d ) = ac + ad + bc + bd . In all semirings, including the complex numbers, the quaternions, polynomials, and matrices, multiplication distributes over addition: u (v + w ) = uv + uw , (u + v )w = uw + vw . Show all
NonUnitalNonAssocSemiring. toDistrib more general
instance NonUnitalNonAssocSemiring.toDistrib {α : Type u} [self : NonUnitalNonAssocSemiring α] : Distrib α
Mathlib.Algebra.Ring.Defs · line 119
Why more general: Lean records in one instance that both one-sided laws hold in any carrier with the additive and multiplicative structure of a semiring, associativity and a unit aside.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e61194b76089 · pair key f5692d668c7f.
mul_add states part
theorem mul_add {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c
Mathlib.Algebra.Ring.Defs · line 91
Why only part: Lean states the equation for any carrier with the two operations and the left-hand distributive class, which every semiring provides.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 466ff2ff5e4f · pair key c6d0df24552f.
add_mul states part
theorem add_mul {R : Type v} [Mul R] [Add R] [RightDistribClass R] (a b c : R) : (a + b) * c = a * c + b * c
Mathlib.Algebra.Ring.Defs · line 97
Why only part: Lean states the companion equation over the same light hypotheses, which every semiring satisfies.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 69189b001f8f · pair key 628b60c749fd.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples › Other examples ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
In all semirings, including the complex numbers, the quaternions, polynomials, and matrices, multiplication distributes over addition: u (v + w ) = uv + uw , (u + v )w = uw + vw . In all algebras over a field, including the octonions and other non-associative algebras, multiplication distributes over addition. Show all
NonUnitalNonAssocSemiring. toDistrib more general
instance NonUnitalNonAssocSemiring.toDistrib {α : Type u} [self : NonUnitalNonAssocSemiring α] : Distrib α
Mathlib.Algebra.Ring.Defs · line 119
Why more general: Lean's class here requires no associativity, so it covers the non-associative algebras the passage names alongside the associative ones.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 16d460078609 · pair key c5bb0d0f3181.
mul_add states part
theorem mul_add {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c
Mathlib.Algebra.Ring.Defs · line 91
Why only part: It gives the law with the sum on the right of the product and leaves the companion law to add_mul.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 83cb847d2936 · pair key 3f96a07bef0d.
add_mul states part
theorem add_mul {R : Type v} [Mul R] [Add R] [RightDistribClass R] (a b c : R) : (a + b) * c = a * c + b * c
Mathlib.Algebra.Ring.Defs · line 97
Why only part: It gives the law with the sum on the left of the product, the companion of mul_add.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a42d1d17578c · pair key 1beb705cd41a.
TauCeti.Octonion. instNonAssocRing special case
instance TauCeti.Octonion.instNonAssocRing {R : Type*} [CommRing R] : NonAssocRing (TauCeti.Octonion R)
TauCeti.Algebra.Octonion.Basic · lines 296–305
Why a special case: Lean records the law for the octonions as part of their ring instance, which is the non-associative algebra the passage names.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key a2b54ecb2fe7 · pair key 53f8802ddd9a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Propositional logic › Rule of replacement ✓ Formalized
Formalized by 2 parts together:
and_or_left Lean core (proved) P ∧ (Q ∨ R) is equivalent to (P ∧ Q) ∨ (P ∧ R) or_and_left Lean core (proved) P ∨ (Q ∧ R) is equivalent to (P ∨ Q) ∧ (P ∨ R)
The rules are (P ∧ (Q ∨ R )) ⇔ ((P ∧ Q ) ∨ (P ∧ R )) and (P ∨ (Q ∧ R )) ⇔ ((P ∨ Q ) ∧ (P ∨ R )) where " ⇔ ", also written ≡ , is a metalogical symbol representing "can be replaced in a proof with" or "is logically equivalent to". Show all
and_or_left states part
theorem and_or_left {a b c : Prop} : a ∧ (b ∨ c) ↔ a ∧ b ∨ a ∧ c
Init.PropLemmas · lines 120–122
Why only part: Lean's iff between propositions is the logical equivalence the passage's symbol stands for.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key b12119737e8a · pair key 70a757c4797c.
or_and_left states part
theorem or_and_left {a b c : Prop} : a ∨ b ∧ c ↔ (a ∨ b) ∧ (a ∨ c)
Init.PropLemmas · lines 128–130
Why only part: Lean again states the rule as an iff between propositions, which is the equivalence the passage's symbol denotes.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 08c15eb3e91c · pair key 9217dd97af57.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Propositional logic › Truth functional connectives ◔ Partial
Partial: Lean core states part of this (proved).
The following are truth-functional tautologies. (P ∧ (Q ∨ R )) ⇔ ((P ∧ Q ) ∨ (P ∧ R )) Distribution of conjunction over disjunction (P ∨ (Q ∧ R )) ⇔ ((P ∨ Q ) ∧ (P ∨ R )) Distribution of disjunction over conjunction (P ∧ (Q ∧ R )) ⇔ ((P ∧ Q ) ∧ (P ∧ R )) Distribution of conjunction over conjunction (P ∨ (Q ∨ R )) ⇔ ((P ∨ Q ) ∨ (P ∨ R )) Distribution of disjunction over disjunction (P → (Q → R )) ⇔ ((P → Q ) → (P → R )) Distribution of implication (P → (Q ↔ R )) ⇔ ((P → Q ) ↔ (P → R )) Distribution of implication over equivalence (P → (Q ∧ R )) ⇔ ((P → Q ) ∧ (P → R )) Distribution of implication over conjunction (P ∨ (Q ↔ R )) ⇔ ((P ∨ Q ) ↔ (P ∨ R )) Distribution of disjunction over equivalence Show all
and_or_left states part
theorem and_or_left {a b c : Prop} : a ∧ (b ∨ c) ↔ a ∧ b ∨ a ∧ c
Init.PropLemmas · lines 120–122
Why only part: Stated as an iff between Props, which is how the article reads its metalogical double arrow.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 173d5219496c · pair key 3e175ade08b6.
or_and_left states part
theorem or_and_left {a b c : Prop} : a ∨ b ∧ c ↔ (a ∨ b) ∧ (a ∨ c)
Init.PropLemmas · lines 128–130
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key d183d81a96d6 · pair key 9052c364ea74.
and_and_left states part
theorem and_and_left {a b c : Prop} : a ∧ b ∧ c ↔ (a ∧ b) ∧ a ∧ c
Init.PropLemmas · line 69
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 18fb1f8ab580 · pair key cad26d717a2b.
or_or_distrib_left states part
theorem or_or_distrib_left {a b c : Prop} : a ∨ b ∨ c ↔ (a ∨ b) ∨ a ∨ c
Init.PropLemmas · line 95
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 4315d0678b83 · pair key e33c6a8625e2.
imp_and states part
theorem imp_and {b c : Prop} {α : Sort u_1} : (∀ (a : α), b ∧ c) ↔ (∀ (a : α), b) ∧ ∀ (a : α), c
Init.PropLemmas · lines 114–115
Why only part: The sort argument ranges over any Sort, and a proposition is one of them, so the arrow form is the instance that matters here.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 5 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 8ed30357702f · pair key 186f459f3637.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Propositional logic › Truth functional connectives ✕ Not formalized
Double distribution ((P ∧ Q ) ∨ (R ∧ S )) ⇔ (((P ∨ R ) ∧ (P ∨ S )) ∧ ((Q ∨ R ) ∧ (Q ∨ S ))) ((P ∨ Q ) ∧ (R ∨ S )) ⇔ (((P ∧ R ) ∨ (P ∧ S )) ∨ ((Q ∧ R ) ∨ (Q ∧ S ))) Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt b6ce04269d6c). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (2)
and_or_left related
theorem and_or_left {a b c : Prop} : a ∧ (b ∨ c) ↔ a ∧ b ∨ a ∧ c
Init.PropLemmas · lines 120–122
How it differs: The single distributive law over three propositions; the four-variable equivalences follow only after several applications of it together with commutativity.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 57578d16ff63 · pair key 52629d51c8c0.
or_and_left related
theorem or_and_left {a b c : Prop} : a ∨ b ∧ c ↔ (a ∨ b) ∧ (a ∨ c)
Init.PropLemmas · lines 128–130
How it differs: The dual single law; again several applications and a reassociation are needed before either displayed equivalence appears.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 93e03005837f · pair key 75e98460f2e7.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Distributivity and rounding ✕ Not formalized
In approximate arithmetic, such as floating-point arithmetic, the distributive property of multiplication (and division) over addition may fail because of the limitations of arithmetic precision. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 8fc4cf38e812). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Distributivity and rounding ✕ Not formalized
For example, the identity 1/3 + 1/3 + 1/3 = (1 + 1 + 1)/3 fails in decimal arithmetic, regardless of the number of significant digits. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 9f25b0af42f0). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · In rings and other structures ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
A semiring has two binary operations, commonly denoted + and ∗, and requires that ∗ must distribute over +. Show all
Semiring close match
class Semiring : Type u → Type u
Mathlib.Algebra.Ring.Defs · lines 141–142
Why close, not exact: Mathlib gathers the two operations, their units and the two distributive laws into a single type class.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5a90fb689b3e · pair key a1bbd1785b73.
Distrib more general
class Distrib : Type u_1 → Type u_1
Mathlib.Algebra.Ring.Defs · lines 62–66
Why more general: Mathlib isolates the distributive requirement itself as a class over a carrier with multiplication and addition.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d7470a542f4d · pair key 9067ed17efbb.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · In rings and other structures ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
A ring is a semiring with additive inverses. Show all
Ring close match
class Ring : Type u → Type u
Mathlib.Algebra.Ring.Defs · line 146
Why close, not exact: Mathlib carries the additive inverse as a negation operation inside the structure, with subtraction derived from it, where the passage speaks of inverses existing.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c0b416708901 · pair key 85f0aaa3ea6b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · In rings and other structures ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
A lattice is another kind of algebraic structure with two binary operations, ∧ and ∨ . If either of these operations distributes over the other (say ∧ distributes over ∨ ), then the reverse also holds ( ∨ distributes over ∧ ), and the lattice is called distributive. Show all
Lattice close match
class Lattice : Type u → Type u
Mathlib.Order.Defs.Lattice · line 226
Why close, not exact: Mathlib presents the two operations as the join and the meet of a partial order, the order being recoverable from either operation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0d07cdfa70cb · pair key 9c7a238f5377.
Lattice. mk' close match
def Lattice.mk' {α : Type*} [Max α] [Min α] : (∀ (a b : α), a ⊔ b = b ⊔ a) → (∀ (a b c : α), a ⊔ b ⊔ c = a ⊔ (b ⊔ c)) → (∀ (a b : α), a ⊓ b = b ⊓ a) → (∀ (a b c : α), a ⊓ b ⊓ c = a ⊓ (b ⊓ c)) → (∀ (a b : α), a ⊔ a ⊓ b = a) → (∀ (a b : α), a ⊓ (a ⊔ b) = a) → Lattice α
Mathlib.Order.Lattice · lines 207–234
Why close, not exact: It builds Mathlib's lattice structure from the purely equational data of two binary operations, which is the presentation the passage uses.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e5e18f62a0d1 · pair key 623bdd5c983d.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · In rings and other structures ◔ Partial
Partial: Mathlib states part of this (proved).
A lattice is another kind of algebraic structure with two binary operations, ∧ and ∨ . If either of these operations distributes over the other (say ∧ distributes over ∨ ), then the reverse also holds ( ∨ distributes over ∧ ), and the lattice is called distributive. Show all
inf_sup_left states part
theorem inf_sup_left {α : Type u} [DistribLattice α] (a b c : α) : a ⊓ (b ⊔ c) = a ⊓ b ⊔ a ⊓ c
Mathlib.Order.Defs.Lattice · lines 323–329
Why only part: The class hypothesis carries the one distributive law and the conclusion is the other, so this is the exchange read in a single direction.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6925eb6ea648 · pair key 42a6f2444c66.
DistribLattice. ofInfSupLe states part
abbrev DistribLattice.ofInfSupLe {α : Type u} [Lattice α] : (∀ (a b c : α), a ⊓ (b ⊔ c) ≤ a ⊓ b ⊔ a ⊓ c) → DistribLattice α
Mathlib.Order.Defs.Lattice · lines 301–307
Why only part: It carries the exchange the other way round, turning the assumed law into the structure that bears the dual one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d5f1561ee166 · pair key 1dfb112b025a.
DistribLattice states part
class DistribLattice : Type u_1 → Type u_1
Mathlib.Order.Defs.Lattice · lines 294–296
Why only part: Mathlib fixes one of the four interchangeable distributive conditions, written as an inequality, as the class's axiom and gives the class the passage's name.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1e60e2be82fa · pair key 50bd374449dd.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · In rings and other structures ✓ Formalized
Formalized by 2 parts together (more general):
BooleanAlgebra. toBooleanRing Mathlib (definition) a Boolean algebra may be read as a Boolean ring GeneralizedCoheytingAlgebra. toDistribLattice Mathlib (definition) a Boolean algebra may be read as a Boolean (distributive) lattice
A Boolean algebra can be interpreted either as a special kind of ring (a Boolean ring) or a special kind of distributive lattice (a Boolean lattice). Show all
BooleanAlgebra. toBooleanRing states part
abbrev BooleanAlgebra.toBooleanRing {α : Type*} [BooleanAlgebra α] : BooleanRing α
Mathlib.Algebra.Ring.BooleanRing · lines 427–432
Why only part: Its addition is symmetric difference, its multiplication meet, with bottom and top as the two constants.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 226c518d2f94 · pair key 8ab27307d0a0.
GeneralizedCoheytingAlgebra. toDistribLattice states part
instance GeneralizedCoheytingAlgebra.toDistribLattice {α : Type*} [GeneralizedCoheytingAlgebra α] : DistribLattice α
Mathlib.Order.Heyting.Basic · lines 508–511
Why only part: Mathlib proves this for the wider class of generalized co-Heyting algebras, which Lean reaches from a Boolean algebra through the two instances named above.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f10b732d7a31 · pair key 433dd05b0240.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · In rings and other structures ◔ Partial
Partial: Mathlib states part of this (proved).
In any semiring, distributivity can be used to show that any product of sums is a sum of products (though not every sum of products is necessarily a product of sums). Show all
Fintype. prod_sum states part
theorem Fintype.prod_sum {ι : Type*} {R : Type*} [Fintype ι] [CommSemiring R] [DecidableEq ι] {κ : ι → Type*} [(i : ι) → Fintype (κ i)] (f : (i : ι) → κ i → R) : ∏ i, ∑ j, f i j = ∑ x, ∏ i, f i (x i)
Mathlib.Algebra.BigOperators.Ring.Finset · lines 305–306
Why only part: Mathlib's version asks the semiring to be commutative, so it reaches those of the passage's semirings that commute.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 22f6a174d388 · pair key 0f2a4864a3a8.
Finset. prod_sum states part
theorem Finset.prod_sum {ι : Type*} {R : Type*} [CommSemiring R] [DecidableEq ι] {κ : ι → Type*} (s : Finset ι) (t : (i : ι) → Finset (κ i)) (f : (i : ι) → κ i → R) : ∏ a ∈ s, ∑ b ∈ t a, f a b = ∑ p ∈ s.pi t, ∏ x ∈ s.attach, f (↑x) (p ↑x ⋯)
Mathlib.Algebra.BigOperators.Ring.Finset · lines 124–152
Why only part: It indexes the resulting sum by Mathlib's dependent-choice finset and again asks for commutativity.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1d50ef90a859 · pair key ab6cdb0c9f45.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · In rings and other structures ◔ Partial
Partial: Mathlib states a special case (proved).
The general formula reads: ∏m i = 1 (∑n i j = 1 a i , j ) = ∑n 1 j 1 = 1 ∑n 2 j 2 = 1 ⋯∑n m j m = 1 ∏m i = 1 a i , j i Structures without two-sided distributive laws are near-rings and near-fields. Show all
Fintype. prod_sum special case
theorem Fintype.prod_sum {ι : Type*} {R : Type*} [Fintype ι] [CommSemiring R] [DecidableEq ι] {κ : ι → Type*} [(i : ι) → Fintype (κ i)] (f : (i : ι) → κ i → R) : ∏ i, ∑ j, f i j = ∑ x, ∏ i, f i (x i)
Mathlib.Algebra.BigOperators.Ring.Finset · lines 305–306
Why a special case: The declaration asks the semiring to be commutative and indexes the families by finite types instead of counting from one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f4a9cd285b8f · pair key 68389d4f8b58.
Finset. prod_univ_sum special case
theorem Finset.prod_univ_sum {ι : Type*} {R : Type*} [CommSemiring R] [DecidableEq ι] {κ : ι → Type*} [Fintype ι] (t : (i : ι) → Finset (κ i)) (f : (i : ι) → κ i → R) : ∏ i, ∑ j ∈ t i, f i j = ∑ x ∈ Fintype.piFinset t, ∏ i, f i (x i)
Mathlib.Algebra.BigOperators.Ring.Finset · lines 157–159
Why a special case: It states the same expansion with the inner ranges given as finite sets, and again with commutativity assumed.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6dfc84413d39 · pair key a3cff3b544c2.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · In rings and other structures ✕ Not formalized
The general formula reads: ∏m i = 1 (∑n i j = 1 a i , j ) = ∑n 1 j 1 = 1 ∑n 2 j 2 = 1 ⋯∑n m j m = 1 ∏m i = 1 a i , j i Structures without two-sided distributive laws are near-rings and near-fields. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 3299dfeef43e). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else (1)
RightDistribClass related
class RightDistribClass (R : Type*) [Mul R] [Add R] : Prop
Mathlib.Algebra.Ring.Defs · lines 74–76
How it differs: It records one axiom on a bare type with two operations and builds no structure of its own.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 26bca4f94323 · pair key ca18127f04c8.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · In rings and other structures ✕ Not formalized
…∏m i = 1 (∑n i j = 1 a i , j ) = ∑n 1 j 1 = 1 ∑n 2 j 2 = 1 ⋯∑n m j m = 1 ∏m i = 1 a i , j i Structures without two-sided distributive laws are near-rings and near-fields. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 19e9732da181). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · In rings and other structures ✕ Not formalized
The operations are usually defined to be distributive on the right but not on the left. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 5947030df0d5). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Generalizations ✕ Not formalized
An application of this principle are the notions of sub-distributivity, where equality is replaced by "less than or equal"; and super-distributivity, where equality is replaced by "greater than or equal". Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt eaa63ecf96da). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Generalizations ✕ Not formalized
An application of this principle are the notions of sub-distributivity, where equality is replaced by "less than or equal"; and super-distributivity, where equality is replaced by "greater than or equal". Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 0493e21c1e4c). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Generalizations ✕ Not formalized
In category theory, if (S , μ , ν ) and (S ′ , μ ′ , ν ′ ) are monads on a category C , a distributive law S .S ′ → S ′ .S is a natural transformation λ : S .S ′ → S ′ .S such that (S ′ , λ ) is a lax map of monads S → S and (S , λ ) is a colax map of monads S ′ → S ′ . This is exactly the data needed to define a monad structure on S ′ .S : the multiplication map is S ′ μ .μ ′ S 2 .S ′ λS and the unit map is η ′ S .η . A generalized… Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 3c19e918dc71). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Construction · supporting · Generalizations ✕ Not formalized
…λ : S .S ′ → S ′ .S such that (S ′ , λ ) is a lax map of monads S → S and (S , λ ) is a colax map of monads S ′ → S ′ . This is exactly the data needed to define a monad structure on S ′ .S : the multiplication map is S ′ μ .μ ′ S 2 .S ′ λS and the unit map is η ′ S .η . A generalized distributive law has also been proposed in the area of information theory. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 2df38cf3488b). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Generalizations › Antidistributivity ✓ Formalized
Formalized: Mathlib states a more general result (proved).
The ubiquitous identity that relates inverses to the binary operation in any group, namely (xy )−1 = y −1 x −1 , which is taken as an axiom in the more general context of a semigroup with involution, has sometimes been called an antidistributive property (of inversion as a unary operation). Show all
mul_inv_rev more general
theorem mul_inv_rev {G : Type*} [DivisionMonoid G] (a b : G) : (a * b)⁻¹ = b⁻¹ * a⁻¹
Mathlib.Algebra.Group.DivInvMonoid · lines 327–328
Why more general: Mathlib proves the identity for division monoids, a class to which every group belongs.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e705a3803203 · pair key b6f7a7095550.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Generalizations › Antidistributivity ✕ Not formalized
In the context of a near-ring, which removes the commutativity of the additively written group and assumes only one-sided distributivity, one can speak of (two-sided) distributive elements but also of antidistributive elements. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 10c230d46f7e). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Generalizations › Antidistributivity ✕ Not formalized
The latter reverse the order of (the non-commutative) addition ; assuming a left-nearring (i.e. one which all elements distribute when multiplied on the left), then an antidistributive element a reverses the order of addition when multiplied to the right: (x + y )a = ya + xa . Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 7e87a60e149f). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Generalizations › Antidistributivity ✕ Not formalized
The latter reverse the order of (the non-commutative) addition; assuming a left-nearring (i.e. one which all elements distribute when multiplied on the left), then an antidistributive element a reverses the order of addition when multiplied to the right: (x + y )a = ya + xa . Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 1ecfc6c419a1). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Generalizations › Antidistributivity ◔ Partial
Partial: Lean core states this exactly, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
In the study of propositional logic and Boolean algebra, the term antidistributive law is sometimes used to denote the interchange between conjunction and disjunction when implication factors over them:[7] (a ∨ b ) ⇒ c ≡ (a ⇒ c ) ∧ (b ⇒ c ) (a ∧ b ) ⇒ c ≡ (a ⇒ c ) ∨ (b ⇒ c ). Show all
or_imp exact match
theorem or_imp {a b c : Prop} : a ∨ b → c ↔ (a → c) ∧ (b → c)
Init.PropLemmas · lines 135–136
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 90352f482a58 · pair key f1b6fb661f43.
sup_himp_distrib more general
theorem sup_himp_distrib {α : Type*} [GeneralizedHeytingAlgebra α] (a b c : α) : a ⊔ b ⇨ c = (a ⇨ c) ⊓ (b ⇨ c)
Mathlib.Order.Heyting.Basic · lines 279–282
Why more general: Mathlib proves the law in every generalized Heyting algebra, which covers the Boolean algebras the passage has in view.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a8c138091625 · pair key c2fa3234e615.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Generalizations › Antidistributivity ◔ Partial
Partial: Mathlib states a special case (proved).
…of propositional logic and Boolean algebra, the term antidistributive law is sometimes used to denote the interchange between conjunction and disjunction when implication factors over them:[7] (a ∨ b ) ⇒ c ≡ (a ⇒ c ) ∧ (b ⇒ c ) (a ∧ b ) ⇒ c ≡ (a ⇒ c ) ∨ (b ⇒ c ).Show all
not_and_or special case
theorem not_and_or {a b : Prop} : ¬(a ∧ b) ↔ ¬a ∨ ¬b
Mathlib.Basic.Logic.Basic · line 422
Why a special case: Mathlib states the case in which the conclusion is falsity, where an implication into falsity is by definition a negation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c8bf8ecad668 · pair key f7526695bebe.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗