lean2/tests/lean/run/univ2.lean

import logic

axiom I : Type
definition F (X : Type) : Type := (X → Prop) → Prop
axiom unfold : I → F I
axiom fold   : F I → I
axiom iso1 : ∀x, fold (unfold x) = x

theorem iso2 : ∀x, fold (unfold x) = x
:= sorry
chore(*): minimize dependencies on tests Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-08-25 02:58:48 +00:00			`import logic`
fix(*): make sure elaborator and type_checker use the same "rules" for treating opaque definitions This is a big change because we have to store in constraints whether we can use the "relaxed" rules or not. The "relaxed" case says that when type checking the value of an opaque definition we can treat other opaque definitions in the same module as transparent. Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-27 19:01:06 +00:00
refactor(frontends/lean): constant/axiom are top-level commands, parameter/variable/hypothesis/conjecture are section/context-level commands Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-10-02 23:20:52 +00:00			`axiom I : Type`
fix(*): make sure elaborator and type_checker use the same "rules" for treating opaque definitions This is a big change because we have to store in constraints whether we can use the "relaxed" rules or not. The "relaxed" case says that when type checking the value of an opaque definition we can treat other opaque definitions in the same module as transparent. Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-27 19:01:06 +00:00			`definition F (X : Type) : Type := (X → Prop) → Prop`
refactor(frontends/lean): constant/axiom are top-level commands, parameter/variable/hypothesis/conjecture are section/context-level commands Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-10-02 23:20:52 +00:00			`axiom unfold : I → F I`
			`axiom fold : F I → I`
			`axiom iso1 : ∀x, fold (unfold x) = x`
fix(*): make sure elaborator and type_checker use the same "rules" for treating opaque definitions This is a big change because we have to store in constraints whether we can use the "relaxed" rules or not. The "relaxed" case says that when type checking the value of an opaque definition we can treat other opaque definitions in the same module as transparent. Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-27 19:01:06 +00:00
			`theorem iso2 : ∀x, fold (unfold x) = x`
			`:= sorry`