Theorems · Theorem · commutative algebra
Ideal.nonPrincipals_zorn
∀ {R : Type u} [inst : Semiring R],
¬IsPrincipalIdealRing R →
∀ c ⊆ Ideal.nonPrincipals R, IsChain (fun x1 x2 => x1 ≤ x2) c → ∃ I ∈ Ideal.nonPrincipals R, ∀ J ∈ c, J ≤ IAny chain in the set of non-principal ideals has an upper bound which is non-principal.
(Namely, the union of the chain is such an upper bound.)
If you want the existence of a maximal non-principal ideal see
Ideal.exists_maximal_not_isPrincipal.
- Defined in
- Mathlib.RingTheory.PrincipalIdealDomain
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 71 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Semiring
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites18
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
- Semiringstatement and proof · cited by 13,802
- Submoduleproof · cited by 7,192
- Idealstatement and proof · cited by 4,748
- Set.Nonemptyproof · cited by 2,627
- le_antisymmproof · cited by 2,068
- Submodule.spanproof · cited by 1,504
- SupSet.sSupproof · cited by 954
- IsChainstatement and proof · cited by 158
- IsPrincipalIdealRingstatement and proof · cited by 131
- Submodule.IsPrincipalproof · cited by 129
- le_sSupproof · cited by 79
Cited by1
Results whose statement or proof uses this declaration.
- Ideal.exists_maximal_not_isPrincipalproof · cited by 1