lean2/library/data/unit/insts.lean

-- Copyright (c) 2014 Microsoft Corporation. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Leonardo de Moura
import data.unit.decl data.unit.thms logic.decidable logic.inhabited
open decidable

namespace unit
  protected theorem subsingleton [instance] : subsingleton unit :=
  subsingleton.intro (λ a b, equal a b)

  protected definition is_inhabited [instance] : inhabited unit :=
  inhabited.mk ⋆

  protected definition has_decidable_eq [instance] : decidable_eq unit :=
  take (a b : unit), inl (equal a b)
end unit
chore(library/standard): add copyright to library files Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-06-30 18:44:47 +00:00			`-- Copyright (c) 2014 Microsoft Corporation. All rights reserved.`
			`-- Released under Apache 2.0 license as described in the file LICENSE.`
			`-- Author: Leonardo de Moura`
refactor(library/data/unit): break unit.lean into smaller pieces The unit datatype is used by automation. We want to be able to access its declaration without having to access all dependencies (e.g., decidable, subsingleton, inhabited, ...). This is not an optimization, but a way to make sure we can "import" unit before we import other declarations. 2014-10-25 21:57:33 +00:00			`import data.unit.decl data.unit.thms logic.decidable logic.inhabited`
feat(frontends/lean): rename 'using' command to 'open' Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-09-03 23:00:38 +00:00			`open decidable`
feat(library/standard): add inhabited, and files option and unit Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-06-30 02:30:38 +00:00
feat(frontends/lean/inductive_cmd): prefix introduction rules with the name of the inductive datatype Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-09-04 23:36:06 +00:00			`namespace unit`
feat(library): add definition of subsingleton and some other minor changes 2014-10-09 01:41:18 +00:00			`protected theorem subsingleton [instance] : subsingleton unit :=`
			`subsingleton.intro (λ a b, equal a b)`

refactor(library): is_inhabited "theorems" should be "definitions", they are "data" 2014-10-02 16:00:34 +00:00			`protected definition is_inhabited [instance] : inhabited unit :=`
refactor(library/data): cleanup datatypes Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-09-05 05:31:52 +00:00			`inhabited.mk ⋆`
fix(lean/library/standard): fix tests, more cleanup 2014-08-20 22:49:44 +00:00
refactor(library): mark 'decidable' theorems as definitions If we don't do that, then any 'if' term that uses one of these theorems will get "stuck". That is, the kernel will not be able to reduce them because theorems are always opaque 2014-09-30 16:02:37 +00:00			`protected definition has_decidable_eq [instance] : decidable_eq unit :=`
refactor(library): replace decidable_eq with abbreviation 2014-09-09 23:07:07 +00:00			`take (a b : unit), inl (equal a b)`
feat(library/standard): port int, and reorganize a lot 2014-08-20 02:32:44 +00:00			`end unit`