const In : set set prop term iIn = In infix iIn 2000 2000 term nIn = \x:set.\y:set.~ x iIn y const Pi : set (set set) set term setexp = \x:set.\y:set.Pi y \z:set.x term Subq = \x:set.\y:set.!z:set.z iIn x -> z iIn y const SNo : set prop const SNoLt : set set prop term < = SNoLt infix < 2020 2020 axiom SNoLt_tra: !x:set.!y:set.!z:set.SNo x -> SNo y -> SNo z -> x < y -> y < z -> x < z const minus_SNo : set set term - = minus_SNo const SNoS_ : set set const omega : set const abs_SNo : set set const add_SNo : set set set term + = add_SNo infix + 2281 2280 const eps_ : set set const ap : set set set const ordsucc : set set const Empty : set lemma !x:set.!y:set.!z:set.!w:set.SNo x -> SNo - x -> z iIn SNoS_ omega -> (!u:set.u iIn omega -> abs_SNo (z + - x) < eps_ u) -> SNo z -> SNo (z + - x) -> (!u:set.u iIn SNoS_ omega -> (!v:set.v iIn omega -> abs_SNo (u + - ap y (ordsucc w)) < eps_ v) -> u = ap y (ordsucc w)) -> SNo (ap y (ordsucc w)) -> ap y (ordsucc w) < z -> Empty < z + - ap y (ordsucc w) -> SNo (z + - ap y (ordsucc w)) -> x < ap y (ordsucc w) -> x < z -> z < ap y w var x:set var y:set var z:set var w:set hyp SNo x hyp !u:set.u iIn omega -> x < ap y u hyp SNo - x hyp z iIn SNoS_ omega hyp !u:set.u iIn omega -> abs_SNo (z + - x) < eps_ u hyp SNo z hyp SNo (z + - x) hyp w iIn omega hyp !u:set.u iIn SNoS_ omega -> (!v:set.v iIn omega -> abs_SNo (u + - ap y (ordsucc w)) < eps_ v) -> u = ap y (ordsucc w) hyp SNo (ap y (ordsucc w)) hyp ap y (ordsucc w) < z hyp Empty < z + - ap y (ordsucc w) hyp SNo (z + - ap y (ordsucc w)) claim x < ap y (ordsucc w) -> z < ap y w