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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
187eea4b78df2ca00f52db4a4294fa70c242f666 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/finsupp/antidiagonal.lean | f6cbda96357b44abf7e0d0246ca3620578d9d494 | [
"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 | 4,496 | 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, Yury Kudryashov
-/
import data.finsupp.basic
import data.multiset.antidiagonal
/-!
# The `finsupp` counterpart of `multiset.antidiagonal`.
The antidiagonal of `s : α ... |
c3c0eda7d91d68304e32512151ce4ec1c6118aea | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/introv.lean | ccf21f1e410fc119e9c0938a938470e1b0fe36ae | [
"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 | 288 | lean | example : ∀ a b : nat, a = b → b = a :=
begin
introv h,
exact h.symm
end
example : ∀ a b : nat, a = b → ∀ c, b = c → a = c :=
begin
introv h₁ h₂,
exact h₁.trans h₂
end
example : ∀ a b : nat, a = b → b = a :=
begin
introv,
intro h,
exact h.symm
end
|
247a1b796864bf77788489a4580a4ce0f81aa5cf | b815abf92ce063fe0d1fabf5b42da483552aa3e8 | /library/init/algebra/ring.lean | af34352d7472d08592b8b8b08c6cabd484d294a9 | [
"Apache-2.0"
] | permissive | yodalee/lean | a368d842df12c63e9f79414ed7bbee805b9001ef | 317989bf9ef6ae1dec7488c2363dbfcdc16e0756 | refs/heads/master | 1,610,551,176,860 | 1,481,430,138,000 | 1,481,646,441,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,679 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
-/
prelude
import init.algebra.group
/- Make sure instances defined in this file have lower priority than the ones
defined for concrete stru... |
58a777ed1134004b363ad730c928a343e66f7745 | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/ring_theory/power_series.lean | af6a4a9bbefac9b52609409102473d1a947770ab | [
"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 | 57,842 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Kenny Lau
-/
import data.mv_polynomial
import ring_theory.ideal_operations
import tactic.linarith
/-!
# Formal power series
This file defines (multivariate) formal po... |
0352e05400db0f82955bd53eec737cdf62b8d0c1 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/pempty.lean | 9188797a5e7b2b2c397003fd21fc6ab9c434cc49 | [
"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,571 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta
-/
import category_theory.discrete_category
/-!
# The empty category
Defines a category structure on `pempty`, and the unique functor `pempty ⥤ C` for an... |
1f01251b5e0db99ce61e9a08474e23728a7fbe07 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/category/CommRing/limits_auto.lean | 1bc3fd92a29af4ebd2ff50924ac2c199e8749c97 | [] | 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 | 12,312 | 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.algebra.ring.pi
import Mathlib.algebra.category.CommRing.basic
import Mathlib.algebra.categ... |
bac73be0b971b7e757befc0886ba67f8d7c76a87 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /tests/compiler/t4.lean | 548dbfe9960f2d95609944139781847fad5f98c2 | [
"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 | 3,486 | lean | #lang lean4
/- Benchmark for new code generator -/
inductive Expr
| Val : Int → Expr
| Var : String → Expr
| Add : Expr → Expr → Expr
| Mul : Expr → Expr → Expr
| Pow : Expr → Expr → Expr
| Ln : Expr → Expr
namespace Expr
protected def Expr.toString : Expr → String
| Val n => toString n
| Var x => x
| Add f g ... |
d5c7eb91e02a4734dbac7af4aa9d93877ff498a3 | b00eb947a9c4141624aa8919e94ce6dcd249ed70 | /tests/lean/binderCacheIssue.lean | 204d2550ceff01c315ca17459e500f6c50b75d48 | [
"Apache-2.0"
] | permissive | gebner/lean4-old | a4129a041af2d4d12afb3a8d4deedabde727719b | ee51cdfaf63ee313c914d83264f91f414a0e3b6e | refs/heads/master | 1,683,628,606,745 | 1,622,651,300,000 | 1,622,654,405,000 | 142,608,821 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 616 | lean | universes u v w
class Funtype (N : Sort u) (O : outParam (Sort v)) (T : outParam (Sort w)) :=
pack : O -> N
unpack : N -> O
apply : N -> T
class LNot {P : Sort u} (L : P -> Prop) :=
toFun : (p : P) -> Not (L p)
namespace LNot
variable {P : Sort u} {L : P -> Prop}
abbrev applyFun (K : LNot L) {p} := K.toFun p... |
81ba270e8759aa01c2afff37be5d39cdb6a834e5 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/ring_theory/dedekind_domain.lean | 7b1c13a2ffe0f5e117e81686e0ad15cb27d7939f | [
"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,101 | lean | /-
Copyright (c) 2020 Kenji Nakagawa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenji Nakagawa, Anne Baanen, Filippo A. E. Nuccio
-/
import ring_theory.discrete_valuation_ring
import ring_theory.fractional_ideal
import ring_theory.ideal.over
/-!
# Dedekind domain... |
1259108804984c42099a0fcec3f4f77a7910b8b7 | 682dc1c167e5900ba3168b89700ae1cf501cfa29 | /src/basicmodal/syntax/soundness.lean | 01cb4d45b8485c637706e7dbe5388c8a0988c56d | [] | no_license | paulaneeley/modal | 834558c87f55cdd6d8a29bb46c12f4d1de3239bc | ee5d149d4ecb337005b850bddf4453e56a5daf04 | refs/heads/master | 1,675,911,819,093 | 1,609,785,144,000 | 1,609,785,144,000 | 270,388,715 | 13 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 3,456 | lean | /-
Copyright (c) 2021 Paula Neeley. All rights reserved.
Author: Paula Neeley
-/
import basicmodal.language data.set.basic basicmodal.semantics.semantics
import basicmodal.semantics.definability basicmodal.syntax.syntaxlemmas
local attribute [instance] classical.prop_decidable
---------------------- Soundness ------... |
1a32a42506dba1dde8276c9845514bfeab35a5b7 | 54deab7025df5d2df4573383df7e1e5497b7a2c2 | /data/nat/sub.lean | 453128851a8bb9901a05a4c22ff4244624e7f1c8 | [
"Apache-2.0"
] | permissive | HGldJ1966/mathlib | f8daac93a5b4ae805cfb0ecebac21a9ce9469009 | c5c5b504b918a6c5e91e372ee29ed754b0513e85 | refs/heads/master | 1,611,340,395,683 | 1,503,040,489,000 | 1,503,040,489,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,291 | lean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Jeremy Avigad
Subtraction on the natural numbers, as well as min, max, and distance.
-/
import data.nat.basic
namespace nat
/- interaction with inequalities -/
... |
42c17cefb17ff2a4cd5fb6dd0c1d5d61a26a913f | 4fa161becb8ce7378a709f5992a594764699e268 | /src/category_theory/simple.lean | 22088fe0a8196631c31d213e18c816654006cd9c | [
"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,919 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel, Scott Morrison
-/
import category_theory.limits.shapes.zero
import category_theory.limits.shapes.kernels
import category_theory.abelian.basic
open category_theory.limit... |
45cb7e337533b693a9a68bb1e4b4f007de0cf55e | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/algebra/continued_fractions/computation/approximations.lean | 332d061f9549b73757301533288ff3e7f2ec6c8b | [
"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 | 29,787 | lean | /-
Copyright (c) 2020 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import algebra.continued_fractions.computation.correctness_terminating
import data.nat.fib
import tactic.solve_by_elim
/-!
# Approximations for Continued Fraction... |
2c6f8fc790142c727221e1ab89c81a03b529ec69 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/algebra/category/Group.lean | 31e27afd7bfa89faf7a36ab95f419d3cc0fe219b | [
"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 | 6,042 | 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.punit_instances
import algebra.category.Mon.basic
import category_theory.endomorphism
/-!
# Category instances for group, add_group, comm_group, and ... |
37befba0587be215ad68b778f418c3c72919cfe7 | c3f2fcd060adfa2ca29f924839d2d925e8f2c685 | /tests/lean/run/group2.lean | f7ff60a4e0d2de830cee483cc1514a674462ea9b | [
"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 | 1,684 | lean | import logic
context
variable {A : Type}
variable f : A → A → A
variable one : A
variable inv : A → A
infixl `*` := f
postfix `^-1`:100 := inv
definition is_assoc := ∀ a b c, (a*b)*c = a*b*c
definition is_id := ∀ a, a*one = a
definition is_inv := ∀ a, a*a^-1 = one
end
inductive group_str... |
c217a0d379aa0edfffca91d543fecccdb7a07870 | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/pnat/factors.lean | f49517117765b61b63c9fa1d38f5974cea8a9560 | [
"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 | 14,620 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
-/
import algebra.big_operators.multiset.basic
import data.pnat.prime
import data.nat.factors
import data.multiset.sort
/-!
# Prime factors of nonzero naturals
This... |
6a35df85bde8c5da05b946448653f1f3323a3dbe | 510e96af568b060ed5858226ad954c258549f143 | /data/list/basic.lean | 75bbef44de3e6fb799a2ccb0d83e40b7025c13fc | [] | no_license | Shamrock-Frost/library_dev | cb6d1739237d81e17720118f72ba0a6db8a5906b | 0245c71e4931d3aceeacf0aea776454f6ee03c9c | refs/heads/master | 1,609,481,034,595 | 1,500,165,215,000 | 1,500,165,347,000 | 97,350,162 | 0 | 0 | null | 1,500,164,969,000 | 1,500,164,969,000 | null | UTF-8 | Lean | false | false | 12,567 | lean | /-
Copyright (c) 2014 Parikshit Khanna. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Parikshit Khanna, Jeremy Avigad, Leonardo de Moura, Floris van Doorn
Basic properties of lists.
-/
import logic.basic ..nat.basic
open function nat
namespace list
universe variable... |
0499ada635408ad7f8850070bda6f84d1cf3599d | 4727251e0cd73359b15b664c3170e5d754078599 | /src/tactic/doc_commands.lean | f51df2877e074b9223215062a3bd1a01d5037622 | [
"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 | 17,315 | lean | /-
Copyright (c) 2020 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import tactic.fix_reflect_string
/-!
# Documentation commands
We generate html documentation from mathlib. It is convenient to collect lists of tactics, commands,... |
8f6163bc9f0344b99e82c2edf98123726fef6bcb | b147e1312077cdcfea8e6756207b3fa538982e12 | /computability/partrec.lean | 5da7da75d066a4f3b2e014407b9a3ecc49e0eac4 | [
"Apache-2.0"
] | permissive | SzJS/mathlib | 07836ee708ca27cd18347e1e11ce7dd5afb3e926 | 23a5591fca0d43ee5d49d89f6f0ee07a24a6ca29 | refs/heads/master | 1,584,980,332,064 | 1,532,063,841,000 | 1,532,063,841,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,402 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
The partial recursive functions are defined similarly to the primitive
recursive functions, but now all functions are partial, implemented
using the `roption` monad, and... |
986f5c68ff52b89a01d85926c38a9b99fa33888c | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/MedialQuasiGroup.lean | d1bec6c1367a0826d9dd0851fc9a5f2c7469c97a | [] | no_license | ysharoda/Deriving-Definitions | 3e149e6641fae440badd35ac110a0bd705a49ad2 | dfecb27572022de3d4aa702cae8db19957523a59 | refs/heads/master | 1,679,127,857,700 | 1,615,939,007,000 | 1,615,939,007,000 | 229,785,731 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,369 | lean | import init.data.nat.basic
import init.data.fin.basic
import data.vector
import .Prelude
open Staged
open nat
open fin
open vector
section MedialQuasiGroup
structure MedialQuasiGroup (A : Type) : Type :=
(op : (A → (A → A)))
(linv : (A → (A → A)))
(leftCancel : (∀ {x y : A} , (op x (linv x y... |
2394598a031bdb189b47ba0bbf4c2b8d82424232 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/tactic/omega/int/main.lean | ce10475d055fc34b379dda1449bd40cca33c1676 | [
"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 | 6,327 | lean | /- Copyright (c) 2019 Seul Baek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Seul Baek
Main procedure for linear integer arithmetic. -/
import tactic.omega.prove_unsats
import tactic.omega.int.dnf
import tactic.omega.misc
open tactic
namespace omega
namespace int... |
7677f5e4d5255a18b97b83fc68c3ae05761869f2 | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/prop_logic_theory/unnamed_664.lean | 747d572ab075e7ecbd5d1ccfda98bf16cd2107c4 | [] | 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 | 209 | lean | variables a b c d e f : Prop
-- BEGIN
example (h₁ : d → a) (h₂ : f → b) (h₃ : e → c) (h₄ : e → a)
(h₅ : d → e) (h₆ : b → e) (h₇ : c) (h₈ : f) : a :=
begin
sorry
end
-- END |
a2654960b41151ec1e8bf8f5f007db107cdc35b4 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/data/finset/basic.lean | a7f2676c0448a915ce03a7191d93ab2ac5e7d19b | [
"Apache-2.0"
] | permissive | hjvromen/lewis | 40b035973df7c77ebf927afab7878c76d05ff758 | 105b675f73630f028ad5d890897a51b3c1146fb0 | refs/heads/master | 1,677,944,636,343 | 1,676,555,301,000 | 1,676,555,301,000 | 327,553,599 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 104,158 | 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, Jeremy Avigad, Minchao Wu, Mario Carneiro
-/
import data.multiset.finset_ops
import tactic.monotonicity
import tactic.apply
import tactic.nth_rewrite
/-!
# F... |
190073d884f3f214197a855e5dc8896b07273cda | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/category/functor.lean | 703386168e6ce9fcce8e5a6892e0b74a1ec14dc9 | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 4,263 | lean | /-
Copyright (c) 2017 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
Standard identity and composition functors
-/
import tactic.ext tactic.cache category.basic
universe variables u v w
section functor
variables {F : Type u → Type v}
variabl... |
a3285c223c8f317fd254e2d3829232defaf3ca5e | 60bf3fa4185ec5075eaea4384181bfbc7e1dc319 | /src/game/order/level08.lean | a7f06e73f8c3efe9ab8282f238c433f836a0f01f | [
"Apache-2.0"
] | permissive | anrddh/real-number-game | 660f1127d03a78fd35986c771d65c3132c5f4025 | c708c4e02ec306c657e1ea67862177490db041b0 | refs/heads/master | 1,668,214,277,092 | 1,593,105,075,000 | 1,593,105,075,000 | 264,269,218 | 0 | 0 | null | 1,589,567,264,000 | 1,589,567,264,000 | null | UTF-8 | Lean | false | false | 875 | lean | import data.real.basic
import data.real.irrational
open real
namespace xena -- hide
/-
# Chapter 2 : Order
## Level 8
Prove by example that there exist pairs of real numbers
$a$ and $b$ such that $a \in \mathbb{R} \setminus \mathbb{Q}$,
$b \in \mathbb{R} \setminus \mathbb{Q}$,
but their product $a \cdot b$ is a r... |
992812f2b36274098ad2e6d3a5195dade01f23df | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/category/Group/basic.lean | 55f7e8e85dd6fb67dcc6944fdab277878908c059 | [] | 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 | 10,512 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.category.Mon.basic
import Mathlib.category_theory.endomorphism
import Mathlib.PostP... |
90740bfc40266b9b4d1df1991634251a631afd0b | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/group_theory/perm/cycles_auto.lean | 9775769cb2bd280d0be57a49e8fea47d60b0421f | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,248 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.group_theory.perm.sign
import Mathlib.PostPort
universes u_2 u_1
namespace Mathlib
/-!
# Cy... |
53e4ce4d4d157efda159d77b2fc0b5f4e78a7f6f | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/moduleOf.lean | 0ed70033b8b9bf3cbcbbe7038549008862cbbf12 | [
"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 | 430 | lean | import Lean
def f (x : Nat) := x + x
open Lean
def tst : MetaM Unit := do
IO.println (← findModuleOf? `HAdd.hAdd)
IO.println (← findModuleOf? `Lean.Core.CoreM)
IO.println (← findModuleOf? `Lean.Elab.Term.elabTerm)
IO.println (← findModuleOf? `Lean.HashMap.insert)
IO.println (← findModuleOf? `tst)
IO.prin... |
47cd8da5bbd47d93f0693e16eee7ec531958eec2 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/gcd.lean | be5b9c5dfc30c4ad640a5dcf32d077f10c02f375 | [
"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,484 | lean | open nat well_founded decidable prod
namespace playground
-- Setup
definition pair_nat.lt := lex nat.lt nat.lt
definition pair_nat.lt.wf : well_founded pair_nat.lt :=
prod.lex_wf lt_wf lt_wf
infixl `≺`:50 := pair_nat.lt
-- Lemma for justifying recursive call
private lemma lt₁ (x₁ y₁ : nat) : (x₁ - y₁, succ y₁) ≺ ... |
02f1da64243fd927522260a7d53ac14ce0177a77 | 54ce0561cebde424526f41d45f490ed56be2bd0c | /src/game/ch4_Integers_and_Rationals/1_The_Integers.lean | e53a58cd8dd086103e5ff0f777390b01bacac3f4 | [] | no_license | melembroucarlitos/Tao_Analysis-LEAN | cf7b3298d317891a09e4bf21cfe7c7ffcb57b9a9 | 3f4fc7e090d96b6cef64896492fba4bef124794b | refs/heads/master | 1,692,952,385,694 | 1,636,287,522,000 | 1,636,287,522,000 | 400,630,166 | 3 | 0 | null | 1,635,910,807,000 | 1,630,096,823,000 | Lean | UTF-8 | Lean | false | false | 162 | lean | -- Level name : The Integers
/-
# Hey yall
## This is just to a placeholder to make sure all is working
these are some words
and these are some other words
-/
|
8423ea569dac263cabc34d185d32457e08ab45e3 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/computability/DFA.lean | f4cf327219af278f72c797c07b98793af3b25ead | [
"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,611 | lean | /-
Copyright (c) 2020 Fox Thomson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fox Thomson
-/
import data.fintype.basic
import computability.language
import tactic.norm_num
/-!
# Deterministic Finite Automata
This file contains the definition of a Deterministic Fi... |
346ecd30a379e03a10707b4308229a134b0d4826 | 1a61aba1b67cddccce19532a9596efe44be4285f | /tests/lean/notation3.lean | 65def3ce7bd2a14a0e9fd5aa0e7ceccb7a86c0ab | [
"Apache-2.0"
] | permissive | eigengrau/lean | 07986a0f2548688c13ba36231f6cdbee82abf4c6 | f8a773be1112015e2d232661ce616d23f12874d0 | refs/heads/master | 1,610,939,198,566 | 1,441,352,386,000 | 1,441,352,494,000 | 41,903,576 | 0 | 0 | null | 1,441,352,210,000 | 1,441,352,210,000 | null | UTF-8 | Lean | false | false | 315 | lean | import data.prod data.num
inductive list (T : Type) : Type := nil {} : list T | cons : T → list T → list T open list notation h :: t := cons h t notation `[` l:(foldr `,` (h t, cons h t) nil) `]` := l
open prod num
constants a b : num
check [a, b, b]
check (a, true, a = b, b)
check (a, b)
check [1, 2+2, 3]
|
d997603a13a7ba6f30708c20e2aaf53f804b2a12 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/quot.lean | cfb4f54fa88962ca07024c6edf7813eb2998f9c7 | [
"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 | 23,482 | 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 logic.relator
/-!
# Quotient types
This module extends the core library's treatment of quotient types (`init.data.quot`).
## Tags
quotient
-/
variables {α... |
3a10cec563eb447653bebcce83892a5b81a49c10 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/linear_algebra/basic.lean | 5d62e6270da791261af80bf21305187ebc57fc75 | [
"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 | 107,460 | 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, Kevin Buzzard, Yury Kudryashov, Frédéric Dupuis,
Heather Macbeth
-/
import algebra.big_operators.pi
import algebra.module.hom
import algebra.module.pr... |
a2534d9f5034c62f8a19038571549d00daf7e7d0 | 19cc34575500ee2e3d4586c15544632aa07a8e66 | /src/data/set/function.lean | 4d1aa8fdc07e3fe7ac49c9a5987961abca6002cc | [
"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 | 25,326 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Andrew Zipperer, Haitao Zhang, Minchao Wu, Yury Kudryashov
-/
import data.set.basic
import logic.function.conjugate
/-!
# Functions over sets
## Main definitions
### Pr... |
376e2f9b4a8662c3eada0d18ed589521800bae26 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/data/unsigned/basic.lean | 660ff82c8f4b07d531636a259a9df79077084887 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,962 | 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
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.data.fin.basic
namespace Mathlib
def unsigned_sz : ℕ :=
Nat.succ
(bit1
(bit1
(bi... |
91ef546481f30c731491ffc05b16f5684924911d | 79cc757e5e5b09c7a522f717a6c490d321d36469 | /src/mywork/practice_2.lean | 729c1b7e2065acbff473962cb30e05167f354420 | [] | no_license | LukeMathe/cs2120f21 | 534c3b8868dcfdea98a9d22513180c8a062794c6 | d51940b174569a8782e62ae027b108b5f099a9aa | refs/heads/main | 1,693,418,664,935 | 1,634,585,653,000 | 1,634,585,653,000 | 403,762,076 | 0 | 0 | null | 1,630,963,485,000 | 1,630,963,485,000 | null | UTF-8 | Lean | false | false | 13,522 | lean | /-
Prove the following simple logical conjectures.
Give a formal and an English proof of each one.
Your English language proofs should be complete
in the sense that they identify all the axioms
and/or theorems that you use.
-/
example : true := true.intro
example : false := _ -- trick question? why?
/- Cannot prov... |
86761945b5c161f408b3b366a158f2cec0979a2e | b147e1312077cdcfea8e6756207b3fa538982e12 | /order/bounded_lattice.lean | fe1974a3bf33277d2c14893f9ed1552c16f8848f | [
"Apache-2.0"
] | permissive | SzJS/mathlib | 07836ee708ca27cd18347e1e11ce7dd5afb3e926 | 23a5591fca0d43ee5d49d89f6f0ee07a24a6ca29 | refs/heads/master | 1,584,980,332,064 | 1,532,063,841,000 | 1,532,063,841,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,643 | 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
set_option old_structure_cmd true
universes u... |
5d1993fd233abd24300741289c80a27baf091aa8 | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/int/cast/lemmas.lean | 75356b0146c7e3c897c3c9635f514b971702aef1 | [
"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 | 11,501 | 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.int.order.basic
import data.nat.cast.basic
/-!
# Cast of integers (additional theorems)
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this... |
87c651a1e838f25939411e89eeb99ac14db0eedb | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/ideal/minimal_prime.lean | 785a283f8026aa8bdaee2a0d7a97fa1d2305a7e5 | [
"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 | 8,537 | lean | /-
Copyright (c) 2022 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import ring_theory.localization.at_prime
import order.minimal
/-!
# Minimal primes
We provide various results concerning the minimal primes above an ideal
## Main resu... |
0eb03acc585a1a33294673be95253ecc997fa184 | 0c1546a496eccfb56620165cad015f88d56190c5 | /tests/lean/run/do_match_else.lean | 18a71010175e150d4c3806019117d97c80f5eda3 | [
"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 | 562 | lean | open tactic
set_option pp.all true
meta def app2 (f a b : expr) :=
expr.app (expr.app f a) b
example (a b c x y : nat) (H : nat.add (nat.add x y) y = 0) : true :=
by do
a ← get_local `a, b ← get_local `b, c ← get_local `c,
H ← get_local `H >>= infer_type,
(lhs, rhs) ← match_eq H,
nat_add : expr ← mk_const `n... |
956fe95d1478e38b30444b96af2e292e60ebc381 | 54c9ed381c63410c9b6af3b0a1722c41152f037f | /Binport/ActionItem.lean | aac0eb702757bdaa8622ed04dbb254f660cf7006 | [
"Apache-2.0"
] | permissive | dselsam/binport | 0233f1aa961a77c4fc96f0dccc780d958c5efc6c | aef374df0e169e2c3f1dc911de240c076315805c | refs/heads/master | 1,687,453,448,108 | 1,627,483,296,000 | 1,627,483,296,000 | 333,825,622 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,823 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam
-/
import Binport.Util
import Binport.Path
import Lean
import Std.Data.HashSet
import Std.Data.HashMap
namespace Binport
open Lean
inductive MixfixKind
| «prefi... |
334980dd7e6fe7f7dee2a2ef6bfd4d66fe947c41 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/nat/nth.lean | 9bc9a72418d12abf55ba0cc512e7a43bda0ef53c | [
"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 | 15,213 | lean | /-
Copyright (c) 2021 Vladimir Goryachev. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies, Vladimir Goryachev, Kyle Miller, Scott Morrison, Eric Rodriguez
-/
import data.nat.count
import order.order_iso_nat
/-!
# The `n`th Number Satisfying a Predicate
Th... |
bd3ce4b086609e0dea54be531ee36af8e313bc80 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/linear_algebra/special_linear_group.lean | 36209babd43d43a5a311967eb993b57b1a9b4b63 | [
"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 | 8,632 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import linear_algebra.matrix.adjugate
import linear_algebra.matrix.to_lin
/-!
# The Special Linear group $SL(n, R)$
This file defines the elements of the Special Linear g... |
8adf3c632d49921c7471c3f5e4f57237328d9c88 | 4d3f29a7b2eff44af8fd0d3176232e039acb9ee3 | /LAMR/Examples/using_lean/examples5.lean | 62b19467c20d4aa1d0a5add4c425c33fac39c5cd | [] | no_license | marijnheule/lamr | 5fc5d69d326ff92e321242cfd7f72e78d7f99d7e | 28cc4114c7361059bb54f407fa312bf38b48728b | refs/heads/main | 1,689,338,013,620 | 1,630,359,632,000 | 1,630,359,632,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,213 | lean | import Init
-- textbook: showSums
def showSums : IO Unit := do
let mut sum := 0
for i in [0:100] do
sum := sum + i
IO.println s!"i: {i}, sum: {sum}"
#eval showSums
-- end textbook: showSums
-- textbook: isPrime
def isPrime (n : Nat) : Bool := do
if n < 2 then false else
for i in [2:n] do
if ... |
ef1cad2bfe57deafd98c48cffc1c62f1fe5f43f1 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/empty_match.lean | 1fdac3894be18be4c4f55100fa232414f1080fa2 | [
"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 | 117 | lean | open nat
definition not_lt_zero (a : nat) : ¬ a < zero :=
assume H : a < zero,
match H with
end
check not_lt_zero
|
89bd21f4b210b2dbd59180ac59e0e78bec77802a | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/order/ring/abs.lean | 4dcdeda4b64ddc9afc2a0c679a4605cb3e3794a5 | [
"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,688 | 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.order.ring.defs
import algebra.ring.divisibility
import algebra.order.group.abs
/-!
# Absolute values in linear orde... |
764a9e8a49909fcd54445c6692702ad5be59e471 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/typeOf.lean | 20f9f672a69ec31a13fb3cf8c70984855ebcdee3 | [
"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 | 626 | lean | --
def f1 (x : Nat) (b : Bool) : type_of% x :=
let r : type_of% (x+1) := x+1;
r + 1
theorem ex1 : f1 1 true = 3 :=
rfl
def f2 (x : Nat) (b : Bool) : type_of% x :=
let r : type_of% b := x+1; -- error
r + 1
def f3 (x : Nat) (b : Bool) : type_of% b :=
let r (x!1 : type_of% x) : type_of% b := x > 1;
r x
def f4 (x : Na... |
8e640ac7f25d11dcbc2ef6c2b8324866a3d1ee1b | 6094e25ea0b7699e642463b48e51b2ead6ddc23f | /tests/lean/run/new_obtain3.lean | 0bcae0cd7684af7c3f493303bcf93f090f65d2df | [
"Apache-2.0"
] | permissive | gbaz/lean | a7835c4e3006fbbb079e8f8ffe18aacc45adebfb | a501c308be3acaa50a2c0610ce2e0d71becf8032 | refs/heads/master | 1,611,198,791,433 | 1,451,339,111,000 | 1,451,339,111,000 | 48,713,797 | 0 | 0 | null | 1,451,338,939,000 | 1,451,338,939,000 | null | UTF-8 | Lean | false | false | 604 | lean | import data.set
open set function eq.ops
variables {X Y Z : Type}
lemma image_compose (f : Y → X) (g : X → Y) (a : set X) : (f ∘ g) '[a] = f '[g '[a]] :=
ext (take z,
iff.intro
(assume Hz : z ∈ (f ∘ g) '[a],
obtain x (Hx₁ : x ∈ a) (Hx₂ : f (g x) = z), from Hz,
have Hgx : g x ∈ g '[a], from mem_image... |
5b97dc24b48285728601f31ec9d6c39c5a337cf0 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/group_theory/group_action/conj_act.lean | a6fedd77833b8f934b0da01182ebc1a88429aa28 | [
"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 | 6,183 | lean | /-
Copyright (c) 2021 . All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import group_theory.group_action.basic
import group_theory.subgroup.basic
/-!
# Conjugation action of a group on itself
This file defines the conjugation action of a group on itself... |
63ff1eac1122771c0f0a47e3c9669bddc71acc32 | 122543640bfbfedbcee1318bfdbd466ead2716a7 | /src/p2.lean | acea66a207a7bc2fb6e21da93b08ab89e546d83c | [] | no_license | jsm28/bmo2-2020-lean | f038489093312c97b9cae3cdb9410b2683ccb11f | ff87ce51ed080d462e63c5549d5f2b377ad83204 | refs/heads/master | 1,692,783,059,184 | 1,689,807,657,000 | 1,689,807,657,000 | 239,362,030 | 9 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,156 | lean | -- BMO2 2020 problem 2.
-- Choices made for formalization: the original problem refers to
-- "collections", which we take as meaning sets.
import geometry.euclidean.monge_point
noncomputable theory
open_locale classical
open affine affine_subspace finite_dimensional euclidean_geometry
variables {V : Type*} {P : Ty... |
90de3c82e4b3590e2806660e52b136892f26848e | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/computability/turing_machine.lean | 405bd17944b8c9c11f06dc673b84db6bdb3f0159 | [
"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 | 109,959 | 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.fintype.basic
import data.pfun
import logic.function.iterate
import order.basic
import tactic.apply_fun
/-!
# Turing machines
This file defines a sequen... |
9212edd5e366569cc8afafa43880eb439d4d57ab | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/measure/haar/normed_space.lean | f4cae461859496b6165750f017dfd6f2f0b08090 | [
"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 | 8,550 | lean | /-
Copyright (c) 2020 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.eq_haar
import measure_theory.integral.bochner
/-!
# Basic properties of Haar measures on real vector s... |
ef6a61b7b7bcd55da9cf0f2a7fcd79859510b059 | 27a31d06bcfc7c5d379fd04a08a9f5ed3f5302d4 | /src/Lean/Data/KVMap.lean | fee7652bcea6e977c900f1b38249d3f1ddc31691 | [
"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 | joehendrix/lean4 | 0d1486945f7ca9fe225070374338f4f7e74bab03 | 1221bdd3c7d5395baa451ce8fdd2c2f8a00cbc8f | refs/heads/master | 1,640,573,727,861 | 1,639,662,710,000 | 1,639,665,515,000 | 198,893,504 | 0 | 0 | Apache-2.0 | 1,564,084,645,000 | 1,564,084,644,000 | null | UTF-8 | Lean | false | false | 6,092 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Data.Name
namespace Lean
inductive DataValue where
| ofString (v : String)
| ofBool (v : Bool)
| ofName (v : Name)
| ofNat (v :... |
24b5f0da6e5217575b78a284be23058b62394365 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/set/accumulate.lean | 11dcfe4dd42c6f960ddf44787dd27e7c9b880c6b | [] | 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,101 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.set.lattice
import Mathlib.PostPort
universes u_1 u_2
namespace Mathlib
/-!
# ... |
563684aeb3e68c675bc64e6b1c53778af62642d6 | ea4aee6b11f86433e69bb5e50d0259e056d0ae61 | /src/tidy/auto_cast.lean | f2465cc3e4d224a5058d3b955ae6986cbf4a14b2 | [] | no_license | timjb/lean-tidy | e18feff0b7f0aad08c614fb4d34aaf527bf21e20 | e767e259bf76c69edfd4ab8af1b76e6f1ed67f48 | refs/heads/master | 1,624,861,693,182 | 1,504,411,006,000 | 1,504,411,006,000 | 103,740,824 | 0 | 0 | null | 1,505,553,968,000 | 1,505,553,968,000 | null | UTF-8 | Lean | false | false | 466 | 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 .smt
open tactic
@[reducible] def {u} auto_cast {α β : Sort u} {h : α = β} (a : α) := cast h a
@[simp] lemma {u} auto_cast_identity {α : Sort u} (a : α) ... |
a6a4286eb31caad258ce67060e9d99feed0759d2 | 1b8f093752ba748c5ca0083afef2959aaa7dace5 | /src/category_theory/universal/comma_categories.lean | 23b2b66ba3712713092edc0af023546fac85d273 | [] | no_license | khoek/lean-category-theory | 7ec4cda9cc64a5a4ffeb84712ac7d020dbbba386 | 63dcb598e9270a3e8b56d1769eb4f825a177cd95 | refs/heads/master | 1,585,251,725,759 | 1,539,344,445,000 | 1,539,344,445,000 | 145,281,070 | 0 | 0 | null | 1,534,662,376,000 | 1,534,662,376,000 | null | UTF-8 | Lean | false | false | 5,147 | 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.functor_category
import category_theory.walking
import category_theory.discrete_category
-- FIXME why do we need this here... |
9799382a1d558c7cc0f23b3bd844370e642debe0 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/calculus/deriv/mul.lean | 3a21aef1819eb4dd90d1a962fd5fce1d7e38c7cf | [
"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,862 | lean | /-
Copyright (c) 2019 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Anatole Dedecker, Yury Kudryashov
-/
import analysis.calculus.deriv.basic
import analysis.calculus.fderiv.mul
import analysis.calculus.fderiv.add
/-!
# Derivative of `f ... |
f640acdc19fc5eff6ac36adcdb1153401c19a871 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/linear_algebra/lagrange.lean | 8c6f35b50203c330b20b1e9ba4a5fb8b0773e027 | [
"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 | 7,257 | 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 ring_theory.polynomial
import algebra.big_operators.basic
/-!
# Lagrange interpolation
## Main definitions
* `lagrange.basis s x` where `s : finset F` and `x : F`: t... |
4d3659cfe67c967acde362b80590358b299fe9cb | ce89339993655da64b6ccb555c837ce6c10f9ef4 | /zeptometer/topprover/2.lean | 81859f871f14b730a056ae7ec5276f0e233c7ada | [] | no_license | zeptometer/LearnLean | ef32dc36a22119f18d843f548d0bb42f907bff5d | bb84d5dbe521127ba134d4dbf9559b294a80b9f7 | refs/heads/master | 1,625,710,824,322 | 1,601,382,570,000 | 1,601,382,570,000 | 195,228,870 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 96 | lean | theorem plus_comm : ∀ n m : nat, n + m = m + n := begin
intros,
apply nat.add_comm
end |
d565e5dbeb47ce751b52dfb8247db592a4d67f8a | 27a31d06bcfc7c5d379fd04a08a9f5ed3f5302d4 | /stage0/src/Leanpkg.lean | c98207e652cf7b1c33027abb99cb59c8e363375c | [
"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 | joehendrix/lean4 | 0d1486945f7ca9fe225070374338f4f7e74bab03 | 1221bdd3c7d5395baa451ce8fdd2c2f8a00cbc8f | refs/heads/master | 1,640,573,727,861 | 1,639,662,710,000 | 1,639,665,515,000 | 198,893,504 | 0 | 0 | Apache-2.0 | 1,564,084,645,000 | 1,564,084,644,000 | null | UTF-8 | Lean | false | false | 8,982 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Sebastian Ullrich
-/
import Leanpkg.Resolve
import Leanpkg.Git
import Leanpkg.Build
import Lean.Util.Paths
open System
namespace Leanpkg
def readManifest : IO ... |
bc3f9d5223580ebd0df6713b7c9d44dab79c0f18 | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/tactic/ring.lean | e186b07b195b00ef7d58cb1db44bdae91a1eca5f | [
"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 | 22,044 | 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 algebra.group_power tactic.norm_num
import tactic.converter.interactive
/-!
# `ring`
Evaluate expressions in the language of commutative (semi)rings.
Based ... |
c0f2c39b43d3b121a8634b5c73f51423c0e3802c | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/category_theory/equivalence.lean | 4698c1780dd2542fc4340ab59a72e294571a763b | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 14,256 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tim Baumann, Stephen Morgan, Scott Morrison, Floris van Doorn
-/
import category_theory.fully_faithful
import category_theory.whiskering
import category_theory.natural_isomorphism
impo... |
20dc22b664c2535d81a6ae454ff65ee7ae2bb8ee | 94096349332b0a0e223a22a3917c8f253cd39235 | /src/game/world2/level3.lean | 71e3580bb674eb26b6f3465dcfe9a25ce428e94d | [] | 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 | 1,562 | lean | import mynat.definition -- hide
import mynat.add -- hide
import game.world2.level2 -- hide
namespace mynat -- hide
/-
# World 2 -- addition world
## Level 3 : `succ_add`
## You are equipped with:
* `add_zero (a : mynat) : a + 0 = a`
* `add_succ (a b : mynat) : a + succ(b) = succ(a + b)`
* `zero_add` (a : myn... |
7704b9c21a11c753ac403e63068c3a32b280f8b0 | 4c06d0726f5a71477566b5375c127fa204c6c583 | /proofs-after.lean | 26ef8a223e3649c505e9709aa78370a8a913d73e | [] | no_license | skaslev/proofs-talk | d2e990c889ee0b3fe015fa391011078a63dba0d5 | b8019ae7506def5f8d657c35c8c4ee685a015796 | refs/heads/master | 1,585,996,863,406 | 1,541,627,234,000 | 1,541,627,234,000 | 155,862,265 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,495 | lean | attribute [simp] function.comp
section intro
variables {a b c d e : Type}
def modus_ponens (x : a) (f : a → b) : b :=
f x
def modus_tollens (h : b → empty) (f : a → b) : a → empty :=
h ∘ f
def ex_falso_quodlibet (x : empty) : a :=
x.rec _
def eagle (x₁ : a → d → c) (x₂ : a) (x₃ : b → e → d) (x₄ : b) (x₅ : e) : c ... |
417750bf780aac23a2392d53608fdb3121f57162 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/algebra/ordered_field.lean | 472c2d9c02b65c52b1556fd5927a911b342d3123 | [
"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 | 28,226 | 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, Mario Carneiro, Floris van Doorn
-/
import algebra.ordered_ring
import algebra.field
import tactic.monotonicity.basic
import algebra.group_power.order
im... |
49f3e208fd7fbe969e20f76c6f8ab5ccbfbd361f | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/analysis/normed_space/normed_group_hom.lean | e1942200aeb911049c649b8c97e48335eedb2888 | [
"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,742 | 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 analysis.normed_space.basic
/-!
# Normed groups homomorphisms
This file gathers definitions and elementary constructions about bounded group homomorphisms
b... |
2b572b8969aca96eac220629d5f985c744d942bd | ff5230333a701471f46c57e8c115a073ebaaa448 | /library/data/rbtree/insert.lean | 2c89dfaf991569bda2fd417e3ce449ba6781dfc5 | [
"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 | 33,438 | 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
-/
import data.rbtree.find
universes u v
local attribute [simp] rbnode.lift
namespace rbnode
variables {α : Type u}
open color
@[simp] lemma balance1_eq₁ (... |
5c35de0f69168fddfcc1a388939e0c1dab0688e5 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/polynomial/inductions.lean | 44eee76787ed821cac75fe3af5a701900f13987a | [
"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 | 5,018 | lean | /-
Copyright (c) 2021 Damiano Testa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Damiano Testa, Jens Wagemaker
-/
import data.nat.interval
import data.polynomial.degree.definitions
/-!
# Induction on polynomials
This f... |
b6f92e26f4ea8a3c01b4269f763c7a7a76977bfb | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/lie/skew_adjoint.lean | c9f78e816a6d0bc373e9397c726620f7999d30ea | [
"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,312 | lean | /-
Copyright (c) 2020 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.matrix
import linear_algebra.matrix.bilinear_form
/-!
# Lie algebras of skew-adjoint endomorphisms of a bilinear form
> THIS FILE IS SYNCHRONIZED WITH ... |
04fdbfa2103086f22ef40e79a7a707240abd68e3 | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/real/basic.lean | 026b37aa748d3c79b047a3bdca8f5c1bb0f80a42 | [
"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 | 20,995 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Floris van Doorn
The (classical) real numbers ℝ. This is a direct construction
from Cauchy sequences.
-/
import order.conditionally_complete_lattice
import data.real.c... |
853e975a2fb0904dd80f84bda39559dfdf7bbfc3 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/ideal/over.lean | e9a5a86776ecf08c13917fcc1d0ce39f6bc29afd | [
"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 | 18,026 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import ring_theory.algebraic
import ring_theory.localization.at_prime
import ring_theory.localization.integral
/-!
# Ideals over/under ideals
> THIS FILE IS SYNCHRONIZED... |
9d23cb85a8c68128d1426e197a348c3e04dbdeef | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/topology/algebra/group/basic.lean | a9088e29754f0b1b71f8b442c5efb56c1c846101 | [
"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 | 67,440 | 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
-/
import group_theory.group_action.conj_act
import group_theory.group_action.quotient
import group_theory.quotient_group
import topology... |
8d9a5ef4a6416e8451b44b85a739857f54f23c62 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/linear_algebra/finite_dimensional.lean | ca5c330cd40eb8cb1fb2521ba32e385b634de2cf | [
"Apache-2.0"
] | permissive | hjvromen/lewis | 40b035973df7c77ebf927afab7878c76d05ff758 | 105b675f73630f028ad5d890897a51b3c1146fb0 | refs/heads/master | 1,677,944,636,343 | 1,676,555,301,000 | 1,676,555,301,000 | 327,553,599 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 53,733 | 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 linear_algebra.dimension
import ring_theory.principal_ideal_domain
import algebra.algebra.subalgebra
/-!
# Finite dimensional vector spaces
Definition and basic ... |
306d9e6aebe4557212259eee766849d7527526c4 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/local_cache.lean | 1a72d041c95dbb47f728a4ca90d18b2bbfca1d7d | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,437 | lean | /-
Copyright (c) 2019 Keeley Hoek. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Keeley Hoek
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.norm_num
import Mathlib.PostPort
namespace Mathlib
namespace tactic
namespace local_ca... |
c831f26034d636f62238ade812fca656662c3e77 | 2385ce0e3b60d8dbea33dd439902a2070cca7a24 | /library/init/meta/tactic.lean | 79f394a50d585b2fc4faa2499f33ea940182e620 | [
"Apache-2.0"
] | permissive | TehMillhouse/lean | 68d6fdd2fb11a6c65bc28dec308d70f04dad38b4 | 6bbf2fbd8912617e5a973575bab8c383c9c268a1 | refs/heads/master | 1,620,830,893,339 | 1,515,592,479,000 | 1,515,592,997,000 | 116,964,828 | 0 | 0 | null | 1,515,592,734,000 | 1,515,592,734,000 | null | UTF-8 | Lean | false | false | 51,263 | 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.function init.data.option.basic init.util
import init.category.combinators init.category.monad init.category.alternative init.category.m... |
2c58c42b852075756616367b7b86727d4802eaeb | 4727251e0cd73359b15b664c3170e5d754078599 | /src/deprecated/subfield.lean | f6bce8e4397b04b1ee8a9180ffe893164dab1166 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 5,784 | lean | /-
Copyright (c) 2018 Andreas Swerdlow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andreas Swerdlow
-/
import deprecated.subring
import algebra.group_with_zero.power
/-
# Unbundled subfields
This file introduces the predicate `is_subfield` on `S : set F` where `F... |
473d38fb3f49f585610d94a5c3d9d0b2cdfb0127 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Meta/GeneralizeTelescope.lean | 719c01560b8d1c190b2cd40fd85006082c1eb3e3 | [
"Apache-2.0"
] | permissive | WojciechKarpiel/lean4 | 7f89706b8e3c1f942b83a2c91a3a00b05da0e65b | f6e1314fa08293dea66a329e05b6c196a0189163 | refs/heads/master | 1,686,633,402,214 | 1,625,821,189,000 | 1,625,821,258,000 | 384,640,886 | 0 | 0 | Apache-2.0 | 1,625,903,617,000 | 1,625,903,026,000 | null | UTF-8 | Lean | false | false | 3,863 | 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.Meta.KAbstract
namespace Lean.Meta
namespace GeneralizeTelescope
structure Entry where
expr : Expr
type : Expr
modified : Bool
... |
7948a321ffa5fdfe958606ae9a1166050eb84d1a | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/order/extension.lean | ac1176a7c828837bc07163d8d2a49bda74026f09 | [
"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 | 3,902 | lean | /-
Copyright (c) 2021 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import data.set.lattice
import order.zorn
/-!
# Extend a partial order to a linear order
This file constructs a linear order which is an extension of the given partial ... |
29a13c87a55c3ee506128e3e476a9d9c243ee4b7 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/data/polynomial/derivative.lean | 1544b21a5dbceed8efd7e52aeae940d6a82d474a | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,824 | 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.eval
import algebra.iterate_hom
/-!
# The derivative map on polynomials
## Main definitions
* `p... |
ba5a1ec7440f24b4e9317535fdb1899a297f497a | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/equivalence.lean | a54f2bb5ec9743d0ef79f929697698d37aea902d | [
"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,247 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tim Baumann, Stephen Morgan, Scott Morrison, Floris van Doorn
-/
import category_theory.fully_faithful
import category_theory.whiskering
import tactic.slice
namespace category_theory
... |
2d6ae76286905d22d300782ded4a1867f9a61133 | 80746c6dba6a866de5431094bf9f8f841b043d77 | /src/data/nat/gcd.lean | b7dd691e7473735dbd5141357d004cea8093239b | [
"Apache-2.0"
] | permissive | leanprover-fork/mathlib-backup | 8b5c95c535b148fca858f7e8db75a76252e32987 | 0eb9db6a1a8a605f0cf9e33873d0450f9f0ae9b0 | refs/heads/master | 1,585,156,056,139 | 1,548,864,430,000 | 1,548,864,438,000 | 143,964,213 | 0 | 0 | Apache-2.0 | 1,550,795,966,000 | 1,533,705,322,000 | Lean | UTF-8 | Lean | false | false | 13,043 | 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
Definitions and properties of gcd, lcm, and coprime.
-/
import data.nat.basic
namespace nat
/- gcd -/
theorem gcd_dvd (m n : ℕ) : (gcd m n ∣ m) ∧ (g... |
0c447f11c3db47d6a2e8bb3fcdd310304a4f5075 | 137c667471a40116a7afd7261f030b30180468c2 | /src/analysis/specific_limits.lean | 80e739b2c8ff3a1b3cd871c88130587f0024a684 | [
"Apache-2.0"
] | permissive | bragadeesh153/mathlib | 46bf814cfb1eecb34b5d1549b9117dc60f657792 | b577bb2cd1f96eb47031878256856020b76f73cd | refs/heads/master | 1,687,435,188,334 | 1,626,384,207,000 | 1,626,384,207,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 41,821 | 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.geom_sum
import order.filter.archimedean
import order.iterate
import topology.instances.ennreal
import tactic.ring_exp
import analysis.asymptotics.asym... |
29e767232a99e50b96e1dd7bc23f83f1844ac33d | c777c32c8e484e195053731103c5e52af26a25d1 | /src/measure_theory/constructions/borel_space.lean | e8067d5ceca54e1c37b81b189039721f5b8a09f2 | [
"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 | 94,180 | 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, Yury Kudryashov
-/
import analysis.complex.basic
import analysis.normed_space.finite_dimension
import measure_theory.function.ae_measurable_sequence
import measure_theo... |
7995e26f5a3795b9ea8776a7bc9ce5408ea9bcf9 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/topology/algebra/uniform_field.lean | 2125b4d4e90597d5f2f1a7aff032c0695972bb39 | [
"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 | 6,593 | lean | /-
Copyright (c) 2019 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import topology.algebra.uniform_ring
import topology.algebra.field
/-!
# Completion of topological fields
The goal of this file is to prove the main part of Proposi... |
08045ac821b07ce841a175c86cdcdab96403e8b5 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/751.lean | bc01a67e3903f2a12928be25c5e89b006b03833b | [
"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 | 95 | lean | #exit
inductive foo (A : Type) :=
| intro : foo A → foo A
with bar : Type :=
| intro : bar A
|
89ddbaae94f2c75ffb4ba36f09b9d634a06ffdf9 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/prod_notation.lean | 9c3070961d18868571819867ea7b26f7f34427f5 | [
"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 | 128 | lean | open prod
definition tst1 : num × Prop × num × Prop := (1, true, 2, false)
definition tst2 : num × num × num := (1, 2, 3)
|
c0f543c3cc344811229db97f4bf360b9a4f45bc7 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/ring_theory/mv_polynomial/basic.lean | d029ddd1ebe907093c9b5e2db2de521588440295 | [
"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,228 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import algebra.char_p.basic
import linear_algebra.finsupp_vector_space
/-!
# Multivariate polynomials over commutative rings
This file contains basic facts about m... |
93ce453afc261bd2cae92418a57b0688a627e1c6 | 42c01158c2730cc6ac3e058c1339c18cb90366e2 | /M1F/2017-18/Example_Sheet_01/Questions_02_to_4/M1F_sheet01_solutions02_to_04.lean | c56bf95dafa8e089d3adf67a950513c82adbc288 | [] | no_license | ChrisHughes24/xena | c80d94355d0c2ae8deddda9d01e6d31bc21c30ae | 337a0d7c9f0e255e08d6d0a383e303c080c6ec0c | refs/heads/master | 1,631,059,898,392 | 1,511,200,551,000 | 1,511,200,551,000 | 111,468,589 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,734 | lean | /-
M1F 2017-18 Sheet 1 Question 2 to 4 solutions.
Author : Kevin Buzzard
This file should work with any version of lean -- whether you installed it yourself
or are running the version on https://leanprover.github.io/live/latest/
-/
-- We probably need the "law of the excluded middle" for this question -- every
-- pro... |
eb036d278cad3a7e5306d696572be54d0b83afaa | 4b4a91d762ac3b6ef8f164899a6a26fc125eddd6 | /src/solutions/level_2_group_actions.lean | 48f1022205582e5e7e8cdbf088eea92ee05a1de7 | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/group-action-exercises | 955ceba8edb7eba7b8916690083829d321909aee | 197b1a0e53ec8d84bf3903c9ab5cddf615a44816 | refs/heads/master | 1,686,020,547,415 | 1,625,354,242,000 | 1,625,354,242,000 | 382,577,731 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,783 | lean | import group_theory.group_action.basic
import tactic
import data.setoid.partition
variables {G : Type*} [group G] {S : Type} {s t u : S} [mul_action G S]
open mul_action
theorem mem_orbit_refl (s : S) : s ∈ orbit G s :=
begin
-- we could use `1 : G` but this is already in the library under another name
exact mem... |
a468d251c40fb6997fc6c30ba1865d7f34d49df2 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/seq/seq.lean | 11377190ea5e7ddfc06f5ae62ee39a6aa3b6afd7 | [] | 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 | 19,881 | 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.list.basic
import Mathlib.Lean3Lib.data.stream
import Mathlib.Lean3Lib.data.lazy_list
i... |
f6dd763e5158b37ae52b927c028ba4ebf9818e5f | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/unhygienicCode.lean | e2a963fe1f1cb96a945ee9f00bb54d15daa56aa8 | [
"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 | 299 | lean | import Lean.Hygiene
open Lean
set_option trace.Compiler.result true
set_option trace.compiler.ir.result true
-- The following function should not allocate any closures,
-- nor any heap object that doesn't appear in the result:
def foo (n : Nat) : Syntax.Term :=
Unhygienic.run `(a + $(quote n))
|
2f800bde44c59ff34835d18c8c816ae7e11a6a17 | abd85493667895c57a7507870867b28124b3998f | /src/category_theory/limits/limits.lean | de333ddfcdd6cdc4cdca88cbd5f0b82b3516f1c3 | [
"Apache-2.0"
] | permissive | pechersky/mathlib | d56eef16bddb0bfc8bc552b05b7270aff5944393 | f1df14c2214ee114c9738e733efd5de174deb95d | refs/heads/master | 1,666,714,392,571 | 1,591,747,567,000 | 1,591,747,567,000 | 270,557,274 | 0 | 0 | Apache-2.0 | 1,591,597,975,000 | 1,591,597,974,000 | null | UTF-8 | Lean | false | false | 43,213 | 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.limits.cones
import category_theory.adjunction.basic
open category_theory category_theory.categ... |
a98abc40df81db052536565682e0e9721581f675 | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/category_theory/monoidal/of_has_finite_products.lean | 57c8c2295e803ea9c9217e6ab3e26c8aba4923c6 | [
"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 | 2,212 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Simon Hudon
-/
import category_theory.monoidal.category
import category_theory.limits.shapes.finite_products
import category_theory.limits.shapes.binary_products
import... |
72bbc3fa2b4322d0045b6cd80e6e58d22d77cddc | 6f1049e897f569e5c47237de40321e62f0181948 | /src/exercises/09_limits_final.lean | bbad8fe10c5ae4749121e65c0ac9cd46d1fe3e3b | [
"Apache-2.0"
] | permissive | anrddh/tutorials | f654a0807b9523608544836d9a81939f8e1dceb8 | 3ba43804e7b632201c494cdaa8da5406f1a255f9 | refs/heads/master | 1,655,542,921,827 | 1,588,846,595,000 | 1,588,846,595,000 | 262,330,134 | 0 | 0 | null | 1,588,944,346,000 | 1,588,944,345,000 | null | UTF-8 | Lean | false | false | 7,189 | lean | import tuto_lib
set_option pp.beta true
set_option pp.coercions false
/-
This is the final file in this series. Here we use everything covered
in previous files to prove a couple of famous theorems from
elementary real analysis. Of course they all have more general versions
in mathlib.
As usual, keep in mind:
ab... |
ae7f69a9ed71faf5cff4e06c85c7211aab14d0a8 | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /library/init/native/cf.lean | 5528ee77887ecf6ed6b95463053256eeae612a7a | [
"Apache-2.0"
] | permissive | bre7k30/lean | de893411bcfa7b3c5572e61b9e1c52951b310aa4 | 5a924699d076dab1bd5af23a8f910b433e598d7a | refs/heads/master | 1,610,900,145,817 | 1,488,006,845,000 | 1,488,006,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,483 | lean | /-
Copyright (c) 2016 Jared Roesch. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jared Roesch
-/
prelude
import init.meta.format
import init.meta.expr
import init.data.string
import init.category.state
import init.native.ir
import init.native.format
import init.nati... |
9903a04abdf3b90b3418cdfc1f27aebeacce0233 | 6df8d5ae3acf20ad0d7f0247d2cee1957ef96df1 | /HW/hw6_prop_logic_and_satifiability.lean | 287993b891bdca7318a03e5ca4eab9ac5d48fec8 | [] | no_license | derekjohnsonva/CS2102 | 8ed45daa6658e6121bac0f6691eac6147d08246d | b3f507d4be824a2511838a1054d04fc9aef3304c | refs/heads/master | 1,648,529,162,527 | 1,578,851,859,000 | 1,578,851,859,000 | 233,433,207 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,588 | lean | namespace prop_logic
/-
This assignment has five problems. The first
is to extend our propositional logic syntax
and semantics to support the three additional
connectives, exclusive or (⊕), implies (which
we will write as ⇒), and if and only iff (↔).
We first give you the definitions developed
in class. You are to ex... |
e95416883e7fe2915828cb261a894d07207c422d | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /doc/examples/bintree.lean | ff62f88c42c59ec6ec45e807eb973b65bae8512f | [
"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,920 | lean | /-!
# Binary Search Trees
If the type of keys can be totally ordered -- that is, it supports a well-behaved `≤` comparison --
then maps can be implemented with binary search trees (BSTs). Insert and lookup operations on BSTs take time
proportional to the height of the tree. If the tree is balanced, the operations ther... |
bdc0a13e03949c6653b950ce65d43ee7f1947f69 | d840a2fd78ca0ee1e172fe2cf3751030229b56f3 | /lean_demo/src/inf_primes.lean | 77cc380be1cfc3bf13bf29569fe57abb533a83e2 | [] | no_license | stormymcstorm/VFRust_Presentation | 6e1d3964ce58d97320b36314ae83021bfb55f12d | 90142be25fa032464b3c4e68bc9f152213146254 | refs/heads/main | 1,673,178,849,384 | 1,605,289,504,000 | 1,605,289,504,000 | 312,644,751 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 249 | lean | import data.nat.prime
open nat
-- A theorem stating that there are an infinite number of primes, or
-- more precisely for any natural number N there exists a prime p ≥ N
theorem infinite_primes: ∀ N, ∃ p ≥ N, prime p := begin
sorry
end |
7611cc89e44db45477eb29da0fe1b8d12135bbb8 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/category_theory/limits/shapes/constructions/limits_of_products_and_equalizers.lean | fd9e64a3589a527b3873ea5112084d7fdee453f1 | [
"Apache-2.0"
] | permissive | Lix0120/mathlib | 0020745240315ed0e517cbf32e738d8f9811dd80 | e14c37827456fc6707f31b4d1d16f1f3a3205e91 | refs/heads/master | 1,673,102,855,024 | 1,604,151,044,000 | 1,604,151,044,000 | 308,930,245 | 0 | 0 | Apache-2.0 | 1,604,164,710,000 | 1,604,163,547,000 | null | UTF-8 | Lean | false | false | 4,886 | 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 category_theory.limits.shapes.equalizers
import category_theory.limits.shapes.finite_products
/-!
# Constructing limits from products and equalizers.... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.