[Imprint][Data Privacy Statement][E-Mail]

Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Theorem base for Specification real-min-max

This is a listing of all goals defined over the current specification. Axioms are marked yellow, proved theorems green and unproved theorems blue. Click on individual names to get more information on the proof.

Name: Sequent: Type:
Min-right ⊦ ¬ r1 < r2 → min(r1, r2) = r2 An Axiom
min-neq2 ⊦ r1 ≠ r2 → (min(r, r1) = r2 ↔ r = r2 ∧ r < r1) A User Theorem
min-neq1 ⊦ r1 ≠ r2 → (min(r1, r) = r2 ↔ r = r2 ∧ r < r1) A User Theorem
Max-right ⊦ ¬ r1 < r2 → max(r1, r2) = r1 An Axiom
Min-left ⊦ r1 < r2 → min(r1, r2) = r1 An Axiom
max-i ⊦ max(r, r) = r A User Theorem
min-ls-both ⊦ min(r1, r2) < r1 → (min(r1, r2) < r2 ↔ false) A User Theorem
max-neq2 ⊦ r1 ≠ r2 → (max(r, r1) = r2 ↔ r = r2 ∧ r1 < r) A User Theorem
max-neq1 ⊦ r1 ≠ r2 → (max(r1, r) = r2 ↔ r = r2 ∧ r1 < r) A User Theorem
max-ls-self2 ⊦ ¬ max(r, r0) < r0 A User Theorem
max-ls-self1 ⊦ ¬ max(r, r0) < r A User Theorem
max-a ⊦ max(r, max(r0, r1)) = max(max(r, r0), r1) A User Theorem
max-c ⊦ max(r1, r2) = max(r2, r1) A User Theorem
min-a ⊦ min(r, min(r0, r1)) = min(min(r, r0), r1) A User Theorem
min-distr ⊦ min(r1 + (* i).r, r2 + (* i).r) = min(r1, r2) + i.r A User Theorem
min-c ⊦ min(r1, r2) = min(r2, r1) A User Theorem
Max-left ⊦ r1 < r2 → max(r1, r2) = r2 An Axiom
min-ls-self1 ⊦ ¬ r < min(r, r0) A User Theorem
min-ls-self2 ⊦ ¬ r0 < min(r, r0) A User Theorem
max-ls-both ⊦ r1 < max(r1, r2) → (r2 < max(r1, r2) ↔ false) A User Theorem
max-distr ⊦ max(r1 + (* i).r, r2 + (* i).r) = max(r1, r2) + i.r A User Theorem
min-i ⊦ min(r, r) = r A User Theorem