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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
44084c144ab44a3000db43eeb8527609b9c0eb94 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /library/data/nat/fact.lean | 9b56fd0e839ad8c459deb479884d288464acb71d | [
"Apache-2.0"
] | permissive | jroesch/lean | 30ef0860fa905d35b9ad6f76de1a4f65c9af6871 | 3de4ec1a6ce9a960feb2a48eeea8b53246fa34f2 | refs/heads/master | 1,586,090,835,348 | 1,455,142,203,000 | 1,455,142,277,000 | 51,536,958 | 1 | 0 | null | 1,455,215,811,000 | 1,455,215,811,000 | null | UTF-8 | Lean | false | false | 1,427 | 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
Factorial
-/
import data.nat.div
namespace nat
definition fact : nat → nat
| 0 := 1
| (succ n) := (succ n) * fact n
lemma fact_zero : fact 0 = 1 :=
r... |
0dabd09e0ea154747877bf4c225d949a6dc04040 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /stage0/src/Lean/Elab/Tactic.lean | d3c0343147b49ba512b00f4f49ed2149bb45ba18 | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 527 | 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, Sebastian Ullrich
-/
import Lean.Elab.Term
import Lean.Elab.Tactic.Basic
import Lean.Elab.Tactic.ElabTerm
import Lean.Elab.Tactic.Induction
import Lean.Elab.T... |
c8bca2767ce749ca3b1ceb0b5d187b8bf8128b81 | abd85493667895c57a7507870867b28124b3998f | /src/tactic/equiv_rw.lean | 036fa8b2a746457e107f7f1cec69cacf59160281 | [
"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 | 12,055 | 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 control.equiv_functor
/-!
# The `equiv_rw` tactic transports goals or hypotheses along equivalences.
The basic syntax is `equiv_rw e`, where `e : α ≃ β` is a... |
4733afb1ef48446b7f789d1da9e65b767a04c24d | dce2ec26258c35f21c8a5318a7a2ed297ddba7c6 | /src/ncategory_theory/Ndefs.lean | ad1485edc55095980961dce4f407c0cd18f67cb5 | [] | no_license | nedsu/lean-category-theory-pr | c151c4f95d58a2d3b33e8f38ff7734d85d82e5ee | 8d72f4645d83c72d15afaee7a2df781b952417e9 | refs/heads/master | 1,625,444,569,743 | 1,597,056,476,000 | 1,597,056,476,000 | 145,738,350 | 0 | 0 | null | 1,534,957,201,000 | 1,534,957,201,000 | null | UTF-8 | Lean | false | false | 3,842 | lean | import category_theory.isomorphism
open category_theory
universes u v u₀ v₀
namespace category_theory.isomorphism
definition is_iso' {D : Type u} [𝒟 : category.{v} D] {X Y : D} (f : X ⟶ Y) : Prop := nonempty (is_iso f)
end category_theory.isomorphism
namespace category_theory.functor
variables {D : Type u} [𝒟... |
f4398302857788cd788886bc48fe81f3906f46eb | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/pkg/user_attr/UserAttr/Tst.lean | 53b664d876eabf965441df94f89e5a5aa54a24ae | [
"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,273 | lean | import Lean
import UserAttr.BlaAttr
@[bla] def f (x : Nat) := x + 2
@[bla] def g (x : Nat) := x + 1
@[foo 10] def h1 (x : Nat) := 2*x + 1
@[foo 20 important] def h2 (x : Nat) := 2*x + 1
open Lean in
def hasBlaAttr (declName : Name) : CoreM Bool :=
return blaAttr.hasTag (← getEnv) declName
#eval hasBlaAttr ``f
#ev... |
a766492fe78aee7ab7d3b1059c9aca7e97ea667a | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/coe6.lean | 3aa5bfb1746799d9d81646b5f42cc9b235beaf48 | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 322 | lean | universe variables u
structure Group :=
(carrier : Type u) (mul : carrier → carrier → carrier) (one : carrier)
attribute [instance]
definition Group_to_Type : has_coe_to_sort Group :=
{ S := Type u, coe := λ g, g^.carrier }
constant g : Group.{1}
set_option pp.binder_types true
#check λ a b : g, Group.mul g a b
|
c51a3593e01c282591c6140e92553cc520557332 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Elab/DeclUtil.lean | d849ee478b803a690c2558fe0919687d420f3ddc | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 3,835 | 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, Sebastian Ullrich
-/
import Lean.Meta.Basic
import Lean.Meta.Check
namespace Lean.Meta
def forallTelescopeCompatibleAux {α} (k : Array Expr → Expr → Expr → ... |
02b54ea45f6eb484f762993eb5fca4868cf87ed2 | 2f4707593665f4eac651cd5e5b39ea8eabafe0d6 | /src/manifold.lean | 3d1db88b5a4bc742f6ba356c7cc3b6260fc35cd5 | [] | no_license | PatrickMassot/lean-differential-topology | 941d2ac639b2c8bcfcbad85fe5ff0a4676d159e9 | 5b020daa5f935140c53408748a9f11ba02e7bf42 | refs/heads/master | 1,543,081,959,510 | 1,536,089,170,000 | 1,536,089,170,000 | 112,875,905 | 12 | 5 | null | 1,520,841,685,000 | 1,512,247,905,000 | Lean | UTF-8 | Lean | false | false | 11,112 | lean | import data.set.function
import analysis.normed_space
import tactic.easy
noncomputable theory
local attribute [instance] classical.prop_decidable
open function set
def continuous_on {α : Type*} {β : Type*} [topological_space α] [topological_space β] (U : set α) (f : α → β) :=
∀ W : set β, is_open W → is_open (f ⁻¹'... |
3c12fd47371dd9ef3bfc61a48795ffbb5de0f0d0 | b2e508d02500f1512e1618150413e6be69d9db10 | /src/category_theory/equivalence.lean | f7d29dfa28f8041193a20e7f9937580e218ded76 | [
"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 | 13,626 | 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
... |
910026fc3ca684c84f8820c41f5195974316e981 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/linear_algebra/basic.lean | 21ca3a4f006a377eacde15bdb467500a79423147 | [
"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 | 84,431 | 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... |
7e4b25ea26a4d507c43b2e9cb14f9db141d3915b | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /library/logic/connectives.lean | cfce06b3e122a294d1fe367549928cd74557d0ed | [
"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 | 8,055 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: logic.connectives
Authors: Jeremy Avigad, Leonardo de Moura
The propositional connectives. See also init.datatypes and init.logic.
-/
variables {a b c d : Prop}
/- false -/
... |
4e1c0beee939cf670e73e3a244217ba88b64abe4 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/category_theory/functor.lean | 08941ded3c7030d6296b9add573b5bd7f396a82f | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 3,490 | 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
Defines a functor between categories.
(As it is a 'bundled' object rather than the `is_functorial` typeclass parametrised
by the underlyin... |
bd003d31c6e8374ebecb44cfee1614eaf9113570 | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/lean/compiler/inlineattrs.lean | 3a14aede8714ed8203f86b6b14af89ea36ec7d80 | [
"Apache-2.0"
] | permissive | GaloisInc/lean4 | 74c267eb0e900bfaa23df8de86039483ecbd60b7 | 228ddd5fdcd98dd4e9c009f425284e86917938aa | refs/heads/master | 1,643,131,356,301 | 1,562,715,572,000 | 1,562,715,572,000 | 192,390,898 | 0 | 0 | null | 1,560,792,750,000 | 1,560,792,749,000 | null | UTF-8 | Lean | false | false | 2,535 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.lean.attributes
import init.lean.compiler.util
namespace Lean
namespace Compiler
inductive InlineAttributeKind
| inline | noinline | m... |
a7d592511023f8f79445f2e9a63b3a0aba463a94 | 556aeb81a103e9e0ac4e1fe0ce1bc6e6161c3c5e | /src/starkware/cairo/common/cairo_secp/verification/verification/signature_recover_public_key_unreduced_mul_soundness.lean | 7c4dcf8b30572eae68b8826dc679295ab4e2f775 | [] | 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 | 2,684 | lean | /-
File: signature_recover_public_key_unreduced_mul_soundness.lean
Autogenerated file.
-/
import starkware.cairo.lean.semantics.soundness.hoare
import .signature_recover_public_key_code
import ..signature_recover_public_key_spec
open tactic
open starkware.cairo.common.cairo_secp.field
open starkware.cairo.common.cair... |
2097559b9b2072c19e39d8d51ce55b167fec7e1f | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/measure_theory/function/l2_space.lean | 1f500c7d371c7beb46162c7df38697fe1a01a4a7 | [
"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,983 | lean | /-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne
-/
import analysis.inner_product_space.basic
import measure_theory.integral.set_integral
/-! # `L^2` space
If `E` is an inner product space over `𝕜` (`ℝ` or `ℂ`), then `L... |
1573e7e84c9f82a70654db2d73705129776c0e37 | 49bd2218ae088932d847f9030c8dbff1c5607bb7 | /src/data/padics/padic_numbers.lean | ab356752c494abe4e58f950c151529d38b6905f9 | [
"Apache-2.0"
] | permissive | FredericLeRoux/mathlib | e8f696421dd3e4edc8c7edb3369421c8463d7bac | 3645bf8fb426757e0a20af110d1fdded281d286e | refs/heads/master | 1,607,062,870,732 | 1,578,513,186,000 | 1,578,513,186,000 | 231,653,181 | 0 | 0 | Apache-2.0 | 1,578,080,327,000 | 1,578,080,326,000 | null | UTF-8 | Lean | false | false | 32,491 | 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.real.cau_seq_completion
import data.padics.padic_norm algebra.archimedean analysis.normed_space.basic
import tactic.norm_cast
/-!
# p-adic numbers
T... |
889d211716835dc3104731d40047d107023fcb4b | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /library/init/native/default.lean | 6f181db5d275cf267328d150e912e2c3b039a008 | [
"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 | 23,779 | 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.category.state
import init.data.string
import init.data.list.instances
import init.native.ir
import in... |
dc7010880c9f7a4d0df5322c15b77c80460d4f15 | a721fe7446524f18ba361625fc01033d9c8b7a78 | /src/principia/mynat/basic.lean | 63130d51bf37e1c8ce7209369c3c6975dd89a825 | [] | no_license | Sterrs/leaning | 8fd80d1f0a6117a220bb2e57ece639b9a63deadc | 3901cc953694b33adda86cb88ca30ba99594db31 | refs/heads/master | 1,627,023,822,744 | 1,616,515,221,000 | 1,616,515,221,000 | 245,512,190 | 2 | 0 | null | 1,616,429,050,000 | 1,583,527,118,000 | Lean | UTF-8 | Lean | false | false | 7,592 | lean | -- vim: ts=2 sw=0 sts=-1 et ai tw=70
-- Natural numbers
-- TODO:
-- shorten the pow theorems
-- work through the sporadic confused comments
-- clean everything up a bit, re naming and formatting
-- try to re-use theorems more
-- stops name conflicts
namespace hidden
inductive mynat
| zero : mynat
| succ (n : mynat)... |
5cf7d2871eee581b1efb90e8eab7ce57524a4149 | 83c8119e3298c0bfc53fc195c41a6afb63d01513 | /library/init/algebra/ordered_ring.lean | 660ad26f0d3678aced94ca100acc85ab922ae93d | [
"Apache-2.0"
] | permissive | anfelor/lean | 584b91c4e87a6d95f7630c2a93fb082a87319ed0 | 31cfc2b6bf7d674f3d0f73848b842c9c9869c9f1 | refs/heads/master | 1,610,067,141,310 | 1,585,992,232,000 | 1,585,992,232,000 | 251,683,543 | 0 | 0 | Apache-2.0 | 1,585,676,570,000 | 1,585,676,569,000 | null | UTF-8 | Lean | false | false | 17,036 | 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.ordered_group init.algebra.ring
/- Make sure instances defined in this file have lower priority than the ones
... |
7636a3f2a712cf00f903b319255af279bf2a0f5c | 6b2a480f27775cba4f3ae191b1c1387a29de586e | /group_rep_2/orthoganality_of_character/orthogonality.lean | fdd767ba3ea6c38af7f5bf03f88f7ca4868246e6 | [] | no_license | Or7ando/group_representation | a681de2e19d1930a1e1be573d6735a2f0b8356cb | 9b576984f17764ebf26c8caa2a542d248f1b50d2 | refs/heads/master | 1,662,413,107,324 | 1,590,302,389,000 | 1,590,302,389,000 | 258,130,829 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 7,150 | lean | import schur_theorem.schur
import data.complex.basic
import Tools.tools
import Tools.eigen_value
import linear_algebra.caracteristic_polynomial
import basic_definitions.matrix_representation
import basic_definitions.equiv
import permutation_representation.regular_representation
import Reynold_operator.reynold_scalar_pr... |
bfb2cd7a419575daeaf9ba4717479dec26b7770b | 5df84495ec6c281df6d26411cc20aac5c941e745 | /src/formal_ml/complete_lattice.lean | 1aba515f672676ca6ebb41544303244efa9ed481 | [
"Apache-2.0"
] | permissive | eric-wieser/formal-ml | e278df5a8df78aa3947bc8376650419e1b2b0a14 | 630011d19fdd9539c8d6493a69fe70af5d193590 | refs/heads/master | 1,681,491,589,256 | 1,612,642,743,000 | 1,612,642,743,000 | 360,114,136 | 0 | 0 | Apache-2.0 | 1,618,998,189,000 | 1,618,998,188,000 | null | UTF-8 | Lean | false | false | 4,098 | 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... |
84e6738741ae9e345a756ecd3a11fa6f8543471b | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/simp_all_contextual.lean | 10ba18b9b2fe90d6b5f9dd10a02f17af9951713c | [
"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 | 73 | lean | theorem ex (h : a = 0) (p : Nat → Prop) : p a → p 0 := by
simp_all
|
52f30a795d2d2fd74962a624efb6c17550bca361 | 367134ba5a65885e863bdc4507601606690974c1 | /src/topology/algebra/group.lean | 7eedd9e06e15118a3241575352d0d4c11f8f78d9 | [
"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 | 26,466 | 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 order.filter.pointwise
import group_theory.quotient_group
import topology.algebra.monoid
import topology.homeomorph
/-!
# The... |
1c6b7cc87ce0d043c4c4aa032f9d8b858f61ae8b | 076f5040b63237c6dd928c6401329ed5adcb0e44 | /instructor-notes/2019.10.01..poly/option.lean | b9a2230edcf9f4fce5ed67597e1c74c8e0d2a274 | [] | no_license | kevinsullivan/uva-cs-dm-f19 | 0f123689cf6cb078f263950b18382a7086bf30be | 09a950752884bd7ade4be33e9e89a2c4b1927167 | refs/heads/master | 1,594,771,841,541 | 1,575,853,850,000 | 1,575,853,850,000 | 205,433,890 | 4 | 9 | null | 1,571,592,121,000 | 1,567,188,539,000 | Lean | UTF-8 | Lean | false | false | 136 | lean | namespace myoption
inductive moption (α : Type) : Type
| some (a : α) : moption
| none : moption
#check moption.some 4
end myoption |
4642e2fcaa3a44fe64593408a249438d94453210 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/geometry/manifold/instances/real.lean | 4c835a09792d29e738eb8da782e5f1df9b97f121 | [
"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 | 13,811 | lean | /-
Copyright (c) 2019 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 linear_algebra.finite_dimensional
import geometry.manifold.smooth_manifold_with_corners
import analysis.inner_product_space.pi_L2
/-!
# Constructing exa... |
b01351d52db0b6137e71265e86d7acf501851c7e | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/field_theory/separable.lean | cfafeec7669a6739d203fe09089a24bb1c920056 | [
"Apache-2.0"
] | permissive | jumpy4/mathlib | d3829e75173012833e9f15ac16e481e17596de0f | af36f1a35f279f0e5b3c2a77647c6bf2cfd51a13 | refs/heads/master | 1,693,508,842,818 | 1,636,203,271,000 | 1,636,203,271,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,676 | 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.big_operators
import field_theory.minpoly
import field_theory.splitting_field
import field_theory.tower
import algebra.squarefree
/-!
# Separable p... |
751d0fb41304d57bac8e99ad62a22beab934472b | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/fintype/lattice.lean | 0602a1bd7b736c9876d8c029d60b2ebda5dad017 | [
"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 | 2,426 | 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.fintype.card
import data.finset.lattice
/-!
# Lemmas relating fintypes and order/lattice structure.
## Instances
We provide `infinite` instances for
* ... |
670322c37bad9774ceb411a3c4a43ebd597fc2cf | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/Meta/Tactic/ElimInfo.lean | 0f13e422ab98f71f4b0e4e4915a4217c0fcea7d2 | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,998 | 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.Basic
namespace Lean.Meta
structure ElimAltInfo :=
(name : Name)
(numFields : Nat)
structure ElimInfo :=
(motivePos : Nat)
... |
5fb709bf6370dd82e0dd21016aa62c073251ec9d | 4727251e0cd73359b15b664c3170e5d754078599 | /src/model_theory/ultraproducts.lean | 4c9363e172200cbf958b6b1cd54d21c07ca7a2eb | [
"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,787 | lean | /-
Copyright (c) 2022 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import model_theory.quotients
import order.filter.germ
import order.filter.ultrafilter
/-! # Ultraproducts and Łoś's Theorem
## Main Definitions
* `first_order.lang... |
0c103ece6067127799dc5426d8b6d61452aac2e8 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/Lake/CLI/Serve.lean | 12fb2210344794e6fc91921f414c4c74afdb378e | [
"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,367 | lean | /-
Copyright (c) 2022 Mac Malone. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mac Malone
-/
import Lake.Load
import Lake.Build
import Lake.Util.MainM
namespace Lake
open Lean (Json toJson fromJson? LeanPaths)
/-- Exit code to return if `print-paths` cannot find th... |
73e0e58de91995476aea08df18d57544871edaee | ac2987d8c7832fb4a87edb6bee26141facbb6fa0 | /Mathlib/Tactic/NoMatch.lean | 882d2bc12edb30eb3a9d2450298eede0bc0b3aaf | [
"Apache-2.0"
] | permissive | AurelienSaue/mathlib4 | 52204b9bd9d207c922fe0cf3397166728bb6c2e2 | 84271fe0875bafdaa88ac41f1b5a7c18151bd0d5 | refs/heads/master | 1,689,156,096,545 | 1,629,378,840,000 | 1,629,378,840,000 | 389,648,603 | 0 | 0 | Apache-2.0 | 1,627,307,284,000 | 1,627,307,284,000 | null | UTF-8 | Lean | false | false | 1,947 | lean | /-
Copyright (c) 2021 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import Mathlib.Tactic.OpenPrivate
import Lean
/-
This adds support for the alternative syntax `match x with.` instead of `nomatch x`. It is more
powerful because it s... |
630793d298fd2a0638e7a1a6664f702a5b7a72f0 | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/project_1_a_decrire/lean-scheme-submission/src/spectrum_of_a_ring/zariski_topology.lean | bdaba6cdd7f40358e706bc9db6036484ebd5aa31 | [] | 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 | 4,426 | lean | /-
Kenny's proof that Spec(A) is a topological space.
https://stacks.math.columbia.edu/tag/00E1
-/
import topology.basic
import topology.opens
import ring_theory.ideals
import group_theory.submonoid
import to_mathlib.topologcal_space
import spectrum_of_a_ring.spec
import spectrum_of_a_ring.properties
local attri... |
e3c1b0aed926d39d3de474049004bd6b91b70554 | 31e8ce8c3f972f4102a087008fd33dee6f2d7dfe | /tauto.lean | 179b8cdcffa6a5eead7306feb2427d8b4595c71e | [
"MIT"
] | permissive | sakas--/lean-tauto | 6ca908abde99b252c9a3fdce5c0e98871ebbcc26 | 3cc5c1349f9204f3b798ea8cdb6e4f36ed2d1b25 | refs/heads/master | 1,610,549,743,092 | 1,488,258,185,000 | 1,488,258,185,000 | 76,671,935 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,495 | lean | /- TODO : Add comments and clean up the code.
-/
open expr tactic list nat
namespace tactic
/- transforms the current goal Γ ⊢ A to into two subgoals Γ ⊢ B → A and Γ ⊢ A. -/
-- I'm not sure if this is the right way to implement it
meta def cut (e: expr) : tactic unit :=
do {goal ← target,
f ← mk_fresh_name,
... |
560913124c9b007e99a6853c66de1ad24d30a342 | c8af905dcd8475f414868d303b2eb0e9d3eb32f9 | /src/data/cpi/transition/enumerate.lean | 5eadbf61f4096c66c721fe281a481e0957e24715 | [
"BSD-3-Clause"
] | permissive | continuouspi/lean-cpi | 81480a13842d67ff5f3698643210d8ed5dd08de4 | 443bf2cb236feadc45a01387099c236ab2b78237 | refs/heads/master | 1,650,307,316,582 | 1,587,033,364,000 | 1,587,033,364,000 | 207,499,661 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 40,670 | lean | import data.cpi.transition.basic data.multiset2 data.option2
-- TODO: Move this somewhere sensible
instance quot.lift.decidable_pred {α : Type*} [setoid α] (p : α → Prop) [dec : decidable_pred p] (h : ∀ a b, a ≈ b → p a = p b)
: decidable_pred (quot.lift p h)
| x := quot.hrec_on x dec (λ x y r, subsingleton.helim (c... |
7ba43540a3102e6af0060999ab65275f684b3286 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/qpf/univariate/basic.lean | 94c474a2a20557892e429e4fe25fe31402119fba | [
"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 | 21,828 | lean | /-
Copyright (c) 2018 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
-/
import data.pfunctor.univariate.M
/-!
# Quotients of Polynomial Functors
We assume the following:
`P` : a polynomial functor
`W` : its W-type
`M` : its M-type... |
9e49de6b14f6f42ac739aa30894206b2f342c4d1 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/group_theory/archimedean.lean | 25b11da804a7c76bdf6ba8a7f82ecfc5c2926ba6 | [
"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,266 | lean | /-
Copyright (c) 2020 Heather Macbeth, Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth, Patrick Massot
-/
import group_theory.subgroup
import algebra.archimedean
/-!
# Archimedean groups
This file proves a few facts about ordered groups... |
d7befb942287d4e2088ff53906c1a86361621222 | 3c9dc4ea6cc92e02634ef557110bde9eae393338 | /src/Lean/Environment.lean | 2997d4ffa212a8c7fc768f6058c142d5499b0d30 | [
"Apache-2.0"
] | permissive | shingtaklam1324/lean4 | 3d7efe0c8743a4e33d3c6f4adbe1300df2e71492 | 351285a2e8ad0cef37af05851cfabf31edfb5970 | refs/heads/master | 1,676,827,679,740 | 1,610,462,623,000 | 1,610,552,340,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 30,215 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Std.Data.HashMap
import Lean.Data.SMap
import Lean.Declaration
import Lean.LocalContext
import Lean.Util.Path
import Lean.Util.FindExpr
import Lean.U... |
2426b5814da9ffd064f040065a0cdfb5f8c05996 | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /data/real/basic.lean | 1fbfd9ea700f6e102fb97178888a78f575b24b3d | [
"Apache-2.0"
] | permissive | kckennylau/mathlib | 21fb810b701b10d6606d9002a4004f7672262e83 | 47b3477e20ffb5a06588dd3abb01fe0fe3205646 | refs/heads/master | 1,634,976,409,281 | 1,542,042,832,000 | 1,542,319,733,000 | 109,560,458 | 0 | 0 | Apache-2.0 | 1,542,369,208,000 | 1,509,867,494,000 | Lean | UTF-8 | Lean | false | false | 24,457 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
The (classical) real numbers ℝ. This is a direct construction
from Cauchy sequences.
-/
import order.conditionally_complete_lattice data.real.cau_seq_completion
algeb... |
ef6b42a514ef0c6a3281053e507cd5776109fd5b | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/data/list/cycle.lean | 64ccc6baad5d546ad201a81704f0c5e989d848a7 | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,222 | lean | /-
Copyright (c) 2021 Yakov Pechersky. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yakov Pechersky
-/
import data.list.rotate
import data.finset.sort
import data.fintype.list
/-!
# Cycles of a list
Lists have an equivalence relation of whether they are rotational ... |
f82b25264a5ac148dcaf4d1ec182895c5ed23f34 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/data/set/classical_inverse.lean | 292f15ab67dd043ba6df59e51d63cc5b21dcc97d | [
"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 | 3,111 | 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
Using classical logic, defines an inverse function.
-/
import .function .map
open eq.ops classical
namespace set
variables {X Y : Type}
noncomputable d... |
66c13762f56c16f8d4b9c8ec80f94907027df2eb | 952248371e69ccae722eb20bfe6815d8641554a8 | /test/multiplicative.lean | 0147e7e3d8547a0693fe36e62fb2711c187fa7cb | [] | no_license | robertylewis/lean_polya | 5fd079031bf7114449d58d68ccd8c3bed9bcbc97 | 1da14d60a55ad6cd8af8017b1b64990fccb66ab7 | refs/heads/master | 1,647,212,226,179 | 1,558,108,354,000 | 1,558,108,354,000 | 89,933,264 | 1 | 2 | null | 1,560,964,118,000 | 1,493,650,551,000 | Lean | UTF-8 | Lean | false | false | 7,898 | lean | import control
open polya tactic
variables x y z u v w r : ℚ
#exit
example (h1 : u > 0) (h2 : u < 1*v) (h3 : z > 0) (h4 : 1*z + 1*1 < 1*w) (h5 : rat.pow (1*u + 1*v + 1*z) 3 ≥ 1* rat.pow (1*u + 1*v + 1*w + 1*1) 5) : false :=
by polya h1 h2 h3 h4 h5
example (h1 : u > 1*1) (h2 : u < 1*v) (h3 : rat.pow u 15 > 1*rat.p... |
b23fbeca5f8fbbcafdf19a2e2a9d6f61a9f2d76c | a339bc2ac96174381fb610f4b2e1ba42df2be819 | /hott/types/pointed.hlean | 73feb5d0e973640d177747e253d32df6a209f94c | [
"Apache-2.0"
] | permissive | kalfsvag/lean2 | 25b2dccc07a98e5aa20f9a11229831f9d3edf2e7 | 4d4a0c7c53a9922c5f630f6f8ebdccf7ddef2cc7 | refs/heads/master | 1,610,513,122,164 | 1,483,135,198,000 | 1,483,135,198,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 40,184 | hlean | /-
Copyright (c) 2014-2016 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer, Floris van Doorn
Ported from Coq HoTT
The basic definitions are in init.pointed
-/
import .nat.basic ..arity ..prop_trunc
open is_trunc eq prod sigma nat equ... |
0c3cc8897f3d12f37b63cd6f0141cee5e5abb72e | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/algebra/module/linear_map.lean | 408f1b028bbce2d9c8120298e8b60022c85b2b64 | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,981 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nathaniel Thomas, Jeremy Avigad, Johannes Hölzl, Mario Carneiro, Anne Baanen
-/
import algebra.group.hom
import algebra.module.basic
import algebra.group_action_hom
/-!
# Linear maps and... |
eb720baa526eb4dc6579782f49bb78d03690c47c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/pnat/prime_auto.lean | ce6c012a4923ef1687f073f08c73d3f1039c6f60 | [] | 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 | 7,036 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro, Neil Strickland
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.nat.prime
import Mathlib.data.pnat.basic
import Mathlib.PostPor... |
b29ce3fce437bda0cec5e5a74f6aec85f54c58a8 | 8be24982c807641260370bd09243eac768750811 | /src/presentation.lean | 98591b0adbe43d98886519ba5c8f815f1df1c201 | [] | no_license | jjaassoonn/transcendental | 8008813253af3aa80b5a5c56551317e7ab4246ab | 99bc6ea6089f04ed90a0f55f0533ebb7f47b22ff | refs/heads/master | 1,607,869,957,944 | 1,599,659,687,000 | 1,599,659,687,000 | 234,444,826 | 9 | 1 | null | 1,598,218,307,000 | 1,579,224,232,000 | HTML | UTF-8 | Lean | false | false | 6,734 | lean | import algebraic_countable_over_Z
import liouville_theorem
import e_transcendental
noncomputable theory
open_locale classical big_operators
variables (p q : Prop)
------------------------------------------------------------------------------------
/-# Formalisations of basic theorems of trascendental number th... |
1923bb7a62514512c8e64d7a974eda07db5749da | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Lean/Compiler/ImplementedByAttr.lean | 3c607625e9d1190c0a7b4cb3158908f79ae793c8 | [
"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 | 1,526 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Attributes
import Lean.MonadEnv
namespace Lean.Compiler
builtin_initialize implementedByAttr : ParametricAttribute Name ← registerParametricAt... |
179d8dfbb8a04a9c8bd4aed496d2b2601e927fb1 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/whileRepeat.lean | e46b3013ad934322864474bbeb6ac29cdcd9c8a0 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 1,266 | lean | structure Loop where
@[inline]
partial def Loop.forIn {β : Type u} {m : Type u → Type v} [Monad m] (loop : Loop) (init : β) (f : Unit → β → m (ForInStep β)) : m β :=
let rec @[specialize] loop (b : β) : m β := do
match ← f () b with
| ForInStep.done b => pure b
| ForInStep.yield b => loop b
loop i... |
00266b9d64f9e287432a24b24b6b0db7f8762b72 | 675b8263050a5d74b89ceab381ac81ce70535688 | /src/analysis/analytic/composition.lean | 44c66ff7b82d96c7f117b13b2fdb76a90f344ec6 | [
"Apache-2.0"
] | permissive | vozor/mathlib | 5921f55235ff60c05f4a48a90d616ea167068adf | f7e728ad8a6ebf90291df2a4d2f9255a6576b529 | refs/heads/master | 1,675,607,702,231 | 1,609,023,279,000 | 1,609,023,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 56,078 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel, Johan Commelin
-/
import analysis.analytic.basic
import combinatorics.composition
/-!
# Composition of analytic functions
in this file we prove that the composi... |
2846a89eb6a2c6339aed39844537ed52c1be119c | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/linear_algebra/clifford_algebra/fold.lean | 86d1432eb9908b4b20da52968696690f2d25a60a | [
"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 | 6,202 | lean | /-
Copyright (c) 2022 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import linear_algebra.clifford_algebra.conjugation
/-!
# Recursive computation rules for the Clifford algebra
This file provides API for a special case `clifford_algebra.... |
ec3ce72a3378acd6d97918d003654835e07a2ffd | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/group_theory/free_abelian_group.lean | 48589854c55a13d7306280ed0f3c3e46cd9770db | [
"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,470 | 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 algebra.group.pi
import group_theory.free_group
import group_theory.abelianization
import algebra.module.basic -- we use the ℤ-module structure on an add_comm_group in ... |
72bb1385867c7d22b616658c96c978f1fecbdff4 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/multiset/lattice.lean | 025300fbbc801810a9c430a34c297bb57cfd0a42 | [] | 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,307 | lean | /-
Copyright (c) 2018 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.multiset.finset_ops
import Mathlib.data.multiset.fold
import Mathlib.PostPort
universe... |
80e27febcab90ac33fcf7deeb5563cda0f884fd7 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/topology/sheaves/stalks.lean | dbedd5b7bf19199fcc5c031d8a152a3ebc8be90b | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,759 | 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 topology.category.Top.open_nhds
import topology.sheaves.presheaf
import category_theory.limits.types
noncomputable theory
universes v u v' u'
open category_... |
023c1786a3d675770aa0ad9c24c57e89d1bd5ef7 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/groupoid/subgroupoid.lean | e6055869660814b1fd47ad3a3114d307a7611370 | [
"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 | 24,788 | lean | /-
Copyright (c) 2022 Rémi Bottinelli. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémi Bottinelli, Junyan Xu
-/
import category_theory.groupoid.vertex_group
import category_theory.groupoid.basic
import category_theory.groupoid
import algebra.group.defs
import data.... |
483cd2c375065215f2c0ee553ec30099811ad6e8 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/group_theory/perm/concrete_cycle.lean | f52e50a7239b5a107a2d91d0c5465ae1abade2ee | [
"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,621 | lean | /-
Copyright (c) 2021 Yakov Pechersky. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yakov Pechersky
-/
import group_theory.perm.list
import data.list.cycle
import group_theory.perm.cycle_type
/-!
# Properties of cyclic permutations constructed from lists/cycles
In... |
50a6d7fd8031a3707ab032a4c501a074be4ab50c | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/groupoid/subgroupoid.lean | 04d52184a73232db6e0d955a2ee83d5073441def | [
"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 | 24,677 | lean | /-
Copyright (c) 2022 Rémi Bottinelli. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémi Bottinelli, Junyan Xu
-/
import category_theory.groupoid.vertex_group
import category_theory.groupoid.basic
import category_theory.groupoid
import algebra.group.defs
import data.... |
56dd774d4bb8030430f1e9c72e2854943ba4a154 | 193da933cf42f2f9188bb47e3c973205bc2abc5c | /Exam2-Review-key.lean | 56117d78380c34aaa8c609cc8d2be08bf908c405 | [] | no_license | pandaman64/cs-dm | aa4e2621c7a19e2dae911bc237c33e02fcb0c7a3 | bfd2f5fd2612472e15bd970c7870b5d0dd73bd1c | refs/heads/master | 1,647,620,340,607 | 1,570,055,187,000 | 1,570,055,187,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,867 | lean | /-
You need to understand the following
elements of automated predicate logic
for Exam 2
Suppose P and Q are arbitrary propositions
(i.e., P Q : Prop) and T and V are arbitrary
types (i.e., T V : Type).
Know the following forms, how to prove them,
how to use proofs of them, and how to do these
things in Lean.
... |
f9042f33e2fd16f4b90b11b94e5f6aff2e6c024d | b392eb79fb36952401156496daa60628ccb07438 | /Lib4/PostPort/Pow.lean | 2ad43bf137ffe2e64a045d2cf0f56a02ea2cca4f | [
"Apache-2.0"
] | permissive | AurelienSaue/mathportsource | d9eabe74e3ab7774baa6a10a6dc8d4855ff92266 | 1a164e4fff7204c522c1f4ecc5024fd909be3b0b | refs/heads/master | 1,685,214,377,305 | 1,623,621,223,000 | 1,623,621,223,000 | 364,191,042 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 421 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam
-/
import Lean3Lib.init.core
namespace Mathlib
universes u v
variable {α : Type u} {β : Type v}
noncomputable instance [has_pow α β] : HPow α β α :=... |
4d10a9609b931ade0e4daaf9de42ca1ec56acfb3 | 36938939954e91f23dec66a02728db08a7acfcf9 | /lean/deps/galois_stdlib/src/galois/data/nat/basic.lean | 9f0005ab2289bc384051ce92af5870f00ade0e42 | [
"Apache-2.0"
] | permissive | pnwamk/reopt-vcg | f8b56dd0279392a5e1c6aee721be8138e6b558d3 | c9f9f185fbefc25c36c4b506bbc85fd1a03c3b6d | refs/heads/master | 1,631,145,017,772 | 1,593,549,019,000 | 1,593,549,143,000 | 254,191,418 | 0 | 0 | null | 1,586,377,077,000 | 1,586,377,077,000 | null | UTF-8 | Lean | false | false | 4,855 | lean | -- This file contains basic lemmas for nat
import ...algebra.order
namespace galois
namespace nat
open nat
/-- pred _ + _ rewrite rule. -/
theorem pred_add (m n : ℕ) : pred m + n = if m = 0 then n else pred (m + n) :=
begin
cases m,
case zero {
simp,
},
case succ : m {
have p : ¬(succ m = 0) := by t... |
ad659461eda6a6fcd99c06f85cdcaa22f8cc4ae9 | b29f946a2f0afd23ef86b9219116968babbb9f4f | /src/problem_sheets/sheet_1/sht01Q01.lean | 7a793de1f58415318bc6b1fb9e0eba44d48aaaaa | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/M1P1-lean | 58be7394fded719d95e45e6b10e1ecf2ed3c7c4c | 3723468cc50f8bebd00a9811caf25224a578de17 | refs/heads/master | 1,587,063,867,779 | 1,572,727,164,000 | 1,572,727,164,000 | 165,845,802 | 14 | 4 | Apache-2.0 | 1,549,730,698,000 | 1,547,554,675,000 | Lean | UTF-8 | Lean | false | false | 2,788 | lean | -- This import gives us a working copy of the real numbers ℝ,
-- and functions such as abs : ℝ → ℝ
import data.real.basic
-- This next import gives us several tactics of use to mathematicians:
-- (1) norm_num [to prove basic facts about reals like 2+2 = 4]
-- (2) ring [to prove basic algebra identities like (a+b)^2 =... |
9b8a6d15bda15588c501410ce767b065d0651985 | e898bfefd5cb60a60220830c5eba68cab8d02c79 | /uexp/src/uexp/rules/transitiveInferenceProject.lean | 70903ed46fb0fe553b18b0a2fcba1f9c8d2d9470 | [
"BSD-2-Clause"
] | permissive | kkpapa/Cosette | 9ed09e2dc4c1ecdef815c30b5501f64a7383a2ce | fda8fdbbf0de6c1be9b4104b87bbb06cede46329 | refs/heads/master | 1,584,573,128,049 | 1,526,370,422,000 | 1,526,370,422,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,334 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..ucongr
import ..TDP
set_option profiler true
open Expr
open Proj
open Pred
open SQL
open tree
open binary_operators
set_option profiler true
notation `int` := datatypes.int
variable integer_1: const datatypes.int
variable integer_7... |
539507ac4fc0d738da7a869199211f34f4817966 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /src/Init/Lean/Elab/Syntax.lean | 026b8f2b5b0030cc7e2554539edc182505e56fef | [
"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 | 16,309 | 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.Lean.Elab.Command
import Init.Lean.Elab.Quotation
namespace Lean
namespace Elab
namespace Term
/-
Expand `optional «precedence»` wher... |
a4c07928069e1cb4a254abbdb50923c314e32377 | 7cdf3413c097e5d36492d12cdd07030eb991d394 | /src/game/world3/level1.lean | 6c7a41dc059016c07e7a70c9f57e0326be19da2d | [] | 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,277 | lean | import game.world2.level6 -- hide
import mynat.mul -- import the definition of multiplication on mynat
-- World name : Multiplication world
/- Axiom : mul_zero (a : mynat) :
a * 0 = 0
-/
/- Axiom : mul_succ (a b : mynat) :
a * succ(b) = a * b + a
-/
/-
# World 3: Multiplication World
A new import! This import gi... |
cf1b8d889ace61a96048d3aeca9c4af27f530ee6 | 1f6fe2f89976b14a4567ab298c35792b21f2e50b | /homotopy/EM.hlean | 474b71690a5e14982dbf712bab6e91e2422fc9eb | [
"Apache-2.0"
] | permissive | jonas-frey/Spectral | e5c1c2f7bcac26aa55f7b1e041a81272a146198d | 72d521091525a4bc9a31cac859840efe9461cf66 | refs/heads/master | 1,610,235,743,345 | 1,505,417,795,000 | 1,505,417,795,000 | 102,653,342 | 0 | 0 | null | 1,504,728,483,000 | 1,504,728,483,000 | null | UTF-8 | Lean | false | false | 28,903 | hlean | -- Authors: Floris van Doorn
import homotopy.EM algebra.category.functor.equivalence types.pointed2 ..pointed_pi ..pointed
..move_to_lib .susp ..algebra.exactness
open eq equiv is_equiv algebra group nat pointed EM.ops is_trunc trunc susp function is_conn
/- TODO: try to fix the speed of this file -/
namespa... |
011b2195bfa50bc7732370f16d66e7b10edb6d62 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/analysis/normed_space/units.lean | 46f599066435aad9c364a6e6a6e75c7a349b43af | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,044 | lean | /-
Copyright (c) 2020 Heather Macbeth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth
-/
import analysis.specific_limits
import analysis.asymptotics.asymptotics
/-!
# The group of units of a complete normed ring
This file contains the basic theory for... |
d5ad95680841b092ecb26acfc21c0150435387df | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/category_theory/limits/limits.lean | 3cd53489a99dd70488720145232d315b056b2b04 | [
"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 | 27,902 | 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
import category_theory.whiskering
import category_theory.yoneda
import category_theory.limits.cones
open category_theory category_th... |
9663efe98c9ecf6c4706480e9be193ca00a3311c | 92b50235facfbc08dfe7f334827d47281471333b | /library/data/nat/div.lean | 37c1a0342e059d8f2a1c9e7e09522c876be3cb0c | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 24,410 | 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 div and mod. Much of the development follows Isabelle's library.
-/
import data.nat.sub
open eq.ops well_founded decidabl... |
d68e8566b8a88fbd27dab19e054a07447fff38af | c45b34bfd44d8607a2e8762c926e3cfaa7436201 | /uexp/src/uexp/TDP.lean | 5f39c4f3468dc1bec0b4a558ae32e79c7c484b54 | [
"BSD-2-Clause"
] | permissive | Shamrock-Frost/Cosette | b477c442c07e45082348a145f19ebb35a7f29392 | 24cbc4adebf627f13f5eac878f04ffa20d1209af | refs/heads/master | 1,619,721,304,969 | 1,526,082,841,000 | 1,526,082,841,000 | 121,695,605 | 1 | 0 | null | 1,518,737,210,000 | 1,518,737,210,000 | null | UTF-8 | Lean | false | false | 10,631 | lean | import .u_semiring
import .cosette_tactics
import .ucongr
import .extra_constants
import .sql
section TDP
open tactic
meta def swap_ith_sigma_forward (i : nat)
: usr_sigma_repr → tactic unit
| ⟨xs, body⟩ := do
swapped_schemas ← list.swap_ith_forward i xs,
-- We have to subtract because the de Bruijn indices are... |
b062dbf5c724289e329f0a2e464d4e21d2ac6f1b | 94e33a31faa76775069b071adea97e86e218a8ee | /src/computability/tm_to_partrec.lean | 0e6f2ea8725c6080372c3ace044e74038462cddb | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 80,700 | lean | /-
Copyright (c) 2020 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import computability.halting
import computability.turing_machine
import data.num.lemmas
import tactic.derive_fintype
/-!
# Modelling partial recursive functions usin... |
90c7d1897e56ffb30fa73078696f092fd46c61c0 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/multiset/sum.lean | 60d03036e59582a711273235d39578f6725fa92a | [
"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,194 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import data.multiset.nodup
/-!
# Disjoint sum of multisets
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.... |
eb01178bd7023bfb83e8df48dac82c33b63f1c14 | 7850aae797be6c31052ce4633d86f5991178d3df | /src/Lean/Elab/Quotation.lean | 44a7414abad97d90f292737bef934675c3d260d3 | [
"Apache-2.0"
] | permissive | miriamgoetze/lean4 | 4dc24d4dbd360cc969713647c2958c6691947d16 | 062cc5d5672250be456a168e9c7b9299a9c69bdb | refs/heads/master | 1,685,865,971,011 | 1,624,107,703,000 | 1,624,107,703,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,854 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
Elaboration of syntax quotations as terms and patterns (in `match_syntax`). See also `./Hygiene.lean` for the basic
hygiene workings and data types.
-/
import... |
2ac236639203f582cb989e8cfaa557209c65ab54 | 1437b3495ef9020d5413178aa33c0a625f15f15f | /data/prod.lean | 60555cae8a92374d46919a58a7739ed6a3165416 | [
"Apache-2.0"
] | permissive | jean002/mathlib | c66bbb2d9fdc9c03ae07f869acac7ddbfce67a30 | dc6c38a765799c99c4d9c8d5207d9e6c9e0e2cfd | refs/heads/master | 1,587,027,806,375 | 1,547,306,358,000 | 1,547,306,358,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,773 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
Extends theory on products
-/
variables {α : Type*} {β : Type*} {γ : Type*} {δ : Type*}
@[simp] theorem prod.forall {p : α × β → Prop} : (∀ x, p x) ↔ (∀ a b, p (a, b)... |
43e7359c3e576a7584bd6650a10fc248d063ad88 | bb31430994044506fa42fd667e2d556327e18dfe | /src/logic/encodable/basic.lean | 9d47356f8757d026aaaae8b2c3a7e37aaa5c5946 | [
"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 | 19,841 | 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... |
28ee9636def76077d19e0e53362b087d9938081a | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/category_theory/limits/connected.lean | c36f9a1d65a79998adf092f0cf4cbfe76e6de536 | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 3,607 | 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 category_theory.limits.shapes.pullbacks
import category_theory.limits.shapes.equalizers
import category_theory.limits.preserves
import category_theory.connected
/... |
4c651d9a6db9aeaead5f470544ea2688268cc9b5 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch4/ex0206.lean | 78f53d9a99973b16f87e92aa635d2f5ce670f053 | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 176 | lean | universe u
variables (α β : Type u)
example (f : α → β) (a : α) : (λ x, f x) a = f a := rfl
example (a : α) (b : α) : (a, b).1 = a := rfl
example : 2 + 3 = 5 := rfl
|
4894c6fc7e6619572669ed7834976e40cc3f8674 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch5/ex0210.lean | 788598882680d6ca98fe29dd38d95e49e492c512 | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 135 | lean | example : ∀ a b c : ℕ, a = b → a = c → c = b :=
begin
intros,
apply eq.trans,
apply eq.symm,
repeat { assumption }
end
|
3ecfe854b4fc57634e6c2951b34e9fbc1d39b713 | 57fdc8de88f5ea3bfde4325e6ecd13f93a274ab5 | /algebra/euclidean_domain.lean | 5dcd00cfaadb9f11dcd61080e60640153e07ea6f | [
"Apache-2.0"
] | permissive | louisanu/mathlib | 11f56f2d40dc792bc05ee2f78ea37d73e98ecbfe | 2bd5e2159d20a8f20d04fc4d382e65eea775ed39 | refs/heads/master | 1,617,706,993,439 | 1,523,163,654,000 | 1,523,163,654,000 | 124,519,997 | 0 | 0 | Apache-2.0 | 1,520,588,283,000 | 1,520,588,283,000 | null | UTF-8 | Lean | false | false | 7,212 | lean | /-
Copyright (c) 2018 Louis Carlin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Louis Carlin
Euclidean domains and Euclidean algorithm (extended to come)
A lot is based on pre-existing code in mathlib for natural number gcds
-/
import tactic.ring
universe u
clas... |
12b202c838705920ddc5e757d213cc60aa702dcd | 88892181780ff536a81e794003fe058062f06758 | /src/100_theorems/t068.lean | 94eb3ee35cb91b026b5a9151ae66c58d81e4e004 | [] | 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 | 171 | lean | import algebra.big_operators
-- Sum of an arithmetic series
open finset
theorem t068 : ∀ (n : ℕ), (finset.range n).sum (λi, i) = (n * (n - 1)) / 2
:= sum_range_id
|
7402de42b20fb7147aaa6c07197b038ea7f28000 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/calculus/inverse.lean | 4532272141c61fc8de8ed71414d85ced80d4cf41 | [
"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 | 37,352 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Heather Macbeth, Sébastien Gouëzel
-/
import analysis.calculus.cont_diff
import tactic.ring_exp
import analysis.normed_space.banach
import topology.local_homeomorph
... |
1edbabd7df3e9c03c48fa71a39849a93c402027e | b2fe74b11b57d362c13326bc5651244f111fa6f4 | /src/analysis/convex/basic.lean | 95e456e43f938281f1930608e77b6028cb69ba7d | [
"Apache-2.0"
] | permissive | midfield/mathlib | c4db5fa898b5ac8f2f80ae0d00c95eb6f745f4c7 | 775edc615ecec631d65b6180dbcc7bc26c3abc26 | refs/heads/master | 1,675,330,551,921 | 1,608,304,514,000 | 1,608,304,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 58,026 | lean | /-
Copyright (c) 2019 Alexander Bentkamp. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alexander Bentkamp, Yury Kudriashov
-/
import data.set.intervals.ord_connected
import data.set.intervals.image_preimage
import data.complex.module
import linear_algebra.affine_spac... |
94f36aa42e4335d73e8fac7b214ed7808d38e8c5 | c7e0fa0422da099d4b66b195c60455d87facee0d | /polynomial.lean | 0e3be9eab4a7dbb518117a1df46532e2c351a98c | [] | no_license | viljamivirolainen/linear | 12d725a90a44ae2760f59e9a9d9dd12aae36300a | dcf28df05e06da1b4fc76bce61b8fa0741300dc8 | refs/heads/master | 1,678,895,327,362 | 1,516,045,398,000 | 1,516,045,398,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 905 | lean | import .seq .vector_space .subspace .function
def fin.max {n} : fin (n + 1) :=
⟨n, nat.le_refl _⟩
def monoid.pow {R} [monoid R] (r : R) : ℕ → R :=
nat.rec 1 (λ _, (*) r)
notation x `^` n := monoid.pow x n
-- A function R → R is a polynomial of degree...
inductive is_polynomial_of_degree {R} [ring R] : (R → R) → ℤ →... |
db21885833d4e63d7ca02ddced32040f11a288db | 0e9e4fa61bad11733d146f25076045b2ac9f9fbe | /library/init/meta/simp_tactic.lean | 2d45bb1763967abe01abd27e71bcbb5dcf297acb | [
"Apache-2.0"
] | permissive | Achierius/lean | 3d9cd6633ebee07987d062c9921b77d90a971343 | 6b8a91e5a76ed78eb5c075cecb0a991ee97a594f | refs/heads/master | 1,676,410,367,196 | 1,610,127,822,000 | 1,610,127,822,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 27,811 | 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.attribute init.meta.constructor_tactic
import init.meta.relation_tactics init.meta.occurrences
import init.data.op... |
d5210da81d626135bf45fbfc44e36d3abfb8b67b | 284f2c54d8342aba193603ced8192501ad01db5c | /src/utils/default.lean | ef73d76a4cbc88f80687e3ea3fb2fdca3e90daf3 | [] | no_license | UVM-M52/quiz-5-ftclark3 | 146a3af5f715010feea454ac4699a484c04b8b37 | eefb07d4966166e8dc5576beed2cf443ecf62c0a | refs/heads/master | 1,616,553,238,217 | 1,584,718,913,000 | 1,584,718,913,000 | 247,507,621 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 43 | lean |
import .cmp
import .int_refl
import .real
|
0b99f6cbbd8586dd2ef1cbd2260c198917191d94 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/order/copy.lean | 6d9adfa5ae98e95154e9df937723cfb4446ac399 | [
"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 | 4,536 | 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 order.conditionally_complete_lattice
/-!
# Tooling to make copies of lattice structures
Sometimes it is useful to make a copy of a lattice structure
where o... |
feac7326dad8f459cd660a3f40c802d21c5e0a02 | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/data/set/basic.lean | ba571baa93897dd16968fd8f5c903d2476f4b7f6 | [
"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 | 90,196 | 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... |
c3f5bbae6c0486eacaf899f62fad4402c68f40c9 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/topology/metric_space/emetric_space.lean | 5c276c970edc72ba7f649489075ecac9adcd0d78 | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 40,094 | lean | /-
Copyright (c) 2015, 2017 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Robert Y. Lewis, Johannes Hölzl, Mario Carneiro, Sébastien Gouëzel
-/
import data.real.ennreal
import data.finset.intervals
import topology.uniform_space.uniform_em... |
402ad99e3ab8f3cd0e664cdae86664a5c3bf18e0 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/big_operators/multiset/basic.lean | 8f44040888cbacee6a2fe94305673654dd0556a2 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 16,065 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.list.big_operators.basic
import data.multiset.basic
/-!
# Sums and products over multisets
In this file we define products and sums indexed by mu... |
a034925393ed4e4de719d5087538a7e6e206da44 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/refine1.lean | bb4902c7272fc27862091e9898230991e44ce0df | [
"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 | 113 | lean | example (a b : Prop) : a → b → a ∧ b :=
begin
intros [Ha, Hb],
refine (and.intro _ Hb),
exact Ha
end
|
37a5853c9f831efcc90ad836d5525cbca1248270 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/algebra/lie/cartan_subalgebra.lean | 861ccec6aa53c0ee9daa501b6be67d1f7eac5141 | [
"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 | 3,375 | lean | /-
Copyright (c) 2021 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import algebra.lie.nilpotent
/-!
# Cartan subalgebras
Cartan subalgebras are one of the most important concepts in Lie theory. We define them here.
The standard example i... |
d87403cd13b72a85e388d7b8d6ef6c009ce1e132 | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/data/equiv/local_equiv.lean | c35aef05cfc3cddfe40242015f266a4e00d23ca8 | [
"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 | 22,335 | lean | /-
Copyright (c) 2019 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 data.equiv.basic
/-!
# Local equivalences
This files defines equivalences between subsets of given types.
An element `e` of `local_equiv α β` is made o... |
7298fbaa824993be3afb74d8e4fa95ccfe226851 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /tests/lean/run/finbug.lean | 4a6430828cd05dfee149d2b04dd32921debe47df | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 913 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.fin
Author: Leonardo de Moura
Finite ordinals.
-/
open nat
inductive fin : nat → Type :=
fz : Π n, fin (succ n),
fs : Π {n}, fin n → fin (succ n)
namespace fin
definit... |
7b5101f3edcb33b866a7d42677b9c7ef8dad9f3c | 94e33a31faa76775069b071adea97e86e218a8ee | /src/representation_theory/invariants.lean | d535445d622fbc2a5ad2f455f2f6b392ef3780f4 | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 5,154 | lean | /-
Copyright (c) 2022 Antoine Labelle. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Antoine Labelle
-/
import representation_theory.basic
import representation_theory.Rep
/-!
# Subspace of invariants a group representation
This file introduces the subspace of invar... |
da0deca7be36be722357ff40dde895fd23efc4ef | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/termElab.lean | 885635588eed2cbe80171596f6a1bb7675249edf | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 687 | lean | import Lean
new_frontend
open Lean
open Lean.Elab
open Lean.Elab.Term
def tst1 : TermElabM Unit := do
let opt ← getOptions;
let stx ← `(forall (a b : Nat), Nat);
IO.println "message 1"; -- This message goes direct to stdio. It will be displayed before trace messages.
let e ← elabTermAndSynthesize stx none;
logDbgTrac... |
f6b05f55a4be65f15cb75940b43e1d8ad92ab212 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/diamond7.lean | df96abc8dca19e7b2507f0d0f12a6d4bbbe77ce0 | [
"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,864 | lean | class Semigroup (α : Type u) extends Mul α where
mul_assoc (a b c : α) : a * b * c = a * (b * c)
class CommSemigroup (α : Type u) extends Semigroup α where
mul_comm (a b : α) : a * b = b * a
class One (α : Type u) where
one : α
instance [One α] : OfNat α (nat_lit 1) where
ofNat := One.one
class Monoid (α : ... |
5ce5c52ae70a842bfd8e629611e461f6f82617ac | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/filtered.lean | 0501b5c2637fb1ab3936ce86645fc20c27368f67 | [
"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 | 2,456 | 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 category_theory.category
import order.bounded_lattice
/-!
# Filtered categories
A category is filtered if every finite diagram admits a cocone.
We give a simple ch... |
35d971d7f67e8ca243ad724bf091f042d6207990 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/tactic/monotonicity/interactive.lean | 552676edb11ae6317993c5a9ba28d4ac76ed12e3 | [
"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 | 23,482 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
-/
import tactic.monotonicity.basic
import control.traversable
import control.traversable.derive
import data.dlist
variables {a b c p : Prop}
namespace tactic.interactive
op... |
a952510ad7471cbc5dc386ce29a52a68d58bad44 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/vector_bundle/basic.lean | 52b78edd640aefa7622993d5a282594b66d7e7c3 | [
"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 | 34,780 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri, Sebastien Gouezel, Heather Macbeth, Patrick Massot, Floris van Doorn
-/
import analysis.normed_space.bounded_linear_maps
import topology.fiber_bundle.basic
/-!
# Ve... |
afb1bb06fc9ff6b23494c0c93aae54e5d45b4a47 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/category_theory/preadditive/yoneda.lean | f7ad10ff21e071f7723ec50a24161aa0c98c73c2 | [
"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,227 | lean | /-
Copyright (c) 2022 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import category_theory.preadditive.opposite
import algebra.category.Module.basic
import algebra.category.Group.preadditive
/-!
# The Yoneda embedding for preadditive c... |
a947e1e503ca7efcdeb978f0e587b1af7ddc17c7 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /test/lint_coe_t.lean | ebe242ceeab98f1b482938238086d128c37daf3c | [
"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,083 | lean | import tactic.lint
open tactic
-- bad, because every iteration of tc search will loop, generating nested quotients
section
local attribute [instance]
def a_to_quot {α} (R : setoid α) : has_coe α (quotient R) := ⟨quotient.mk⟩
run_cmd do
d ← get_decl ``a_to_quot,
some _ ← linter.has_coe_variable.test d,
d ← get_d... |
7892f303825d0b23894a91760f68e896af7296d0 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/order/lexicographic.lean | 6ab8d7e8a0442a218f80427e210008366b6ab399 | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 8,630 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Scott Morrison, Minchao Wu
Lexicographic preorder / partial_order / linear_order / decidable_linear_order,
for pairs and dependent pairs.
-/
import tactic.basic
import algebra.order
u... |
8d36df106a00ba5569bfc3d592aae58491a4d786 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/fourier.lean | 8c568d14f027dfc2f603ba0ccb02768728c51841 | [
"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 | 10,700 | lean | /-
Copyright (c) 2021 Heather Macbeth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth
-/
import analysis.complex.circle
import analysis.inner_product_space.l2_space
import measure_theory.function.continuous_map_dense
import measure_theory.function.l2_sp... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.