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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
b8baad382d553842570ea9c1a60230e0f94b0fe5 | f3a5af2927397cf346ec0e24312bfff077f00425 | /src/game/world4/level7.lean | da0855dc57a5c1dfa3a42ecade4d80fbb8c93766 | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/natural_number_game | 05c39e1586408cfb563d1a12e1085a90726ab655 | f29b6c2884299fc63fdfc81ae5d7daaa3219f9fd | refs/heads/master | 1,688,570,964,990 | 1,636,908,242,000 | 1,636,908,242,000 | 195,403,790 | 277 | 84 | Apache-2.0 | 1,694,547,955,000 | 1,562,328,792,000 | Lean | UTF-8 | Lean | false | false | 808 | lean | import game.world4.level6 -- hide
namespace mynat -- hide
/-
# Power World
## Level 7: `pow_pow`
-/
/-
Boss level! What will the collectible be?
-/
/- Lemma
For all naturals $a$, $m$, $n$, we have $(a ^ m) ^ n = a ^ {mn}$.
-/
lemma pow_pow (a m n : mynat) : (a ^ m) ^ n = a ^ (m * n) :=
begin [nat_num_game]
induc... |
b82028e48a90aa2d4b815c3d1e9f4c25e2e62eb6 | f3a5af2927397cf346ec0e24312bfff077f00425 | /src/game/world4/level6.lean | 644d8a5fd6fc34deed142ad154add8324af5f677 | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/natural_number_game | 05c39e1586408cfb563d1a12e1085a90726ab655 | f29b6c2884299fc63fdfc81ae5d7daaa3219f9fd | refs/heads/master | 1,688,570,964,990 | 1,636,908,242,000 | 1,636,908,242,000 | 195,403,790 | 277 | 84 | Apache-2.0 | 1,694,547,955,000 | 1,562,328,792,000 | Lean | UTF-8 | Lean | false | false | 686 | lean | import game.world4.level5 -- hide
namespace mynat -- hide
/-
# Power World
## Level 6: `mul_pow`
You might find the tip at the end of level 9 of Multiplication World
useful in this one. You can go to the main menu and pop back into
Multiplication World and take a look -- you won't lose any of your
proofs. You'll o... |
a39767fbebcb5eaa1e5df7933d9ea49c5a861fc1 | fecda8e6b848337561d6467a1e30cf23176d6ad0 | /src/data/set/basic.lean | 827130299ed8f35ecf6f9859ca30dea7ad554269 | [
"Apache-2.0"
] | permissive | spolu/mathlib | bacf18c3d2a561d00ecdc9413187729dd1f705ed | 480c92cdfe1cf3c2d083abded87e82162e8814f4 | refs/heads/master | 1,671,684,094,325 | 1,600,736,045,000 | 1,600,736,045,000 | 297,564,749 | 1 | 0 | null | 1,600,758,368,000 | 1,600,758,367,000 | null | UTF-8 | Lean | false | false | 88,702 | 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
-/
import logic.unique
import order.boolean_algebra
/-!
# Basic properties of sets
Sets in Lean are homogeneous; all their elements have the same type... |
2d321efaffbe504c55256ba2a86b9182c4926010 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/data/mv_polynomial/basic.lean | 7cd02f8f2ec2835723aab333f792fefb2d973f2c | [
"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 | 37,012 | 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, Johan Commelin, Mario Carneiro
-/
import data.polynomial.eval
import data.finsupp.antidiagonal
/-!
# Multivariate polynomials
This file defines polynomial rings over... |
68ac816ca4fb138c87a1db8a8aa61d5e6924cacb | 97f752b44fd85ec3f635078a2dd125ddae7a82b6 | /library/data/hf.lean | d75eb373b34771d719ac3925a3ba6c7df80ac747 | [
"Apache-2.0"
] | permissive | tectronics/lean | ab977ba6be0fcd46047ddbb3c8e16e7c26710701 | f38af35e0616f89c6e9d7e3eb1d48e47ee666efe | refs/heads/master | 1,532,358,526,384 | 1,456,276,623,000 | 1,456,276,623,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 25,404 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
Hereditarily finite sets: finite sets whose elements are all hereditarily finite sets.
Remark: all definitions compute, however the performace is quite poor s... |
b583ee8946f43570f598d4a4ec6c1c0618902723 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /tests/lean/auxDeclIssue.lean | 1d4b3484b1ba7fd8082118c4e4da2a5d9c8f2e38 | [
"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 | 375 | lean |
theorem ex1 : False :=
by {
assumption -- should not use the auxiliary declaration `ex1 : False`
}
variables (x y : Nat) in
theorem ex2 : x = y :=
by {
subst x; -- should not use the auxiliary declaration `ex2 : x = y`
exact rfl
}
set_option pp.auxDecls true in
theorem ex1 : False :=
by {
assumption -- sh... |
bb6b59ccaa868ea780a11261e7932271ac0f8eed | c777c32c8e484e195053731103c5e52af26a25d1 | /src/data/real/sqrt.lean | c8f1337bd8715173752d7ad8c2ff3513f9074477 | [
"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 | 13,687 | lean | /-
Copyright (c) 2020 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Floris van Doorn, Yury Kudryashov
-/
import topology.algebra.order.monotone_continuity
import topology.instances.nnreal
import tactic.positivity
/-!
# Square root of a... |
1772209a230063b6bc3dd49e37c5cfe142265e2b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/set_theory/lists.lean | c45a4fb7c6d2b152e38ce3d87cb9e45a81b7d21f | [
"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 | 15,007 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.list.basic
/-!
# A computable model of ZFA without infinity
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a correspondin... |
b0e49e2270e089ca145b356c257b5dd5adb8ff57 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/fintype/card.lean | 6e8b7940582bfd93855b3dd111b7f971ecf1ca1d | [] | 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 | 16,209 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.fintype.basic
import Mathlib.algebra.big_operators.ring
import Mathlib.PostPort
univer... |
72a79e59711fa1739554332b5bb6889a87022b9d | 4da0c8e61fcd6ec3f3be47ee14a038850c03d0c3 | /src/s5/soundness.lean | 6748472029534279ed85411ecebab0630942aeaa | [
"Apache-2.0"
] | permissive | bbentzen/mpl | fcbea60204bc8fd64667e0f76a5cebf4b67fb6ca | bb5066ec51fa11a4b66f440c4f6c9a3d8fb2e0de | refs/heads/master | 1,625,175,849,308 | 1,624,207,634,000 | 1,624,207,634,000 | 142,774,375 | 9 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,654 | lean | /-
Copyright (c) 2018 Bruno Bentzen. All rights reserved.
Released under the Apache License 2.0 (see "License");
Author: Bruno Bentzen
-/
import .syntax.lemmas .semantics.lemmas
variable {σ : nat}
/- soundness -/
theorem sndnss {Γ : ctx σ} {p : form σ} :
(Γ ⊢ₛ₅ p) → (Γ ⊨ₛ₅ p) :=
begin
intro h,
... |
92c2594f6455e7538ce5a575d7d4e07828b2403f | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/ring_theory/finiteness.lean | fa104317c0f77ec5a96aa36299aab45361dc6f78 | [
"Apache-2.0"
] | permissive | hikari0108/mathlib | b7ea2b7350497ab1a0b87a09d093ecc025a50dfa | a9e7d333b0cfd45f13a20f7b96b7d52e19fa2901 | refs/heads/master | 1,690,483,608,260 | 1,631,541,580,000 | 1,631,541,580,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 33,190 | 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 ring_theory.noetherian
import ring_theory.ideal.operations
import ring_theory.algebra_tower
import group_theory.finiteness
/-!
# Finiteness conditions in com... |
dd8da97fae8d08f4491e70845d250b5de065c932 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/geometry/euclidean/basic.lean | c4c43711c759bd98cff1db67a4720bf70c58c749 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 56,246 | 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 analysis.special_functions.trigonometric
import algebra.quadratic_discriminant
import analysis.normed_space.add_torsor
import data.matrix.notation... |
7571a0a40ab767f2ee70da549798e3af4935ee17 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/category_theory/limits/shapes/biproducts.lean | 9f20bafb34e2176489c31a97aaf798fb222caa2a | [
"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 | 37,819 | 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.limits.shapes.finite_products
import category_theory.limits.shapes.binary_products
import category_theory.preadditive
/-!
# Biproducts and bin... |
fe18fb3cdf31d30278373e3885020eb5cb6e2be7 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/preadditive/eilenberg_moore.lean | a4f9535fda0a43b3ac1c07fe811f7435f031908b | [
"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 | 4,623 | lean | /-
Copyright (c) 2022 Julian Kuelshammer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Julian Kuelshammer
-/
import category_theory.preadditive.basic
import category_theory.monad.algebra
import category_theory.preadditive.additive_functor
/-!
# Preadditive structur... |
62b1c88011b6707bf827b634f39d06263cb12c22 | f10d66a159ce037d07005bd6021cee6bbd6d5ff0 | /poly_over_field.lean | 71fe3e45839aa5202076468b5555f1f2f6eb9c27 | [] | no_license | johoelzl/mason-stother | 0c78bca183eb729d7f0f93e87ce073bc8cd8808d | 573ecfaada288176462c03c87b80ad05bdab4644 | refs/heads/master | 1,631,751,973,492 | 1,528,923,934,000 | 1,528,923,934,000 | 109,133,224 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 18,951 | lean | import .Sup_fin data.finsupp order.lattice data.nat.cast .euclidean_domain unique_factorization_domain
import .to_finsupp poly .to_multiset poly_over_UFD to_field
--import data.multiset
universes u v w
local notation a`~ᵤ`b := associated a b
noncomputable theory
open classical set function finsupp lattice
local att... |
304035893b7fbeab45c38e68f567191f5ab9415e | ff5230333a701471f46c57e8c115a073ebaaa448 | /tests/lean/run/cpdt.lean | bad54fd4778482ce9616e22db2a96bee6e881841 | [
"Apache-2.0"
] | permissive | stanford-cs242/lean | f81721d2b5d00bc175f2e58c57b710d465e6c858 | 7bd861261f4a37326dcf8d7a17f1f1f330e4548c | refs/heads/master | 1,600,957,431,849 | 1,576,465,093,000 | 1,576,465,093,000 | 225,779,423 | 0 | 3 | Apache-2.0 | 1,575,433,936,000 | 1,575,433,935,000 | null | UTF-8 | Lean | false | false | 1,116 | lean | /- "Proving in the Large" chapter of CPDT -/
inductive exp : Type
| Const (n : nat) : exp
| Plus (e1 e2 : exp) : exp
| Mult (e1 e2 : exp) : exp
open exp
def eeval : exp → nat
| (Const n) := n
| (Plus e1 e2) := eeval e1 + eeval e2
| (Mult e1 e2) := eeval e1 * eeval e2
def times (k : nat) : exp → exp
| (Const n) ... |
ed33e021964e5c6f5ea7116a82a2bc6c03c3ba9b | 5749d8999a76f3a8fddceca1f6941981e33aaa96 | /src/group_theory/group_action.lean | 749271bd5c7b65d2572901d8ac359ceab2ddfa70 | [
"Apache-2.0"
] | permissive | jdsalchow/mathlib | 13ab43ef0d0515a17e550b16d09bd14b76125276 | 497e692b946d93906900bb33a51fd243e7649406 | refs/heads/master | 1,585,819,143,348 | 1,580,072,892,000 | 1,580,072,892,000 | 154,287,128 | 0 | 0 | Apache-2.0 | 1,540,281,610,000 | 1,540,281,609,000 | null | UTF-8 | Lean | false | false | 7,441 | 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.set.finite group_theory.coset
universes u v w
variables {α : Type u} {β : Type v} {γ : Type w}
/-- Typeclass for types with a scalar multiplication operatio... |
dfcbd85b24be200e9c77559d2f7c95b1ee5e2517 | 367134ba5a65885e863bdc4507601606690974c1 | /src/set_theory/schroeder_bernstein.lean | 6e922397c3277fc980aa228c34c463b00afd6209 | [
"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 | 5,052 | 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
The Schröder-Bernstein theorem, and well ordering of cardinals.
-/
import order.fixed_points
import order.zorn
open set classical
open_locale classical... |
3dca49ff2c55312b9087be3537654a9b92dcbe8f | 1d265c7dd8cb3d0e1d645a19fd6157a2084c3921 | /src/lessons/lesson18.lean | 76a4a5874fc5cac8dc989201b03348bdd1d58fb3 | [
"MIT"
] | permissive | hanzhi713/lean-proofs | de432372f220d302be09b5ca4227f8986567e4fd | 4d8356a878645b9ba7cb036f87737f3f1e68ede5 | refs/heads/master | 1,585,580,245,658 | 1,553,646,623,000 | 1,553,646,623,000 | 151,342,188 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 996 | lean | def fn1 (n : ℕ) := n + 1
def fn1' : set ℕ := {n : ℕ | ∃ x, n = x + 1}
def fn1'' : set (ℕ×ℕ) := {tuple | tuple.1 = tuple.2 + 1}
def fn2 (n : ℕ) (m : ℕ) := n / m
def fn2' : set (ℕ × ℕ × ℕ) := {tuple | tuple.1 / tuple.2.1 = tuple.2.2}
def fn3 (n : ℕ) (m : {a : ℕ // a ≠ 0}) := n / m
-- def fn3' : set (ℕ × ℕ × ℕ) :=
de... |
cd3fc83704a85f0aeb04c9d574c0abe550dc7f7b | 26b8b0964ca8e1c2e203585ba5940f83fe05e48a | /src/tidy/tidy.lean | 2108e4e1ca15498f40c273d51d3be4df1c032b79 | [] | no_license | jcommelin/lean-tidy | ef3cd32a3804221d93f0dff9e180bb2c52f4b143 | 9cecf497e90db64b5ea140ad6ae1603976dcd402 | refs/heads/master | 1,585,129,919,276 | 1,533,512,680,000 | 1,533,512,680,000 | 143,677,361 | 0 | 0 | null | 1,616,803,481,000 | 1,533,530,576,000 | Lean | UTF-8 | Lean | false | false | 3,559 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import .force .applicable .fsplit .automatic_induction .tidy_attributes .intro_at_least_one
import .chain
import .recover
import .rewrite_search
import .injection... |
4e7e95d3b7e8f05206209df647a00548846f4737 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /library/data/int/div.lean | 112a6b83c912db4656c83237dea046042bc83c62 | [
"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 | 18,142 | 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... |
5ccca304f80f393309f2b7231747a279c539140e | d1bbf1801b3dcb214451d48214589f511061da63 | /src/category_theory/monad/adjunction.lean | 47fcb7eeef611c94ba746186ec857128534afe77 | [
"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 | 5,970 | 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.monad.algebra
import category_theory.adjunction
namespace category_theory
open category
universes v₁ v₂ u₁ u₂ -- declare the `v`'s first; see... |
9fed08e546b2063aeebb208ae00dd351a145a453 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/pfunctor/multivariate/basic.lean | 3a4a950f74b7b884ec4891e20b7709e60aac5039 | [
"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,624 | lean | /-
Copyright (c) 2018 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Simon Hudon
-/
import control.functor.multivariate
import data.pfunctor.univariate.basic
/-!
# Multivariate polynomial functors.
> THIS FILE IS SYNCHRONIZED WITH MATHLI... |
a462a9504c994d3e516304592cee1834e342f260 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/sums/associator_auto.lean | 9b313ef77e6db673379d95bb3b2f2626a7633677 | [] | 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 | 4,811 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.sums.basic
import Mathlib.PostPort
universes u v
namespace Mathlib
/-#
... |
67f7c9d28a4dafa66fa290aeb767050e6fcc3c8d | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/field_theory/fixed.lean | 21113bec8cc9416e8c7c04d99d061b708cabd56c | [
"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 | 14,631 | 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.polynomial.group_ring_action
import field_theory.normal
import field_theory.separable
import field_theory.tower
import ring_theory.polynomial
/-!
# Fixed field... |
3e738775616b4d100524d849806536c12303fb1c | e0b0b1648286e442507eb62344760d5cd8d13f2d | /stage0/src/Lean/Data/Name.lean | 4f80d525bc3ef62c8b55a2e71b8ac014426b31df | [
"Apache-2.0"
] | permissive | MULXCODE/lean4 | 743ed389e05e26e09c6a11d24607ad5a697db39b | 4675817a9e89824eca37192364cd47a4027c6437 | refs/heads/master | 1,682,231,879,857 | 1,620,423,501,000 | 1,620,423,501,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,684 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
import Std.Data.HashSet
import Std.Data.RBMap
import Std.Data.RBTree
namespace Lean
instance : Coe String Name := ⟨Name.mkSimple⟩
namespace Name
@[export ... |
bc24e804a5d5951299a1df7a326ebdbc9b4a7b90 | 05b503addd423dd68145d68b8cde5cd595d74365 | /src/set_theory/surreal.lean | 3341e3248708eb5f9534adc1ae3e9ec2947288c6 | [
"Apache-2.0"
] | permissive | aestriplex/mathlib | 77513ff2b176d74a3bec114f33b519069788811d | e2fa8b2b1b732d7c25119229e3cdfba8370cb00f | refs/heads/master | 1,621,969,960,692 | 1,586,279,279,000 | 1,586,279,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,072 | lean | /-
Copyright (c) 2019 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Scott Morrison
-/
import set_theory.pgame
/-!
# Surreal numbers
The basic theory of surreal numbers, built on top of the theory of combinatorial (pre-)games.
A prega... |
3850c548d1f87471a7b9a16113a8f7082d7f890a | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/algebra/group_power/lemmas.lean | bd32b65f3ddb2e311618a4ea60647125f6215c59 | [
"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 | 19,688 | 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.opposites
import data.list.basic
import data.int.cast
import data.equiv.basic
import deprecated.group
... |
8c6f7800d13140ec56a1f885348c3d5ce08f2aa3 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/sheaves/sheafify.lean | 24ec3b79c730673013f2408b7f6d8dec57217f18 | [] | 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,443 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.topology.sheaves.local_predicate
import Mathlib.topology.sheaves.stalks
import Mathlib.Post... |
42ed7948d889922dff4f700210747a1986988612 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/topology/algebra/uniform_group.lean | aedbb349e66772f955562fb89b8fe2b4f154ed28 | [
"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 | 17,940 | 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.uniform_space.uniform_embedding
import topology.uniform_space.complete_separated
import topology.algebra.group
import tactic.abel
/-!... |
36951934277e773db51ca45c84b1a31084daab21 | b82c5bb4c3b618c23ba67764bc3e93f4999a1a39 | /src/formal_ml/finset.lean | 85efe3d6884a27e2d44c0b08a5f0182d839d24dc | [
"Apache-2.0"
] | permissive | nouretienne/formal-ml | 83c4261016955bf9bcb55bd32b4f2621b44163e0 | 40b6da3b6e875f47412d50c7cd97936cb5091a2b | refs/heads/master | 1,671,216,448,724 | 1,600,472,285,000 | 1,600,472,285,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,931 | lean | /-
Copyright 2020 Google LLC
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
di... |
fb7210ffd7934ddfa36f814f9fe656540c77a156 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /archive/imo/imo2008_q3.lean | ce1470e753e1b827306e4e24a060c2dbdece128c | [
"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 | 3,999 | lean | /-
Copyright (c) 2021 Manuel Candales. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Manuel Candales
-/
import data.real.basic
import data.real.sqrt
import data.nat.prime
import number_theory.primes_congruent_one
import number_theory.legendre_symbol.quadratic_reciproc... |
b7468078c8fe9cc793ae39c977f0e871449e587c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/polynomial/hasse_deriv.lean | 6c237af6ae053274b5f5370fb346234bc7ed47fb | [
"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 | 10,473 | lean | /-
Copyright (c) 2021 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import algebra.polynomial.big_operators
import data.nat.choose.cast
import data.nat.choose.vandermonde
import data.polynomial.derivative
/-!
# Hasse derivative of p... |
5fa55ba0a3186722ceb5ce317156f2be06313f2b | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/project_1_a_decrire/projet_A2/A2_functor.lean | 69f41f8e6ce2338bb3a6d5d549943fb529fec154 | [] | 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 | 1,177 | lean | import .A2
import category_theory.functor_category
import algebra.category.CommRing.basic
universes v u
open A2
def map_A2 {A B :Type v}[comm_ring A][comm_ring B](f : A → B)[is_ring_hom f] : A2 A → A2 B := λ ζ, begin
use { a := f ζ.a, b := f ζ.b},
end
variables (A B :Type v)[comm_ring A][comm_ring B]
def ma... |
b585304c3499898033a9bcc077f9372e26925c20 | 9bb72db9297f7837f673785604fb89b3184e13f8 | /library/init/meta/interactive.lean | 9b8049d13165f646dd1c82924ed88724b6ca7c16 | [
"Apache-2.0"
] | permissive | dselsam/lean | ec83d7592199faa85687d884bbaaa570b62c1652 | 6b0bd5bc2e07e13880d332c89093fe3032bb2469 | refs/heads/master | 1,621,807,064,966 | 1,611,454,685,000 | 1,611,975,642,000 | 42,734,348 | 3 | 3 | null | 1,498,748,560,000 | 1,442,594,289,000 | C++ | UTF-8 | Lean | false | false | 72,616 | 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, Jannis Limperg
-/
prelude
import init.meta.tactic init.meta.type_context init.meta.rewrite_tactic init.meta.simp_tactic
import init.meta.smt.congruence_closur... |
78d4d3487b83466aa6497f303660be03890ff0c0 | 2b2a05a7af89c79da194505bf88205a6c4e05d68 | /src/game/world_05_function.lean | 79e8f5d1698c1e2c6bf7d625499043f586c0c5c5 | [] | no_license | lacrosse/natural_number_game | 6401a11a8c965da3903ae6695f84586edf6fac85 | 400179cde1d3fcc9744901dabff98813ba2b544f | refs/heads/master | 1,677,566,006,582 | 1,612,576,917,000 | 1,612,576,917,000 | 335,655,947 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,265 | lean | import game.world_04_power
namespace mynat
example (P Q : Type) (p : P) (h : P → Q) : Q := begin[nat_num_game]
exact h p,
end
example : mynat → mynat := begin[nat_num_game]
intro p,
exact 3 * p + 2,
end
example (P Q R S T U: Type) (p : P) (h : P → Q) (i : Q → R) (j : Q → T) (k : S → T) (l : T → U) : U := begin... |
9d7454ab472c8019044464e23ee5e2bce2944196 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /stage0/src/Init/Data/Array/Macros.lean | 5f07844afe3025ab2e08cba4d0209d2c6dabd30f | [
"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 | 639 | 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
-/
prelude
import Init.LeanInit
import Init.Data.Array.Basic
import Init.Data.Array.Subarray
namespace Array
syntax:max term noWs "[" term ":" term "]" : ter... |
be6828d344b45afe6e52bf7b8eef5607cabc780f | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/opposites.lean | a2f729a4982fc850ae495a1ad64e68a60fdd3ea9 | [
"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 | 14,548 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import data.opposite
import algebra.field
import algebra.group.commute
import group_theory.group_action.defs
import data.equiv.mul_add
/-!
# Algebraic operations on `αᵒᵖ`
Thi... |
86a8dbb4c6cdca1fab579738a2866c1d14510b6c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/apply_rules.lean | 5bfeab875b81204ead6a7f901668e86937c1527c | [
"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,986 | lean | import data.int.order.basic
import data.nat.pow
open nat
example {a b c d e : nat} (h1 : a ≤ b) (h2 : c ≤ d) (h3 : 0 ≤ e) :
a + c * e + a + c + 0 ≤ b + d * e + b + d + e :=
add_le_add (add_le_add (add_le_add (add_le_add h1 (mul_le_mul_of_nonneg_right h2 h3)) h1 ) h2) h3
example {a b c d e : nat} (h1 : a ≤ b) (h2 : c... |
546dc992b19dc4b16c7a9e78c51823bdcbaa40ff | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/Compiler/TerminalCases.lean | 04406062f10874a64a7ff2fece885c17f8e85c7d | [
"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 | 2,549 | 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.Check
import Lean.Compiler.Util
import Lean.Compiler.Decl
import Lean.Compiler.CompilerM
namespace Lean.Compiler
namespace TerminalCases
... |
a643bcf31c8365d08571265ee059cd1ca709dcb7 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/sites/spaces.lean | f337f7221a3a009e5f3678a58e9dd233488ad555 | [] | 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 | 2,328 | 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.topology.opens
import Mathlib.category_theory.sites.grothendieck
import Mathlib.category_theory... |
22d5cfde2bf2beddb6bd91002d20f0c5853d222f | 49ffcd4736fa3bdcc1cdbb546d4c855d67c0f28a | /library/init/meta/interactive.lean | 04091fc6b471012f07fbfcb0ae61d2f25c0e63ac | [
"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 | 54,117 | 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.rewrite_tactic init.meta.simp_tactic
import init.meta.smt.congruence_closure init.category.combinators
import init... |
57047b1db4d9f4444eb40a2f6a67f6e06d2d30b8 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/data/nat/lemmas_auto.lean | 48cdac08d758ef27e14ebc0dfe9a5ab0cc09623b | [] | 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 | 37,763 | 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, Jeremy Avigad
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.data.nat.basic
import Mathlib.Lean3Lib.init.data.nat.div
import Mathlib.Lean3Lib.init.met... |
8e5ff4a4fe6ab905d7f45b588c7c04232d86a5a1 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/pi_simp.lean | 9225a5fe7cb9787a938c12c71ac37d9bfbdc17fb | [
"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 | 641 | 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 algebra.group.pi
/-!
Test if `simp` can use a lemma about `pi.has_one` to simplify `1` coming from `pi.group`
-/
variables {I : Type*} {f : Π i : I, ... |
d8d0397ca310bd7c5b134ddfb928966b636d9878 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/linear_algebra/projection.lean | b3e092f4c8dc490ee58b9de6bafa9f42595bb118 | [] | 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 | 11,220 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury Kudryashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.linear_algebra.basic
import Mathlib.PostPort
universes u_1 u_2 u_3 u_4
namespace Mathli... |
d2d8cc549efce398b859f9691054071673528e27 | 5756a081670ba9c1d1d3fca7bd47cb4e31beae66 | /Mathport/Syntax/Translate/Tactic/Mathlib/Apply.lean | a25dc3069e532e2fcf56ef2da080d47e48186d65 | [
"Apache-2.0"
] | permissive | leanprover-community/mathport | 2c9bdc8292168febf59799efdc5451dbf0450d4a | 13051f68064f7638970d39a8fecaede68ffbf9e1 | refs/heads/master | 1,693,841,364,079 | 1,693,813,111,000 | 1,693,813,111,000 | 379,357,010 | 27 | 10 | Apache-2.0 | 1,691,309,132,000 | 1,624,384,521,000 | Lean | UTF-8 | Lean | false | false | 927 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import Mathport.Syntax.Translate.Tactic.Basic
import Mathport.Syntax.Translate.Tactic.Lean3
open Lean
namespace Mathport.Translate.Tactic
open AST3 Parser
-... |
fa7b99361c24ae4588b7c25e6cc9338927cc8e29 | 36938939954e91f23dec66a02728db08a7acfcf9 | /lean4/app/Annotations.lean | e183999dc91d15102ce356cf8f35e62b09059922 | [] | no_license | 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 | 15,404 | lean | import Galois.Data.RBMap
import Galois.Data.SExp
import Galois.Init.Json
import Galois.Init.Nat
import Init.Data.UInt
import Init.Lean.Data.Json
import Init.Lean.Data.Json.Basic
import Init.Lean.Data.Json.Printer
import Init.Lean.Data.Json.FromToJson
import Init.Data.RBMap
import LeanLLVM.AST
import Main.Elf
import Reo... |
08806b646a175328550a05b42ebcbb7e802dac6b | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/pred_logic/unnamed_146.lean | 195f7e4b0194a309c5a1585f8c27531ebfc400d4 | [] | no_license | gihanmarasingha/mth1001_sphinx | 190a003269ba5e54717b448302a27ca26e31d491 | 05126586cbf5786e521be1ea2ef5b4ba3c44e74a | refs/heads/master | 1,672,913,933,677 | 1,604,516,583,000 | 1,604,516,583,000 | 309,245,750 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 190 | lean | def avg_three_u : (ℤ × ℤ × ℤ) → ℤ
| (x, y, z) := (x + y + z)/3
#check avg_three_u -- `avg_three_u` has type `ℤ × ℤ × ℤ → ℤ`
#eval avg_three_u (10, 5, 6) -- This is 7. |
cc5d4b9a0741d89132776c2a85a18e34306ad5f3 | 7571914d3f4d9677288f35ab1a53a2ad70a62bd7 | /library/init/data/default.lean | a8f63b173da802059935e13f728159d29e9cf364 | [
"Apache-2.0"
] | permissive | picrin/lean-1 | a395fed5287995f09a15a190bb24609919a0727f | b50597228b42a7eaa01bf8cb7a4fb1a98e7a8aab | refs/heads/master | 1,610,757,735,162 | 1,502,008,413,000 | 1,502,008,413,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 430 | 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.data.basic init.data.sigma init.data.nat init.data.char init.data.string
import init.data.list init.data.sum init.data.subtype init.data... |
57b942c232910416c4c5a41a3756d246935be5db | e6b8240a90527fd55d42d0ec6649253d5d0bd414 | /src/algebra/group/hom.lean | cb3f0e4423a6bd016a6e86175cf26d0153c044f4 | [
"Apache-2.0"
] | permissive | mattearnshaw/mathlib | ac90f9fb8168aa642223bea3ffd0286b0cfde44f | d8dc1445cf8a8c74f8df60b9f7a1f5cf10946666 | refs/heads/master | 1,606,308,351,137 | 1,576,594,130,000 | 1,576,594,130,000 | 228,666,195 | 0 | 0 | Apache-2.0 | 1,576,603,094,000 | 1,576,603,093,000 | null | UTF-8 | Lean | false | false | 16,201 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Kevin Buzzard, Scott Morrison, Johan Commelin, Chris Hughes,
Johannes Hölzl, Yury Kudryashov
Homomorphisms of multiplicative and additive (semi)groups and monoids.
... |
bd89bdac49b3f9136b81e5874538ba3468350b6a | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/polynomial/reverse.lean | 51ecf903c5bf5e69d6bcfc3ebde0bfe7907faf94 | [] | 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 | 5,471 | lean | /-
Copyright (c) 2020 Damiano Testa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.polynomial.erase_lead
import Mathlib.data.polynomial.degree.default
import Mathlib.PostP... |
4950e7adb9d712442294ea5d30739cb33fad80e9 | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/category_theory/limits/limits.lean | 94e86b7638eb6263df3d0fcb564d01b121731c32 | [
"Apache-2.0"
] | permissive | khoek/mathlib | bc49a842910af13a3c372748310e86467d1dc766 | aa55f8b50354b3e11ba64792dcb06cccb2d8ee28 | refs/heads/master | 1,588,232,063,837 | 1,587,304,803,000 | 1,587,304,803,000 | 176,688,517 | 0 | 0 | Apache-2.0 | 1,553,070,585,000 | 1,553,070,585,000 | null | UTF-8 | Lean | false | false | 42,372 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Mario Carneiro, Scott Morrison, Floris van Doorn
-/
import category_theory.whiskering
import category_theory.yoneda
import category_theory.limits.cones
import category_the... |
2abec8d1f065352c6413a6c3fdbff47e5855aedb | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/category/Top/epi_mono.lean | cbf8e684eb01caca3bf9042c176b365134a0b148 | [] | 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 | 619 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.topology.category.Top.adjunctions
import Mathlib.category_theory.epi_mono
import Mathlib.PostPort... |
a02c7eb49011d01165ff3d80041d4e46fef84f8e | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/interaction_monad_auto.lean | ca2a5982372d97b527291dded11e7197c932b810 | [] | 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 | 890 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.function
import Mathlib.Lean3Lib.init.data.option.basic
import Mathlib.Lean3Lib.init.... |
1ac3a64f3e222f49d5eadca1979b1583e7fa62fa | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/analysis/calculus/fderiv_symmetric.lean | 0df997b825a71d0d0ed53dc8a2c5fb5f72a7f65c | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,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 ... |
a903a6897037a08bf263cc91d38644e6bae8e882 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/topology/instances/add_circle.lean | e84d83778331f72711664f5d7dd02fb0927119fb | [
"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 | 23,928 | lean | /-
Copyright (c) 2022 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import data.nat.totient
import algebra.ring.add_aut
import group_theory.divisible
import group_theory.order_of_element
import algebra.order.floor
import algebra.order.to_in... |
7b7f938dc31543dac29db6a9e585faf6c26fbe08 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/box_integral/partition/measure.lean | a216a433f8954dee1abfb426dd12b89841161527 | [
"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 | 4,075 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import analysis.box_integral.partition.additive
import measure_theory.measure.lebesgue
/-!
# Box-additive functions defined by measures
In this file we prove a fe... |
48eb673d63c621fba9f73613140a75513ccb5d1f | 922aabadca677ef935a2394c546f8ec097ee04a8 | /src/infinitude_of_primes.lean | 68ab93832f29a6dfb6418ba5c3a4b8015988c6fd | [
"MIT"
] | permissive | apurvanakade/uwo2021-CUMC | 14afe4201c54cf42e2bdbc640a5e5e15aec720ba | 0be9402011feda35e510725449686c0af3c3761e | refs/heads/master | 1,688,802,880,363 | 1,629,752,690,000 | 1,629,752,690,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,083 | lean | import data.nat.prime
open nat
theorem infinitude_of_primes (n : ℕ) : ∃ (p : ℕ), prime p ∧ n ≤ p :=
-- For every natural number n,
-- there exists a number p, such that
-- n is less than or equal to p and p is prime
begin
let m := n.factorial + 1,
let p := min_fac m,
use p,
-- use the smallest prime factor... |
1ced501244329283bcafc3fbc2a58c2a9692dfdb | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/number_theory/modular_forms/jacobi_theta/basic.lean | 86c8bd4862385306afe47f264342e947bdeb52f4 | [
"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,153 | lean | /-
Copyright (c) 2023 David Loeffler. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Loeffler
-/
import analysis.special_functions.gaussian
import analysis.complex.locally_uniform_limit
import analysis.complex.upper_half_plane.functions_bounded_at_infty
import an... |
fb958693228ee8f093cfc1df776521cf9e8d2f09 | e91b0bc0bcf14cf6e1bfc20ad1f00ad7cfa5fa76 | /src/sheaves/presheaf_of_types.lean | 9931045b1358e066df5ea91d63d7d2ad8827ea86 | [] | no_license | kckennylau/lean-scheme | b2de50025289a0339d97798466ef777e1899b0f8 | 8dc513ef9606d2988227490e915b7c7e173a2791 | refs/heads/master | 1,587,165,137,978 | 1,548,172,249,000 | 1,548,172,249,000 | 167,025,881 | 0 | 0 | null | 1,548,173,930,000 | 1,548,173,924,000 | Lean | UTF-8 | Lean | false | false | 2,746 | lean | import topology.basic
universes u v
-- -- Lemmas about ⊆. TODO: Can this be automated?
-- @[simp, refl] lemma subset_refl {U : set α} : U ⊆ U :=
-- set.subset.refl U
-- @[simp, trans] lemma subset_trans {U V W : set α} : W ⊆ V → V ⊆ U → W ⊆ U :=
-- set.subset.trans
-- Definition of a presheaf.
structure pres... |
1b246d1d42c691c9462595329a37b7ef1dcb103c | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/topology/algebra/order/basic.lean | 9ec7b4ba4999babc1dfaef5c9ea9ca4d01171e18 | [
"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 | 140,838 | 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 algebra.group_with_zero.power
import data.set.intervals.pi
import order.filter.interval
import topology.algebra.field
import t... |
76209ff4394bba1e31a56caacfe05129adc16f41 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/int/succ_pred.lean | f13426a391f14f27ac85012f9018a00f26fc5902 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,614 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import data.int.basic
import order.succ_pred
/-!
# Successors and predecessors of integers
In this file, we show that `ℤ` is both an archimedean `succ_order` and an arc... |
e050bb0c3e335cbc43f0f00038db98160cafb818 | 6ae186a0c6ab366b39397ec9250541c9d5aeb023 | /src/category_theory/adjunctions/default.lean | 77a31611f845c22bc6e7824f3c74e52b54697edc | [] | no_license | ThanhPhamPhuong/lean-category-theory | 0d5c4fe1137866b4fe29ec2753d99aa0d0667881 | 968a29fe7c0b20e10d8a27e120aca8ddc184e1ea | refs/heads/master | 1,587,206,682,489 | 1,544,045,056,000 | 1,544,045,056,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,293 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Stephen Morgan, Scott Morrison
import category_theory.natural_transformation
import category_theory.opposites
import category_theory.types
import category_theory.tactics.obviou... |
aa1611cbaa985cabb7fd5df0824e93524e051bb3 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/whnfinst.lean | cec0576cfd718e9c25939000f048b528e260954d | [
"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 | 391 | lean | import logic
open decidable
definition decidable_bin_rel [reducible] {A : Type} (R : A → A → Prop) := Πx y, decidable (R x y)
section
variable {A : Type}
variable (R : A → A → Prop)
theorem tst1 (H : Πx y, decidable (R x y)) (a b c : A) : decidable (R a b ∧ R b a)
theorem tst2 (H : decidable_bin_rel R) (a b... |
aaa7d1aee59afec9bd6bd0aeba2449b6d4e27abf | 4fa118f6209450d4e8d058790e2967337811b2b5 | /src/valuation/with_zero_topology.lean | 969bf6842363838a59cad885a1181751892939a9 | [
"Apache-2.0"
] | permissive | leanprover-community/lean-perfectoid-spaces | 16ab697a220ed3669bf76311daa8c466382207f7 | 95a6520ce578b30a80b4c36e36ab2d559a842690 | refs/heads/master | 1,639,557,829,139 | 1,638,797,866,000 | 1,638,797,866,000 | 135,769,296 | 96 | 10 | Apache-2.0 | 1,638,797,866,000 | 1,527,892,754,000 | Lean | UTF-8 | Lean | false | false | 15,219 | lean | import topology.algebra.ordered
import for_mathlib.filter
import for_mathlib.topology
import valuation.linear_ordered_comm_group_with_zero
/-!
# The topology on linearly ordered commutative groups with zero
Let Γ₀ be a linearly ordered commutative group to which we have adjoined a zero element.
Then Γ₀ may naturall... |
ca2bd2d002ad9120e0999e2573cc99b110b9360d | cf39355caa609c0f33405126beee2739aa3cb77e | /library/init/data/list/instances.lean | fc711d8b2cbcd3fb81b2d56d532373b6dac7fe42 | [
"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,932 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import init.data.list.lemmas
open list
universes u v
local attribute [simp] join list.ret
instance : monad list :=
{ pure := @list.ret, map := @l... |
6c71788fb6d8ee60c9fd3558d7896f197fe97c19 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /test/itauto.lean | a2fbd4aa4a7a0302c0534749bb3a0ff324941b45 | [
"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 | 2,742 | lean | /-
Copyright (c) 2021 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import tactic.itauto
section itauto₀
variables p q r : Prop
variables h : p ∧ q ∨ p ∧ r
include h
example : p ∧ p :=
by itauto
end itauto₀
section itauto₃
example... |
87b5c3d82ed54010c08ce481d63200c9efbd82af | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/LiftMethodIssue.lean | b5fb7d7f218bab51c3ed4cebb2d840bf7c3dfc9e | [
"Apache-2.0"
] | permissive | mhuisi/lean4 | 28d35a4febc2e251c7f05492e13f3b05d6f9b7af | dda44bc47f3e5d024508060dac2bcb59fd12e4c0 | refs/heads/master | 1,621,225,489,283 | 1,585,142,689,000 | 1,585,142,689,000 | 250,590,438 | 0 | 2 | Apache-2.0 | 1,602,443,220,000 | 1,585,327,814,000 | C | UTF-8 | Lean | false | false | 754 | lean | new_frontend
def tst : IO (Option Nat) := do
x? : Option Nat ← pure none;
pure x?
def tst2 (x : Nat) : IO (Option Nat) := do
x? : Option Nat ← pure x;
if x?.isNone then
/-
We need the `some` because we propagate the expected type at `pure` applications.
The expected type is `IO (Option Nat)`, and we elabora... |
3c46ce63b32e0ae594181d3509a8b3ae10295535 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /hott/algebra/group.hlean | 1021211e73f21226933e22c1e784a0bafca8e8dd | [
"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 | 25,290 | hlean | /-
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
Various multiplicative and additive structures. Partially modeled on Isabelle's library.
-/
import algebra.binary algebra.priority
open eq eq.ops -... |
b66b51394c9b905dcf95c935654ba55b296fa750 | 88892181780ff536a81e794003fe058062f06758 | /src/positive_nat/div.lean | 3b2f5a3fb3f841a5b67ae219b5524b377a1b3305 | [] | 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 | 2,927 | lean | import positive_nat.lemmas
namespace positive_nat namespace natural
def div.total : natural → natural → natural
| a b :=
if h : a > b then
have sub a b h < a := sub_lt_of_lt h,
div.total (sub a b h) b + 1 else 1
using_well_founded lib.wf_tacs
lemma div_wf {a b : natural} (h : b < a) : sub a b h < a := begin
exact ... |
5fafdb820aa6b1bc0d6e17fe3947c3ae60c702a1 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/smartUnfoldingBug.lean | 36439c6915c71c5eaeac2675755161294e5b10b9 | [
"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 | 6,311 | lean | import Lean.Elab
open Nat
structure ProvedSkip(n m: Nat) where
result : Nat
lt : m < n → result = m
ge : n ≤ m → result = m + 1
def provedSkip (n m : Nat) : ProvedSkip n m :=
if c : m < n then
⟨m, fun _ => rfl, fun hyp => False.elim (Nat.lt_irrefl m (Nat.lt_of_lt_of_le c hyp))⟩
else
⟨m + 1, fun hyp ... |
540dd7fd2bc51a29e1dfb021c95703d3f498f8dc | 47181b4ef986292573c77e09fcb116584d37ea8a | /src/valuations/multiplicative_hom.lean | 965d0d8fcb5dfffec36259c038a0844225de2d24 | [
"MIT"
] | permissive | RaitoBezarius/berkovich-spaces | 87662a2bdb0ac0beed26e3338b221e3f12107b78 | 0a49f75a599bcb20333ec86b301f84411f04f7cf | refs/heads/main | 1,690,520,666,912 | 1,629,328,012,000 | 1,629,328,012,000 | 332,238,095 | 4 | 0 | MIT | 1,629,312,085,000 | 1,611,414,506,000 | Lean | UTF-8 | Lean | false | false | 748 | lean | import data.real.cau_seq
import ring_theory.unique_factorization_domain
open is_absolute_value
open_locale classical
theorem ext_hom_primes {α} [comm_monoid_with_zero α] [wf_dvd_monoid α]
{β} [monoid_with_zero β]
(φ₁ φ₂: monoid_with_zero_hom α β)
(h_units: ∀ u: units α, φ₁ u = φ₂ u)
(h_irreducibles: ∀ a: α, i... |
4b6e32ae86382b419225a07c74602d9314f95ec0 | 9a0b1b3a653ea926b03d1495fef64da1d14b3174 | /tidy/command/suggestion.lean | 958738e4e12a610a3d9ed4b277b107c20708cf50 | [
"Apache-2.0"
] | permissive | khoek/mathlib-tidy | 8623b27b4e04e7d598164e7eaf248610d58f768b | 866afa6ab597c47f1b72e8fe2b82b97fff5b980f | refs/heads/master | 1,585,598,975,772 | 1,538,659,544,000 | 1,538,659,544,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 674 | lean | import tidy.lib.parser
-- Import the `@[suggest]` attribute definition, since we emit code which uses it.
import tidy.rewrite_search.discovery.suggest
open lean.parser
open interactive
open tidy.rewrite_search.discovery
@[user_command]
meta def suggestion_cmd (d : decl_meta_info) (_ : parse $ tk "suggestion") : lea... |
511c0c22b9edb9959a848a59f50dd92bdb1b9504 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /08_Building_Theories_and_Proofs.org.37.lean | 6a4a0bb0685fb2cdc1bd6b2edb9c92fcdb6c598b | [] | 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 | 143 | lean | import standard
namespace foo
protected definition bar (A : Type) (x : A) := x
end foo
open foo
check foo.bar -- "check bar" yields an error
|
fd377b7e04339738b95381e3d94893f8af3695c4 | 367134ba5a65885e863bdc4507601606690974c1 | /src/topology/category/Top/basic.lean | f52da1fc5d381202b586f129b522fc857b69f3a6 | [
"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 | 2,091 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Scott Morrison, Mario Carneiro
-/
import category_theory.concrete_category.unbundled_hom
import topology.continuous_map
import topology.opens
/-!
# Category instance f... |
1fb2dcdafea7f683a6a34427435d64311d126edf | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/pred_logic/unnamed_587.lean | 89ef022ab8d7ea12dfbd79297f9cc4f3da62417f | [] | no_license | gihanmarasingha/mth1001_sphinx | 190a003269ba5e54717b448302a27ca26e31d491 | 05126586cbf5786e521be1ea2ef5b4ba3c44e74a | refs/heads/master | 1,672,913,933,677 | 1,604,516,583,000 | 1,604,516,583,000 | 309,245,750 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 383 | lean | import tactic.interactive
variables (U : Type*) (S T : U → Prop)
-- BEGIN
example (h : ∃ x, S x ∧ T x) : ∃ y, S y :=
begin
cases h with u k, -- By exists elim. on `h`, it suffices to prove the goal assuming `u : U` and `k : S u ∧ T u`.
use u, -- By exists intro. on `u`, it suffices to prove `S u`.
exact k.left, -... |
415f1a51e108292a55cddd833ae7a3e193f39922 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/measure_theory/constructions/polish.lean | 546b85d2501a0cdae22cf4286b81f4f7238cee86 | [
"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 | 40,400 | lean | /-
Copyright (c) 2022 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel, Felix Weilacher
-/
import data.real.cardinality
import topology.perfect
import measure_theory.constructions.borel_space
/-!
# The Borel sigma-algebra on Polish s... |
52893525453fece44ae17ed906a69af934de2113 | b2e508d02500f1512e1618150413e6be69d9db10 | /src/topology/algebra/ordered.lean | 1e1e4c6573a57da748e7e385d2dc6bd5dea0e81f | [
"Apache-2.0"
] | permissive | callum-sutton/mathlib | c3788f90216e9cd43eeffcb9f8c9f959b3b01771 | afd623825a3ac6bfbcc675a9b023edad3f069e89 | refs/heads/master | 1,591,371,888,053 | 1,560,990,690,000 | 1,560,990,690,000 | 192,476,045 | 0 | 0 | Apache-2.0 | 1,568,941,843,000 | 1,560,837,965,000 | Lean | UTF-8 | Lean | false | false | 44,533 | 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
Theory of ordered topology.
-/
import order.liminf_limsup
import data.set.intervals
import topology.algebra.group
import topology.constructions
open cl... |
33a9260f4027982c3d781dce7fa466afb30369bc | 7d5ad87afb17e514aee234fcf0a24412eed6384f | /src/completeness.lean | 1a37181610f6e9abedfc8b847bac65aca69b762c | [] | no_license | digama0/flypitch | 764f849eaef59c045dfbeca142a0f827973e70c1 | 2ec14b8da6a3964f09521d17e51f363d255b030f | refs/heads/master | 1,586,980,069,651 | 1,547,078,141,000 | 1,547,078,283,000 | 164,965,135 | 1 | 0 | null | 1,547,082,858,000 | 1,547,082,857,000 | null | UTF-8 | Lean | false | false | 3,355 | lean | import .henkin
local attribute [instance, priority 0] classical.prop_decidable
open fol fol.Lhom
lemma completeness_for_inconsistent_theories {L : Language} (T : Theory L) (ψ : sentence L) (h_inconsis : ¬ is_consistent T) : T ⊢' ψ ↔ T ⊨ ψ :=
⟨by {intro H, fapply soundness, exact classical.choice H}, (by {intro H, e... |
83e909c746e7552856e965ee052390aa3086bd66 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/continuous_function/algebra.lean | 982300e5bfebaa5e27481c6bed15cd2066328a74 | [
"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 | 30,992 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Nicolò Cavalleri
-/
import topology.algebra.module.basic
import topology.continuous_function.ordered
import topology.algebra.uniform_group
import topology.uniform_space... |
7d1adc8cbc253e0032b87f434a51b970bb28ee80 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /test/instance_diamonds.lean | 4c6ed7631fd7080f51b24850e01a7ab8f859f0ce | [
"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 | 8,420 | 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.module.pi
import data.polynomial.basic
import group_theory.group_action.prod
import group_theory.group_action.units
import data.complex.module
import ring_t... |
d6e976c7ac1faf8cb2acf882eb48e5b611950448 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/logic/encodable/basic.lean | a5d2623a656c0572a0326baf5aeb662d90a0e038 | [
"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 | 19,952 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Mario Carneiro
-/
import logic.equiv.nat
import data.pnat.basic
import order.directed
import data.countable.defs
import order.rel_iso.basic
import data.fin.ba... |
2b38c96a1cc4f00d04d60dd46057c860473bcb57 | ff5230333a701471f46c57e8c115a073ebaaa448 | /library/init/data/nat/basic.lean | f5627c9f99c8931ceb9fa4539519b35cc1a1946c | [
"Apache-2.0"
] | permissive | stanford-cs242/lean | f81721d2b5d00bc175f2e58c57b710d465e6c858 | 7bd861261f4a37326dcf8d7a17f1f1f330e4548c | refs/heads/master | 1,600,957,431,849 | 1,576,465,093,000 | 1,576,465,093,000 | 225,779,423 | 0 | 3 | Apache-2.0 | 1,575,433,936,000 | 1,575,433,935,000 | null | UTF-8 | Lean | false | false | 6,076 | 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.logic
notation `ℕ` := nat
namespace nat
inductive less_than_or_equal (a : ℕ) : ℕ → Prop
| refl : less_than_or_equal... |
9add86737771b88adedc5d842ce3ddd9bcbb8b28 | fecda8e6b848337561d6467a1e30cf23176d6ad0 | /src/topology/sheaves/sheaf_of_functions.lean | 125c5eaae262706535e79b0934d4c5c817f9d891 | [
"Apache-2.0"
] | permissive | spolu/mathlib | bacf18c3d2a561d00ecdc9413187729dd1f705ed | 480c92cdfe1cf3c2d083abded87e82162e8814f4 | refs/heads/master | 1,671,684,094,325 | 1,600,736,045,000 | 1,600,736,045,000 | 297,564,749 | 1 | 0 | null | 1,600,758,368,000 | 1,600,758,367,000 | null | UTF-8 | Lean | false | false | 7,348 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Scott Morrison
-/
import topology.sheaves.presheaf_of_functions
import topology.sheaves.sheaf
import category_theory.limits.shapes.types
import topology.local_homeomorp... |
dd87a72a1dac81d5135cf18c7e612f0412004a4d | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/dynamics/omega_limit.lean | bbbc77887094d9d95ae96e92b6c1b3bee0c69b51 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,665 | lean | /-
Copyright (c) 2020 Jean Lo. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean Lo
-/
import dynamics.flow
/-!
# ω-limits
For a function `ϕ : τ → α → β` where `β` is a topological space, we
define the ω-limit under `ϕ` of a set `s` in `α` with respect to
filter `f... |
b53f1fb1f6b394a5e03ef0be80baebd8408a3094 | b186c784450e8bcbcf835ab3f10fa7e73f27bc2e | /check.lean | f7e9fb81d361f4fbe7e5d01e76ec34c669be9d60 | [] | no_license | esclear/Learning-Lean | 9780a0efe769e275992cf3ab4ebf55809ec53b48 | d81d5c4743b94c96d8f1bb135e1f13a1d99b3154 | refs/heads/master | 1,593,312,896,806 | 1,565,904,243,000 | 1,565,904,243,000 | 200,125,941 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,904 | lean | def double (x : ℕ) : ℕ := x + x
def square (x : ℕ) := x * x
def do_twice (f : ℕ → ℕ) (x : ℕ) : ℕ := f (f x)
def quadruple (x : ℕ) : ℕ := do_twice double x
def octuple (x : ℕ) : ℕ := double (quadruple x)
def foo := let a := nat in λ x : a, x + 2
section useful
variables (α β γ : Type)
variables (g : β → γ)... |
7184458cc5d387ee7bf0914d98a516c981ed2a51 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/1794.lean | 4cd1944f0b5e2820c1a14c02658df68776aa2851 | [
"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 | 710 | lean | inductive test : nat -> list nat -> Prop
| zero: test 0 list.nil
--n remains even
| nil: forall {n: nat}, test n list.nil -> test (n+2) list.nil
--n flips between even and odd
| cons: forall {n i: nat} {is: list nat}, test n is -> test (n+3) (list.cons i is)
lemma example3 : forall (n m: nat), test (n+n) [m] -> false ... |
c7f6351d827416f88ca598e53ce1f81ee59cc30f | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Util/CollectLevelParams.lean | 54db73fb4c43f5c93c86b8ae637e2d18b9749bdb | [
"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 | 2,278 | 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
namespace Lean
namespace CollectLevelParams
structure State where
visitedLevel : LevelSet := {}
visitedExpr : ExprSet := {}
... |
40a10c8a90e2fa686b8f0a3a3da4f44b4967f9cf | 556aeb81a103e9e0ac4e1fe0ce1bc6e6161c3c5e | /src/starkware/cairo/lean/semantics/air_encoding/memory_aux.lean | 7e02e69e8b0a2b8ebc616fa24da22249666d3cbf | [
"Apache-2.0"
] | permissive | starkware-libs/formal-proofs | d6b731604461bf99e6ba820e68acca62a21709e8 | f5fa4ba6a471357fd171175183203d0b437f6527 | refs/heads/master | 1,691,085,444,753 | 1,690,507,386,000 | 1,690,507,386,000 | 410,476,629 | 32 | 9 | Apache-2.0 | 1,690,506,773,000 | 1,632,639,790,000 | Lean | UTF-8 | Lean | false | false | 15,323 | lean | /-
Interpretation of memory constraints.
-/
import starkware.cairo.lean.semantics.util
noncomputable theory
open_locale classical big_operators
/-
General facts about polyomials
-/
namespace polynomial_aux
variables {F : Type*} [field F] [fintype F]
variables {n : Type*} [fintype n] (a b : n → F)
open finset poly... |
572470174a0b014a9fb82195de31c852934d3a48 | 94096349332b0a0e223a22a3917c8f253cd39235 | /src/game/world2/level6.lean | 601300d1239dca693525720ed27e093f916eeb68 | [] | no_license | robertylewis/natural_number_game | 26156e10ef7b45248549915cc4d1ab3d8c3afc85 | b210c05cd627242f791db1ee3f365ee7829674c9 | refs/heads/master | 1,598,964,725,038 | 1,572,602,236,000 | 1,572,602,236,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,750 | lean | import mynat.definition -- hide
import mynat.add -- hide
import game.world2.level5 -- hide
import tactic.ring -- hide
namespace mynat -- hide
/-
# World 2 -- Addition World
## Level 6 -- `add_right_comm`
You have (amongst other things these:
* `add_assoc (a b c : mynat) : (a + b) + c = a + (b + c)`
* `add_co... |
3017bed69c0ded82cb8245f4f5a22a7aa0c59f38 | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/algebra/ring.lean | cd6e23248c0b666956fa338aa15af42f02a64496 | [
"Apache-2.0"
] | permissive | roro47/mathlib | 761fdc002aef92f77818f3fef06bf6ec6fc1a28e | 80aa7d52537571a2ca62a3fdf71c9533a09422cf | refs/heads/master | 1,599,656,410,625 | 1,573,649,488,000 | 1,573,649,488,000 | 221,452,951 | 0 | 0 | Apache-2.0 | 1,573,647,693,000 | 1,573,647,692,000 | null | UTF-8 | Lean | false | false | 24,917 | 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, Amelia Livingston
-/
import algebra.group
import tactic.norm_cast
/-!
# Properties and homomorphisms of semirings and rings
This f... |
e9bff14107c42ee388c1fc59f5ac3bd90662517a | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/data/real/nnreal.lean | 05b1e4c4c86b1b3073419419ee1e9cad14a4bb25 | [
"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 | 28,450 | 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.big_operators.ring
import data.real.basic
import algebra.indicator_function
import algebra.algebra.basic
import algebra.order.nonneg
/-!
# Nonnegative... |
f1ffb17900ba03c17b57a7e4bd3b71407d4cc14f | 7cdf3413c097e5d36492d12cdd07030eb991d394 | /src/game/world6/level3.lean | 74bd64632b96f97fff94efedbb6375c04def26f7 | [] | no_license | alreadydone/natural_number_game | 3135b9385a9f43e74cfbf79513fc37e69b99e0b3 | 1a39e693df4f4e871eb449890d3c7715a25c2ec9 | refs/heads/master | 1,599,387,390,105 | 1,573,200,587,000 | 1,573,200,691,000 | 220,397,084 | 0 | 0 | null | 1,573,192,734,000 | 1,573,192,733,000 | null | UTF-8 | Lean | false | false | 2,340 | lean | /-
# Proposition world.
## Level 3 : `have`.
Say you have a whole bunch of propositions and implications between them,
and your goal is to build a certain proof of a certain proposition.
If it helps, you can build intermediate proofs of other propositions
along the way, using the `have` command. `have` is the Lean a... |
e67adb00bc2fa2f68d4773f58a004a691b6119b2 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /hott/algebra/e_closure.hlean | 5a01c4ba78f564bde8a15d70db66ea6178c98c72 | [
"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 | 8,682 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
The "equivalence closure" of a type-valued relation.
A more appropriate intuition is the type of words formed from the relation,
and inverses, concatenations and r... |
06f15a18b439a5c13de7a9c4a1866939468e0475 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/filter.lean | 99d78022305616d2fbc7d2cb99fadfe6b90393a3 | [
"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 | 63 | lean | #eval ((List.iota 1000000).filter (fun x => x % 2 = 1)).length
|
fa13f8257ade6ae216dd2ae74145c3c5735ae5dd | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/measure_theory/ae_eq_fun.lean | 9359fc98edd27b2f3af99fd70978fad39563fdb9 | [
"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 | 21,529 | lean | /-
Copyright (c) 2019 Johannes Hölzl, Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Zhouhang Zhou
-/
import measure_theory.integration
import order.filter.germ
/-!
# Almost everywhere equal functions
Two measurable functions are treat... |
724564a68f15c7a9defb89d4729bf37d4b8e6385 | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Lean/Linter/UnusedVariables.lean | 1aaf666c60dfaf68b94bc0838338975477edb635 | [
"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",
"Apache-2.0",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | gebner/lean4 | d51c4922640a52a6f7426536ea669ef18a1d9af5 | 8cd9ce06843c9d42d6d6dc43d3e81e3b49dfc20f | refs/heads/master | 1,685,732,780,391 | 1,672,962,627,000 | 1,673,459,398,000 | 373,307,283 | 0 | 0 | Apache-2.0 | 1,691,316,730,000 | 1,622,669,271,000 | Lean | UTF-8 | Lean | false | false | 10,650 | lean | import Lean.Elab.Command
import Lean.Util.ForEachExprWhere
import Lean.Linter.Util
import Lean.Server.References
namespace Lean.Linter
open Lean.Elab.Command Lean.Server Std
register_builtin_option linter.unusedVariables : Bool := {
defValue := true,
descr := "enable the 'unused variables' linter"
}
register_buil... |
9b4438aab0d3a08d0cb9851bd25c60c5e747ffa1 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/order/rearrangement.lean | 0a76e17ad39d409f8e68c7659e7f65e3a8c67f6d | [
"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 | 9,771 | lean | /-
Copyright (c) 2022 Mantas Bakšys. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mantas Bakšys
-/
import algebra.order.module
import group_theory.perm.support
import order.monovary
import tactic.abel
/-!
# Rearrangement inequality
This file proves the rearrangemen... |
6e6a13daa049732c9c7bb55c275cae6b5b55d7c1 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /doc/examples/Certora2022/ex21.lean | 37f6c5e5659eea354d6112141432efef1f726c1d | [
"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 | 555 | lean | /- Simplifier -/
example (p : Nat → Prop) : (x + 0) * (0 + y * 1 + z * 0) = x * y := by
simp
example (p : Nat → Prop) (h : p (x * y)) : p ((x + 0) * (0 + y * 1 + z * 0)) := by
simp; assumption
example (p : Nat → Prop) (h : p ((x + 0) * (0 + y * 1 + z * 0))) : p (x * y) := by
simp at h; assumption
def f (m n :... |
446394af034a2ad012ef9db371e20174cf2cc3bb | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/data/padics/hensel.lean | 042655c2d0aa4f85e5400d7300cb13ef309a06f7 | [
"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 | 21,464 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import data.padics.padic_integers
import topology.metric_space.cau_seq_filter
import analysis.specific_limits
import topology.algebra.polynomial
/-!
# Hensel's lem... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.