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 const ordinal : set prop const SNoS_ : set set const SNoLev : set set const SNo : set prop const SNo_ : set set prop axiom SNoS_E2: !x:set.ordinal x -> !y:set.y iIn SNoS_ x -> !P:prop.(SNoLev y iIn x -> ordinal (SNoLev y) -> SNo y -> SNo_ (SNoLev y) y -> P) -> P const ordsucc : set set const SNoCutP : set set prop const SNoCut : set set set lemma !x:set.!y:set.!z:set.ordinal x -> (!w:set.w iIn x -> ordsucc w iIn x) -> Subq y (SNoS_ x) -> Subq z (SNoS_ x) -> SNoCutP y z -> (!w:set.w iIn y -> SNoLev w iIn x) -> (!w:set.w iIn z -> SNoLev w iIn x) -> SNoLev (SNoCut y z) iIn ordsucc x var x:set var y:set var z:set hyp ordinal x hyp !w:set.w iIn x -> ordsucc w iIn x hyp Subq y (SNoS_ x) hyp Subq z (SNoS_ x) hyp SNoCutP y z claim (!w:set.w iIn y -> SNoLev w iIn x) -> SNoLev (SNoCut y z) iIn ordsucc x