Theorems · Definition · number theory
IsApproximateAddSubgroup.casesOn
{G : Type u_2} →
[inst : AddGroup G] →
{K : ℝ} →
{A : Set G} →
{motive : IsApproximateAddSubgroup K A → Sort u} →
(t : IsApproximateAddSubgroup K A) →
((zero_mem : 0 ∈ A) → (neg_eq_self : -A = A) → (two_nsmul_covByVAdd : CovByVAdd G K (2 • A) A) → motive ⋯) →
motive t- Cited by
- 0 results in Mathlib
- Foundations
- Depth 98 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddGroup
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.