Reference · Lemmas behind operations-research checks
rainbow.math.lemmas.fulfil-readings
General lemmas: fulfil readings. The mathematical facts the corresponding checks rest on, each checked by the kernel.
signed/min-select-cases
signed/min-select-cases : (ms-x ms-y : ℚ) → proposition/conjunction (data/Bool.rec (fun x₄₈ => ℚ) ms-y ms-x (signed/decide-at-most ms-x ms-y) ≤ ms-x) (proposition/conjunction (data/Bool.rec (fun x₇₂ => ℚ) ms-y ms-x (signed/decide-at-most ms-x ms-y) ≤ ms-y) (proposition/disjunction (data/Bool.rec (fun x₈₄ => ℚ) ms-y ms-x (signed/decide-at-most ms-x ms-y) = ms-x) (data/Bool.rec (fun x₈₈ => ℚ) ms-y ms-x (signed/decide-at-most ms-x ms-y) = ms-y)))
= = signed/equivalent: equality of rational valuesℚ = signed/SignedRational≤ = signed/at-most
signed/pick-line
signed/pick-line : (pl-o pl-a pl-s pl-d : ℚ) (pl-ho : 0 ≤ pl-o) (pl-ha : 0 ≤ pl-a) (pl-hs : pl-s = data/Bool.rec (fun x₄ => ℚ) pl-a pl-o (signed/decide-at-most pl-o pl-a)) (pl-hd : pl-d = pl-o + signed/negate pl-s) → proposition/conjunction (conjunction) (conjunction₁) where conjunction := proposition/conjunction (proposition/disjunction (pl-s = pl-o) (pl-s = pl-a)) (proposition/conjunction (pl-s ≤ pl-o) (proposition/conjunction (pl-s ≤ pl-a) (0 ≤ pl-s))) where conjunction₁ := proposition/conjunction (0 ≤ pl-d) (proposition/disjunction (pl-d = 0) (pl-s = pl-a))
+ = signed/add0 = signed/zero= = signed/equivalent: equality of rational valuesℚ = signed/SignedRational≤ = signed/at-most