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 term ordinal = \x:set.TransSet x & !y:set.y iIn x -> TransSet y term nIn = \x:set.\y:set.~ x iIn y axiom ordinal_Hered: !x:set.ordinal x -> !y:set.y iIn x -> ordinal y const SNoLev : set set const ordsucc : set set const minus_SNo : set set term - = minus_SNo lemma !x:set.!y:set.!z:set.!w:set.ordinal (SNoLev x) -> y iIn ordsucc (SNoLev z) -> z = - w -> SNoLev w iIn SNoLev x -> Subq (SNoLev - w) (SNoLev w) -> ordinal (ordsucc (SNoLev z)) -> ordinal y -> y iIn SNoLev x var x:set var y:set var z:set var w:set hyp ordinal (SNoLev x) hyp y iIn ordsucc (SNoLev z) hyp z = - w hyp SNoLev w iIn SNoLev x hyp Subq (SNoLev - w) (SNoLev w) hyp ordinal (SNoLev - w) claim ordinal (ordsucc (SNoLev z)) -> y iIn SNoLev x