Reference · Lemmas behind operations-research checks
rainbow.math.lemmas.xol-readings
General lemmas: xol readings. The mathematical facts the corresponding checks rest on, each checked by the kernel.
signed/layer-clamp-cases
signed/layer-clamp-cases : (lc-e lc-l : ℚ) (lc-hl : 0 ≤ lc-l) → proposition/conjunction (0 ≤ data/Bool.rec (fun x₁₁₉₆ => ℚ) (data/Bool.rec (fun x₁₂₀₀ => ℚ) lc-l lc-e (signed/decide-at-most lc-e lc-l)) 0 (signed/decide-at-most lc-e 0)) (proposition/conjunction (data/Bool.rec (fun x₁₇₉₆ => ℚ) (data/Bool.rec (fun x₁₈₀₀ => ℚ) lc-l lc-e (signed/decide-at-most lc-e lc-l)) 0 (signed/decide-at-most lc-e 0) ≤ lc-l) (proposition/disjunction (proposition/conjunction (lc-e ≤ 0) (data/Bool.rec (fun x₂₁₁₆ => ℚ) (data/Bool.rec (fun x₂₁₂₀ => ℚ) lc-l lc-e (signed/decide-at-most lc-e lc-l)) 0 (signed/decide-at-most lc-e 0) = 0)) (proposition/disjunction (proposition/conjunction (0 ≤ lc-e) (proposition/conjunction (lc-e ≤ lc-l) (data/Bool.rec (fun x₂₃₁₆ => ℚ) (data/Bool.rec (fun x₂₃₂₀ => ℚ) lc-l lc-e (signed/decide-at-most lc-e lc-l)) 0 (signed/decide-at-most lc-e 0) = lc-e))) (proposition/conjunction (lc-l ≤ lc-e) (data/Bool.rec (fun x₂₃₅₆ => ℚ) (data/Bool.rec (fun x₂₃₆₀ => ℚ) lc-l lc-e (signed/decide-at-most lc-e lc-l)) 0 (signed/decide-at-most lc-e 0) = lc-l)))))
0 = signed/zero= = signed/equivalent: equality of rational valuesℚ = signed/SignedRational≤ = signed/at-most
signed/layer-recovery-cell
signed/layer-recovery-cell : (rc-x rc-d rc-l rc-R : ℚ) (rc-hx : 0 ≤ rc-x) (rc-hd : 0 ≤ rc-d) (rc-hl : 0 ≤ rc-l) (rc-h : rc-R = data/Bool.rec (fun x₁₆ => ℚ) (data/Bool.rec (fun x₂₀ => ℚ) rc-l (rc-x + signed/negate rc-d) (most)) 0 (most₃)) → proposition/conjunction (disjunction) (conjunction) where conjunction := proposition/conjunction (0 ≤ rc-R) (proposition/conjunction (rc-R ≤ rc-l) (rc-R ≤ rc-x)) where disjunction := proposition/disjunction (proposition/conjunction (rc-x + signed/negate rc-d ≤ 0) (rc-R = 0)) (proposition/disjunction (proposition/conjunction (0 ≤ rc-x + signed/negate rc-d) (proposition/conjunction (rc-x + signed/negate rc-d ≤ rc-l) (rc-R = rc-x + signed/negate rc-d))) (proposition/conjunction (rc-l ≤ rc-x + signed/negate rc-d) (rc-R = rc-l))) where most := signed/decide-at-most (rc-x + signed/negate rc-d) rc-l where most₃ := signed/decide-at-most (rc-x + signed/negate rc-d) 0
+ = signed/add0 = signed/zero= = signed/equivalent: equality of rational valuesℚ = signed/SignedRational≤ = signed/at-most