Theorems · Theorem · convex and discrete geometry

List.Wbtw.map

∀ {R : Type u_1} {V : Type u_2} {V' : Type u_3} {P : Type u_4} {P' : Type u_5} [inst : Ring R] [inst_1 : PartialOrder R]
  [inst_2 : AddCommGroup V] [inst_3 : Module R V] [inst_4 : AddTorsor V P] [inst_5 : AddCommGroup V']
  [inst_6 : Module R V'] [inst_7 : AddTorsor V' P'] {l : List P},
  List.Wbtw R l → ∀ (f : P →ᵃ[R] P'), List.Wbtw R (List.map (⇑f) l)

Defined in

Mathlib.Analysis.Convex.BetweenList

Cited by

3 results in Mathlib

Foundations

Depth 49 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

RingPartialOrderAddCommGroupModuleAddTorsorAddCommGroupModuleAddTorsor