const In : set set prop term iIn = In infix iIn 2000 2000 const SNo : set prop const SNoLt : set set prop term < = SNoLt infix < 2020 2020 term SNoCutP = \x:set.\y:set.(!z:set.z iIn x -> SNo z) & (!z:set.z iIn y -> SNo z) & !z:set.z iIn x -> !w:set.w iIn y -> z < w 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 binintersect : set set set axiom binintersectE: !x:set.!y:set.!z:set.z iIn binintersect x y -> z iIn x & z iIn y const SNoLev : set set const SNoL : set set axiom SNoL_I: !x:set.SNo x -> !y:set.SNo y -> SNoLev y iIn SNoLev x -> y < x -> y iIn SNoL x const SNoR : set set axiom SNoR_I: !x:set.SNo x -> !y:set.SNo y -> SNoLev y iIn SNoLev x -> x < y -> y iIn SNoR x const SNoEq_ : set set set prop const nIn : set set prop axiom SNoLtE: !x:set.!y:set.SNo x -> SNo y -> x < y -> !P:prop.(!z:set.SNo z -> SNoLev z iIn binintersect (SNoLev x) (SNoLev y) -> SNoEq_ (SNoLev z) z x -> SNoEq_ (SNoLev z) z y -> x < z -> z < y -> nIn (SNoLev z) x -> SNoLev z iIn y -> P) -> (SNoLev x iIn SNoLev y -> SNoEq_ (SNoLev x) x y -> SNoLev x iIn y -> P) -> (SNoLev y iIn SNoLev x -> SNoEq_ (SNoLev y) x y -> nIn (SNoLev y) x -> P) -> P const add_SNo : set set set term + = add_SNo infix + 2281 2280 const binunion : set set set const Repl : set (set set) set const SNoS_ : set set lemma !x:set.!y:set.!z:set.!w:set.!u:set.(!v:set.!x2:set.SNo (v + x2) & (!y2:set.y2 iIn SNoL v -> (y2 + x2) < v + x2) & (!y2:set.y2 iIn SNoR v -> (v + x2) < y2 + x2) & (!y2:set.y2 iIn SNoL x2 -> (v + y2) < v + x2) & (!y2:set.y2 iIn SNoR x2 -> (v + x2) < v + y2) & SNoCutP (binunion (Repl (SNoL v) \y2:set.y2 + x2) (Repl (SNoL x2) (add_SNo v))) (binunion (Repl (SNoR v) \y2:set.y2 + x2) (Repl (SNoR x2) (add_SNo v))) -> !P:prop.(SNo (v + x2) -> (!y2:set.y2 iIn SNoL v -> (y2 + x2) < v + x2) -> (!y2:set.y2 iIn SNoR v -> (v + x2) < y2 + x2) -> (!y2:set.y2 iIn SNoL x2 -> (v + y2) < v + x2) -> (!y2:set.y2 iIn SNoR x2 -> (v + x2) < v + y2) -> P) -> P) -> SNo y -> (!v:set.v iIn SNoS_ (SNoLev y) -> SNo (x + v) & (!x2:set.x2 iIn SNoL x -> (x2 + v) < x + v) & (!x2:set.x2 iIn SNoR x -> (x + v) < x2 + v) & (!x2:set.x2 iIn SNoL v -> (x + x2) < x + v) & (!x2:set.x2 iIn SNoR v -> (x + v) < x + x2) & SNoCutP (binunion (Repl (SNoL x) \x2:set.x2 + v) (Repl (SNoL v) (add_SNo x))) (binunion (Repl (SNoR x) \x2:set.x2 + v) (Repl (SNoR v) (add_SNo x)))) -> TransSet (SNoLev y) -> SNo z -> SNo (x + z) -> (!v:set.v iIn SNoR z -> (x + z) < x + v) -> SNo w -> SNoLev w iIn SNoLev y -> SNo (x + w) -> (!v:set.v iIn SNoL w -> (x + v) < x + w) -> SNo u -> z < u -> u < w -> SNoLev u iIn SNoLev z -> SNoLev u iIn SNoLev w -> SNoLev u iIn SNoLev y -> (x + z) < x + w var x:set var y:set var z:set var w:set hyp !u:set.!v:set.SNo (u + v) & (!x2:set.x2 iIn SNoL u -> (x2 + v) < u + v) & (!x2:set.x2 iIn SNoR u -> (u + v) < x2 + v) & (!x2:set.x2 iIn SNoL v -> (u + x2) < u + v) & (!x2:set.x2 iIn SNoR v -> (u + v) < u + x2) & SNoCutP (binunion (Repl (SNoL u) \x2:set.x2 + v) (Repl (SNoL v) (add_SNo u))) (binunion (Repl (SNoR u) \x2:set.x2 + v) (Repl (SNoR v) (add_SNo u))) -> !P:prop.(SNo (u + v) -> (!x2:set.x2 iIn SNoL u -> (x2 + v) < u + v) -> (!x2:set.x2 iIn SNoR u -> (u + v) < x2 + v) -> (!x2:set.x2 iIn SNoL v -> (u + x2) < u + v) -> (!x2:set.x2 iIn SNoR v -> (u + v) < u + x2) -> P) -> P hyp SNo y hyp !u:set.u iIn SNoS_ (SNoLev y) -> SNo (x + u) & (!v:set.v iIn SNoL x -> (v + u) < x + u) & (!v:set.v iIn SNoR x -> (x + u) < v + u) & (!v:set.v iIn SNoL u -> (x + v) < x + u) & (!v:set.v iIn SNoR u -> (x + u) < x + v) & SNoCutP (binunion (Repl (SNoL x) \v:set.v + u) (Repl (SNoL u) (add_SNo x))) (binunion (Repl (SNoR x) \v:set.v + u) (Repl (SNoR u) (add_SNo x))) hyp TransSet (SNoLev y) hyp SNo z hyp z < y hyp SNo (x + z) hyp !u:set.u iIn SNoR z -> (x + z) < x + u hyp SNo w hyp SNoLev w iIn SNoLev y hyp y < w hyp SNo (x + w) hyp !u:set.u iIn SNoL w -> (x + u) < x + w claim z < w -> (x + z) < x + w