Theorems · Theorem · commutative algebra
CauSeq.complete
∀ {α : Type u_1} [inst : Field α] [inst_1 : LinearOrder α] [inst_2 : IsStrictOrderedRing α] {β : Type u_2}
[inst_3 : Ring β] {abv : β → α} [inst_4 : IsAbsoluteValue abv] [CauSeq.IsComplete β abv] (s : CauSeq β abv),
∃ b, s ≈ CauSeq.const abv b- Defined in
- Mathlib.Algebra.Order.CauSeq.Completion
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 66 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LinearOrderstatement and proof · cited by 8,572
- Ringstatement and proof · cited by 7,463
- Fieldstatement and proof · cited by 7,404
- IsStrictOrderedRingstatement and proof · cited by 2,490
- CauSeqstatement · cited by 189
- IsAbsoluteValuestatement and proof · cited by 160
- CauSeq.conststatement · cited by 58
- CauSeq.IsCompletestatement and proof · cited by 21
- CauSeq.IsComplete.isCompleteproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- CauSeq.limproof · cited by 35
- CauSeq.equiv_limproof · cited by 15