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 nIn = \x:set.\y:set.~ x iIn y const SNoS_ : set set const SNoLev : set set const SNoCut : set set set const minus_SNo : set set term - = minus_SNo const Repl : set (set set) set lemma !x:set.!y:set.!z:set.SNo x -> (!w:set.w iIn SNoS_ (SNoLev x) -> !u:set.!v:set.SNoCutP u v -> w = SNoCut u v -> - w = SNoCut (Repl v minus_SNo) (Repl u minus_SNo)) -> (!w:set.w iIn y -> SNo w) -> (!w:set.w iIn z -> SNo w) -> x = SNoCut y z -> SNoCutP (Repl z minus_SNo) (Repl y minus_SNo) -> SNo (SNoCut (Repl z minus_SNo) (Repl y minus_SNo)) -> SNoLev (SNoCut (Repl z \w:set.- w) (Repl y \w:set.- w)) iIn SNoLev - x -> SNoCut (Repl z minus_SNo) (Repl y minus_SNo) iIn SNoS_ (SNoLev x) -> - SNoCut (Repl z minus_SNo) (Repl y minus_SNo) != SNoCut (Repl (Repl y minus_SNo) minus_SNo) (Repl (Repl z minus_SNo) minus_SNo) var x:set var y:set var z:set hyp SNo x hyp !w:set.w iIn SNoS_ (SNoLev x) -> !u:set.!v:set.SNoCutP u v -> w = SNoCut u v -> - w = SNoCut (Repl v minus_SNo) (Repl u minus_SNo) hyp !w:set.w iIn y -> SNo w hyp !w:set.w iIn z -> SNo w hyp x = SNoCut y z hyp SNoCutP (Repl z minus_SNo) (Repl y minus_SNo) hyp SNo (SNoCut (Repl z minus_SNo) (Repl y minus_SNo)) hyp SNoLev (SNoCut (Repl z \w:set.- w) (Repl y \w:set.- w)) iIn SNoLev - x claim ~ SNoCut (Repl z minus_SNo) (Repl y minus_SNo) iIn SNoS_ (SNoLev x)