Reference · Lemmas behind operations-research checks
rainbow.math.lemmas.claimpay-readings
General lemmas: claimpay readings. The mathematical facts the corresponding checks rest on, each checked by the kernel.
signed/positive-part-cases
signed/positive-part-cases : (pq-v : ℚ) → proposition/conjunction (0 ≤ data/Bool.rec (fun x₄₈ => ℚ) 0 pq-v (signed/decide-at-most 0 pq-v)) (proposition/conjunction (pq-v ≤ data/Bool.rec (fun x₇₂ => ℚ) 0 pq-v (signed/decide-at-most 0 pq-v)) (proposition/disjunction (data/Bool.rec (fun x₈₄ => ℚ) 0 pq-v (signed/decide-at-most 0 pq-v) = 0) (data/Bool.rec (fun x₈₈ => ℚ) 0 pq-v (signed/decide-at-most 0 pq-v) = pq-v)))
0 = signed/zero= = signed/equivalent: equality of rational valuesℚ = signed/SignedRational≤ = signed/at-most
signed/claim-payment-cell
signed/claim-payment-cell : (cp-L cp-d cp-c cp-k cp-E cp-R cp-X cp-P : ℚ) (cp-hL : 0 ≤ cp-L) (cp-hd : 0 ≤ cp-d) (cp-hc : 0 ≤ cp-c) (cp-hc1 : cp-c ≤ 1) (cp-hk : 0 ≤ cp-k) (cp-hE : cp-E = data/Bool.rec (fun x₄ => ℚ) 0 (cp-L + signed/negate cp-d) (most₃)) (cp-hR : cp-R = cp-c · cp-E) (cp-hX : cp-X = data/Bool.rec (fun x₈ => ℚ) 0 (cp-R + signed/negate cp-k) (most)) (cp-hP : cp-P = cp-R + signed/negate cp-X) → proposition/conjunction (conjunction₁) (conjunction) where conjunction := proposition/conjunction (proposition/conjunction (proposition/disjunction (cp-P = cp-R) (cp-P = cp-k)) (proposition/conjunction (cp-P ≤ cp-R) (cp-P ≤ cp-k))) (proposition/conjunction (0 ≤ cp-P) (cp-P ≤ cp-L)) where conjunction₁ := proposition/conjunction (proposition/disjunction (cp-E = 0) (cp-E = cp-L + signed/negate cp-d)) (proposition/conjunction (0 ≤ cp-E) (cp-L + signed/negate cp-d ≤ cp-E)) where most := signed/decide-at-most 0 (cp-R + signed/negate cp-k) where most₃ := signed/decide-at-most 0 (cp-L + signed/negate cp-d)
+ = signed/add0 = signed/zero1 = signed/one= = signed/equivalent: equality of rational values· = signed/multiplyℚ = signed/SignedRational≤ = signed/at-most