Loogle!
Result
Found 696 declarations whose name contains "Std.Do". Of these, only the first 200 are shown.
- Std.Do.SVal.StateTuple π Std.Do.SPred.SVal
(Οs : List (Type u)) : Type u - Std.Do.SVal π Std.Do.SPred.SVal
(Οs : List (Type u)) (Ξ± : Type u) : Type u - Std.Do.SVal.GetTy π Std.Do.SPred.SVal
(Ο : Type u) (Οs : List (Type u)) : Type u - Std.Do.SVal.instInhabitedStateTupleNil π Std.Do.SPred.SVal
: Inhabited (Std.Do.SVal.StateTuple []) - Std.Do.SVal.curry π Std.Do.SPred.SVal
{Ξ± : Type u} {Οs : List (Type u)} (f : Std.Do.SVal.StateTuple Οs β Ξ±) : Std.Do.SVal Οs Ξ± - Std.Do.SVal.getThe π Std.Do.SPred.SVal
{Οs : List (Type u)} (Ο : Type u) [Std.Do.SVal.GetTy Ο Οs] : Std.Do.SVal Οs Ο - Std.Do.SVal.instGetTyCons π Std.Do.SPred.SVal
{Ο : Type u_1} {Οs : List (Type u_1)} : Std.Do.SVal.GetTy Ο (Ο :: Οs) - Std.Do.SVal.instInhabited π Std.Do.SPred.SVal
{Ξ± : Type u_1} {Οs : List (Type u_1)} [Inhabited Ξ±] : Inhabited (Std.Do.SVal Οs Ξ±) - Std.Do.SVal.uncurry π Std.Do.SPred.SVal
{Ξ± : Type u} {Οs : List (Type u)} (f : Std.Do.SVal Οs Ξ±) : Std.Do.SVal.StateTuple Οs β Ξ± - Std.Do.SVal.GetTy.get π Std.Do.SPred.SVal
{Ο : Type u} {Οs : List (Type u)} [self : Std.Do.SVal.GetTy Ο Οs] : Std.Do.SVal Οs Ο - Std.Do.SVal.GetTy.mk π Std.Do.SPred.SVal
{Ο : Type u} {Οs : List (Type u)} (get : Std.Do.SVal Οs Ο) : Std.Do.SVal.GetTy Ο Οs - Std.Do.SVal.instGetTyCons_1 π Std.Do.SPred.SVal
{Οβ : Type u_1} {Οs : List (Type u_1)} {Οβ : Type u_1} [Std.Do.SVal.GetTy Οβ Οs] : Std.Do.SVal.GetTy Οβ (Οβ :: Οs) - Std.Do.SVal.instInhabitedStateTupleCons π Std.Do.SPred.SVal
{Ο : Type u_1} {Οs : List (Type u_1)} [Inhabited Ο] [Inhabited (Std.Do.SVal.StateTuple Οs)] : Inhabited (Std.Do.SVal.StateTuple (Ο :: Οs)) - Std.Do.SVal.uncurry_nil π Std.Do.SPred.SVal
{Ο : Type u} {s : Ο} : Std.Do.SVal.uncurry s = fun x => s - Std.Do.SVal.curry_nil π Std.Do.SPred.SVal
{Ξ± : Type u_1} {f : Std.Do.SVal.StateTuple [] β Ξ±} : Std.Do.SVal.curry f = f PUnit.unit - Std.Do.SVal.curry_uncurry π Std.Do.SPred.SVal
{Ξ± : Type u} {Οs : List (Type u)} {f : Std.Do.SVal Οs Ξ±} : Std.Do.SVal.curry f.uncurry = f - Std.Do.SVal.uncurry_curry π Std.Do.SPred.SVal
{Ξ± : Type u} {Οs : List (Type u)} {f : Std.Do.SVal.StateTuple Οs β Ξ±} : (Std.Do.SVal.curry f).uncurry = f - Std.Do.SVal.getThe_here π Std.Do.SPred.SVal
{Οs : List (Type u)} (Ο : Type u) (s : Ο) : Std.Do.SVal.getThe Ο s = Std.Do.SVal.curry fun x => s - Std.Do.SVal.getThe_there π Std.Do.SPred.SVal
{Ο : Type u} {Οs : List (Type u)} [Std.Do.SVal.GetTy Ο Οs] (Ο' : Type u) (s : Ο') : Std.Do.SVal.getThe Ο s = Std.Do.SVal.getThe Ο - Std.Do.SVal.uncurry_cons π Std.Do.SPred.SVal
{Ξ± Ο : Type u} {Οs : List (Type u)} {f : Std.Do.SVal (Ο :: Οs) Ξ±} {s : Ο} {t : Std.Do.SVal.StateTuple Οs} : f.uncurry (s, t) = (f s).uncurry t - Std.Do.SVal.curry_cons π Std.Do.SPred.SVal
{Ξ± Ο : Type u} {Οs : List (Type u)} {f : Std.Do.SVal.StateTuple (Ο :: Οs) β Ξ±} {s : Ο} : Std.Do.SVal.curry f s = Std.Do.SVal.curry fun s' => f (s, s') - Std.Do.SPred π Std.Do.SPred.SPred
(Οs : List (Type u)) : Type u - Std.Do.SPred.pure π Std.Do.SPred.SPred
{Οs : List (Type u)} (P : Prop) : Std.Do.SPred Οs - Std.Do.SPred.not π Std.Do.SPred.SPred
{Οs : List (Type u)} (P : Std.Do.SPred Οs) : Std.Do.SPred Οs - Std.Do.SPred.bientails π Std.Do.SPred.SPred
{Οs : List (Type u)} (P Q : Std.Do.SPred Οs) : Prop - Std.Do.SPred.conjunction π Std.Do.SPred.SPred
{Οs : List (Type u)} (env : List (Std.Do.SPred Οs)) : Std.Do.SPred Οs - Std.Do.SPred.entails π Std.Do.SPred.SPred
{Οs : List (Type u)} (P Q : Std.Do.SPred Οs) : Prop - Std.Do.SPred.and π Std.Do.SPred.SPred
{Οs : List (Type u)} (P Q : Std.Do.SPred Οs) : Std.Do.SPred Οs - Std.Do.SPred.exists π Std.Do.SPred.SPred
{Ξ± : Sort u} {Οs : List (Type v)} (P : Ξ± β Std.Do.SPred Οs) : Std.Do.SPred Οs - Std.Do.SPred.forall π Std.Do.SPred.SPred
{Ξ± : Sort u} {Οs : List (Type v)} (P : Ξ± β Std.Do.SPred Οs) : Std.Do.SPred Οs - Std.Do.SPred.iff π Std.Do.SPred.SPred
{Οs : List (Type u)} (P Q : Std.Do.SPred Οs) : Std.Do.SPred Οs - Std.Do.SPred.imp π Std.Do.SPred.SPred
{Οs : List (Type u)} (P Q : Std.Do.SPred Οs) : Std.Do.SPred Οs - Std.Do.SPred.or π Std.Do.SPred.SPred
{Οs : List (Type u)} (P Q : Std.Do.SPred Οs) : Std.Do.SPred Οs - Std.Do.SPred.pure_nil π Std.Do.SPred.SPred
{P : Prop} : βPβ = { down := P } - Std.Do.SPred.conjunction_nil π Std.Do.SPred.SPred
{Οs : List (Type u)} : Std.Do.SPred.conjunction [] = βTrueβ - Std.Do.SPred.not_nil π Std.Do.SPred.SPred
{P : Std.Do.SPred []} : spred(Β¬P) = { down := Β¬P.down } - Std.Do.SPred.entails_nil π Std.Do.SPred.SPred
{P Q : Std.Do.SPred []} : (P β’β Q) = (P.down β Q.down) - Std.Do.SPred.ext_nil π Std.Do.SPred.SPred
{P Q : Std.Do.SPred []} (h : P.down β Q.down) : P = Q - Std.Do.SPred.bientails_nil π Std.Do.SPred.SPred
{P Q : Std.Do.SPred []} : (P β£β’β Q) = (P.down β Q.down) - Std.Do.SPred.ext_nil_iff π Std.Do.SPred.SPred
{P Q : Std.Do.SPred []} : P = Q β (P.down β Q.down) - Std.Do.SPred.pure_cons π Std.Do.SPred.SPred
{Οs : List (Type u)} {Ο : Type u} {P : Prop} : βPβ = fun x => βPβ - Std.Do.SPred.forall_nil π Std.Do.SPred.SPred
{Ξ± : Sort u_1} {P : Ξ± β Std.Do.SPred []} : Std.Do.SPred.forall P = { down := β (a : Ξ±), (P a).down } - Std.Do.SPred.conjunction_cons π Std.Do.SPred.SPred
{Οs : List (Type u)} {P : Std.Do.SPred Οs} {env : List (Std.Do.SPred Οs)} : Std.Do.SPred.conjunction (P :: env) = spred(P β§ Std.Do.SPred.conjunction env) - Std.Do.SPred.exists_nil π Std.Do.SPred.SPred
{Ξ± : Sort u_1} {P : Ξ± β Std.Do.SPred []} : Std.Do.SPred.exists P = { down := β a, (P a).down } - Std.Do.SPred.imp_nil π Std.Do.SPred.SPred
{P Q : Std.Do.SPred []} : spred(P β Q) = { down := P.down β Q.down } - Std.Do.SPred.and_nil π Std.Do.SPred.SPred
{P Q : Std.Do.SPred []} : spred(P β§ Q) = { down := P.down β§ Q.down } - Std.Do.SPred.iff_nil π Std.Do.SPred.SPred
{P Q : Std.Do.SPred []} : spred(P β Q) = { down := P.down β Q.down } - Std.Do.SPred.or_nil π Std.Do.SPred.SPred
{P Q : Std.Do.SPred []} : spred(P β¨ Q) = { down := P.down β¨ Q.down } - Std.Do.SPred.not_cons π Std.Do.SPred.SPred
{Οs : List (Type u)} {Ο : Type u} {s : Ο} {P : Std.Do.SPred (Ο :: Οs)} : spred(Β¬P) s = spred(Β¬P s) - Std.Do.SPred.bientails_cons_intro π Std.Do.SPred.SPred
{Οs : List (Type u)} {Ο : Type u} {P Q : Std.Do.SPred (Ο :: Οs)} : (β (s : Ο), P s β£β’β Q s) β P β£β’β Q - Std.Do.SPred.entails_cons_intro π Std.Do.SPred.SPred
{Οs : List (Type u)} {Ο : Type u} {P Q : Std.Do.SPred (Ο :: Οs)} : (β (s : Ο), P s β’β Q s) β P β’β Q - Std.Do.SPred.bientails_cons π Std.Do.SPred.SPred
{Οs : List (Type u)} {Ο : Type u} {P Q : Std.Do.SPred (Ο :: Οs)} : (P β£β’β Q) = β (s : Ο), P s β£β’β Q s - Std.Do.SPred.entails_cons π Std.Do.SPred.SPred
{Οs : List (Type u)} {Ο : Type u} {P Q : Std.Do.SPred (Ο :: Οs)} : (P β’β Q) = β (s : Ο), P s β’β Q s - Std.Do.SPred.exists_cons π Std.Do.SPred.SPred
{Οs : List (Type u)} {Ο : Type u} {s : Ο} {Ξ± : Sort u_1} {P : Ξ± β Std.Do.SPred (Ο :: Οs)} : Std.Do.SPred.exists P s = spred(β a, P a s) - Std.Do.SPred.ext_cons π Std.Do.SPred.SPred
{Οs : List (Type u)} {Ο : Type u} {P Q : Std.Do.SPred (Ο :: Οs)} : (β (s : Ο), P s = Q s) β P = Q - Std.Do.SPred.forall_cons π Std.Do.SPred.SPred
{Οs : List (Type u)} {Ο : Type u} {s : Ο} {Ξ± : Sort u_1} {P : Ξ± β Std.Do.SPred (Ο :: Οs)} : Std.Do.SPred.forall P s = spred(β a, P a s) - Std.Do.SPred.ext_cons_iff π Std.Do.SPred.SPred
{Οs : List (Type u)} {Ο : Type u} {P Q : Std.Do.SPred (Ο :: Οs)} : P = Q β β (s : Ο), P s = Q s - Std.Do.SPred.and_cons π Std.Do.SPred.SPred
{Οs : List (Type u)} {Ο : Type u} {s : Ο} {P Q : Std.Do.SPred (Ο :: Οs)} : spred(P β§ Q) s = spred(P s β§ Q s) - Std.Do.SPred.iff_cons π Std.Do.SPred.SPred
{Οs : List (Type u)} {Ο : Type u} {s : Ο} {P Q : Std.Do.SPred (Ο :: Οs)} : spred(P β Q) s = spred(P s β Q s) - Std.Do.SPred.imp_cons π Std.Do.SPred.SPred
{Οs : List (Type u)} {Ο : Type u} {s : Ο} {P Q : Std.Do.SPred (Ο :: Οs)} : spred(P β Q) s = spred(P s β Q s) - Std.Do.SPred.or_cons π Std.Do.SPred.SPred
{Οs : List (Type u)} {Ο : Type u} {s : Ο} {P Q : Std.Do.SPred (Ο :: Οs)} : spred(P β¨ Q) s = spred(P s β¨ Q s) - Std.Do.SPred.conjunction_apply π Std.Do.SPred.SPred
{Οs : List (Type u)} {Ο : Type u} {s : Ο} {env : List (Std.Do.SPred (Ο :: Οs))} : Std.Do.SPred.conjunction env s = Std.Do.SPred.conjunction (List.map (fun x => x s) env) - Std.Do.Β«termSpred(_)Β» π Std.Do.SPred.Notation.Basic
: Lean.ParserDescr - Std.Do.Β«termTerm(_)Β» π Std.Do.SPred.Notation.Basic
: Lean.ParserDescr - Std.Do.SPred.Notation.unpack π Std.Do.SPred.Notation.Basic
{m : Type β Type} [Monad m] [Lean.MonadRef m] [Lean.MonadQuotation m] : Lean.Term β m Lean.Term - Std.Do.Β«term_β’β_Β» π Std.Do.SPred.Notation
: Lean.TrailingParserDescr - Std.Do.Β«term_β£β’β_Β» π Std.Do.SPred.Notation
: Lean.TrailingParserDescr - Std.Do.Β«termβ’β_Β» π Std.Do.SPred.Notation
: Lean.ParserDescr - Std.Do.Β«termβ_βΒ» π Std.Do.SPred.Notation
: Lean.ParserDescr - Std.Do.SPred.Notation.unexpandAnd π Std.Do.SPred.Notation
: Lean.PrettyPrinter.Unexpander - Std.Do.SPred.Notation.unexpandBientails π Std.Do.SPred.Notation
: Lean.PrettyPrinter.Unexpander - Std.Do.SPred.Notation.unexpandEntails π Std.Do.SPred.Notation
: Lean.PrettyPrinter.Unexpander - Std.Do.SPred.Notation.unexpandExists π Std.Do.SPred.Notation
: Lean.PrettyPrinter.Unexpander - Std.Do.SPred.Notation.unexpandForall π Std.Do.SPred.Notation
: Lean.PrettyPrinter.Unexpander - Std.Do.SPred.Notation.unexpandIff π Std.Do.SPred.Notation
: Lean.PrettyPrinter.Unexpander - Std.Do.SPred.Notation.unexpandImp π Std.Do.SPred.Notation
: Lean.PrettyPrinter.Unexpander - Std.Do.SPred.Notation.unexpandNot π Std.Do.SPred.Notation
: Lean.PrettyPrinter.Unexpander - Std.Do.SPred.Notation.unexpandOr π Std.Do.SPred.Notation
: Lean.PrettyPrinter.Unexpander - Std.Do.SPred.Notation.unexpandPure π Std.Do.SPred.Notation
: Lean.PrettyPrinter.Unexpander - Std.Do.SPred.bientails.refl π Std.Do.SPred.Laws
{Οs : List (Type u)} (P : Std.Do.SPred Οs) : P β£β’β P - Std.Do.SPred.entails.refl π Std.Do.SPred.Laws
{Οs : List (Type u)} (P : Std.Do.SPred Οs) : P β’β P - Std.Do.SPred.down_pure π Std.Do.SPred.Laws
{Ο : Prop} : βΟβ.down = Ο - Std.Do.SPred.pure_intro π Std.Do.SPred.Laws
{Οs : List (Type u)} {Ο : Prop} {P : Std.Do.SPred Οs} : Ο β P β’β βΟβ - Std.Do.SPred.and_elim_l π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : P β§ Q β’β P - Std.Do.SPred.and_elim_r π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : P β§ Q β’β Q - Std.Do.SPred.or_intro_l π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : P β’β P β¨ Q - Std.Do.SPred.or_intro_r π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : Q β’β P β¨ Q - Std.Do.SPred.bientails.symm π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : (P β£β’β Q) β Q β£β’β P - Std.Do.SPred.instTransBientails π Std.Do.SPred.Laws
{Οs : List (Type u)} : Trans Std.Do.SPred.bientails Std.Do.SPred.bientails Std.Do.SPred.bientails - Std.Do.SPred.instTransEntails π Std.Do.SPred.Laws
{Οs : List (Type u)} : Trans Std.Do.SPred.entails Std.Do.SPred.entails Std.Do.SPred.entails - Std.Do.SPred.bientails.to_eq π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} (h : P β£β’β Q) : P = Q - Std.Do.SPred.exists_intro π Std.Do.SPred.Laws
{Οs : List (Type u)} {Ξ± : Sort u_1} {Ξ¨ : Ξ± β Std.Do.SPred Οs} (a : Ξ±) : Ξ¨ a β’β β a, Ξ¨ a - Std.Do.SPred.forall_elim π Std.Do.SPred.Laws
{Οs : List (Type u)} {Ξ± : Sort u_1} {Ξ¨ : Ξ± β Std.Do.SPred Οs} (a : Ξ±) : (β a, Ξ¨ a) β’β Ξ¨ a - Std.Do.SPred.pure_elim' π Std.Do.SPred.Laws
{Οs : List (Type u)} {Ο : Prop} {P : Std.Do.SPred Οs} : (Ο β β’β P) β βΟβ β’β P - Std.Do.SPred.apply_pure π Std.Do.SPred.Laws
{Οs : List (Type u)} {Ο : Type u} {s : Ο} {Ο : Prop} : βΟβ s = βΟβ - Std.Do.SPred.bientails.iff π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : P β£β’β Q β (P β’β Q) β§ (Q β’β P) - Std.Do.SPred.bientails.trans π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q R : Std.Do.SPred Οs} : (P β£β’β Q) β (Q β£β’β R) β P β£β’β R - Std.Do.SPred.entails.trans π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q R : Std.Do.SPred Οs} : (P β’β Q) β (Q β’β R) β P β’β R - Std.Do.SPred.imp_elim π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q R : Std.Do.SPred Οs} (h : P β’β Q β R) : P β§ Q β’β R - Std.Do.SPred.imp_intro π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q R : Std.Do.SPred Οs} (h : P β§ Q β’β R) : P β’β Q β R - Std.Do.SPred.and_intro π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q R : Std.Do.SPred Οs} (h1 : P β’β Q) (h2 : P β’β R) : P β’β Q β§ R - Std.Do.SPred.exists_elim π Std.Do.SPred.Laws
{Οs : List (Type u)} {Ξ± : Sort u_1} {Ξ¦ : Ξ± β Std.Do.SPred Οs} {Q : Std.Do.SPred Οs} (h : β (a : Ξ±), Ξ¦ a β’β Q) : (β a, Ξ¦ a) β’β Q - Std.Do.SPred.forall_intro π Std.Do.SPred.Laws
{Οs : List (Type u)} {Ξ± : Sort u_1} {P : Std.Do.SPred Οs} {Ξ¨ : Ξ± β Std.Do.SPred Οs} (h : β (a : Ξ±), P β’β Ξ¨ a) : P β’β β a, Ξ¨ a - Std.Do.SPred.or_elim π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q R : Std.Do.SPred Οs} (h1 : P β’β R) (h2 : Q β’β R) : P β¨ Q β’β R - Std.Do.SPred.imp_curry π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q : Std.Do.SVal.StateTuple Οs β Prop} : ((Std.Do.SVal.curry fun t => { down := P t }) β Std.Do.SVal.curry fun t => { down := Q t }) β£β’β Std.Do.SVal.curry fun t => { down := P t β Q t } - Std.Do.SPred.and_curry π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q : Std.Do.SVal.StateTuple Οs β Prop} : ((Std.Do.SVal.curry fun t => { down := P t }) β§ Std.Do.SVal.curry fun t => { down := Q t }) β£β’β Std.Do.SVal.curry fun t => { down := P t β§ Q t } - Std.Do.SPred.or_curry π Std.Do.SPred.Laws
{Οs : List (Type u)} {P Q : Std.Do.SVal.StateTuple Οs β Prop} : ((Std.Do.SVal.curry fun t => { down := P t }) β¨ Std.Do.SVal.curry fun t => { down := Q t }) β£β’β Std.Do.SVal.curry fun t => { down := P t β¨ Q t } - Std.Do.SPred.Tactic.tautological π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} (Q : Std.Do.SPred Οs) : Prop - Std.Do.SPred.Tactic.IsPure π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} (P : Std.Do.SPred Οs) (Ο : outParam Prop) : Prop - Std.Do.SPred.Tactic.PropAsSPredTautology π Std.Do.SPred.DerivedLaws
(Ο : Prop) {Οs : outParam (List (Type u))} (P : outParam (Std.Do.SPred Οs)) : Prop - Std.Do.SPred.bientails.rfl π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : P β£β’β P - Std.Do.SPred.entails.rfl π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : P β’β P - Std.Do.SPred.Tactic.instIsPurePure π Std.Do.SPred.DerivedLaws
{Ο : Prop} (Οs : List (Type u_1)) : Std.Do.SPred.Tactic.IsPure βΟβ Ο - Std.Do.SPred.Tactic.instIsPurePure_1 π Std.Do.SPred.DerivedLaws
(Ο : Prop) : Std.Do.SPred.Tactic.IsPure βΟβ Ο - Std.Do.SPred.false_elim π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : βFalseβ β’β P - Std.Do.SPred.true_intro π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : P β’β βTrueβ - Std.Do.SPred.Tactic.HasFrame π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} (P : Std.Do.SPred Οs) (P' : outParam (Std.Do.SPred Οs)) (Ο : outParam Prop) : Prop - Std.Do.SPred.Tactic.SimpAnd π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} (P Q : Std.Do.SPred Οs) (PQ : outParam (Std.Do.SPred Οs)) : Prop - Std.Do.SPred.Tactic.instIsPureDown π Std.Do.SPred.DerivedLaws
(P : Std.Do.SPred []) : Std.Do.SPred.Tactic.IsPure P P.down - Std.Do.SPred.Tactic.instPropAsSPredTautologyDown π Std.Do.SPred.DerivedLaws
{Ο : Std.Do.SPred []} : Std.Do.SPred.Tactic.PropAsSPredTautology Ο.down Ο - Std.Do.SPred.and_self π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : P β§ P β£β’β P - Std.Do.SPred.or_self π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : P β¨ P β£β’β P - Std.Do.SPred.Tactic.IsAnd π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} (P : Std.Do.SPred Οs) (Qβ Qβ : outParam (Std.Do.SPred Οs)) : Prop - Std.Do.SPred.Tactic.instSimpAndPureTrue π Std.Do.SPred.DerivedLaws
(Οs : List (Type u_1)) (P : Std.Do.SPred Οs) : Std.Do.SPred.Tactic.SimpAnd P βTrueβ P - Std.Do.SPred.Tactic.instSimpAndPureTrue_1 π Std.Do.SPred.DerivedLaws
(Οs : List (Type u_1)) (P : Std.Do.SPred Οs) : Std.Do.SPred.Tactic.SimpAnd βTrueβ P P - Std.Do.SPred.pure_true π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {Ο : Prop} (h : Ο) : βΟβ β£β’β βTrueβ - Std.Do.SPred.true_intro_simp π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {Q : Std.Do.SPred Οs} : Q β’β βTrueβ β True - Std.Do.SPred.Tactic.instHasFramePureTrue π Std.Do.SPred.DerivedLaws
{Ο : Prop} (Οs : List (Type u_1)) : Std.Do.SPred.Tactic.HasFrame βΟβ βTrueβ Ο - Std.Do.SPred.and_true π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : P β§ βTrueβ β£β’β P - Std.Do.SPred.false_or π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : βFalseβ β¨ P β£β’β P - Std.Do.SPred.imp_self π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : Q β’β P β P - Std.Do.SPred.or_false π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : P β¨ βFalseβ β£β’β P - Std.Do.SPred.true_and π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : βTrueβ β§ P β£β’β P - Std.Do.SPred.true_imp π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : (βTrueβ β P) β£β’β P - Std.Do.SPred.Tactic.instPropAsSPredTautologyEntailsPureTrue π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : Std.Do.SPred.Tactic.PropAsSPredTautology (β’β P) P - Std.Do.SPred.Tactic.Focus.this π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : P β£β’β βTrueβ β§ P - Std.Do.SPred.pure_mono π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {Οβ Οβ : Prop} (h : Οβ β Οβ) : βΟββ β’β βΟββ - Std.Do.SPred.Tactic.instHasFramePureTrueDown π Std.Do.SPred.DerivedLaws
{P : Std.Do.SPred []} : Std.Do.SPred.Tactic.HasFrame P βTrueβ P.down - Std.Do.SPred.Tactic.instIsAndAnd π Std.Do.SPred.DerivedLaws
(Οs : List (Type u_1)) (Qβ Qβ : Std.Do.SPred Οs) : Std.Do.SPred.Tactic.IsAnd spred(Qβ β§ Qβ) Qβ Qβ - Std.Do.SPred.Tactic.instSimpAndAnd π Std.Do.SPred.DerivedLaws
(Οs : List (Type u_1)) (P Q : Std.Do.SPred Οs) : Std.Do.SPred.Tactic.SimpAnd P Q spred(P β§ Q) - Std.Do.SPred.bientails.mp π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : (P β£β’β Q) β P β’β Q - Std.Do.SPred.bientails.mpr π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : (P β£β’β Q) β Q β’β P - Std.Do.SPred.and_false π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : P β§ βFalseβ β£β’β βFalseβ - Std.Do.SPred.false_and π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : βFalseβ β§ P β£β’β βFalseβ - Std.Do.SPred.false_imp π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : (βFalseβ β P) β£β’β βTrueβ - Std.Do.SPred.imp_self_simp π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : Q β’β P β P β True - Std.Do.SPred.or_true π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : P β¨ βTrueβ β£β’β βTrueβ - Std.Do.SPred.pure_congr π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {Οβ Οβ : Prop} (h : Οβ β Οβ) : βΟββ β£β’β βΟββ - Std.Do.SPred.true_or π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} : βTrueβ β¨ P β£β’β βTrueβ - Std.Do.SPred.Tactic.instHasFrameAndPure π Std.Do.SPred.DerivedLaws
{Ο : Prop} (Οs : List (Type u_1)) (P : Std.Do.SPred Οs) : Std.Do.SPred.Tactic.HasFrame spred(βΟβ β§ P) P Ο - Std.Do.SPred.Tactic.instHasFrameAndPure_1 π Std.Do.SPred.DerivedLaws
{Ο : Prop} (Οs : List (Type u_1)) (P : Std.Do.SPred Οs) : Std.Do.SPred.Tactic.HasFrame spred(P β§ βΟβ) P Ο - Std.Do.SPred.bientails.of_eq π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} (h : P = Q) : P β£β’β Q - Std.Do.SPred.and_comm π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : P β§ Q β£β’β Q β§ P - Std.Do.SPred.and_symm π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : P β§ Q β’β Q β§ P - Std.Do.SPred.exfalso π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} (h : P β’β βFalseβ) : P β’β Q - Std.Do.SPred.imp_elim_l π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : (P β Q) β§ P β’β Q - Std.Do.SPred.imp_elim_r π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : P β§ (P β Q) β’β Q - Std.Do.SPred.or_comm π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : P β¨ Q β£β’β Q β¨ P - Std.Do.SPred.or_symm π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : P β¨ Q β’β Q β¨ P - Std.Do.SPred.Tactic.instIsPureImpPureForall π Std.Do.SPred.DerivedLaws
{Ο Ο : Prop} (Οs : List (Type u_1)) : Std.Do.SPred.Tactic.IsPure spred(βΟβ β βΟβ) (Ο β Ο) - Std.Do.SPred.Tactic.instPropAsSPredTautologyEntailsImp π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : Std.Do.SPred.Tactic.PropAsSPredTautology (P β’β Q) spred(P β Q) - Std.Do.SPred.Tactic.Exact.from_tautology π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {Ο : Prop} {P T : Std.Do.SPred Οs} [Std.Do.SPred.Tactic.PropAsSPredTautology Ο T] (h : Ο) : P β’β T - Std.Do.SPred.Tactic.IsPure.mk π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} {Ο : outParam Prop} (to_pure : P β£β’β βΟβ) : Std.Do.SPred.Tactic.IsPure P Ο - Std.Do.SPred.Tactic.IsPure.to_pure π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} {Ο : outParam Prop} [self : Std.Do.SPred.Tactic.IsPure P Ο] : P β£β’β βΟβ - Std.Do.SPred.Tactic.ProofMode.elim_entails π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} {Ο : Prop} [Std.Do.SPred.Tactic.PropAsSPredTautology Ο P] : Ο β β’β P - Std.Do.SPred.Tactic.ProofMode.start_entails π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P : Std.Do.SPred Οs} {Ο : Prop} [Std.Do.SPred.Tactic.PropAsSPredTautology Ο P] : (β’β P) β Ο - Std.Do.SPred.Tactic.Pure.intro π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} {Ο : Prop} [Std.Do.SPred.Tactic.IsPure Q Ο] (hΟ : Ο) : P β’β Q - Std.Do.SPred.Tactic.Specialize.pure_taut π Std.Do.SPred.DerivedLaws
{Οs : List (Type u_1)} {Ο : Prop} {P : Std.Do.SPred Οs} [Std.Do.SPred.Tactic.IsPure P Ο] (h : Ο) : β’β P - Std.Do.SPred.and_intro_l π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} (h : P β’β Q) : P β’β Q β§ P - Std.Do.SPred.and_intro_r π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} (h : P β’β Q) : P β’β P β§ Q - Std.Do.SPred.Tactic.instIsAndPureAnd π Std.Do.SPred.DerivedLaws
{p q : Prop} (Οs : List (Type u_1)) : Std.Do.SPred.Tactic.IsAnd βp β§ qβ βpβ βqβ - Std.Do.SPred.Tactic.instIsPureAndPureAnd π Std.Do.SPred.DerivedLaws
{Ο Ο : Prop} (Οs : List (Type u_1)) : Std.Do.SPred.Tactic.IsPure spred(βΟβ β§ βΟβ) (Ο β§ Ο) - Std.Do.SPred.Tactic.instIsPureOrPureOr π Std.Do.SPred.DerivedLaws
{Ο Ο : Prop} (Οs : List (Type u_1)) : Std.Do.SPred.Tactic.IsPure spred(βΟβ β¨ βΟβ) (Ο β¨ Ο) - Std.Do.SPred.and_eq_left π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : P β’β Q β P β£β’β P β§ Q - Std.Do.SPred.and_eq_right π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : P β’β Q β P β£β’β Q β§ P - Std.Do.SPred.or_eq_left π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : P β’β Q β Q β£β’β Q β¨ P - Std.Do.SPred.or_eq_right π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q : Std.Do.SPred Οs} : P β’β Q β Q β£β’β P β¨ Q - Std.Do.SPred.pure_imp π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {Οβ Οβ : Prop} : (βΟββ β βΟββ) β£β’β βΟβ β Οββ - Std.Do.SPred.pure_imp_2 π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {Οβ Οβ : Prop} : βΟβ β Οββ β’β βΟββ β βΟββ - Std.Do.SPred.Tactic.instIsPureForallPureForall π Std.Do.SPred.DerivedLaws
{Ξ± : Sort u_1} (Οs : List (Type u_2)) (P : Ξ± β Prop) : Std.Do.SPred.Tactic.IsPure spred(β x, βP xβ) (β (x : Ξ±), P x) - Std.Do.SPred.Tactic.instIsPure_1 π Std.Do.SPred.DerivedLaws
{Ο : Prop} {Ο : Type u_1} (Οs : List (Type u_1)) (P : Std.Do.SPred Οs) [inst : Std.Do.SPred.Tactic.IsPure P Ο] : Std.Do.SPred.Tactic.IsPure (fun x => P) Ο - Std.Do.SPred.and_elim_l' π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q R : Std.Do.SPred Οs} (h : P β’β R) : P β§ Q β’β R - Std.Do.SPred.and_elim_r' π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q R : Std.Do.SPred Οs} (h : Q β’β R) : P β§ Q β’β R - Std.Do.SPred.and_imp π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P' Q' : Std.Do.SPred Οs} : P' β§ (P' β Q') β’β P' β§ Q' - Std.Do.SPred.or_intro_l' π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q R : Std.Do.SPred Οs} (h : P β’β Q) : P β’β Q β¨ R - Std.Do.SPred.or_intro_r' π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q R : Std.Do.SPred Οs} (h : P β’β R) : P β’β Q β¨ R - Std.Do.SPred.pure_and π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {Οβ Οβ : Prop} : βΟββ β§ βΟββ β£β’β βΟβ β§ Οββ - Std.Do.SPred.pure_or π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {Οβ Οβ : Prop} : βΟββ β¨ βΟββ β£β’β βΟβ β¨ Οββ - Std.Do.SPred.Tactic.Assumption.left π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q R : Std.Do.SPred Οs} (h : P β’β R) : P β§ Q β’β R - Std.Do.SPred.Tactic.Assumption.right π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P Q R : Std.Do.SPred Οs} (h : Q β’β R) : P β§ Q β’β R - Std.Do.SPred.Tactic.Cases.pure π Std.Do.SPred.DerivedLaws
{Οs : List (Type u_1)} {Q T : Std.Do.SPred Οs} (hgoal : Q β§ βTrueβ β’β T) : Q β’β T - Std.Do.SPred.Tactic.Exact.assumption π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {P P' A : Std.Do.SPred Οs} (h : P β£β’β P' β§ A) : P β’β A - Std.Do.SPred.Tactic.PropAsSPredTautology.iff π Std.Do.SPred.DerivedLaws
{Ο : Prop} {Οs : outParam (List (Type u))} {P : outParam (Std.Do.SPred Οs)} [self : Std.Do.SPred.Tactic.PropAsSPredTautology Ο P] : Ο β β’β P - Std.Do.SPred.Tactic.PropAsSPredTautology.mk π Std.Do.SPred.DerivedLaws
{Ο : Prop} {Οs : outParam (List (Type u))} {P : outParam (Std.Do.SPred Οs)} (iff : Ο β β’β P) : Std.Do.SPred.Tactic.PropAsSPredTautology Ο P - Std.Do.SPred.entails_true_intro π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} (P Q : Std.Do.SPred Οs) : β’β P β Q β P β’β Q - Std.Do.SPred.pure_forall π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {Ξ± : Sort u_1} {Ο : Ξ± β Prop} : (β x, βΟ xβ) β£β’β ββ (x : Ξ±), Ο xβ - Std.Do.SPred.pure_forall_2 π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {Ξ± : Sort u_1} {Ο : Ξ± β Prop} : ββ (x : Ξ±), Ο xβ β’β β x, βΟ xβ - Std.Do.SPred.Tactic.instIsPureExistsPureExists π Std.Do.SPred.DerivedLaws
{Ξ± : Sort u_1} (Οs : List (Type u_2)) (P : Ξ± β Prop) : Std.Do.SPred.Tactic.IsPure spred(β x, βP xβ) (β x, P x) - Std.Do.SPred.Tactic.Focus.rewrite_hyps π Std.Do.SPred.DerivedLaws
{Οs : List (Type u_1)} {P Q R : Std.Do.SPred Οs} (hrw : P β£β’β Q) (hgoal : Q β’β R) : P β’β R - Std.Do.SPred.pure_elim_l π Std.Do.SPred.DerivedLaws
{Οs : List (Type u)} {Q R : Std.Do.SPred Οs} {Ο : Prop} (h : Ο β Q β’β R) : βΟβ β§ Q β’β R
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using (by default) Ctrl-K Ctrl-S. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
πReal.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
π"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
π_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
πReal.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
π(?a -> ?b) -> List ?a -> List ?b
πList ?a -> (?a -> ?b) -> List ?bBy main conclusion:
π|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allβandβ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
π|- _ < _ β tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
π Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ β _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO.
This is Loogle revision 401c76f serving mathlib revision a3d2529