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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0ac7f648d71500c3721a5cdfb1e608519e602363 | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Elab/Tactic/BuiltinTactic.lean | 9cba9ec60364127394732ed37e006bb7ceda2ffd | [
"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 | 14,866 | 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.Tactic.Assumption
import Lean.Meta.Tactic.Contradiction
import Lean.Meta.Tactic.Refl
import Lean.Elab.Binders
import Lean.Elab.Open
import ... |
ce1022d78e3c0eabfab76eb17fe78e2b737930c0 | 9338c56dfd6ceacc3e5e63e32a7918cfec5d5c69 | /src/sheaves/covering/covering.lean | bba527658e6d1afcf05a9a549c8585facaa20ede | [] | 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 | 3,240 | lean | /-
Package the definition of an open cover of an open set.
-/
import topology.basic
import topology.opens
import to_mathlib.opens
universes u
open topological_space lattice
section covering
variables {α : Type u} [topological_space α]
-- Open cover.
structure covering (U : opens α) :=
{γ : Type u}
(Uis : γ... |
844c9db9581dc9a84c9d8ebc72b1c20dba940f0d | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Server/Rpc/RequestHandling.lean | 2c7293329f764bb41ad245540d702cf89c8a4c3e | [
"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 | 5,737 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Wojciech Nawrocki
-/
import Lean.Data.Lsp.Extra
import Lean.Server.Requests
import Lean.Server.Rpc.Basic
namespace Lean.Server
private structure RpcProcedure where
wrapper... |
af4cefed6d288f5938b45d3d17c0fc7345bd5e12 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/linear_algebra/determinant.lean | 5ea4f49404df724b10934b9d7c9691c47013c70e | [
"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 | 8,870 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Chris Hughes, Tim Baanen
-/
import data.matrix.basic
import data.matrix.pequiv
import data.fintype.card
import group_theory.perm.sign
import tactic.ring
universes u v
open equiv... |
235d4495bb835c5d9202e15bec4c738890fd3918 | cc62cd292c1acc80a10b1c645915b70d2cdee661 | /src/category_theory/universal/kernels.lean | 89706f34099f8e6cbd9494955718dadd51cd8228 | [] | no_license | RitaAhmadi/lean-category-theory | 4afb881c4b387ee2c8ce706c454fbf9db8897a29 | a27b4ae5eac978e9188d2e867c3d11d9a5b87a9e | refs/heads/master | 1,651,786,183,402 | 1,565,604,314,000 | 1,565,604,314,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,590 | lean | -- import category_theory.universal.zero
-- import category_theory.limits.equalizers
-- import category_theory.over
-- open category_theory
-- universes u v
-- namespace category_theory.limits
-- variables {C : Type u} [𝒞 : category.{u v} C] [has_zero_object.{u v} C]
-- include 𝒞
-- variables {X Y Z : C}
-- stru... |
e141b27ec26ce381ad6e7cf0c386af42f2469cc9 | 704c0b4221e71a413a9270e3160af0813f426c91 | /src/simplex.lean | 2bb50651875a2c29f889893d36e0010d8b8f1d14 | [] | no_license | CohenCyril/LP | d39b766199d2176b592ff223f9c00cdcb4d5f76d | 4dca829aa0fe94c0627410b88d9dad54e6ed2c63 | refs/heads/master | 1,596,132,000,357 | 1,568,817,913,000 | 1,568,817,913,000 | 210,310,499 | 0 | 0 | null | 1,569,229,479,000 | 1,569,229,479,000 | null | UTF-8 | Lean | false | false | 44,223 | lean | import tableau order.lexicographic
open matrix fintype finset function pequiv partition
variables {m n : ℕ}
local notation `rvec`:2000 n := matrix (fin 1) (fin n) ℚ
local notation `cvec`:2000 m := matrix (fin m) (fin 1) ℚ
local infix ` ⬝ `:70 := matrix.mul
local postfix `ᵀ` : 1500 := transpose
namespace tableau
def... |
be85235c29fa1b09223804116e2518787500a699 | acc85b4be2c618b11fc7cb3005521ae6858a8d07 | /data/fin.lean | bf1fd763eade7beb725089f1fcb40eb5348b96e1 | [
"Apache-2.0"
] | permissive | linpingchuan/mathlib | d49990b236574df2a45d9919ba43c923f693d341 | 5ad8020f67eb13896a41cc7691d072c9331b1f76 | refs/heads/master | 1,626,019,377,808 | 1,508,048,784,000 | 1,508,048,784,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 487 | lean | import data.nat.basic
open fin nat
def raise_fin {n : ℕ} (k : fin n) : fin (n + 1) := ⟨val k, lt_succ_of_lt (is_lt k)⟩
theorem eq_of_lt_succ_of_not_lt {a b : ℕ} (h1 : a < b + 1) (h2 : ¬ a < b) : a = b :=
have h3 : a ≤ b, from le_of_lt_succ h1,
or.elim (eq_or_lt_of_not_lt h2) (λ h, h) (λ h, absurd h (not_lt_of_ge h3)... |
e4c36ea2046c402b3bf26f177c32760bae735f7a | 761fea1362b10b4c588c2dfc0ae90c70b119e35d | /src/provers/ljt.lean | f9f919ec47485bc14a23bbd10dd75100713413ba | [] | no_license | holtzermann17/mm-lean | 382a29fca5245f97cf488c525ed0c9594917f73b | a9130d71ed448f62df28d4128043b707bad85ccd | refs/heads/master | 1,588,477,413,982 | 1,553,885,046,000 | 1,553,885,046,000 | 178,404,617 | 0 | 0 | null | 1,553,863,829,000 | 1,553,863,828,000 | null | UTF-8 | Lean | false | false | 3,782 | lean | import .utils
open tactic expr util
/- the intuitionitsic prover -/
-- Assumes pr is a proof of t. Adds the consequences of t to the context
-- and returns tt if anything nontrivial has been added.
meta def add_consequences : expr → expr → tactic bool :=
λ pr t,
let assert_consequences := λ e t, mcond (add_consequenc... |
2949819824b5278e4290e0492b8dacb5b20f716e | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/bad9.lean | 9415c179774495c9c716f450482ca639300fa3e8 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 203 | lean | set_option pp::implicit true.
set_option pp::colors false.
variable N : Type.
check
fun (a : N) (f : N -> N) (H : f a = a),
let calc1 : f a = a := substp (fun x : N, f a = _) (refl (f a)) H
in calc1. |
962f47c34d5cc8e763f293b5a79a36d7944029f3 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/set_theory/zfc.lean | 705f5da6c65f4202988bfc27613ee7aafb5cecec | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 30,760 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
A model of ZFC in Lean.
-/
import data.set.basic
universes u v
/-- The type of `n`-ary functions `α → α → ... → α`. -/
def arity (α : Type u) : nat → Type u
| 0 :=... |
46482478577f143f70257e3d898f0849c8a86d13 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Data/JsonRpc.lean | 7b215f9571662e66f8e14f56f6730002de26e722 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,266 | lean | /-
Copyright (c) 2020 Marc Huisinga. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Marc Huisinga, Wojciech Nawrocki
-/
import Init.Control
import Init.System.IO
import Std.Data.RBTree
import Lean.Data.Json
/-! Implementation of JSON-RPC 2.0 (https://www.jsonrpc.org/... |
f4deea4b99b4c8d9c1a00821b3ee709182c93d8e | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch5/ex0722.lean | bd322d4f929eb2d8f24aeb7dfa9d2f351c211c10 | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 816 | lean | import data.list.basic
open list
universe u
variables {α : Type} (x y z : α) (xs ys zs : list α)
def mk_symm (xs : list α) := xs ++ reverse xs
theorem reverse_mk_symm (xs : list α) :
reverse (mk_symm xs) = mk_symm xs :=
by simp [mk_symm]
attribute [simp] reverse_mk_symm
example (xs ys : list ℕ) (p : list ℕ → Pr... |
5f2b6cd5379c4639d2675f2e6592d7da6334a49e | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /12_Axioms.org.6.lean | 2078eb39029e080089446d8ec0dd5b613c614f6d | [] | 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 | 261 | lean | import standard
import data.nat
open nat
definition f₁ (x : ℕ) := x
definition f₂ (x : ℕ) := 0 + x
theorem feq : f₁ = f₂ := funext (take x, eq.subst !zero_add rfl)
check eq.rec (0 : ℕ) feq -- ℕ
eval eq.rec (0 : ℕ) feq -- eq.rec 0 feq
|
d353cf0a810031d8d1fc59e51764e284ddbf0515 | c2b0bd5aa4b3f4fb8a887fab57c5fc08be03aa01 | /ski.lean | def9501cb9bfb8939814d2d3f826f16a325d5cb9 | [] | no_license | cipher1024/lambda-calc | f72aa6dedea96fc7831d1898f3150a18baefdf0b | 327eaa12588018c01b2205f3e4e0048de1d97afd | refs/heads/master | 1,625,672,854,392 | 1,507,233,523,000 | 1,507,233,523,000 | 99,383,225 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,528 | lean |
import .variables.unary
universes u v u₀ u₁ u₂
namespace ski
open has_map unary
inductive expr (t : Type u) (α : Type u) : ℕ → Type u
| var {n : ℕ} : var α n → expr n
| app {n : ℕ} : expr n → expr n → expr n
| abstr (n : ℕ) : t → expr (n+1) → expr n
| skip {n : ℕ} : expr n → expr (n+1)
def bind {t α α'}
:... |
1570bbff47a0235958aff7d91777abfd955f775a | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/linear_algebra/dimension.lean | 3c68c4b22a9e2ab8d6e791276375bd26bee8985c | [
"Apache-2.0"
] | permissive | keeferrowan/mathlib | f2818da875dbc7780830d09bd4c526b0764a4e50 | aad2dfc40e8e6a7e258287a7c1580318e865817e | refs/heads/master | 1,661,736,426,952 | 1,590,438,032,000 | 1,590,438,032,000 | 266,892,663 | 0 | 0 | Apache-2.0 | 1,590,445,835,000 | 1,590,445,835,000 | null | UTF-8 | Lean | false | false | 16,665 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro, Johannes Hölzl, Sander Dahmen
-/
import linear_algebra.basis
import set_theory.ordinal
/-!
# Dimension of modules and vector spaces
## Main definitions
* The dimension... |
62a67141e47c0c1a2df95b19825a7df9b766e98c | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/run/coe9.lean | d0867e25ee7e64ea84b2b6b3f59ed59987bcf5a4 | [
"Apache-2.0"
] | permissive | codyroux/lean | 7f8dff750722c5382bdd0a9a9275dc4bb2c58dd3 | 0cca265db19f7296531e339192e9b9bae4a31f8b | refs/heads/master | 1,610,909,964,159 | 1,407,084,399,000 | 1,416,857,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 768 | lean | import data.nat
open nat
constant list.{l} : Type.{l} → Type.{l}
constant vector.{l} : Type.{l} → nat → Type.{l}
constant matrix.{l} : Type.{l} → nat → nat → Type.{l}
constant length : Pi {A : Type}, list A → nat
constant list_to_vec {A : Type} (l : list A) : vector A (length l)
constant to_row {A : Type} {n : nat} :... |
3a8d65eb7dff0f4680436f8589bfcb75f58373e3 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /tests/lean/run/tele_eq.lean | 1797756be9f4300892f97f9d0081c68fd9e30328 | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 541 | lean | constant A₁ : Type
constant A₂ : A₁ → Type
constant A₃ : Π (a₁ : A₁), A₂ a₁ → Type
structure foo :=
mk :: (a₁ : A₁) (a₂ : A₂ a₁) (a₃ : A₃ a₁ a₂)
theorem foo.eq {a₁ b₁ : A₁} {a₂ : A₂ a₁} {b₂ : A₂ b₁} {a₃ : A₃ a₁ a₂} {b₃ : A₃ b₁ b₂}
(H₁ : a₁ = b₁) (H₂ : a₂ == b₂) (H₃ : a₃ == b₃)
: foo.mk a... |
271c05d74153ba38bdaa9aea8707b56e32b4de56 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/squarefree.lean | ef1e9064d8728d1dac9af00435df044333401dcf | [] | 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 | 3,972 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.ring_theory.unique_factorization_domain
import Mathlib.ring_theory.int.basic
import Mathlib... |
f0b0fd8c426c862b7cb68f565d53935f5957c93d | 798dd332c1ad790518589a09bc82459fb12e5156 | /order/bounded_lattice.lean | a90a2601b34e3302be32f5b006fd7876d6e82224 | [
"Apache-2.0"
] | permissive | tobiasgrosser/mathlib | b040b7eb42d5942206149371cf92c61404de3c31 | 120635628368ec261e031cefc6d30e0304088b03 | refs/heads/master | 1,644,803,442,937 | 1,536,663,752,000 | 1,536,663,907,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,723 | 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
Defines bounded lattice type class hierarchy.
Includes the Prop and fun instances.
-/
import order.lattice data.option
tactic.pi_instances
set_option old_stru... |
43fd2afd1ada3eda8ac479266f437179301e04e7 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/algebra/order/group.lean | 2bccb2931576c689987116f73d94a1b69859699f | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 46,495 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro, Johannes Hölzl
-/
import algebra.order.monoid
import order.order_dual
import algebra.abs
/-!
# Ordered groups
This file develops the ... |
5471df55d4824433c6912fe1f0d7bcc39690accb | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /doc/examples/NFM2022/nfm11.lean | 183588ff900f01b2dceaf4e2054bfcbe69eeff90 | [
"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 | 308 | lean | /- Structures -/
structure Point where
x : Int := 0
y : Int := 0
deriving Repr
#eval Point.x (Point.mk 10 20)
-- 10
#eval { x := 10, y := 20 : Point }
def p : Point := { y := 20 }
#eval p.x
#eval p.y
#eval { p with x := 5 }
-- { x := 5, y := 20 }
structure Point3D extends Point where
z : Int
|
e3fe75d6a3a6755569711786e571f111c5314c78 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /library/init/algebra/field.lean | 9306ec2badeaa4746a0973f8b211e354bcd5f630 | [
"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 | 18,401 | lean | /-
Copyright (c) 2014 Robert Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Lewis, Leonardo de Moura
Structures with multiplicative and additive components, including division rings and fields.
The development is modeled after Isabelle's library.
-/
prel... |
ecdb91faeb9e66b6bd6ad5174e48ed40c6a8f4fe | 9cb9db9d79fad57d80ca53543dc07efb7c4f3838 | /src/system_of_complexes/basic.lean | 6770785a0057456b0cbc8353ffda47b25cae5933 | [] | no_license | mr-infty/lean-liquid | 3ff89d1f66244b434654c59bdbd6b77cb7de0109 | a8db559073d2101173775ccbd85729d3a4f1ed4d | refs/heads/master | 1,678,465,145,334 | 1,614,565,310,000 | 1,614,565,310,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,475 | lean | import algebra.homology.chain_complex
import normed_group.NormedGroup
import algebra.ordered_group
import facts
import tactic.gptf
universe variables v u
noncomputable theory
open opposite category_theory
open_locale nnreal
/-!
# Systems of complexes of normed abelian groups
In this file we define systems of compl... |
7c9060507264491d2f3e1bc00539df8b717573d9 | 78269ad0b3c342b20786f60690708b6e328132b0 | /src/library_dev/data/num/basic.lean | d85e199789547bbfcd8e4773bd5ceff81d566705 | [] | no_license | dselsam/library_dev | e74f46010fee9c7b66eaa704654cad0fcd2eefca | 1b4e34e7fb067ea5211714d6d3ecef5132fc8218 | refs/heads/master | 1,610,372,841,675 | 1,497,014,421,000 | 1,497,014,421,000 | 86,526,137 | 0 | 0 | null | 1,490,752,133,000 | 1,490,752,132,000 | null | UTF-8 | Lean | false | false | 11,274 | 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, Mario Carneiro
Binary representation of integers using inductive types.
Note: Unlike in Coq, where this representation is preferred because of
the reliance ... |
30d0ca06978cea9df499a7bbae83cac743f2082a | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/tactic/squeeze.lean | 6f43d0c9e0faf676461bdbecdbbbede21411ee28 | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 13,240 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
-/
import control.traversable.basic
import tactic.simpa
open interactive interactive.types lean.parser
private meta def loc.to_string_aux : option name → string
| none := "⊢"... |
f9b59a96c9e4664e02ca297a28376b1e6333820c | 8eeb99d0fdf8125f5d39a0ce8631653f588ee817 | /src/algebra/ordered_ring.lean | 6e7dc0ccb238b31b4ab517a972b87883456424a7 | [
"Apache-2.0"
] | permissive | jesse-michael-han/mathlib | a15c58378846011b003669354cbab7062b893cfe | fa6312e4dc971985e6b7708d99a5bc3062485c89 | refs/heads/master | 1,625,200,760,912 | 1,602,081,753,000 | 1,602,081,753,000 | 181,787,230 | 0 | 0 | null | 1,555,460,682,000 | 1,555,460,682,000 | null | UTF-8 | Lean | false | false | 43,044 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro
-/
import algebra.ordered_group
set_option old_structure_cmd true
universe u
variable {α : Type u}
/-- An `ordered_semiring α` is a s... |
8a046557e57d0dfb5d9a9d9f9a3ff15d499051d6 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/cases_induction_fresh.lean | 7c27773163fadf7fc5c1d4066acd23ca33a9eaf3 | [
"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 | 646 | lean | example (p q r s: Prop): p ∧ q → r ∧ s → s ∧ q :=
begin
intros h1 h2,
cases h1,
cases h2,
trace_state,
constructor; assumption
end
example (p q r s: Prop): p ∧ q → r ∧ s → s ∧ q :=
begin
intros a a_1,
cases a,
cases a_1,
trace_state,
constructor; assumption
end
#print "------------"
example (p q ... |
8789c40429a04b0da0194844d04244da774ef6b4 | c2b0bd5aa4b3f4fb8a887fab57c5fc08be03aa01 | /applicative.lean | 0a26ef3160b820405403d389d9619e1ce74311a0 | [] | no_license | cipher1024/lambda-calc | f72aa6dedea96fc7831d1898f3150a18baefdf0b | 327eaa12588018c01b2205f3e4e0048de1d97afd | refs/heads/master | 1,625,672,854,392 | 1,507,233,523,000 | 1,507,233,523,000 | 99,383,225 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,302 | lean | universes u u₀ u₁ u₂ u₃
structure identity (α : Type u) : Type u :=
(run : α)
structure const (α : Type u) (β : Type u₀) : Type u :=
(run : α)
structure compose (f : Type u₁ → Type u₀) (g : Type u₂ → Type u₁) (α : Type u₂) : Type u₀ :=
(run : f (g α))
instance : monad identity :=
{ bind := λ α β x f, f x.run... |
1305640dcfbdb1e6da13669e07560426760cd9ce | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /tests/lean/hott/eq1.hlean | 420bb851e100f45d864f88341baa7d3a4f5896f6 | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 534 | hlean | open nat
inductive vector (A : Type) : nat → Type :=
nil {} : vector A zero,
cons : Π {n}, A → vector A n → vector A (succ n)
infixr `::` := vector.cons
definition swap {A : Type} : Π {n}, vector A (succ (succ n)) → vector A (succ (succ n)),
swap (a :: b :: vs) := b :: a :: vs
-- Remark: in the current approach f... |
3cbbb96d93f092c2eb880dc5ec228a32b8c6a335 | 0c1546a496eccfb56620165cad015f88d56190c5 | /library/init/algebra/field.lean | 20c062c2a107ab0cf984641b4c3af09d0ecd96f5 | [
"Apache-2.0"
] | permissive | Solertis/lean | 491e0939957486f664498fbfb02546e042699958 | 84188c5aa1673fdf37a082b2de8562dddf53df3f | refs/heads/master | 1,610,174,257,606 | 1,486,263,620,000 | 1,486,263,620,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,315 | lean | /-
Copyright (c) 2014 Robert Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Lewis, Leonardo de Moura
Structures with multiplicative and additive components, including division rings and fields.
The development is modeled after Isabelle's library.
-/
prel... |
4db3f01b5d7fbc7741092e57a305fb55ba4b272a | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/analysis/convex/basic_auto.lean | a4635554b995416ae5c7f20eeb8f62fade01125c | [] | 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 | 52,396 | lean | /-
Copyright (c) 2019 Alexander Bentkamp. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alexander Bentkamp, Yury Kudriashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.set.intervals.ord_connected
import Mathlib.data.set.intervals... |
c7d3e08cbd7657d7cdf98ecfa77ffdf41323ca22 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /src/Lean/Elab/Inductive.lean | 79bbedd5dd6ecf97583837c17adc4fc8659df09f | [
"Apache-2.0"
] | permissive | dupuisf/lean4 | d082d13b01243e1de29ae680eefb476961221eef | 6a39c65bd28eb0e28c3870188f348c8914502718 | refs/heads/master | 1,676,948,755,391 | 1,610,665,114,000 | 1,610,665,114,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,991 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Util.ReplaceLevel
import Lean.Util.ReplaceExpr
import Lean.Util.CollectLevelParams
import Lean.Util.Constructions
import Lean.Elab.Command
impor... |
ae2e58c022d7b98cf7a9adc554b576089080d027 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/group_power/ring.lean | 80e3dd7a3d76d345f36275359c2c8a3bd05d828a | [
"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,936 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis
-/
import algebra.group_power.basic
import algebra.group_with_zero.commute
import algebra.hom.ring
import algebra.ring.commute
import algebra.group_with_z... |
7beab3d134117223c770d343b24714beeda0035e | 4e3bf8e2b29061457a887ac8889e88fa5aa0e34c | /lean/love11_logical_foundations_of_mathematics_demo.lean | 7933383438e2afebc779880e3c1abb3d2a9ca34d | [] | no_license | mukeshtiwari/logical_verification_2019 | 9f964c067a71f65eb8884743273fbeef99e6503d | 16f62717f55ed5b7b87e03ae0134791a9bef9b9a | refs/heads/master | 1,619,158,844,208 | 1,585,139,500,000 | 1,585,139,500,000 | 249,906,380 | 0 | 0 | null | 1,585,118,728,000 | 1,585,118,727,000 | null | UTF-8 | Lean | false | false | 9,025 | lean | /- LoVe Demo 11: Logical Foundations of Mathematics -/
import .love05_inductive_predicates_demo_master
namespace LoVe
set_option pp.beta true
/- Type Universes -/
#check @and.intro
#check ∀a b : Prop, a → b → a ∧ b
#check Prop
#check ℕ
#check Type
#check Type 1
#check Type 2
-- ...
universe variables u v
#check... |
cc0447b6679dc06c7f72c9aecfbd8c0386b49d74 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/eisenstein_criterion.lean | 78fc40f281f19efb88c7a4bf962175ee50a6d313 | [
"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 | 5,743 | 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 data.nat.cast.with_top
import ring_theory.prime
import ring_theory.polynomial.content
import ring_theory.ideal.quotient_operations
/-!
# Eisenstein's criterion
> ... |
0c218abff5cb3cfa8b0e414440a4434626d5b8c6 | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/group_theory/subgroup.lean | 77a9fccc8fe1d56232b6d806ad535a53d6332fd6 | [
"Apache-2.0"
] | permissive | rspencer01/mathlib | b1e3afa5c121362ef0881012cc116513ab09f18c | c7d36292c6b9234dc40143c16288932ae38fdc12 | refs/heads/master | 1,595,010,346,708 | 1,567,511,503,000 | 1,567,511,503,000 | 206,071,681 | 0 | 0 | Apache-2.0 | 1,567,513,643,000 | 1,567,513,643,000 | null | UTF-8 | Lean | false | false | 28,051 | 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, Mitchell Rowett, Scott Morrison, Johan Commelin, Mario Carneiro,
Michael Howes
-/
import group_theory.submonoid
open set function
variables {α : Type*} {β : Type*} {... |
b1bdd5bde8d1ca63d67f9dcec6d6767854b26a61 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /stage0/src/Init/Data/Nat/Basic.lean | ebf7439bf3619eefecca1f315524445d850bf797 | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,354 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Leonardo de Moura
-/
prelude
import Init.Core
universes u
namespace Nat
set_option bootstrap.gen_matcher_code false in
@[extern "lean_nat_sub"]
protected def... |
6af54dbb2a6874c8188e7b909e792305438f9abc | c6ff7f82fbfbc4ed06a4edc8adf7239c6aba6945 | /src/ring_theory/algebra_tower.lean | fb3c6c57e7e31db759d5b2af3fe253159e412a7a | [
"Apache-2.0"
] | permissive | jpablo/mathlib | f14c9042506cce59176d3d22b457f190e78938a3 | fd453cf1569b8f9396476287b046d216e92224e4 | refs/heads/master | 1,690,443,975,886 | 1,631,043,219,000 | 1,631,043,219,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,493 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.algebra.restrict_scalars
import algebra.algebra.tower
import algebra.invertible
import linear_algebra.basis
import ring_theory.adjoin.basic
import ring_theory.po... |
773248e44ae83023263b7c5fd26dcde68cb8b207 | 9338c56dfd6ceacc3e5e63e32a7918cfec5d5c69 | /src/sheaves/locally_ringed_space.lean | 32e9a5db34986a6442c7e51e3b42c9b030450eab | [] | 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 | 3,146 | lean | /-
Locally ringed spaces.
https://stacks.math.columbia.edu/tag/01HA
-/
import topology.basic
import ring_theory.localization
import sheaves.presheaf_maps
import sheaves.presheaf_of_rings_maps
import sheaves.presheaf_of_rings
import sheaves.sheaf_of_rings
import sheaves.stalk_of_rings
universes u v w
open topolo... |
e435892f347484c072c47473e18df68900802ea9 | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/project_1_a_decrire/lean-scheme-submission/src/sheaves/presheaf_maps.lean | 22cfa56df5a8847c27a483a75dd3e7f5cd0707c2 | [] | no_license | Or7ando/lean | cc003e6c41048eae7c34aa6bada51c9e9add9e66 | d41169cf4e416a0d42092fb6bdc14131cee9dd15 | refs/heads/master | 1,650,600,589,722 | 1,587,262,906,000 | 1,587,262,906,000 | 255,387,160 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,802 | lean | /-
Continuous maps and presheaves.
https://stacks.math.columbia.edu/tag/008C
-/
import to_mathlib.opens
import sheaves.presheaf
import sheaves.stalk
universes u v w
open topological_space
variables {α : Type u} [topological_space α]
variables {β : Type v} [topological_space β]
variables {f : α → β} (Hf : conti... |
3b1c260abbb6560bcd3d7db13043c0e153b6c215 | 78269ad0b3c342b20786f60690708b6e328132b0 | /src/library_dev/topology/topological_space.lean | 37b455f56a93d61bd9d56a15a7611d61ab2c5b77 | [] | no_license | dselsam/library_dev | e74f46010fee9c7b66eaa704654cad0fcd2eefca | 1b4e34e7fb067ea5211714d6d3ecef5132fc8218 | refs/heads/master | 1,610,372,841,675 | 1,497,014,421,000 | 1,497,014,421,000 | 86,526,137 | 0 | 0 | null | 1,490,752,133,000 | 1,490,752,132,000 | null | UTF-8 | Lean | false | false | 25,793 | 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
Theory of topological spaces.
-/
import ..algebra.lattice.filter
open set filter lattice
universes u v w
structure topological_space (α : Type u) :=
(open' : se... |
91fb7a20e01af2789ab9ff923c0902e842566169 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/order/pilex.lean | 90244be72264c49752c42c5684e36a88adfef3dd | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 3,966 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import algebra.order_functions tactic.tauto algebra.pi_instances
variables {ι : Type*} {β : ι → Type*} (r : ι → ι → Prop)
(s : Π {i}, β i → β i → Prop)
def pi.lex (x... |
31a406411d134beaffaa313267a8c80940a263c2 | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /library/init/meta/smt/congruence_closure.lean | 3777874a36a28280bea2a89f6a1b65abaeaab7d6 | [
"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 | 5,353 | 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.interactive_base init.meta.tactic init.meta.set_get_option_tactics
structure cc_config :=
/- If tt, congruence closure will treat ... |
80c3ed75ebe704235a8a624431d01dc3a9dae93b | 36938939954e91f23dec66a02728db08a7acfcf9 | /lean/deps/galois_stdlib/src/galois/data/array.lean | 17f19f04cc24b5aa17e4d053ffba4318c182042e | [
"Apache-2.0"
] | permissive | pnwamk/reopt-vcg | f8b56dd0279392a5e1c6aee721be8138e6b558d3 | c9f9f185fbefc25c36c4b506bbc85fd1a03c3b6d | refs/heads/master | 1,631,145,017,772 | 1,593,549,019,000 | 1,593,549,143,000 | 254,191,418 | 0 | 0 | null | 1,586,377,077,000 | 1,586,377,077,000 | null | UTF-8 | Lean | false | false | 4,912 | lean | -- Additional definitions for arrays
import .array.lex_order
import ..algebra.order
import ..data.nat.basic
import ..data.list
import ..logic
namespace galois
open array
namespace array
universe u
/- rev_list -/
section rev_list
variables {n : ℕ} {α : Type u} {a : array n α}
theorem rev_list_reverse_aux : ∀ i (h... |
878583f8b3fd2382203b23ee2040c083a5589385 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/bool/all_any.lean | 2b7b3bbe292a7544feec8d380b316aae87a491fe | [
"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,620 | 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 data.list.basic
/-!
# Boolean quantifiers
This proves a few properties about `list.all` and `list.any`, which are the `bool` universal and
existential quanti... |
5046f4a13f2193ed11775a7c96897e1059236655 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/cubic_discriminant.lean | ae9d98ff2d568022b02e54af365905d88c61fa50 | [
"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 | 11,419 | lean | /-
Copyright (c) 2022 David Kurniadi Angdinata. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Kurniadi Angdinata
-/
import field_theory.splitting_field
/-!
# Cubics and discriminants
This file defines cubic polynomials over a semiring and their discriminants ... |
44855e6f24798f3c5ac9e267acb552a662b2f61a | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/bornology/basic.lean | c3aeef4234909753cd03196337436b29416efad7 | [
"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,135 | lean | /-
Copyright (c) 2022 Jireh Loreaux. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jireh Loreaux
-/
import order.filter.cofinite
/-!
# Basic theory of bornology
We develop the basic theory of bornologies. Instead of axiomatizing bounded sets and defining
bornologies... |
5ef9ad0a494698d5cf03405bc158b716047c29ff | 4727251e0cd73359b15b664c3170e5d754078599 | /src/linear_algebra/free_module/rank.lean | f4457a08efbbe1e71173bdf1985c94a5960489d9 | [
"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 | 4,959 | lean | /-
Copyright (c) 2021 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import linear_algebra.free_module.basic
import linear_algebra.finsupp_vector_space
/-!
# Rank of free modules
This is a basic API for the rank of free modules.
... |
1230745f0b2d64c9a2e1686f7ed7992a2a8e2ba7 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/t11.lean | f0e5ef7cfe7e45e825753e485d8e765a5bb7388f | [
"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 | 390 | lean | prelude constant A : Type.{1}
definition bool : Type.{1} := Type.{0}
constant Exists (P : A → bool) : bool
notation `exists` binders `, ` b:(scoped b, Exists b) := b
notation `∃` binders `, ` b:(scoped b, Exists b) := b
constant p : A → bool
constant q : A → A → bool
check exists x : A, p x
check ∃ x y : A, q x y
no... |
da58b3b9b9dff9d66fe2f15cc437144da1f8d4c3 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/algebra/lie/basic.lean | bc0159871f634ebad9896beb63dd095d200472f8 | [
"Apache-2.0"
] | permissive | stjordanis/mathlib | 51e286d19140e3788ef2c470bc7b953e4991f0c9 | 2568d41bca08f5d6bf39d915434c8447e21f42ee | refs/heads/master | 1,631,748,053,501 | 1,627,938,886,000 | 1,627,938,886,000 | 228,728,358 | 0 | 0 | Apache-2.0 | 1,576,630,588,000 | 1,576,630,587,000 | null | UTF-8 | Lean | false | false | 26,620 | lean | /-
Copyright (c) 2019 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import data.bracket
import algebra.algebra.basic
import tactic.noncomm_ring
/-!
# Lie algebras
This file defines Lie rings and Lie algebras over a commutative ring togeth... |
42409c6a7a12489586e4f8d30fb8f74ce2aeff58 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/algebra/star/self_adjoint.lean | ded683b24709057f70a866f20b811d5cbda04303 | [
"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 | 13,789 | lean | /-
Copyright (c) 2021 Frédéric Dupuis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frédéric Dupuis
-/
import algebra.star.basic
import group_theory.subgroup.basic
/-!
# Self-adjoint, skew-adjoint and normal elements of a star additive group
This file defines `sel... |
dcc0bb0fd40a8a094ef41ba60f82eca786222076 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/topology/algebra/group.lean | abc1dbe62ad8318a7182def4e47e578942267716 | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 20,773 | 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, Patrick Massot
Theory of topological groups.
-/
import order.filter.pointwise
import group_theory.quotient_group
import topology.algebra.monoid
import... |
357866f06b9139f8d81d22d8b36a50eeef3aec2a | 0cdd90d2d613d48e567989a6bb0c5808ed4ad727 | /src/happy_number.lean | 647722e04bb6102b0a77d0a7b425819bda34e5fd | [
"MIT"
] | permissive | SnobbyDragon/happynumbers | e749077a6aed5b6158f168293466130c729ddbcc | e71d1c05d461a27db7dfbaa34561ad7c1e141836 | refs/heads/master | 1,669,489,237,904 | 1,596,426,948,000 | 1,596,426,948,000 | 275,297,492 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,067 | lean | import tactic
import data.nat.digits
import logic.basic
import data.list
namespace happynumber
section definitions
-- Perfect digital invariant (a.k.a. happy function)
-- the sum of the pth (p > 0) power of digits of a natural number n in a base b > 1
def happyfunction (p : ℕ) (b : ℕ) : ℕ → ℕ
| n := ((digits b n).ma... |
46f0607f82b46da99924d612bdbab56b3ed9c7ad | 4bddde0d06fbd53be6f23d7f5899998e8f63410b | /src/tactic/iconfig/struct.lean | 5cd71aa78070bf3efc7d3b81b103546198c87dcd | [] | no_license | khoek/libiconfig | 4816290a5862af14b07683b3d2663e8e62832ef4 | 6f55c50bc5d852d26ee5ee4c5b52b2cda2a852e5 | refs/heads/master | 1,586,109,683,212 | 1,559,567,916,000 | 1,559,567,916,000 | 157,085,466 | 0 | 1 | null | 1,559,567,917,000 | 1,541,945,134,000 | Lean | UTF-8 | Lean | false | false | 1,135 | lean | import .types
namespace iconfig
open tactic cfgopt
meta def is_valid_config (n : name) : tactic bool :=
(to_expr $ pexpr.mk_structure_instance ⟨some n, [], [], []⟩) >> return tt
<|> return ff
meta def assert_valid_config (n : name) : tactic unit := do
r ← is_valid_config n,
if r then skip else fail format!"... |
7a03d8dc443822f4968c71218d774b9caab0587f | 7c92a46ce39266c13607ecdef7f228688f237182 | /src/Spa/space.lean | 80b05f4a19439e7021bef73dbced87189ec6238a | [
"Apache-2.0"
] | permissive | asym57/lean-perfectoid-spaces | 3217d01f6ddc0d13e9fb68651749469750420767 | 359187b429f254a946218af4411d45f08705c83e | refs/heads/master | 1,609,457,937,251 | 1,577,542,616,000 | 1,577,542,675,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,662 | lean | import continuous_valuations
import Huber_pair
/-!
# The adic spectrum as a topological space
In this file we define a structure (`rational_open_data`) that will parameterise
a basis for the topology on the adic spectrum of a Huber pair.
-/
open_locale classical
local attribute [instance] set.pointwise_mul_comm_semi... |
f82074435eb398a123c16ab9a0e86e2de2bfe270 | 12dabd587ce2621d9a4eff9f16e354d02e206c8e | /world03/level06.lean | 04bf09bc2b74e5aff7a28a03766b9e11ab3374a9 | [] | no_license | abdelq/natural-number-game | a1b5b8f1d52625a7addcefc97c966d3f06a48263 | bbddadc6d2e78ece2e9acd40fa7702ecc2db75c2 | refs/heads/master | 1,668,606,478,691 | 1,594,175,058,000 | 1,594,175,058,000 | 278,673,209 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 202 | lean | lemma succ_mul (a b : mynat) : succ a * b = a * b + b :=
begin
induction b with h hd,
repeat {rw mul_zero},
refl,
rw mul_succ,
rw mul_succ,
rw hd,
rw add_succ,
rw add_succ,
rw add_right_comm,
refl,
end
|
8b7028a152175f36c52b9947b5efc79193dbe87f | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/period_after_eqns.lean | 6d3985368db7637a7b0d7a9317260a5ffc6d492f | [
"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 | 55 | lean | def f : nat → nat
| 0 := 1
| (a+1) := 1
.
#check 10
|
34c82ae8d77923d37aa391f20bf0353db2d11f46 | 367134ba5a65885e863bdc4507601606690974c1 | /src/set_theory/game/short.lean | b579e1f5bd5218bb66091e305453cffe1dd6c79b | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 8,720 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import set_theory.game
import data.fintype.basic
/-!
# Short games
A combinatorial game is `short` [Conway, ch.9][conway2001] if it has only finitely many positions... |
b40ede235f815e52f29015a1f2a30e4485f231d3 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/algebra/monoid_algebra/grading.lean | dc5b3b1092c129c66094bbdca4864d1ec38618be | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,849 | lean | /-
Copyright (c) 2021 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import algebra.monoid_algebra.to_direct_sum
import linear_algebra.finsupp
/-!
# Internal grading of an `add_monoid_algebra`
In this file, we show that an `add_monoid_alge... |
d58fe8824a823aa89eadf391edebe8b89fed4138 | 78269ad0b3c342b20786f60690708b6e328132b0 | /src/library_dev/algebra/lattice/basic_experiment.lean | e4dc791b3d8f278f19aa37e146177d041acbc2b8 | [] | no_license | dselsam/library_dev | e74f46010fee9c7b66eaa704654cad0fcd2eefca | 1b4e34e7fb067ea5211714d6d3ecef5132fc8218 | refs/heads/master | 1,610,372,841,675 | 1,497,014,421,000 | 1,497,014,421,000 | 86,526,137 | 0 | 0 | null | 1,490,752,133,000 | 1,490,752,132,000 | null | UTF-8 | Lean | false | false | 9,490 | 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
Defines the inf/sup (semi)-lattice with optionally top/bot type class hierarchy.
-/
import ..order ...tools.auto.finish
open auto
set_option old_structure_cmd true
u... |
b3f192cf1b5f8105583fb45adb8669d3a0db0e2f | 4fa161becb8ce7378a709f5992a594764699e268 | /test/nth_rewrite.lean | 257d4347f179787aa29df1f2bd4d496a9909b78f | [
"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 | 3,169 | lean | /-
Copyright (c) 2018 Keeley Hoek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Keeley Hoek, Scott Morrison
-/
import tactic.nth_rewrite
import init_.data.nat.lemmas
import data.vector
structure F :=
(a : ℕ)
(v : vector ℕ a)
(p : v.val = [])
example (f : F) : f.v.v... |
759f745bc167f06145fce64101cff1a86fb00c94 | 54d7e71c3616d331b2ec3845d31deb08f3ff1dea | /tests/lean/run/infix_paren.lean | 0b71264bf161c7f15f902e9faeb8f4ae88a6913f | [
"Apache-2.0"
] | permissive | pachugupta/lean | 6f3305c4292288311cc4ab4550060b17d49ffb1d | 0d02136a09ac4cf27b5c88361750e38e1f485a1a | refs/heads/master | 1,611,110,653,606 | 1,493,130,117,000 | 1,493,167,649,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 555 | lean | open list
#eval filter (< 10) [20, 5, 10, 3, 2, 14, 1]
#eval qsort (<) [20, 5, 10, 3, 2, 14, 1]
#eval foldl (+) 0 [1, 2, 3]
example : foldl (+) 0 [3, 4, 1] = 8 :=
rfl
example : foldl (*) 2 [3, 4, 1] = 24 :=
rfl
#check (+) 1 2
example : (+) 1 2 = 3 :=
rfl
example : (*) 3 4 = 12 :=
rfl
example : (++) [1,2] [3,4] =... |
90ebef3ad03825e60bc79be0c861c957a5230eb7 | 2bafba05c98c1107866b39609d15e849a4ca2bb8 | /src/week_5/Part_B_topology.lean | c50829548ce989076dd9788f9fc46c2dfadfae11 | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/formalising-mathematics | b54c83c94b5c315024ff09997fcd6b303892a749 | 7cf1d51c27e2038d2804561d63c74711924044a1 | refs/heads/master | 1,651,267,046,302 | 1,638,888,459,000 | 1,638,888,459,000 | 331,592,375 | 284 | 24 | Apache-2.0 | 1,669,593,705,000 | 1,611,224,849,000 | Lean | UTF-8 | Lean | false | false | 5,478 | lean | import topology.subset_properties
variables (X Y : Type) [topological_space X] [topological_space Y] (f : X → Y)
open filter set
open_locale filter -- for 𝓟
open_locale topological_space -- for 𝓝
/-
## Neighbourhood filters
If `α` is a topological space and `a : α` then `𝓝 a` is the following
filter on `α`: `... |
bab527c0289ff4524a5ab03165244f5cdaa25f7a | 737dc4b96c97368cb66b925eeea3ab633ec3d702 | /stage0/src/Lean/Meta/Match/Match.lean | d02354efee755bdeb043f3e2b718ae81ebf75c5e | [
"Apache-2.0"
] | permissive | Bioye97/lean4 | 1ace34638efd9913dc5991443777b01a08983289 | bc3900cbb9adda83eed7e6affeaade7cfd07716d | refs/heads/master | 1,690,589,820,211 | 1,631,051,000,000 | 1,631,067,598,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 41,153 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Util.CollectLevelParams
import Lean.Util.Recognizers
import Lean.Compiler.ExternAttr
import Lean.Meta.Check
import Lean.Meta.Closure
import Lean... |
5b226cad552d0a51b85e8e50f194d78ee0b65560 | f00cc9c04d77f9621aa57d1406d35c522c3ff82c | /library/init/core.lean | ad2c2698b95fbe4b1c4d52f3934ac8b7e944423b | [
"Apache-2.0"
] | permissive | shonfeder/lean | 444c66a74676d74fb3ef682d88cd0f5c1bf928a5 | 24d5a1592d80cefe86552d96410c51bb07e6d411 | refs/heads/master | 1,619,338,440,905 | 1,512,842,340,000 | 1,512,842,340,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,331 | 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
notation, basic datatypes and type classes
-/
prelude
notation `Prop` := Sort 0
notation f ` $ `:1 a:0 := f a
/- Logical operations and relations -/
reserv... |
e951dc82a95e5826e21a98d99332716d80a5fd62 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/linear_algebra/matrix/nondegenerate.lean | 9c76a186f06802fe6e3f6871cefda3224641ac53 | [
"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 | 2,646 | 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 data.matrix.basic
import linear_algebra.matrix.determinant
import linear_algebra.matrix.adjugate
/-!
# Matrices associated with non-degenerate bilinear forms
> THI... |
ba89882abc718f2e9f7bd0f5f1cfabcd7b817e19 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/complex/schwarz.lean | 4e72bd775073aee74d2dbb40626dc9a3e02c3fd0 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 10,032 | lean | /-
Copyright (c) 2022 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import analysis.complex.abs_max
import analysis.complex.removable_singularity
/-!
# Schwarz lemma
In this file we prove several versions of the Schwarz lemm... |
91dd48af3381cadf5b7131630840af072e1e280a | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/order/iterate.lean | f45b9053df2da37ab817243cf8b46b2ef00389f7 | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,383 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import logic.function.iterate
import data.nat.basic
/-!
# Inequalities on iterates
In this file we prove some inequalities comparing `f^[n] x` and `g^[n] x`... |
2da2421e97f3eb50dd55d49672e793ecf4c540f6 | fbf512ee44de430e3d3c5869751ad95325c938d7 | /tactic.lean | 0e6c9f35781b1efbbeedfe82c50be4121035ebf7 | [] | no_license | skbaek/clausify | 4858c9005fb86a5e410bfcaa77524f82d955f655 | d09b071bdcce7577c3fffacd0893b776285b1590 | refs/heads/master | 1,588,360,590,818 | 1,553,553,880,000 | 1,553,553,880,000 | 177,644,542 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 715 | lean | open expr tactic
meta def unifies_with_and (x : expr) : tactic (expr × expr) :=
do mv1 ← mk_meta_var `(Prop),
mv2 ← mk_meta_var `(Prop),
tactic.unify x `(%%mv1 ∧ %%mv2),
return (mv1,mv2)
meta def split_ands_core : list expr → tactic unit
| [] := skip
| (x::xs) :=
try (do
(px,qx) ← infer_type x >>= ... |
5222ff45510d559f3290ea1fe02147028eae3399 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/linear_algebra/tensor_product.lean | 0fc5732514bf36402c0206d2235ff5e82a639ce1 | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 16,024 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Mario Carneiro
Tensor product of modules over commutative rings.
-/
import group_theory.free_abelian_group
import linear_algebra.direct_sum_module
variables {R : Type*} [comm... |
d9227b012b200c6ff6ad88a46ee15d5a4971a0ea | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/linear_algebra/exterior_algebra.lean | dde36fd297534e28567fc3b4eb5c97b7cbe2e00f | [
"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 | 10,038 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhangir Azerbayev, Adam Topaz, Eric Wieser
-/
import algebra.ring_quot
import linear_algebra.tensor_algebra
import linear_algebra.alternating
import group_theory.perm.sign
/-!
# Exterior... |
341fe3f1d658480e59f2d83963449abe9da54d53 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/probability/process/adapted.lean | a483a31db3c44f2a3f8f1801e523c93a2673c201 | [
"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,032 | lean | /-
Copyright (c) 2021 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.filtration
import topology.instances.discrete
/-!
# Adapted and progressively measurable processes
> THIS FILE IS SYNCHRONIZED WI... |
bff3b74389e301848cdeb1cefd3d0569c96c037c | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/logic/relation.lean | d27e6bff4b721e008a52549a8677d860c3139719 | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 13,192 | 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
Transitive reflexive as well as reflexive closure of relations.
-/
import tactic.basic
variables {α : Type*} {β : Type*} {γ : Type*} {δ : Type*}
namespace relation
se... |
39fed535b8ab068a48e3b822a2c434293723985c | bb31430994044506fa42fd667e2d556327e18dfe | /src/algebra/big_operators/intervals.lean | ac3699ea592de502902d547d6eeee33fb44d42d5 | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 10,487 | 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
-/
import algebra.big_operators.basic
import algebra.module.basic
import data.nat.interval
import tactic.linarith
/-!
# Results about big operators over intervals
We ... |
a28aeb983a1e7d92a0ab6bf2a0a516e55d3e7c23 | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/nat/with_bot.lean | 7c369ce1d50c2108265a04fe53d404ab28fda870 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 1,854 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.nat.basic
import algebra.ordered_group
/-!
# `with_bot ℕ`
Lemmas about the type of natural numbers with a bottom element adjoined.
-/
namespace nat
lemma wi... |
9bda8bede1ae4f25cdc1b8e00b2dee33db8d3501 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/deprecated/submonoid_auto.lean | 5a3a0a336fbf89f68f7b32b93a4d36c61d8b7122 | [] | 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 | 17,862 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.group_theory.submonoid.basic
impo... |
54353682049064044c729e0be6b214211456e909 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/normed/group/SemiNormedGroup/kernels.lean | 0dc24df7e08d082df71d182e6effaf366994c380 | [
"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 | 13,247 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca, Johan Commelin, Scott Morrison
-/
import analysis.normed.group.SemiNormedGroup
import analysis.normed.group.quotient
import category_theory.limits.shapes.kernels
/-!
... |
b870fcaf31fdd752825e10f654c05ab7de67ab4b | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/Util/FoldConsts.lean | 315119046510562fc5c66fff3192cc95eb7c1444 | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,695 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Expr
import Lean.Environment
namespace Lean
namespace Expr
namespace FoldConstsImpl
abbrev cacheSize : USize := 8192
structure State :=
(visi... |
f4420e32a199fd9ee5bedfce40aef8e9053f1d7c | 853df553b1d6ca524e3f0a79aedd32dde5d27ec3 | /src/order/filter/cofinite.lean | 466f7615f94404522834ea0883e12d1b49e2c0e8 | [
"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 | 2,289 | 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, Jeremy Avigad, Yury Kudryashov
-/
import order.filter.at_top_bot
/-!
# The cofinite filter
In this file we define
`cofinite`: the filter of sets with finite compleme... |
07d0827458ee65b48669e51aab1285b0f6e8c0f9 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /library/logic/axioms/classical.lean | 77353544453416990f756d6325d410f34037cc97 | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 281 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: logic.axioms.classical
Author: Jeremy Avigad
-/
import logic.axioms.prop_complete logic.axioms.hilbert
import logic.axioms.prop_decidable
|
a8d131151ed6850d6b6aef3f6543b2bbb6631772 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/cc_constructors.lean | a1f370febc43490635fdbaa75877edd6c18132e6 | [
"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 | 1,826 | lean | open tactic
example (a b : nat) (s t : list nat) : a::s = b::t → a ≠ b → false :=
by cc
example (a b : nat) (s t : list nat) : a::s = b::t → t ≠ s → false :=
by cc
example (a c b : nat) (s t : list nat) : a::s = b::t → a ≠ c → c = b → false :=
by cc
example (a c b : nat) (s t : list nat) : a::a::s = a::b::t → a ≠ c... |
853478a818a3429663761d206c9decb0bdd19baf | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Parser/Level.lean | c49cb80a69b06f86865b1329cb27b5715b1a9d6d | [
"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,038 | 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, Sebastian Ullrich
-/
import Lean.Parser.Extra
namespace Lean
namespace Parser
builtin_initialize
registerBuiltinParserAttribute `builtinLevelParser `level... |
8f8ef61821c96bd8edec3c20c1b044f958aaf21d | 19cc34575500ee2e3d4586c15544632aa07a8e66 | /src/analysis/special_functions/pow.lean | 1c459f3ae90373721638a9b5c2c804e50a6fbae6 | [
"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 | 52,593 | 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... |
8e5fc39ec0371df4850792511c8aa1a5c11e9f68 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /tests/lean/mvar3.lean | 026ad0ece54435298dfdabe727fcc510e6ce7bb4 | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,864 | lean | import Lean.MetavarContext
open Lean
def mkLambdaTest (mctx : MetavarContext) (ngen : NameGenerator) (lctx : LocalContext) (xs : Array Expr) (e : Expr)
: Except MetavarContext.MkBinding.Exception (MetavarContext × NameGenerator × Expr) :=
match MetavarContext.mkLambda xs e false true lctx { mctx := mctx, ngen := ... |
4f2b9dff44b663be034a373fd0eb11cee49795ae | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/data/polynomial/eval.lean | 605388058e22d1e311383b94c6d0f49f9592d1fd | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 19,021 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import data.polynomial.induction
import data.polynomial.degree.basic
import deprecated.ring
/-!
# Theory of univariate po... |
f32f6365bc7ec79af835bdd75f238484cdc7ee2d | bb31430994044506fa42fd667e2d556327e18dfe | /src/algebra/field/basic.lean | 0beeca085d3fb9664c7c08bf6b9444f0694ff9d0 | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 13,378 | lean | /-
Copyright (c) 2014 Robert Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Lewis, Leonardo de Moura, Johannes Hölzl, Mario Carneiro
-/
import algebra.field.defs
import algebra.group_with_zero.units.lemmas
import algebra.hom.ring
import algebra.ring.inj_s... |
53e696de53944597788bc636cdf2ed262454b4f8 | 618003631150032a5676f229d13a079ac875ff77 | /src/algebra/default.lean | ca5733cb22ae5c19cc6c3e2cdaa07392b9a20c80 | [
"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 | 43 | lean | import algebra.group
import algebra.module
|
cc6417da0b726df338c58480d994725c87a841f6 | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/nat/parity.lean | bce772492a353f5fe042ab94a457a093e749349f | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 8,217 | lean | /-
Copyright (c) 2019 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Benjamin Davidson
The `even` and `odd` predicates on the natural numbers.
-/
import data.nat.modeq
namespace nat
variables {m n : ℕ}
@[simp] theorem mod_two_ne_one : ... |
1e855d971e5cced71d99962b7563f960169298a2 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/measure_theory/measure/haar_lebesgue.lean | e6cf45bc7797c6f0962b0f6e5577aeb87de062f6 | [
"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 | 40,061 | lean | /-
Copyright (c) 2021 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Sébastien Gouëzel
-/
import measure_theory.measure.lebesgue
import measure_theory.measure.haar
import linear_algebra.finite_dimensional
import analysis.normed_space... |
9ac7418c73011ce0fc073553eebf289d5c6447e8 | 958488bc7f3c2044206e0358e56d7690b6ae696c | /lean/instance.lean | 96ca2cef1e0fa113cd57e49adfba0b8158637445 | [] | no_license | possientis/Prog | a08eec1c1b121c2fd6c70a8ae89e2fbef952adb4 | d4b3debc37610a88e0dac3ac5914903604fd1d1f | refs/heads/master | 1,692,263,717,723 | 1,691,757,179,000 | 1,691,757,179,000 | 40,361,602 | 3 | 0 | null | 1,679,896,438,000 | 1,438,953,859,000 | Coq | UTF-8 | Lean | false | false | 371 | lean | variable {α : Type}
def isPrefix (xs : list α) (ys : list α) : Prop :=
∃ (t : list α), xs ++ t = ys
instance list_has_le : has_le (list α) := ⟨isPrefix⟩
lemma list.isPrefixRelf : ∀ (xs : list α), xs ≤ xs :=
assume xs, ⟨[], by simp⟩
section
local attribute [instance] list_has_le
lemma foo (xs : list α): xs ≤ xs... |
740e0b280ce7435c3b831fd8e20c1230900998f2 | 91b8df3b248df89472cc0b753fbe2bac750aefea | /experiments/lean/src/ddl/binary/default.lean | a51d2d4141b77a3a0c70420559c9caea591ad460 | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | yeslogic/fathom | eabe5c4112d3b4d5ec9096a57bb502254ddbdf15 | 3960a9466150d392c2cb103c5cb5fcffa0200814 | refs/heads/main | 1,685,349,769,736 | 1,675,998,621,000 | 1,675,998,621,000 | 28,993,871 | 214 | 11 | Apache-2.0 | 1,694,044,276,000 | 1,420,764,938,000 | Rust | UTF-8 | Lean | false | false | 149 | lean | import ddl.binary.basic
import ddl.binary.formation
import ddl.binary.kinding
import ddl.binary.monad
import ddl.binary.repr
import ddl.binary.subst
|
2376ebf6ff569b0197764dd0819894298da1d7b5 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/big_operators/nat_antidiagonal.lean | 3a9b8428ab5d395ea9bd497634c3d6e90224182f | [
"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,852 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import data.finset.nat_antidiagonal
import algebra.big_operators.basic
/-!
# Big operators for `nat_antidiagonal`
This file contains theorems relevant to big opera... |
5908e7637ae6b111de1358bbb77e7aac5643f23c | 675b8263050a5d74b89ceab381ac81ce70535688 | /src/data/real/nnreal.lean | 815793f13a9a6a2d135c3a65f37adf0924a4b7d2 | [
"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 | 29,057 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import algebra.linear_ordered_comm_group_with_zero
import algebra.big_operators.ring
import data.real.basic
import data.indicator_function
/-!
# Nonnegative real num... |
306daa3f75ddf0a3bfb69b8b9826cf0a65be982c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/witt_vector/discrete_valuation_ring.lean | f44bfbc19e7a62beed7a1df38829b420c43b561f | [
"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,211 | lean | /-
Copyright (c) 2022 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis, Heather Macbeth, Johan Commelin
-/
import ring_theory.witt_vector.domain
import ring_theory.witt_vector.mul_coeff
import ring_theory.discrete_valuation_ring.basic
im... |
6893cb036a97e8feb3a824fabdee67a307eac3e9 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /tests/lean/run/n4.lean | 6e2e9fb04159cb4142b9a022a4e375a75c42f0b8 | [
"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 | 440 | lean | prelude
definition Prop : Type.{1} := Type.{0}
section
variable N : Type.{1}
variables a b c : N
variable and : Prop → Prop → Prop
local infixr `∧`:35 := and
variable le : N → N → Prop
variable lt : N → N → Prop
precedence `≤`:50
precedence `<`:50
local infixl ≤ := le
local infixl < := lt
check a ... |
81a2b042c5dfbac48c047ad11b2229869bf63183 | f4bff2062c030df03d65e8b69c88f79b63a359d8 | /src/game/series/tempLevel03.lean | 32c6c3b05c8d36d18c8e54ce6f7cd71bfb1061eb | [
"Apache-2.0"
] | permissive | adastra7470/real-number-game | 776606961f52db0eb824555ed2f8e16f92216ea3 | f9dcb7d9255a79b57e62038228a23346c2dc301b | refs/heads/master | 1,669,221,575,893 | 1,594,669,800,000 | 1,594,669,800,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,573 | lean | import game.series.tempLevel02
variable X : Type --hide
namespace xena
/-
Idea 03: comparison test
-/
/- Lemma
Suppose $0 ≤ a_n ≤ b_n$ for all n ∈ ℕ. If $∑ b_n$ converges
then $∑ a_n$ converges and $∑ a_n ≤ ∑ b_n$.
-/
theorem comparison_test (a b : ℕ → ℝ)
(h1 : ∀ (n : ℕ), 0 ≤ a n)
(h2 : ∀ (n : ℕ), a n ≤ b n) :
s... |
b7c07195634b95e37e72fa34f963185e66656db6 | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/polyhedral_lattice/Hom.lean | 250cae3e815044435d7f3b02f753cac65bbab5aa | [] | no_license | Ja1941/lean-liquid | fbec3ffc7fc67df1b5ca95b7ee225685ab9ffbdc | 8e80ed0cbdf5145d6814e833a674eaf05a1495c1 | refs/heads/master | 1,689,437,983,362 | 1,628,362,719,000 | 1,628,362,719,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,272 | lean | import polyhedral_lattice.pseudo_normed_group
import polyhedral_lattice.int
import polyhedral_lattice.category
import pseudo_normed_group.category
/-!
# Category-theoretic Hom(Λ, M)
If Λ is a polyhedral lattice then Hom(Λ, -) is a functor from profinitely filtered
pseudo-normed groups equipped with T⁻¹ to itself. Fu... |
b92d66a40a1e66d4e5dcef2fec41a5d6854cd32e | 94e33a31faa76775069b071adea97e86e218a8ee | /src/algebra/category/FinVect/limits.lean | e27d7c05aa3c239001bbd87355cb3b7a1e969ced | [
"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 | 2,850 | lean | /-
Copyright (c) 2022 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.category.FinVect
import algebra.category.Module.limits
import algebra.category.Module.products
import algebra.category.Module.epi_mono
import category_... |
2072bfe7507922aeab41153d8803336df70866d5 | c3f2fcd060adfa2ca29f924839d2d925e8f2c685 | /library/data/list/default.lean | 521bd8a30309ca0a552a37bfb59ad53de67ca0ad | [
"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 | 186 | lean | -- Copyright (c) 2014 Microsoft Corporation. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Jeremy Avigad
import data.list.basic
|
0fb3d7c4aba418f5274d165fcd9e0f90f9444ce4 | 618003631150032a5676f229d13a079ac875ff77 | /src/category_theory/sums/basic.lean | 5f93ad854be9d349c1dc991f0cb62641e490bfde | [
"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 | 5,031 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.eq_to_hom
/-#
Disjoint unions of categories, functors, and natural transformations.
-/
namespace category_theory
universes v₁ u₁ -- declare ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.