101 lines
4.7 KiB
C
101 lines
4.7 KiB
C
|
/*
|
||
|
|
Copyright (c) 2013 Microsoft Corporation. All rights reserved.
|
||
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
||
|
|
|
||
|
|
Author: Leonardo de Moura
|
||
|
|
*/
|
||
|
|
#pragma once
|
||
|
|
#include "builtin.h"
|
||
|
|
|
||
|
|
namespace lean {
|
||
|
|
|
||
|
|
expr mk_absurd_fn();
|
||
|
|
bool is_absurd_fn(expr const & e);
|
||
|
|
/** \brief (Theorem) a : Bool, H1 : a, H2 : Not(a) |- Absurd(a, H1, H2) : False */
|
||
|
|
inline expr Absurd(expr const & a, expr const & H1, expr const & H2) { return mk_app(mk_absurd_fn(), a, H1, H2); }
|
||
|
|
|
||
|
|
expr mk_false_elim_fn();
|
||
|
|
bool is_false_elim_fn(expr const & e);
|
||
|
|
/** \brief (Theorem) a : Bool, H : False |- FalseElim(a, H) : a */
|
||
|
|
inline expr FalseElim(expr const & a, expr const & H) { return mk_app(mk_false_elim_fn(), a, H); }
|
||
|
|
|
||
|
|
expr mk_double_neg_fn();
|
||
|
|
bool is_double_neg_fn(expr const & e);
|
||
|
|
/** \brief (Theorem) a : Bool |- DoubleNeg(a) : Neg(Neg(a)) = a */
|
||
|
|
inline expr DoubleNeg(expr const & a) { return mk_app(mk_double_neg_fn(), a); }
|
||
|
|
|
||
|
|
expr mk_mt_fn();
|
||
|
|
bool is_mt_fn(expr const & e);
|
||
|
|
/** \brief (Theorem) a b : Bool, H1 : a => b, H2 : Not(b) |- MT(a, b, H1, H2) : Not(a) */
|
||
|
|
inline expr MT(expr const & a, expr const & b, expr const & H1, expr const & H2) { return mk_app(mk_mt_fn(), a, b, H1, H2); }
|
||
|
|
|
||
|
|
expr mk_contrapos_fn();
|
||
|
|
bool is_contrapos_fn(expr const & e);
|
||
|
|
/** \brief (Theorem) a b : Bool, H : a => b |- Contrapos(a, b, H): Neg(b) => Neg(a) */
|
||
|
|
inline expr Contrapos(expr const & a, expr const & b, expr const & H) { return mk_app(mk_contrapos_fn(), a, b, H); }
|
||
|
|
|
||
|
|
expr mk_symm_fn();
|
||
|
|
bool is_symm_fn(expr const & e);
|
||
|
|
/** \brief (Theorem) A : Type u, a b : A, H : a = b |- Symm(A, a, b, H) : b = a */
|
||
|
|
inline expr Symm(expr const & A, expr const & a, expr const & b, expr const & H) { return mk_app(mk_symm_fn(), A, a, b, H); }
|
||
|
|
|
||
|
|
expr mk_trans_fn();
|
||
|
|
bool is_trans_fn(expr const & e);
|
||
|
|
/** \brief (Theorem) A : Type u, a b c : A, H1 : a = b, H2 : b = c |- Trans(A, a, b, c, H1, H2) : a = c */
|
||
|
|
inline expr Trans(expr const & A, expr const & a, expr const & b, expr const & c, expr const & H1, expr const & H2) { return mk_app({mk_trans_fn(), A, a, b, c, H1, H2}); }
|
||
|
|
|
||
|
|
expr mk_xtrans_fn();
|
||
|
|
bool is_xtrans_fn(expr const & e);
|
||
|
|
/** \brief (Theorem) A : Type u, B : Type u, a : A, b c : B, H1 : a = b, H2 : b = c |- xTrans(A, B, a, b, c, H1, H2) : a = c */
|
||
|
|
inline expr xTrans(expr const & A, expr const & B, expr const & a, expr const & b, expr const & c, expr const & H1, expr const & H2) { return mk_app({mk_xtrans_fn(), A, B, a, b, c, H1, H2}); }
|
||
|
|
|
||
|
|
expr mk_congr1_fn();
|
||
|
|
bool is_congr1_fn(expr const & e);
|
||
|
|
/** \brief (Theorem) A : Type u, B : A -> Type u, f g : (Pi x : A, B x), a : A, H : f = g |- Congr2(A, B, f, g, a, H) : f a = g a */
|
||
|
|
inline expr Congr1(expr const & A, expr const & B, expr const & f, expr const & g, expr const & a, expr const & H) { return mk_app({mk_congr1_fn(), A, B, f, g, a, H}); }
|
||
|
|
|
||
|
|
expr mk_congr2_fn();
|
||
|
|
bool is_congr2_fn(expr const & e);
|
||
|
|
/** \brief (Theorem) A : Type u, B : A -> Type u, f : (Pi x : A, B x), a b : A, H : a = b |- Congr1(A, B, f, a, b, H) : f a = f b */
|
||
|
|
inline expr Congr2(expr const & A, expr const & B, expr const & f, expr const & a, expr const & b, expr const & H) { return mk_app({mk_congr2_fn(), A, B, f, a, b, H}); }
|
||
|
|
|
||
|
|
expr mk_congr_fn();
|
||
|
|
bool is_congr_fn(expr const & e);
|
||
|
|
/** \brief (Theorem) A : Type u, B : A -> Type u, f g : (Pi x : A, B x), a b : A, H1 : f = g, H2 : a = b |- Congr(A, B, f, g, a, b, H1, H2) : f a = g b */
|
||
|
|
inline expr Congr(expr const & A, expr const & B, expr const & f, expr const & g, expr const & a, expr const & b, expr const & H1, expr const & H2) { return mk_app({mk_congr_fn(), A, B, f, g, a, b, H1, H2}); }
|
||
|
|
|
||
|
|
expr mk_eq_mp_fn();
|
||
|
|
bool is_eq_mp_fn(expr const & e);
|
||
|
|
/** \brief (Theorem) a : Bool, b : Bool, H1 : a = b, H2 : a |- EqMP(a, b, H1, H2) : b */
|
||
|
|
inline expr EqMP(expr const & a, expr const & b, expr const & H1, expr const & H2) { return mk_app(mk_eq_mp_fn(), a, b, H1, H2); }
|
||
|
|
|
||
|
|
expr mk_truth();
|
||
|
|
bool is_truth(expr const & e);
|
||
|
|
/** \brief (Theorem) Truth : True */
|
||
|
|
#define Truth mk_truth()
|
||
|
|
|
||
|
|
expr mk_eqt_elim_fn();
|
||
|
|
bool is_eqt_elim(expr const & e);
|
||
|
|
// \brief (Theorem) a : Bool, H : a = True |- EqT(a, H) : a
|
||
|
|
inline expr EqTElim(expr const & a, expr const & H) { return mk_app(mk_eqt_elim_fn(), a, H); }
|
||
|
|
|
||
|
|
expr mk_forall_elim_fn();
|
||
|
|
bool is_forall_elim_fn(expr const & e);
|
||
|
|
// \brief (Theorem) A : Type u, P : A -> Bool, H : (Forall A P), a : A |- Forallelim(A, P, H, a) : P a
|
||
|
|
inline expr ForallElim(expr const & A, expr const & P, expr const & H, expr const & a) { return mk_app(mk_forall_elim_fn(), A, P, H, a); }
|
||
|
|
|
||
|
|
/** \brief Add basic theorems to Environment */
|
||
|
|
void add_basic_thms(environment & env);
|
||
|
|
|
||
|
|
#if 0
|
||
|
|
expr mk_ext_fn();
|
||
|
|
bool is_ext_fn(expr const & e);
|
||
|
|
expr mk_foralli_fn();
|
||
|
|
bool is_foralli_fn(expr const & e);
|
||
|
|
expr mk_domain_inj_fn();
|
||
|
|
bool is_domain_inj_fn(expr const & e);
|
||
|
|
expr mk_range_inj_fn();
|
||
|
|
bool is_range_inj_fn(expr const & e);
|
||
|
|
#endif
|
||
|
|
}
|