Mathlib Map

Theorems · Theorem · order theory

RelSeries.smash_castLE

∀ {α : Type u_1} {r : SetRel α α} {p q : RelSeries r} (h : p.last = q.head) (i : Fin (p.length + 1)),
  (p.smash q h).toFun (Fin.castLE ⋯ i) = p.toFun i
Defined in
Mathlib.Order.RelSeries
Cited by
3 results in Mathlib
Foundations
Depth 52 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

RelSeries.smash_castAdd · cited by 1RelSeries.smash_castAddLTSeries.exists_relSeries_covBy · cited by 1LTSeries.exists_relSeries…RelSeries.smash_succ_castAdd · cited by 1RelSeries.smash_succ_cast…SetRel · cited by 581SetRelRelSeries.length · cited by 195RelSeries.lengthRelSeries · cited by 129RelSeriesRelSeries.last · cited by 114RelSeries.lastRelSeries.toFun · cited by 114RelSeries.toFunRelSeries.head · cited by 89RelSeries.headRelSeries.smash · cited by 15RelSeries.smashRelSeries.smash_castLECITED BYCITES

Cites7

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by3

Results whose statement or proof uses this declaration.