blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 7 139 | content_id stringlengths 40 40 | detected_licenses listlengths 0 16 | license_type stringclasses 2
values | repo_name stringlengths 7 55 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 6
values | visit_date int64 1,471B 1,694B | revision_date int64 1,378B 1,694B | committer_date int64 1,378B 1,694B | github_id float64 1.33M 604M ⌀ | star_events_count int64 0 43.5k | fork_events_count int64 0 1.5k | gha_license_id stringclasses 6
values | gha_event_created_at int64 1,402B 1,695B ⌀ | gha_created_at int64 1,359B 1,637B ⌀ | gha_language stringclasses 19
values | src_encoding stringclasses 2
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 1
class | length_bytes int64 3 6.4M | extension stringclasses 4
values | content stringlengths 3 6.12M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
fbf73762ecccef3f3ab86d2acf47cc97ef127d09 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/limits/shapes/equivalence.lean | 8adbd7bec47738268060f99cd677bda332016b99 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 1,342 | lean | /-
Copyright (c) Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import category_theory.adjunction.limits
import category_theory.limits.shapes.terminal
/-!
# Transporting existence of specific limits across equivalences
For now, we only... |
5fbe9f2261fee7cb7be23af9b09d3a1e3e5f01be | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/topology/sequences.lean | 956b8f791c8294ef6969dda545d8271b595e3912 | [
"Apache-2.0"
] | permissive | DanielFabian/mathlib | efc3a50b5dde303c59eeb6353ef4c35a345d7112 | f520d07eba0c852e96fe26da71d85bf6d40fcc2a | refs/heads/master | 1,668,739,922,971 | 1,595,201,756,000 | 1,595,201,756,000 | 279,469,476 | 0 | 0 | null | 1,594,696,604,000 | 1,594,696,604,000 | null | UTF-8 | Lean | false | false | 19,009 | lean | /-
Copyright (c) 2018 Jan-David Salchow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jan-David Salchow, Patrick Massot
-/
import topology.bases
import topology.subset_properties
import topology.metric_space.basic
/-!
# Sequences in topological spaces
In this file ... |
db80bdbeedfcb4bce779067c6c75aa481d016bd4 | abd85493667895c57a7507870867b28124b3998f | /src/analysis/analytic/basic.lean | fac01d8f128a42607112a9115b6026322efa7395 | [
"Apache-2.0"
] | permissive | pechersky/mathlib | d56eef16bddb0bfc8bc552b05b7270aff5944393 | f1df14c2214ee114c9738e733efd5de174deb95d | refs/heads/master | 1,666,714,392,571 | 1,591,747,567,000 | 1,591,747,567,000 | 270,557,274 | 0 | 0 | Apache-2.0 | 1,591,597,975,000 | 1,591,597,974,000 | null | UTF-8 | Lean | false | false | 38,090 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.calculus.times_cont_diff
import tactic.omega
import analysis.special_functions.pow
/-!
# Analytic functions
A function is analytic in one dime... |
b16a50600c31849264f1259e24dbcb9480bc6bc5 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/full.lean | c12376659f18eb76b32a3f8b8d3145fc6ee35d15 | [
"Apache-2.0"
] | permissive | soonhokong/lean | cb8aa01055ffe2af0fb99a16b4cda8463b882cd1 | 38607e3eb57f57f77c0ac114ad169e9e4262e24f | refs/heads/master | 1,611,187,284,081 | 1,450,766,737,000 | 1,476,122,547,000 | 11,513,992 | 2 | 0 | null | 1,401,763,102,000 | 1,374,182,235,000 | C++ | UTF-8 | Lean | false | false | 116 | lean | import logic
namespace foo
constant x : num
check x
check x
set_option pp.full_names true
check x
end foo
|
4149137f7ed500cf26b4aa5e18f75e6c6050d47f | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /src/Lean/Compiler/InitAttr.lean | b13e6dd9bf405ae0bb1eab043b018f4c8cd4271a | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,266 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Environment
import Lean.Attributes
namespace Lean
private def getIOTypeArg : Expr → Option Expr
| Expr.app (Expr.const `IO _ _) arg _ => som... |
626031403c7bf4db7eb4d26ed504386e8858d52a | e030b0259b777fedcdf73dd966f3f1556d392178 | /library/init/meta/congr_lemma.lean | 7d90a613fa37e8cd2146e340f13e38137320c728 | [
"Apache-2.0"
] | permissive | fgdorais/lean | 17b46a095b70b21fa0790ce74876658dc5faca06 | c3b7c54d7cca7aaa25328f0a5660b6b75fe26055 | refs/heads/master | 1,611,523,590,686 | 1,484,412,902,000 | 1,484,412,902,000 | 38,489,734 | 0 | 0 | null | 1,435,923,380,000 | 1,435,923,379,000 | null | UTF-8 | Lean | false | false | 3,542 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.meta.tactic init.meta.format init.function
inductive congr_arg_kind
/- It is a parameter for the congruence lemma, the parameter occurs... |
b283c505cc7a2357cbad153e41c2fbc33ae11ea6 | 0ddf2dd8409bcb923d11603846800bd9699616ea | /chapter5.lean | d6ea9fc815767fe1712fbf440c04f24e0f374651 | [] | no_license | tounaishouta/Lean | 0cbaaa9340e7f8f884504ea170243e07a54f0566 | 1d75311f5506ca2bfd8b7ccec0b7d70c3319d555 | refs/heads/master | 1,610,229,383,935 | 1,459,950,226,000 | 1,459,950,226,000 | 50,836,185 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,377 | lean | import standard
import data.tuple
/-
5. Intteracting with Lean
5章では、いくつかの実際的な Lean の使い方を学びます。
5.1 Display Infromation
5.1節では、現在の状況や objects に関する情報を
表示する方法を学びます。
-/
-- print <識別子>
-- <識別子> の情報を表示する。
-- 種類、型、定義など
print nat
print add
print definition add -- 違いはよく分からない。
print +
-- check <式>
-- <式> の型を表示する。
-- @ と組合... |
ad1d51b6791d9412e8dae5270b97ed079f4fe3d7 | c3f2fcd060adfa2ca29f924839d2d925e8f2c685 | /library/data/int/div.lean | 3b81cd61b02ca9fb9f80af55066e7ccb59701876 | [
"Apache-2.0"
] | permissive | respu/lean | 6582d19a2f2838a28ecd2b3c6f81c32d07b5341d | 8c76419c60b63d0d9f7bc04ebb0b99812d0ec654 | refs/heads/master | 1,610,882,451,231 | 1,427,747,084,000 | 1,427,747,429,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,073 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.int.div
Author: Jeremy Avigad
Definitions and properties of div, mod, gcd, lcm, coprime, following the SSReflect library.
Following SSReflect and the SMTlib standard, we define a... |
b6ff8943248f9ac41251cf050e0741d2c2426c47 | 137c667471a40116a7afd7261f030b30180468c2 | /src/combinatorics/simple_graph/basic.lean | 6771c97cf06d7604341604afa1133e58511b0c0c | [
"Apache-2.0"
] | permissive | bragadeesh153/mathlib | 46bf814cfb1eecb34b5d1549b9117dc60f657792 | b577bb2cd1f96eb47031878256856020b76f73cd | refs/heads/master | 1,687,435,188,334 | 1,626,384,207,000 | 1,626,384,207,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 26,640 | lean | /-
Copyright (c) 2020 Aaron Anderson, Jalex Stark, Kyle Miller. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson, Jalex Stark, Kyle Miller, Alena Gusakov, Hunter Monroe
-/
import data.fintype.basic
import data.sym2
import data.set.finite
/-!
# Simple graph... |
60458b983c8f1f3a0e611cb04cc7706ac644857c | ca1ad81c8733787aba30f7a8d63f418508e12812 | /clfrags/src/hilbert/wr/proofs/ka_bot.lean | 422a27850ede96856cc84bde171079e22e5b3999 | [] | no_license | greati/hilbert-classical-fragments | 5cdbe07851e979c8a03c621a5efd4d24bbfa333a | 18a21ac6b2e890060eb4ae65752fc0245394d226 | refs/heads/master | 1,591,973,117,184 | 1,573,822,710,000 | 1,573,822,710,000 | 194,334,439 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,110 | lean | import hilbert.wr.ka_bot
import hilbert.wr.proofs.ka
namespace clfrags
namespace hilbert
namespace wr
namespace ka_bot
theorem kab₁_ka {a b c d e : Prop} (h₁ : ka d e (ka a b bot)) : ka d e (ka a b c) :=
have h₂ : ka d e (ka d b bot), from ka.ka₇ h₁,
... |
84db80278b5bcaf7fd0e8c4803998e551b92ed8a | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/topology/uniform_space/uniform_convergence_topology.lean | 5915f96223940f2f7091008193d82d0456f32061 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 39,696 | lean | /-
Copyright (c) 2022 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker
-/
import topology.uniform_space.uniform_convergence
import topology.uniform_space.pi
import topology.uniform_space.equiv
/-!
# Topology and uniform structure of un... |
79d574a403d277a6169f339dfa871b8fa37e1b89 | b7fc5b86b12212bea5542eb2c9d9f0988fd78697 | /src/solutions/thursday/order.lean | 00b433d0975a61f9454bc5de17f002ee9dfe5a23 | [] | no_license | stjordanis/lftcm2020 | 3b16591aec853c8546d9c8b69c0bf3f5f3956fee | 1f3485e4dafdc587b451ec5144a1d8d3ec9b411e | refs/heads/master | 1,675,958,865,413 | 1,609,901,722,000 | 1,609,901,722,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,259 | lean | /-
# Orders
Groups, rings, fields, modules etc are in the "algebra hierarchy".
Metric and topological spaces are in the "topology hierarchy".
The other important hierarchy is the "order hierarchy".
It starts with partially ordered sets, and then goes on to lattices.
Because I like algebra, let's demonstrate the or... |
448f53b194216b1a75e40b0417e9a09223b4fc1d | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/sites/canonical_auto.lean | 49e6ebc88ed2428212fb061ddcb84c88252157a1 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,978 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.sites.sheaf_of_types
import Mathlib.PostPort
universes v u
namespace Mathlib... |
ae205e749835bba3a77588c6e2a50e809820eeed | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/attr_at2.lean | 45b30add9796e877e2c9ebf00e12b540a11f1c02 | [
"Apache-2.0"
] | permissive | soonhokong/lean | cb8aa01055ffe2af0fb99a16b4cda8463b882cd1 | 38607e3eb57f57f77c0ac114ad169e9e4262e24f | refs/heads/master | 1,611,187,284,081 | 1,450,766,737,000 | 1,476,122,547,000 | 11,513,992 | 2 | 0 | null | 1,401,763,102,000 | 1,374,182,235,000 | C++ | UTF-8 | Lean | false | false | 539 | lean | namespace foo
namespace bah
namespace bla
section
section
section
definition f (a : nat) := a + 1
attribute f [reducible] at foo.bah
definition g (a : nat) := a + a
attribute g [reducible] at _root_
print "sec 3. " print f print g
end
print "sec 2. " print f print g
end
print "sec 1. " print f print g
end
print "foo.... |
393aa00f995dadada909be5ab6684f78a4aab223 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1954.lean | ada449924dc0900df74cc03ff1f6ded66d01c8ea | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 101 | lean |
def all (p : Nat → Prop) : Prop := ∀x, p x
example {p : Nat → Prop} (h : all p) : p 0 := h 0
|
4404266ba3dd5f048759cc49a844f8718fc5772f | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /tests/lean/change2.lean | 26ba612c226edff2be1cb4fce44d6ea0e5b04d0f | [
"Apache-2.0"
] | permissive | jcarlson23/lean | b00098763291397e0ac76b37a2dd96bc013bd247 | 8de88701247f54d325edd46c0eed57aeacb64baf | refs/heads/master | 1,611,571,813,719 | 1,497,020,963,000 | 1,497,021,515,000 | 93,882,536 | 1 | 0 | null | 1,497,029,896,000 | 1,497,029,896,000 | null | UTF-8 | Lean | false | false | 467 | lean | open tactic nat expr option
attribute [simp]
lemma succ_eq_add (n : nat) : succ n = n + 0 + 1 :=
rfl
example (a b : nat) : a = b → succ (succ a) = succ (b + 1) :=
by do intro `Heq,
get_local `a >>= subst,
trace_state,
dsimp,
trace "---- after dsimp ----",
trace_state,
t ← target,
... |
109f31d5f0e0e6831838e879931560b196ab64ac | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/deprecated/submonoid.lean | 01a40df8c75688c30c4a4e54804abafcadac6cd4 | [
"Apache-2.0"
] | permissive | mcncm/mathlib | 8d25099344d9d2bee62822cb9ed43aa3e09fa05e | fde3d78cadeec5ef827b16ae55664ef115e66f57 | refs/heads/master | 1,672,743,316,277 | 1,602,618,514,000 | 1,602,618,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 20,250 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Kenny Lau, Johan Commelin, Mario Carneiro, Kevin Buzzard
-/
import group_theory.submonoid.basic
import algebra.big_operators.basic
/-!
# Submonoids
This file defines ... |
4914c210525e08fd7444cb0ac2b3ae38e9a34754 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/dunfold4.lean | 71f8740e34060e501e80b38ac5cb77ab0b502cf2 | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 116 | lean | open tactic
namespace list
example : length ([] : list unit) = 0 :=
begin dunfold length, reflexivity end
end list
|
e39fee9964922209d2872e1bf8b2fd4b936e3b04 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/data/sigma/basic.lean | 8ed106e4b802a99078f0b999c7a5a85fb480f8eb | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,076 | 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, Jeremy Avigad, Floris van Doorn
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.logic
import Mathlib.Lean3Lib.init.wf
universes u v
namespace Mathl... |
9ba5f7161d1a148928a510003d92a927624c7ae9 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/complex/exponential_bounds.lean | 28bffde9acb8950ecfa2bf44d6a8a9445d400d4a | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 2,582 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Joseph Myers
-/
import data.complex.exponential
import analysis.special_functions.log.deriv
/-!
# Bounds on specific values of the exponential
-/
namespace real
open i... |
747475f8f2660778dc6620a3b6b2da84c2c1c3be | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /02_Dependent_Type_Theory.org.27.lean | 5abd189c24a2d8fe4abb323fc83b679531f65561 | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 254 | lean | /- page 24 -/
import standard
import data.nat -- imports the nat module
check nat.add
check nat.zero
open nat -- imports short identifiers, notations, etc. into the context
check add
check zero
constants m n : nat
check m + n
check 0
check m + 0
|
16f8b0b526fb6ac9849d30e7577437e1a0dd4629 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/set/enumerate.lean | 9c9287eb6d3717cd46b1029fe755d8fd36d00ff5 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,357 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
Enumerate elements of a set with a select function.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.set.lattice
import Mathlib.tactic.... |
16568ce3c34a1118cfabe5e4c0a99716b83dd0ac | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/unifHintAndTC.lean | 814102cd7dfab45b2cd168a39680e25f59837950 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 1,285 | lean | structure Magma.{u} where
α : Type u
mul : α → α → α
instance : CoeSort Magma.{u} (Type u) where
coe m := m.α
def mul {s : Magma} (a b : s) : s :=
s.mul a b
infixl:70 (priority := high) "*" => mul
def Nat.Magma : Magma where
α := Nat
mul a b := Nat.mul a b
def Prod.Magma (m : Magma.{u}) (n : Ma... |
a655a52353d54f163d0dbaa7575e8adf3920a617 | eb9357a70318e50e095b58730bebfe0cffee457f | /lean/love07_metaprogramming_exercise_sheet.lean | 2e6b47d8d9988753fd5c88ab418ae23cc762d79e | [] | no_license | Vierkantor/logical_verification_2021 | 7485dd916953131d501760f023d5b30fbb74d36a | 9500b9c194e22a9ab4067321cfed7a1f445afcfc | refs/heads/main | 1,692,560,845,086 | 1,624,721,275,000 | 1,624,721,275,000 | 416,354,079 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,307 | lean | import .love07_metaprogramming_demo
/-! # LoVe Exercise 7: Metaprogramming -/
set_option pp.beta true
set_option pp.generalized_field_notation false
namespace LoVe
/-! ## Question 1: A Term Exploder
In this question, we develop a string format for the `expr` metatype. By
default, there is no `has_repr` instance... |
87f1022b2f3b31c5bc1a330bc12f01bca172bc00 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/analysis/normed_space/bounded_linear_maps.lean | a82c3585d6c04779399c484c4e49aaad3596ce7b | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 19,303 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
Continuous linear functions -- functions between normed vector spaces which are bounded and linear.
-/
import analysis.normed_space.multilinear
noncomp... |
09e8b2f0b54d26eb11f68e6ed9bba6b1e5aca852 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/number_theory/class_number/admissible_card_pow_degree.lean | 528ee0d617d9dc3cd38f6c4e0b86c4c0a0b4f99c | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 13,871 | lean | /-
Copyright (c) 2021 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import number_theory.class_number.admissible_absolute_value
import analysis.special_functions.pow
import ring_theory.ideal.local_ring
import data.polynomial.degree.card_pow... |
232ffe89be7292854bedca75b1096dbdfd5ee4ee | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/limits/creates_auto.lean | 185c0aa92efed1d23ec28d1d765544028e3cec53 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,245 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.limits.preserves.basic
import Mathlib.PostPort
universes v u₁ u₂ l u₃
namesp... |
f74dd0cec61b8a5a80d9433c23020955d4d3e5fc | c61b91f85121053c627318ad8fcde30dfb8637d2 | /Chapter2/2-10.lean | e170c9be467b8818fc9772579ac9c315c629124a | [] | no_license | robkorn/theorem-proving-in-lean-exercises | 9e2256360eaf6f8df6cdd8fd656e63dfb04c8cdb | 9c51da587105ee047a9db55d52709d881a39be7a | refs/heads/master | 1,585,403,341,988 | 1,540,142,619,000 | 1,540,142,619,000 | 148,431,678 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,450 | lean |
-- Exercise # 1
def double (x : nat) := x * 2
def doTwice (f : ℕ -> ℕ) (n : ℕ) : ℕ := f $ f n
#print doTwice
#reduce doTwice
def Do_Twice (f : (ℕ → ℕ) → (ℕ → ℕ)) (g : ℕ → ℕ) : ℕ → ℕ := f $ g
#reduce Do_Twice doTwice double
#eval Do_Twice doTwice double 2
-- Exercise # 2
def curry (α β γ : Type) (f :... |
5a6b5fb016d042c9d915d4d3d0d6d925182048e1 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/def_ite_value.lean | 6f8a089cf56682a2da7a44f0c9e77ab33acef5b6 | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 563 | lean | inductive bv : nat → Type
| nil : bv 0
| cons : Π n, bool → bv n → bv (n+1)
open bv
definition f : ∀ n : nat, bv n → nat → nat
| (n+1) (cons .(n) b v) 1000000 := f n v 0
| (n+1) (cons .(n) b v) x := f n v (x + 1)
| _ _ _ := 1
set_option pp.binder_types true
#check @f._main.equations._... |
f10c66da4d7aa2a20c451936ebdb8bfaab1cde70 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/continued_fractions/default_auto.lean | d50710cf703548e43793b61ea8534e24a20b033e | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 524 | lean | /-
Copyright (c) 2019 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.continued_fractions.continuants_recurrence
import Mathlib.algebra.continued_fra... |
07a10dcdac0e2362d9aaa1be35fce3ab91a0709c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/limits/shapes/reflexive.lean | 7a866f2d6e6e49193e91e0f3f5c66ffc5a6ae9b0 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,426 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.adjunction.default
import Mathlib.category_theory.limits.shapes.equalizers
impo... |
f04228ebf6462a95b34f3532ab0e8e2503fd143d | 49ffcd4736fa3bdcc1cdbb546d4c855d67c0f28a | /library/init/meta/mk_dec_eq_instance.lean | 99bae056409f88ed54573bc657699f9c6df3a8f1 | [
"Apache-2.0"
] | permissive | black13/lean | 979e24d09e17b2fdf8ec74aac160583000086bc8 | 1a80ea9c8e28902cadbfb612896bcd45ba4ce697 | refs/heads/master | 1,626,839,620,164 | 1,509,113,016,000 | 1,509,122,889,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,730 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
Helper tactic for showing that a type has decidable equality.
-/
prelude
import init.meta.contradiction_tactic init.meta.constructor_tactic
import init.meta.i... |
9bec71e33692ea59b7b37ed13432e89355da1cb8 | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/analysis/calculus/fderiv_symmetric.lean | 98f48309aaaaf00f7fbca0e1c0ded0e95b42636d | [
"Apache-2.0"
] | permissive | ayush1801/mathlib | 78949b9f789f488148142221606bf15c02b960d2 | ce164e28f262acbb3de6281b3b03660a9f744e3c | refs/heads/master | 1,692,886,907,941 | 1,635,270,866,000 | 1,635,270,866,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,570 | lean | /-
Copyright (c) 2021 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import analysis.calculus.deriv
import analysis.calculus.mean_value
import analysis.convex.topology
/-!
# Symmetry of the second derivative
We show that, over ... |
bef3fdcdd6bae233875b34a42c6c189ded4b8138 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/category/Group/zero.lean | b613d33acfaad890b05015cd1068fcbb5a0144bb | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 1,464 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.category.Group.basic
import category_theory.limits.shapes.zero_morphisms
/-!
# The category of (commutative) (additive) groups has a zero object.
`Ad... |
20d25313883d828727d3c5db3d0e9efd6de89969 | c1a29ca460720df88ab68dc42d9a1a02e029d505 | /examples/logic/unnamed_1708.lean | 45827b7b7a51d9ea1c0700a68926ac4daeb1184c | [] | no_license | agusakov/mathematics_in_lean | acb5b3d659e4522ae4b4836ea550527f03f6546c | 2539562e4d91c858c73dbecb5b282ce1a7d38b6d | refs/heads/master | 1,665,963,365,241 | 1,592,080,022,000 | 1,592,080,022,000 | 272,078,062 | 0 | 0 | null | 1,592,078,772,000 | 1,592,078,772,000 | null | UTF-8 | Lean | false | false | 217 | lean | import data.real.basic
-- BEGIN
theorem not_monotone_iff {f : ℝ → ℝ}:
¬ monotone f ↔ ∃ x y, x ≤ y ∧ f x > f y :=
by { rw [monotone], push_neg }
example : ¬ monotone (λ x : ℝ, -x) :=
sorry
-- END |
0447ef77eedc29aacb48639b5282b8b01a92b43d | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /04_Quantifiers_and_Equality.org.12.lean | 219f08530a97cb3d313908f7ec3da9f302880238 | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 184 | lean | /- page 51 -/
import standard
variables (A : Type) (a b c d : A)
premises (Hab : a = b) (Hcb : c = b) (Hcd : c = d)
-- BEGIN
open eq.ops
example : a = d := Hab ⬝ Hcb⁻¹ ⬝ Hcd
|
00ed750da0af63ffadafe097af9739c8a5d10a4a | 94e33a31faa76775069b071adea97e86e218a8ee | /src/data/rat/basic.lean | 2c957f15e782b3158911e2591102c1bfaacbc672 | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 1,357 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import algebra.euclidean_domain
import data.int.cast
import data.nat.gcd
import data.rat.defs
import logic.encodable.basic
/-!
# Field Structure on t... |
ae1aa539b2a5ba82e2b0d1bc7ce75cbd24f33f1f | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/locally_convex/weak_dual.lean | 164e1d336a29cb70febc80772c6cbc5cee11c86f | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 5,570 | lean | /-
Copyright (c) 2022 Moritz Doll. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Moritz Doll
-/
import topology.algebra.module.weak_dual
import analysis.normed.normed_field
import analysis.locally_convex.with_seminorms
/-!
# Weak Dual in Topological Vector Spaces
We... |
354d9e6c0ca78f3c33ca3fe79b2e111efb5d209c | cc060cf567f81c404a13ee79bf21f2e720fa6db0 | /lean/20160217-lean-assertion-error.lean | 7ee54e1e7b8568d5d1490b60a5dc7320e2f17b23 | [
"Apache-2.0"
] | permissive | semorrison/proof | cf0a8c6957153bdb206fd5d5a762a75958a82bca | 5ee398aa239a379a431190edbb6022b1a0aa2c70 | refs/heads/master | 1,610,414,502,842 | 1,518,696,851,000 | 1,518,696,851,000 | 78,375,937 | 2 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,269 | lean | universe variables u v
structure Category :=
(Obj : Type u)
(Hom : Obj → Obj → Type v)
universe variables u1 v1 u2 v2
structure Functor (C : Category.{ u1 v1 }) (D : Category.{ u2 v2 }) :=
(onObjects : C^.Obj → D^.Obj)
@[reducible] definition ProductCategory (C : Category) (D : Category) :
Category :=
... |
175e0260818fef3176cb5bc9daa005959dff2066 | 38ee9024fb5974f555fb578fcf5a5a7b71e669b5 | /Mathlib/Data/Nat/Basic.lean | 1004f65e9b13204c50593f5540483cc0c655df03 | [
"Apache-2.0"
] | permissive | denayd/mathlib4 | 750e0dcd106554640a1ac701e51517501a574715 | 7f40a5c514066801ab3c6d431e9f405baa9b9c58 | refs/heads/master | 1,693,743,991,894 | 1,636,618,048,000 | 1,636,618,048,000 | 373,926,241 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,200 | lean | import Mathlib.Init.Data.Nat.Basic
import Mathlib.Init.Data.Nat.Lemmas
import Mathlib.Tactic.Basic
import Mathlib.Logic.Basic
namespace Nat
-- TODO: in mathlib, this is done for ordered monoids
protected lemma pos_iff_ne_zero {n : ℕ} : 0 < n ↔ n ≠ 0 := by
refine ⟨?_, Nat.pos_of_ne_zero⟩
cases n with
| zero =>... |
1b67c18cf2b4861fbe30a02fb0c68ffa45b25eb0 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/algebra/order/lattice_group.lean | e90cb24f31213e85f5caef8f5046d7888f4e3a49 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 19,155 | lean | /-
Copyright (c) 2021 Christopher Hoskin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christopher Hoskin
-/
import algebra.group_power.basic -- Needed for squares
import algebra.order.group
import tactic.nth_rewrite
/-!
# Lattice ordered groups
Lattice ordered gro... |
0969c189f9874206312f1ffb5e340bc8129ea809 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/data/finsupp.lean | d9ca65a41dba8248db69c17e746132ce6e45daea | [
"Apache-2.0"
] | permissive | kmill/mathlib | ea5a007b67ae4e9e18dd50d31d8aa60f650425ee | 1a419a9fea7b959317eddd556e1bb9639f4dcc05 | refs/heads/master | 1,668,578,197,719 | 1,593,629,163,000 | 1,593,629,163,000 | 276,482,939 | 0 | 0 | null | 1,593,637,960,000 | 1,593,637,959,000 | null | UTF-8 | Lean | false | false | 71,376 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Scott Morrison
-/
import algebra.module
import data.fintype.card
import data.multiset.antidiagonal
/-!
# Type of functions with finite support
For any type `α` and a... |
b9662d0af203ab17a6a2b9e1c0580ca8fa7b09e9 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/multiset/range.lean | 40c687e881cb66fa1c3e96546e378ca42e3e8374 | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 1,016 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import data.multiset.basic
import data.list.range
open list nat
namespace multiset
/- range -/
/-- `range n` is the multiset lifted from the list `range n`,... |
ddd2a38e242e838e75d01ec105a3e2da0a1c5621 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/probability/process/hitting_time.lean | f8260177b6912d8c94a8a677a10c3fd13745b922 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 13,200 | lean | /-
Copyright (c) 2022 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying, Rémy Degenne
-/
import probability.process.stopping
/-!
# Hitting time
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to m... |
3630b700a37fde60c8610b9fab86683cc79e30ae | 969dbdfed67fda40a6f5a2b4f8c4a3c7dc01e0fb | /src/topology/sheaves/presheaf.lean | b8394be1d4d85de2f1469135a8b4894141b110ba | [
"Apache-2.0"
] | permissive | SAAluthwela/mathlib | 62044349d72dd63983a8500214736aa7779634d3 | 83a4b8b990907291421de54a78988c024dc8a552 | refs/heads/master | 1,679,433,873,417 | 1,615,998,031,000 | 1,615,998,031,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,804 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Mario Carneiro, Reid Barton
-/
import topology.category.Top.opens
/-!
# Presheaves on a topological space
We define `presheaf C X` simply as `(opens X)ᵒᵖ ⥤ C`,
and in... |
71b593869ef446ce853c3cb6ec3cfe906d2469b9 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/ring/divisibility.lean | 2a44107e6500f5580a89b75fc9142434f5805d92 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 4,633 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Yury Kudryashov, Neil Strickland
-/
import algebra.divisibility.basic
import algebra.hom.equiv.basic
import algebra.ring.defs
/-!
# ... |
4e1e4bb9fb3fc99ca1c285fa97b1be0faa6e8c90 | 5ee26964f602030578ef0159d46145dd2e357ba5 | /src/for_mathlib/nonarchimedean/adic_topology.lean | a3aeadf31e4d5eaabed086069d56c8eeed952610 | [
"Apache-2.0"
] | permissive | fpvandoorn/lean-perfectoid-spaces | 569b4006fdfe491ca8b58dd817bb56138ada761f | 06cec51438b168837fc6e9268945735037fd1db6 | refs/heads/master | 1,590,154,571,918 | 1,557,685,392,000 | 1,557,685,392,000 | 186,363,547 | 0 | 0 | Apache-2.0 | 1,557,730,933,000 | 1,557,730,933,000 | null | UTF-8 | Lean | false | false | 4,492 | lean | import for_mathlib.nonarchimedean.basic
import for_mathlib.nonarchimedean.is_subgroups_basis
namespace ideal
open lattice
variables {R : Type*} [comm_ring R]
def adic_basis (I : ideal R) : ℕ → set R := (λ n : ℕ, (I^n).carrier)
lemma is_subgroups_basis (I : ideal R) : is_subgroups_basis (adic_basis I) :=
begin
appl... |
0f5b4eb76e0c5867744bf0784637878d299c344b | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/analysis/convex/cone.lean | feaef302c089e5ad5ca3e316a0c919117b565578 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 24,014 | lean | /-
Copyright (c) 2020 Yury Kudryashov All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Frédéric Dupuis
-/
import linear_algebra.linear_pmap
import analysis.convex.basic
import order.zorn
import analysis.normed_space.inner_product
/-!
# Convex cones
In ... |
377bc3bc6a02245e610ef5f8c7bacfd95e4c944f | 618003631150032a5676f229d13a079ac875ff77 | /src/tactic/omega/nat/preterm.lean | 2e9e4371d7485d0eec49d881b4eb9e50c779e3d0 | [
"Apache-2.0"
] | permissive | awainverse/mathlib | 939b68c8486df66cfda64d327ad3d9165248c777 | ea76bd8f3ca0a8bf0a166a06a475b10663dec44a | refs/heads/master | 1,659,592,962,036 | 1,590,987,592,000 | 1,590,987,592,000 | 268,436,019 | 1 | 0 | Apache-2.0 | 1,590,990,500,000 | 1,590,990,500,000 | null | UTF-8 | Lean | false | false | 4,874 | lean | /- Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
Linear natural number arithmetic terms in pre-normalized form. -/
import tactic.omega.term
open tactic
namespace omega
namespace nat
/-- The shadow syntax for arithmetic terms.... |
4bdb949e68bd6b69d78ea7692425c06a607135e4 | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /tests/lean/meta_equation_pos.lean | 9b1d7f2dd771cc75d479d5d824920138cc087ca0 | [
"Apache-2.0"
] | permissive | bre7k30/lean | de893411bcfa7b3c5572e61b9e1c52951b310aa4 | 5a924699d076dab1bd5af23a8f910b433e598d7a | refs/heads/master | 1,610,900,145,817 | 1,488,006,845,000 | 1,488,006,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 82 | lean | meta def f (x : nat) : nat :=
tt -- type error should be reported here
check nat
|
32517a0d46383898a57dca146ce18924b1a0e8d7 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/topology/algebra/ordered/liminf_limsup.lean | 35ebda4e04e0d80a982bd31826f9672b76125ab1 | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,215 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Yury Kudryashov
-/
import topology.algebra.ordered.basic
import order.liminf_limsup
/-!
# Lemmas about liminf and limsup in an order topology.
-/
open... |
2e46198fe3fe2d142ddebe10a375ddfb2d7bc53f | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Std/Data/BinomialHeap.lean | e062dcd6a57a0f8ff9630571b90034e45fa8cf91 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | EdAyers/lean4 | 57ac632d6b0789cb91fab2170e8c9e40441221bd | 37ba0df5841bde51dbc2329da81ac23d4f6a4de4 | refs/heads/master | 1,676,463,245,298 | 1,660,619,433,000 | 1,660,619,433,000 | 183,433,437 | 1 | 0 | Apache-2.0 | 1,657,612,672,000 | 1,556,196,574,000 | Lean | UTF-8 | Lean | false | false | 8,517 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jannis Limperg
-/
namespace Std
universe u
namespace BinomialHeapImp
structure HeapNodeAux (α : Type u) (h : Type u) where
val : α
rank : Nat
children ... |
35c6b384a9553dd4ee33225ac52488d85ae0a6c8 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/algebra/basic.lean | b8cf2a9b3c9cca6f54dc59ba2018b3c2a36fac95 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 60,445 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Yury Kudryashov
-/
import tactic.nth_rewrite
import data.matrix.basic
import data.equiv.ring_aut
import linear_algebra.tensor_product
import ring_theory.subring
import deprecated... |
dfb2542e0710eac37208bee823f35f4e2af854a0 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/ring_theory/noetherian.lean | 11e999998f2e9f7878300cc8e112bf673ac5de80 | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 30,478 | lean | /-
Copyright (c) 2018 Mario Carneiro, Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kevin Buzzard
-/
import algebraic_geometry.prime_spectrum
import data.multiset.finset_ops
import linear_algebra.linear_independent
import order.order_iso... |
3c2e6c8862de6880c230062fd971370d1b24be59 | 2de8c1580f92bb6c28b60135f589fe9d0513faba | /src/finsupp_pos.lean | bab3b7a760be01eeddde7377b2cf79333afa6698 | [] | no_license | FCL-lean/verification | 44a52e40ab78b18654b8d61bb55c2c912a40d2f4 | be02c698c0ca78b18762e3fe7749cdc72a55d197 | refs/heads/master | 1,585,960,207,309 | 1,560,259,990,000 | 1,560,259,990,000 | 155,650,137 | 0 | 0 | null | 1,541,039,704,000 | 1,541,038,972,000 | Lean | UTF-8 | Lean | false | false | 3,796 | lean | import order.order_iso finsupp user_classes
namespace finsupp
section linear_order
variables {α : Type*} {β : Type*} [decidable_eq α] [decidable_canonically_ordered_monoid β]
variables [linear_order (α →₀ β)] [is_well_founded (α →₀ β) (<)] [is_monomial_order (α →₀ β) (≤)]
instance : ordered_cancel_comm_mono... |
48ecc1f9e7fa93e6e3196ccf502e290c50fb8081 | 79cc757e5e5b09c7a522f717a6c490d321d36469 | /src/mywork/Homework 1 and 2.lean | 2b5548d9a7b98a66afb43c267dd67194588f2b48 | [] | no_license | LukeMathe/cs2120f21 | 534c3b8868dcfdea98a9d22513180c8a062794c6 | d51940b174569a8782e62ae027b108b5f099a9aa | refs/heads/main | 1,693,418,664,935 | 1,634,585,653,000 | 1,634,585,653,000 | 403,762,076 | 0 | 0 | null | 1,630,963,485,000 | 1,630,963,485,000 | null | UTF-8 | Lean | false | false | 6,228 | lean | /- lkm6eka; https://github.com/LukeMathe/cs2120f21
-/
/-
EQUALITY
-/
/- #1
Suppose that x, y, z, and w are arbitrary objects of some type,
T; and suppose further that we know (have proofs of the facts)
that x = y, y = z, and w = z. Give a very, very short English
proof of the conjecture that z = w. You can use no... |
253511a103eae2c7d6191446b595d1d4af7eaf0c | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/meta/mk_has_sizeof_instance.lean | 7ff9a7b6d665d414a5f2bd39b0df9281a9daecf5 | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 3,200 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
Helper tactic for constructing has_sizeof instance.
-/
prelude
import init.meta.rec_util init.meta.constructor_tactic
namespace tactic
open expr environment ... |
1081d8e52c0e11ad5673e772af7611c42e85dd09 | 9338c56dfd6ceacc3e5e63e32a7918cfec5d5c69 | /src/Kenny/sheaf_on_opens.lean | 78e5a3e0f8a0dd61037a13a6b150bd1cbceaee37 | [] | no_license | Project-Reykjavik/lean-scheme | 7322eefce504898ba33737970be89dc751108e2b | 6d3ec18fecfd174b79d0ce5c85a783f326dd50f6 | refs/heads/master | 1,669,426,172,632 | 1,578,284,588,000 | 1,578,284,588,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,301 | lean | import sheaves.sheaf Kenny.sandbox
universes v w u₁ v₁ u
open topological_space lattice
namespace opens
variables {X : Type u} [topological_space X]
theorem Inf_eq (s : set (opens X)) : Inf s = opens.interior (Inf $ subtype.val '' s) :=
le_antisymm
((subset_interior_iff_subset_of_open (Inf s).2).2 $ show (Inf s)... |
ba378a2e57682d62828936f156f1e0dfffae17f0 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Elab/InfoTree/Types.lean | afd685518cfdcc64b03400005ae86449ec6b763c | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 7,978 | lean | /-
Copyright (c) 2020 Wojciech Nawrocki. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Wojciech Nawrocki, Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Data.Position
import Lean.Data.OpenDecl
import Lean.MetavarContext
import Lean.Environment
import Lean.Data.J... |
f402febf04f8366d41757a518a74e75d119ec988 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /test/norm_cast.lean | 911990637c158fabf85627c636b10e3fb1bf00ca | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 4,400 | lean | /-
Tests for norm_cast
-/
import tactic.norm_cast
import data.complex.basic -- ℕ, ℤ, ℚ, ℝ, ℂ
import data.real.ennreal
open_locale ennreal
constants (an bn cn dn : ℕ) (az bz cz dz : ℤ) (aq bq cq dq : ℚ)
constants (ar br cr dr : ℝ) (ac bc cc dc : ℂ)
example : (an : ℤ) = bn → an = bn := by {intro h, exact_mod_cast h}
... |
75231fb36bbf8bcbfe91e01c5248e068a47859a2 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/group_theory/subsemigroup/basic.lean | 0c7c232cd6857317d77dcad54849787f1a0b25e4 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 16,776 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Kenny Lau, Johan Commelin, Mario Carneiro, Kevin Buzzard,
Amelia Livingston, Yury Kudryashov, Yakov Pechersky
-/
import algebra.hom.group -- Only needed for notation
i... |
a1c193a516d09e0ffe9dd84b70f3d2feb69f61eb | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/finset/fin.lean | e034777f9a1b19411294fa1285b78231b1d1fe19 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 1,339 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Scott Morrison, Johan Commelin
-/
import data.finset.card
/-!
# Finsets in `fin n`
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresp... |
fb25285d939dda5243169daeb57de625adbe51ea | 19cc34575500ee2e3d4586c15544632aa07a8e66 | /src/data/pnat/factors.lean | ab117afd2ae039a5d7fa6035c447f527fc012bcf | [
"Apache-2.0"
] | permissive | LibertasSpZ/mathlib | b9fcd46625eb940611adb5e719a4b554138dade6 | 33f7870a49d7cc06d2f3036e22543e6ec5046e68 | refs/heads/master | 1,672,066,539,347 | 1,602,429,158,000 | 1,602,429,158,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,396 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Neil Strickland
-/
import data.pnat.basic
import data.multiset.sort
import data.int.gcd
import algebra.group
/-- The type of multisets of prime numbers. Unique factorization
gives a... |
94f25f9bdb1917d9e80206bb95a5466d8dd994ce | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/linear_algebra/symplectic_group.lean | 895a077101aaefac99f5012c0e9b04cc3ca6da09 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 6,441 | lean | /-
Copyright (c) 2022 Matej Penciak. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Matej Penciak, Moritz Doll, Fabien Clery
-/
import linear_algebra.matrix.nonsingular_inverse
/-!
# The Symplectic Group
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to th... |
d55deda0bf1e72a059698aa70d325f6ddd5a4c47 | f7315930643edc12e76c229a742d5446dad77097 | /tests/lean/run/intros.lean | 9c977cbc9b3fd5556a40058a1ee8d9c8119348d6 | [
"Apache-2.0"
] | permissive | bmalehorn/lean | 8f77b762a76c59afff7b7403f9eb5fc2c3ce70c1 | 53653c352643751c4b62ff63ec5e555f11dae8eb | refs/heads/master | 1,610,945,684,489 | 1,429,681,220,000 | 1,429,681,449,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 583 | lean | import logic
open tactic
theorem tst1 (a b : Prop) : a → b → b :=
by intro Ha; intro Hb; apply Hb
theorem tst2 (a b : Prop) : a → b → a ∧ b :=
by intro Ha; intro Hb; rapply and.intro; apply Hb; apply Ha
theorem tst3 (a b : Prop) : a → b → a ∧ b :=
begin
intro Ha,
intro Hb,
apply and.intro,
apply Ha,
apply Hb,
e... |
3f280f52efe8c255fe0d19370c6657ddd32677dc | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/data/mv_polynomial/counit.lean | 784f3e1abe8526f76a08129afc31eec991027fdc | [
"Apache-2.0"
] | permissive | Lix0120/mathlib | 0020745240315ed0e517cbf32e738d8f9811dd80 | e14c37827456fc6707f31b4d1d16f1f3a3205e91 | refs/heads/master | 1,673,102,855,024 | 1,604,151,044,000 | 1,604,151,044,000 | 308,930,245 | 0 | 0 | Apache-2.0 | 1,604,164,710,000 | 1,604,163,547,000 | null | UTF-8 | Lean | false | false | 2,858 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import data.mv_polynomial.basic
/-!
## Counit morphisms for multivariate polynomials
One may consider the ring of multivariate polynomials `mv_polynomial A R` with... |
37a720a33b4f00a817fcb957887bfbf08241f2ab | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/model_theory/language_map.lean | 7407b211d7e5a7f4d2f4c0b4e9410499ced2f17a | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 19,636 | lean | /-
Copyright (c) 2021 Aaron Anderson, Jesse Michael Han, Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson, Jesse Michael Han, Floris van Doorn
-/
import model_theory.basic
/-!
# Language Maps
Maps between first-order languages in the styl... |
64838de6bfc31c1e4e207a70d60b1018e2f0adb1 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /src/Lean/Meta/Eqns.lean | 875bb7e00ebeb676fbf5ed23d07e27e39ad35abb | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 2,833 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.Basic
namespace Lean.Meta
def GetEqnsFn := Name → MetaM (Option (Array Name))
private builtin_initialize getEqnsFnsRef : IO.Ref (List Ge... |
359b8f633a977d4bcc58ca9b91786224b2cd3f78 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Compiler/LCNF/Types.lean | 029ad83ab13c2e395e33fc0e1c8ba7b7ae95bdc3 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 9,361 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Meta.InferType
namespace Lean.Compiler
scoped notation:max "◾" => lcErased
scoped notation:max "⊤" => lcAny
namespace LCNF
def erasedExpr :=... |
ffa5f0c8c59579fb974c139b5e1f431ee13fa755 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/analysis/special_functions/pow.lean | 0efc22023364bc2752a462a10831d856bcfc322b | [
"Apache-2.0"
] | permissive | Lix0120/mathlib | 0020745240315ed0e517cbf32e738d8f9811dd80 | e14c37827456fc6707f31b4d1d16f1f3a3205e91 | refs/heads/master | 1,673,102,855,024 | 1,604,151,044,000 | 1,604,151,044,000 | 308,930,245 | 0 | 0 | Apache-2.0 | 1,604,164,710,000 | 1,604,163,547,000 | null | UTF-8 | Lean | false | false | 54,387 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne, Sébastien Gouëzel
-/
import analysis.special_functions.trigonometric
import analysis.calculus.extend_deriv
/-!
# Power func... |
7138851bfd1af983daecd9125ba58200c89de4bd | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/filter/archimedean.lean | 81fa27e031c80c559cda99d7fd1a7f3f7ac36b13 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 9,876 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Yury Kudryashov
-/
import algebra.order.archimedean
import order.filter.at_top_bot
/-!
# `at_top` filter and archimedean (semi)rings/fields
> THIS FILE IS SYNCHRONIZE... |
dd8e04e614455faaec2957f2714f141b75c337f6 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Compiler/LCNF/FloatLetIn.lean | 9849a20c8155850612525dc9302a94ec33a65efd | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 10,056 | lean | /-
Copyright (c) 2022 Henrik Böving. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Henrik Böving
-/
import Lean.Compiler.LCNF.CompilerM
import Lean.Compiler.LCNF.FVarUtil
import Lean.Compiler.LCNF.PassManager
import Lean.Compiler.LCNF.Types
namespace Lean.Compiler.LC... |
6b5397e21316313946a032c492f7bef71b41f53c | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/geometry/euclidean/triangle.lean | d035f3eaf004c5872091414654d5699e1e74a779 | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 19,359 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers, Manuel Candales
-/
import geometry.euclidean.basic
import tactic.interval_cases
/-!
# Triangles
This file proves basic geometrical results about distances and angles
in (... |
0990911d7ff4ebfd22ad307999353d565068098b | 8e6cad62ec62c6c348e5faaa3c3f2079012bdd69 | /src/data/multiset/basic.lean | be48a8a5a76e70bc9115da785fb06a97d7299534 | [
"Apache-2.0"
] | permissive | benjamindavidson/mathlib | 8cc81c865aa8e7cf4462245f58d35ae9a56b150d | fad44b9f670670d87c8e25ff9cdf63af87ad731e | refs/heads/master | 1,679,545,578,362 | 1,615,343,014,000 | 1,615,343,014,000 | 312,926,983 | 0 | 0 | Apache-2.0 | 1,615,360,301,000 | 1,605,399,418,000 | Lean | UTF-8 | Lean | false | false | 92,738 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import data.list.perm
import algebra.group_power
/-!
# Multisets
These are implemented as the quotient of a list by permutations.
## Notation
We define the ... |
bcd52024803ee085b4cbd3db50c753022c1957c6 | 88892181780ff536a81e794003fe058062f06758 | /src/xena_challenge/challenge09.lean | bbcf768471f1658adc8d3af2c550bf3d9b70161a | [] | no_license | AtnNn/lean-sandbox | fe2c44280444e8bb8146ab8ac391c82b480c0a2e | 8c68afbdc09213173aef1be195da7a9a86060a97 | refs/heads/master | 1,623,004,395,876 | 1,579,969,507,000 | 1,579,969,507,000 | 146,666,368 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,418 | lean | import data.set.basic
import tactic.tidy
import lib.attempt
variables (R A : Type)
variables (𝕍 : set R → set A) (𝕀 : set A → set R)
open set
-- 𝕍 𝕀 𝕍 = 𝕍 for a contravariant Galois connection
-- for example the one between R=k[X₁,X₂,…,Xₙ] and A=𝔸ⁿ
-- in the theory of algebraic varieties
example
(𝕍_antimo... |
723e3976b8959e752ec0e8001e0f3df009f7f46f | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/category_theory/limits/preserves.lean | 3c958b5c383e71b99e3a6f08f381884040b1f905 | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 10,689 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Reid Barton
-/
import category_theory.limits.limits
/-!
# Preservation and reflection of (co)limits.
-/
open category_theory
namespace category_theory.limits
univer... |
ca49989afd8eef0ca96e8655524934c6517ae8da | 675b8263050a5d74b89ceab381ac81ce70535688 | /src/analysis/normed_space/basic.lean | a31b82f428e0d66baa5c35966ac8da5107cc820d | [
"Apache-2.0"
] | permissive | vozor/mathlib | 5921f55235ff60c05f4a48a90d616ea167068adf | f7e728ad8a6ebf90291df2a4d2f9255a6576b529 | refs/heads/master | 1,675,607,702,231 | 1,609,023,279,000 | 1,609,023,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 53,747 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
-/
import topology.instances.nnreal
import topology.algebra.module
import topology.metric_space.antilipschitz
/-!
# Normed spaces
-/
variables {α : Typ... |
6ed2e4f3b1f734bd10985d93c1b83d28ba500eb4 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/order/filter/archimedean.lean | 5019341af730c07e97b9f1e6180686b753d4789e | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 10,581 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Yury Kudryashov
-/
import algebra.order.archimedean
import order.filter.at_top_bot
/-!
# `at_top` filter and archimedean (semi)rings/fields
In this file we prove that... |
9eca4a4ae0af66971c2b9f444bcadf3edca83930 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Compiler/IR/LLVMBindings.lean | e60a49abcaeeaa835cb00e70ecccdd83c75a1a60 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 18,293 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Siddharth Bhat
-/
namespace LLVM
/-!
This file defines bindings for LLVM. The main mechanisms
are to:
- Mirror the values of C enumerations.
- Create opaque values for LLVM's p... |
375ce19e6a182a844f8579eab4ac026b4c9be231 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/algebra/big_operators/multiset.lean | 385adff005b3d7806393d0dafc4117997b3d1c70 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 16,215 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import algebra.group_with_zero.power
import data.list.big_operators
import data.multiset.basic
/-!
# Sums and products over multisets
In this file we define ... |
005074f8585de7ad992b6051c23e15ea96aa698d | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/ring_theory/unique_factorization_domain.lean | da6d72dd690754f0b1ee67e92e7b4484a99dfedb | [
"Apache-2.0"
] | permissive | kmill/mathlib | ea5a007b67ae4e9e18dd50d31d8aa60f650425ee | 1a419a9fea7b959317eddd556e1bb9639f4dcc05 | refs/heads/master | 1,668,578,197,719 | 1,593,629,163,000 | 1,593,629,163,000 | 276,482,939 | 0 | 0 | null | 1,593,637,960,000 | 1,593,637,959,000 | null | UTF-8 | Lean | false | false | 19,629 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Jens Wagemaker
Theory of unique factorization domains.
@TODO: setup the complete lattice structure on `factor_set`.
-/
import algebra.gcd_domain
variables {α : Type*... |
2b01607bf586ff0923100cbb7e0d7afa0d382195 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/algebra/subalgebra/basic.lean | e4b47764f34e5caef63ebdf2062fb1af455be311 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 46,934 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Yury Kudryashov
-/
import algebra.algebra.basic
import data.set.Union_lift
import linear_algebra.finsupp
import ring_theory.ideal.operations
/-!
# Subalgebras over Commutative S... |
3314eabc19428b6ea17fd71292994fa77c8272a1 | 92b50235facfbc08dfe7f334827d47281471333b | /library/init/logic.lean | cae5a0d7ec76744ee5af1587d4125ca62fd6a02a | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 22,576 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad, Floris van Doorn
-/
prelude
import init.datatypes init.reserved_notation
/- implication -/
definition implies (a b : Prop) := a → b
lemma im... |
f0abf59bf7d8c2bf7f77cc1cece0e610cbb0f431 | 54f4ad05b219d444b709f56c2f619dd87d14ec29 | /my_project/src/love10_denotational_semantics_exercise_sheet.lean | d979cc5a4c5930771371600fe7569730c701bb72 | [] | no_license | yizhou7/learning-lean | 8efcf838c7276e235a81bd291f467fa43ce56e0a | 91fb366c624df6e56e19555b2e482ce767cd8224 | refs/heads/master | 1,675,649,087,737 | 1,609,022,281,000 | 1,609,022,281,000 | 272,072,779 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,565 | lean | import .love10_denotational_semantics_demo
/-! # LoVe Exercise 10: Denotational Semantics -/
set_option pp.beta true
namespace LoVe
/-! ## Question 1: Monotonicity
1.1. Prove the following lemma from the lecture. -/
lemma monotone_comp {α β : Type} [partial_order α] (f g : α → set (β × β))
(hf : monotone f... |
5b541a47cfcdb9c853a9f6212c188c3e3649aa95 | 398b53a5e02ce35196531591f84bb2f6b034ce5a | /category_theory/def.lean | adc052be8a300a0ab049a19927b7b7feb0e811df | [
"MIT"
] | permissive | crockeo/math-exercises | 64f07a9371a72895bbd97f49a854dcb6821b18ab | cf9150ef9e025f1b7929ba070a783e7a71f24f31 | refs/heads/master | 1,607,910,221,030 | 1,581,231,762,000 | 1,581,231,762,000 | 234,595,189 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,681 | lean | universes v u v₂ u₂
-- TODO:
-- * Define a monoidal category
-- * Specialize monoid on the endofunctor
-- * ???
-- * Profit
namespace hidden
-- Defining a class of things that have homomorphisms.
class has_hom (obj : Type u) : Type (max u (v + 1)) :=
(hom : obj → obj → Type v)
infixr ` ⟶ ` : 10 := has_hom... |
dd4ea3a795a3476e0d4dd75f8146a177946870b8 | a2ee6a66690e8da666951cac0c243d42db11f9f3 | /src/data/fintype/basic.lean | 1d149979960112b408b827f1c8da8fd583c13cce | [
"Apache-2.0"
] | permissive | shyamalschandra/mathlib | 6d414d7c334bf383e764336843f065bd14c44273 | ca679acad147870b2c5087d90fe3550f107dea49 | refs/heads/master | 1,671,730,354,335 | 1,601,883,576,000 | 1,601,883,576,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 49,253 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Finite types.
-/
import tactic.wlog
import data.finset.powerset
import data.finset.lattice
import data.finset.pi
import data.array.lemmas
open_locale nat
universes u v... |
901a5890f394ece5103dab34a08e1b440fd75e93 | 69bc7d0780be17e452d542a93f9599488f1c0c8e | /10-22-2019.lean | 7d58ad990feae8fb6497b529a164b849967b8411 | [] | no_license | joek13/cs2102-notes | b7352285b1d1184fae25594f89f5926d74e6d7b4 | 25bb18788641b20af9cf3c429afe1da9b2f5eafb | refs/heads/master | 1,673,461,162,867 | 1,575,561,090,000 | 1,575,561,090,000 | 207,573,549 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,694 | lean | -- Notes 10/22/2019
/-
Quick recap:
pEval e i
e is of type pExp
i is of type (var→bool)
pEval returns a bool
i is a "model" of e if i makes e evaluate to true.
If e is valid, all possible i are models of e.
If e is satisfiable, at least one i exists that is a model of e.
If e is unsatisfiable, no i exists that is ... |
8a2822e73e47bb6edc9df00b875bd5deb43920ed | 35677d2df3f081738fa6b08138e03ee36bc33cad | /test/library_search/ordered_ring.lean | d50acdf5f2454af7e01d024fbf2d995b47869e90 | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 420 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.ordered_ring
/- Turn off trace messages so they don't pollute the test build: -/
set_option trace.silence_library_search true
example {a b : ℕ} (h : ... |
95ccc8de6c26f34c3a5726e97261efa2ef1203bc | c8b4b578b2fe61d500fbca7480e506f6603ea698 | /src/number_theory/cyclotomic/case_I.lean | fcb5b5aa83443f5995865e70ed90d15ac9325aef | [] | no_license | leanprover-community/flt-regular | aa7e564f2679dfd2e86015a5a9674a6e1197f7cc | 67fb3e176584bbc03616c221a7be6fa28c5ccd32 | refs/heads/master | 1,692,188,905,751 | 1,691,766,312,000 | 1,691,766,312,000 | 421,021,216 | 19 | 4 | null | 1,694,532,115,000 | 1,635,166,136,000 | Lean | UTF-8 | Lean | false | false | 3,125 | lean | import number_theory.cyclotomic.Unit_lemmas
import number_theory.cyclotomic.cycl_rat
import number_theory.regular_primes
import number_theory.cyclotomic.factoring
open_locale number_field non_zero_divisors
variables {p : ℕ+} {K : Type*} [field K] [char_zero K] [is_cyclotomic_extension {p} ℚ K]
variables {ζ : K} (hζ :... |
6cab68658fe90d98e0eff4c7ea96c4637aea38be | 51c1a276984eccde1889df19fbc87b914cad4613 | /lib/data/fin.lean | 005b2e0f9e3ab0d542b0960c0dfb5f0549ce43f9 | [] | no_license | cipher1024/lean-modexp | 6c0e996654b6a31c2e7be646072091530e4ffb9f | d779c1b9f588e86181beca26e32c4c1ae8ef1f36 | refs/heads/master | 1,609,627,624,569 | 1,510,265,500,000 | 1,510,265,500,000 | 99,388,479 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,258 | lean |
namespace fin
open nat
protected def neg {n} : fin n → fin n
| ⟨x,P⟩ :=
if h : 0 < x
then
have P' : n - x < n, from sorry,
⟨n-x,P'⟩
else ⟨x,P⟩
instance {n} : comm_monoid (fin (succ n)) :=
{ one := has_one.one _
, mul := has_mul.mul
, mul_one := sorry
, one_mul := sorry
, mul_assoc := sorry
, mul_comm := sorry... |
8956df23fb6154d542ff6da4d36e9d5132d69023 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/topology/uniform_space/absolute_value.lean | 7dc6691363eb54cbf438d028739277e09c3e2957 | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 2,930 | lean | /-
Copyright (c) 2019 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import data.real.cau_seq
import topology.uniform_space.basic
/-!
# Uniform structure induced by an absolute value
We build a uniform space structure on a commutati... |
67eed0811463784030b5d6b129499793f5d6ab8b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/nilpotent.lean | 1795de367c5f98e2e7005998288e1ea6d5bc02ef | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 7,497 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import data.nat.choose.sum
import algebra.algebra.bilinear
import ring_theory.ideal.operations
/-!
# Nilpotent elements
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any c... |
443efbbb6b43eea28bef1c720cf8486ed25754d0 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/elabissues/issues1.lean | 542f3b54684f687cee09e404040926cec39bd4d8 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 1,014 | lean | def f : List Int → Bool := fun _ => true
def ex1 : Bool :=
f [1, 2, 3] -- Works
def ex2 : Bool :=
let xs := [1, 2, 3];
f xs -- Works
def ex3 : IO Bool :=
do
xs ← pure [1, 2, 3];
pure $ f xs -- Works
def ex4 :=
[1, 2, 3].map $ fun x => x+1
def ex5 (xs : List String) :=
/- `r.push x` fails because we don't know the... |
878e19e44de889e473ab52141c796c34422a9ff1 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/set/intervals/unordered_interval.lean | 6edbb024832d0a27de21faa7ea9036cf6ac2f334 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 11,221 | lean | /-
Copyright (c) 2020 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
-/
import order.bounds.basic
import data.set.intervals.basic
/-!
# Intervals without endpoints ordering
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this ... |
c4d34d6caa10ee3cf4bf62729642bd81f00e5020 | d1bbf1801b3dcb214451d48214589f511061da63 | /src/data/matrix/notation.lean | f0e2d5609bb6929640aa87191182a401085fbaea | [
"Apache-2.0"
] | permissive | cheraghchi/mathlib | 5c366f8c4f8e66973b60c37881889da8390cab86 | f29d1c3038422168fbbdb2526abf7c0ff13e86db | refs/heads/master | 1,676,577,831,283 | 1,610,894,638,000 | 1,610,894,638,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,524 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
Notation for vectors and matrices
-/
import data.fintype.card
import data.matrix.basic
import tactic.fin_cases
/-!
# Matrix and vector notation
This file defines notation ... |
e0e7d0b78b72f4ccba24dd04b75ca33ef7abbbe8 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/module/default.lean | 5c7fbb27f383dced7e7f0270e67c8b8c314f5e63 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 330 | lean | /-
Copyright (c) 2020 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.module.basic
import Mathlib.algebra.module.submodule
import Mathlib.PostPort
namespace... |
2ce3ffb83e3ee193b68fd2879c7c16a0bd8ac565 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /tests/lean/quasireducible.lean | cf8a0bb8abc43433819cbacf7d7e5324f1f7e33b | [
"Apache-2.0"
] | permissive | jroesch/lean | 30ef0860fa905d35b9ad6f76de1a4f65c9af6871 | 3de4ec1a6ce9a960feb2a48eeea8b53246fa34f2 | refs/heads/master | 1,586,090,835,348 | 1,455,142,203,000 | 1,455,142,277,000 | 51,536,958 | 1 | 0 | null | 1,455,215,811,000 | 1,455,215,811,000 | null | UTF-8 | Lean | false | false | 403 | lean | constant g : nat → nat
definition f [reducible] := g
example (a : nat) (H : f a = a) : g a = a :=
by rewrite H
attribute f [quasireducible]
example (a : nat) (H : f a = a) : g a = a :=
by rewrite H -- error
attribute f [semireducible]
example (a : nat) (H : f a = a) : g a = a :=
by rewrite H -- error
attribute f... |
25a37abc8dc170b5cc2fd59e365206a5d5ef73db | d1bbf1801b3dcb214451d48214589f511061da63 | /src/topology/basic.lean | 2a1f1c83be2adb919d426cc8212d16a13b903d35 | [
"Apache-2.0"
] | permissive | cheraghchi/mathlib | 5c366f8c4f8e66973b60c37881889da8390cab86 | f29d1c3038422168fbbdb2526abf7c0ff13e86db | refs/heads/master | 1,676,577,831,283 | 1,610,894,638,000 | 1,610,894,638,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 51,946 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro, Jeremy Avigad
-/
import order.filter.ultrafilter
import order.filter.partial
noncomputable theory
/-!
# Basic theory of topological spaces.
The main ... |
cfd9186d52a5498b51baa5b725ea7b5a089a0da0 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/omit.lean | 913a64ffd2d00414fe508d740c57a8a979e183af | [
"Apache-2.0"
] | permissive | soonhokong/lean-osx | 4a954262c780e404c1369d6c06516161d07fcb40 | 3670278342d2f4faa49d95b46d86642d7875b47c | refs/heads/master | 1,611,410,334,552 | 1,474,425,686,000 | 1,474,425,686,000 | 12,043,103 | 5 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 290 | lean | prelude section
variable A : Type
variable a : A
variable c : A
omit A
include A
include A
omit A
variable B : Type
variable b : B
variable d : B
include A
include a
include c
definition foo := b
inductive tst (C : Type)
| mk : tst
end
check foo
check tst
|
cc453c2b6114653aa2acd19aec7cb84c62f18f5c | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/order/rel_iso.lean | cffcb8b0cd97acbb35bfd902e0d97bd8db8282ed | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 33,163 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import logic.embedding
import order.rel_classes
import data.set.intervals.basic
open function
universes u v w
variables {α : Type*} {β : Type*} {γ : Type*}
{r : α... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.