const In : set set prop term iIn = In infix iIn 2000 2000 term Subq = \x:set.\y:set.!z:set.z iIn x -> z iIn y term TransSet = \x:set.!y:set.y iIn x -> Subq y x const SNo : set prop const SNoLt : set set prop term < = SNoLt infix < 2020 2020 const add_SNo : set set set term + = add_SNo infix + 2281 2280 axiom add_SNo_Lt1_cancel: !x:set.!y:set.!z:set.SNo x -> SNo y -> SNo z -> (x + y) < z + y -> x < z const mul_SNo : set set set term * = mul_SNo infix * 2291 2290 lemma !x:set.!y:set.!z:set.!w:set.!u:set.!v:set.SNo z -> SNo w -> z < w -> SNo (u * v) -> (w + u * v) < z + u * v -> w < z -> x * y < w const SNoLe : set set prop term <= = SNoLe infix <= 2020 2020 const SNoL : set set var x:set var y:set var z:set var w:set var u:set var v:set hyp SNo x hyp SNo y hyp SNo z hyp !x2:set.x2 iIn SNoL x -> !y2:set.y2 iIn SNoL y -> (x2 * y + x * y2) < z + x2 * y2 hyp SNo w hyp z < w hyp u iIn SNoL x hyp v iIn SNoL y hyp (w + u * v) <= u * y + x * v hyp SNo u hyp SNo v hyp SNo (u * v) claim (w + u * v) < z + u * v -> x * y < w