Theorems · Theorem · ring theory
NonUnitalSubring.closure_induction
∀ {R : Type u} [inst : NonUnitalNonAssocRing R] {s : Set R} {p : (x : R) → x ∈ NonUnitalSubring.closure s → Prop},
(∀ (x : R) (hx : x ∈ s), p x ⋯) →
p 0 ⋯ →
(∀ (x y : R) (hx : x ∈ NonUnitalSubring.closure s) (hy : y ∈ NonUnitalSubring.closure s),
p x hx → p y hy → p (x + y) ⋯) →
(∀ (x : R) (hx : x ∈ NonUnitalSubring.closure s), p x hx → p (-x) ⋯) →
(∀ (x y : R) (hx : x ∈ NonUnitalSubring.closure s) (hy : y ∈ NonUnitalSubring.closure s),
p x hx → p y hy → p (x * y) ⋯) →
∀ {x : R} (hx : x ∈ NonUnitalSubring.closure s), p x hxAn induction principle for closure membership. If p holds for 0, 1, and all elements
of s, and is preserved under addition, negation, and multiplication, then p holds for all
elements of the closure of s.
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 73 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- NonUnitalNonAssocRing
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.ofPredproof · cited by 6,101
- NonUnitalNonAssocRingstatement and proof · cited by 354
- AddMemClass.add_memstatement and proof · cited by 229
- NonUnitalSubringstatement and proof · cited by 185
- MulMemClass.mul_memstatement and proof · cited by 173
- ZeroMemClass.zero_memstatement and proof · cited by 162
- NegMemClass.neg_memstatement and proof · cited by 63
- NonUnitalSubring.closurestatement and proof · cited by 23
- NonUnitalSubring.subset_closurestatement and proof · cited by 9
- NonUnitalSubring.closure_leproof · cited by 7
Cited by2
Results whose statement or proof uses this declaration.
- NonUnitalSubring.mem_closure_iffproof · cited by 0
- NonUnitalSubring.closure_induction₂proof · cited by 0