const In : set set prop term iIn = In infix iIn 2000 2000 const SNo : set prop const SNoLe : set set prop term <= = SNoLe infix <= 2020 2020 term SNo_max_of = \x:set.\y:set.y iIn x & SNo y & !z:set.z iIn x -> SNo z -> z <= y const bij : set set (set set) prop term equip = \x:set.\y:set.?f:set set.bij x y f const omega : set term finite = \x:set.?y:set.y iIn omega & equip x y term Subq = \x:set.\y:set.!z:set.z iIn x -> z iIn y term nIn = \x:set.\y:set.~ x iIn y const ordsucc : set set axiom ordsuccI2: !x:set.x iIn ordsucc x const Repl : set (set set) set lemma !x:set.!y:set.!f:set set.!z:set.(!w:set.w iIn y -> SNo w) -> (!w:set.w iIn ordsucc (ordsucc x) -> f w iIn y) -> (!w:set.w iIn y -> ?u:set.u iIn ordsucc (ordsucc x) & f u = w) -> Subq (Repl (ordsucc x) f) y -> z iIn Repl (ordsucc x) (\w:set.f w) -> SNo z -> (!w:set.w iIn Repl (ordsucc x) f -> SNo w -> w <= z) -> f (ordsucc x) iIn y -> ?w:set.SNo_max_of y w var x:set var y:set var f:set set hyp !z:set.(!w:set.w iIn z -> SNo w) -> equip z (ordsucc x) -> ?w:set.SNo_max_of z w hyp !z:set.z iIn y -> SNo z hyp !z:set.z iIn ordsucc (ordsucc x) -> f z iIn y hyp !z:set.z iIn ordsucc (ordsucc x) -> !w:set.w iIn ordsucc (ordsucc x) -> f z = f w -> z = w hyp !z:set.z iIn y -> ?w:set.w iIn ordsucc (ordsucc x) & f w = z hyp Subq (Repl (ordsucc x) f) y claim equip (Repl (ordsucc x) f) (ordsucc x) -> ?z:set.SNo_max_of y z