(7steps) PrintForm Definitions Lemmas int 2 Sections StandardLIB Doc

At: int upper well founded 1 1

1. n:
2. WellFnd{i}(;x,y.x < y)

WellFnd{i}({n...};x,y.x < y)

By: Using [`B',{n...};`f',(z.z-n)] (FwdThru Thm* r:(AAProp), B:Type, f:(BA). WellFnd{i}(A;x,y.r(x,y)) WellFnd{i}(B;x,y.r(f(x),f(y))) [2])

Generated subgoal:

13. WellFnd{i}({n...};x,y.(z.z-n)(x) < (z.z-n)(y))
WellFnd{i}({n...};x,y.x < y)


About:
intsubtractless_thanlambda

(7steps) PrintForm Definitions Lemmas int 2 Sections StandardLIB Doc