Theorems · Theorem · order theory
CompositionSeries.Equivalent.smash
∀ {X : Type u} [inst : Lattice X] [inst_1 : JordanHolderLattice X] {s₁ s₂ t₁ t₂ : CompositionSeries X}
(hs : RelSeries.last s₁ = RelSeries.head s₂) (ht : RelSeries.last t₁ = RelSeries.head t₂),
s₁.Equivalent t₁ →
s₂.Equivalent t₂ → CompositionSeries.Equivalent (RelSeries.smash s₁ s₂ hs) (RelSeries.smash t₁ t₂ ht)- Defined in
- Mathlib.Order.JordanHolder
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 54 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LatticeJordanHolderLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites23
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Equivproof · cited by 8,337
- Set.ofPredstatement · cited by 6,101
- Equiv.symmproof · cited by 3,681
- Latticestatement and proof · cited by 916
- RelSeries.lengthproof · cited by 195
- RelSeries.laststatement and proof · cited by 114
- RelSeries.toFunproof · cited by 114
- RelSeries.headstatement and proof · cited by 89
- JordanHolderLatticestatement and proof · cited by 44
- JordanHolderLattice.IsMaximalstatement · cited by 42
- CompositionSeriesstatement and proof · cited by 40
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.