33 lines
939 B
Text
33 lines
939 B
Text
|
import standard
|
|||
|
|
using num tactic pair
|
|||
|
|
|
|||
|
|
inductive inh (A : Type) : Bool :=
|
|||
|
|
| inh_intro : A -> inh A
|
|||
|
|
|
|||
|
|
instance inh_intro
|
|||
|
|
|
|||
|
|
theorem inh_elim {A : Type} {B : Bool} (H1 : inh A) (H2 : A → B) : B
|
|||
|
|
:= inh_rec H2 H1
|
|||
|
|
|
|||
|
|
theorem inh_exists [instance] {A : Type} {P : A → Bool} (H : ∃x, P x) : inh A
|
|||
|
|
:= obtain w Hw, from H, inh_intro w
|
|||
|
|
|
|||
|
|
theorem inh_bool [instance] : inh Bool
|
|||
|
|
:= inh_intro true
|
|||
|
|
|
|||
|
|
theorem inh_fun [instance] {A B : Type} (H : inh B) : inh (A → B)
|
|||
|
|
:= inh_rec (λb, inh_intro (λa : A, b)) H
|
|||
|
|
|
|||
|
|
theorem pair_inh [instance] {A : Type} {B : Type} (H1 : inh A) (H2 : inh B) : inh (pair A B)
|
|||
|
|
:= inh_elim H1 (λa, inh_elim H2 (λb, inh_intro (mk_pair a b)))
|
|||
|
|
|
|||
|
|
definition assump := eassumption
|
|||
|
|
tactic_hint assump
|
|||
|
|
|
|||
|
|
theorem tst {A B : Type} (H : inh B) : inh (A → B → B)
|
|||
|
|
|
|||
|
|
theorem T1 {A B C D : Type} {P : C → Bool} (a : A) (H1 : inh B) (H2 : ∃x, P x) : inh ((A → A) × B × (D → C) × Bool)
|
|||
|
|
|
|||
|
|
(*
|
|||
|
|
print(get_env():find("T1"):value())
|
|||
|
|
*)
|