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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
95ac2594963550b3c4ee1c4e8ad9b2bd00bf2069 | f4bff2062c030df03d65e8b69c88f79b63a359d8 | /src/game/intro.lean | be06477245657de1cb076fbadd79e9230485ab5b | [
"Apache-2.0"
] | permissive | adastra7470/real-number-game | 776606961f52db0eb824555ed2f8e16f92216ea3 | f9dcb7d9255a79b57e62038228a23346c2dc301b | refs/heads/master | 1,669,221,575,893 | 1,594,669,800,000 | 1,594,669,800,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,021 | lean | /-
# The Real Number Game, version 1.0beta
## By Kevin Buzzard, Dan Stanescu and Gavin Thomson
# What is this game?
Welcome to the real number game -- a game to help undergraduates learn analysis through Lean,
a formal proof verification system. Starting from the real numbers with its usual structure,
we develop the... |
a21ab5d2b923e094a10b311dfa02e621b761d7cc | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/algebra/opposites.lean | 4db5d0daee227f6e43f3858319ee4bfd41a2eec7 | [
"Apache-2.0"
] | permissive | hamdysalah1/mathlib | b915f86b2503feeae268de369f1b16932321f097 | 95454452f6b3569bf967d35aab8d852b1ddf8017 | refs/heads/master | 1,677,154,116,545 | 1,611,797,994,000 | 1,611,797,994,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,984 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import data.opposite
import algebra.field
import group_theory.group_action.defs
import data.equiv.mul_add
/-!
# Algebraic operations on `αᵒᵖ`
-/
namespace opposite
universes ... |
a5fd606803c4623469e63af859586d153700db5c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/wlog.lean | edb965d87235072c46665a11b84201f8378c7cdd | [] | 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,460 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
Without loss of generality tactic.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.list.perm
import Mathlib.PostPort
namespace Mathl... |
d7bde6d5fb5b728c5a464d175e346d57f43172dc | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/autobound_and_macroscopes.lean | c679805969a8a8d0acfc5d52bcb494a66168d9df | [
"Apache-2.0"
] | permissive | collares/lean4 | 861a9269c4592bce49b71059e232ff0bfe4594cc | 52a4f535d853a2c7c7eea5fee8a4fa04c682c1ee | refs/heads/master | 1,691,419,031,324 | 1,618,678,138,000 | 1,618,678,138,000 | 358,989,750 | 0 | 0 | Apache-2.0 | 1,618,696,333,000 | 1,618,696,333,000 | null | UTF-8 | Lean | false | false | 57 | lean | local notation "A" => id x
theorem test : A = A := sorry
|
6bae758879f23bdd09f519d50aa8a66063451888 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/matchEqsBug.lean | 44884f6f99e6b6d39160c88954f1936535681b93 | [
"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 | 690 | lean | import Lean
syntax (name := test) "test%" ident : command
open Lean.Elab
open Lean.Elab.Command
@[command_elab test] def elabTest : CommandElab := fun stx => do
let id ← resolveGlobalConstNoOverloadWithInfo stx[1]
liftTermElabM do
IO.println (repr (← Lean.Meta.Match.getEquationsFor id))
return ()
def f (x ... |
1756f9ea265c567bd023e86ead61d1e3a0f4ed25 | d9ed0fce1c218297bcba93e046cb4e79c83c3af8 | /library/tools/super/clausifier.lean | 6a73883c122cc961a89e32f8821ff24a3e6649f4 | [
"Apache-2.0"
] | permissive | leodemoura/lean_clone | 005c63aa892a6492f2d4741ee3c2cb07a6be9d7f | cc077554b584d39bab55c360bc12a6fe7957afe6 | refs/heads/master | 1,610,506,475,484 | 1,482,348,354,000 | 1,482,348,543,000 | 77,091,586 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,885 | lean | /-
Copyright (c) 2016 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import .clause .clause_ops
import .prover_state .misc_preprocessing
open expr list tactic monad decidable
universe variable u
namespace super
meta def try_option {a ... |
d314987c4bf30f7069cd0ac3edfec42b49969a66 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/algebra/lie/weights.lean | 949cdf6dd190f1522079dadf3c69e83afcf6af70 | [
"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 | 24,026 | 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
import algebra.lie.tensor_product
import algebra.lie.character
import algebra.lie.engel
import algebra.lie.cartan_subalgebra
import linear_alge... |
f5e74f86eb1e3b252aab2ffe41d675f39ebfb2c4 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/number_theory/pell.lean | d59b87ec9b0ae7f436a7c2fed84328546ec8e0e5 | [
"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 | 37,690 | 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.nat.modeq
import number_theory.zsqrtd.basic
/-!
# Pell's equation and Matiyasevic's theorem
This file solves Pell's equation, i.e. integer solutions to... |
5059bd0d3e63d1b2380d6f46b5670c76ddf671a7 | 54d7e71c3616d331b2ec3845d31deb08f3ff1dea | /tests/lean/pp_char_bug.lean | ba1b002f3fccb476de6cd1d70fccfc25b34d71ef | [
"Apache-2.0"
] | permissive | pachugupta/lean | 6f3305c4292288311cc4ab4550060b17d49ffb1d | 0d02136a09ac4cf27b5c88361750e38e1f485a1a | refs/heads/master | 1,611,110,653,606 | 1,493,130,117,000 | 1,493,167,649,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 418 | lean | #check (fin.mk 2 dec_trivial : fin 5)
#check (fin.mk 1 dec_trivial : fin 3)
#check #"a"
#check to_string #"a"
#eval to_string #"a"
#eval #"a"
#eval char.of_nat 1
#eval char.of_nat 1
#eval char.of_nat 20
#check char.of_nat 1
#check char.of_nat 20
#check char.of_nat 15
#check char.of_nat 16
#eval char.of_nat 15
#eval c... |
b4f3bc4ab5d7ac2bf5da40d684052da17890595d | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Compiler/LCNF/JoinPoints.lean | 604b30602ec6f6d3f08be817601d6138e1519715 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 18,705 | lean | /-
Copyright (c) 2022 Henrik Böving. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Henrik Böving
-/
import Lean.Compiler.LCNF.CompilerM
import Lean.Compiler.LCNF.PassManager
import Lean.Compiler.LCNF.PullFunDecls
namespace Lean.Compiler.LCNF
-- TODO: These can be us... |
bbd805e90ac7dcf58655fac9db7b01fb971764a8 | 1437b3495ef9020d5413178aa33c0a625f15f15f | /data/equiv/basic.lean | 58c866c1dd2252e9c7d07a853710eb4de472ae8e | [
"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 | 29,923 | 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
In the standard library we cannot assume the univalence axiom.
We say two types are equivalent if they are isomorphic.
Two equivalent types h... |
a4cef51a610c9b11a9f1f98cee779241aba2ec6f | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/compiler/termparsertest1.lean | 5a4b29770b780b882f7bcfd0ae760390620ddef1 | [
"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 | 2,598 | lean | import Init.Lean.Parser.Term
open Lean
open Lean.Parser
def testParser (input : String) : IO Unit :=
do
env ← mkEmptyEnvironment;
stx ← IO.ofExcept $ runParserCategory env `term input "<input>";
IO.println stx
def test (is : List String) : IO Unit :=
is.forM $ fun input => do
IO.println input;
testParser input
d... |
e78d945ff51d31ba879cfde6dc405f51300f91cf | 1437b3495ef9020d5413178aa33c0a625f15f15f | /tactic/basic.lean | b29f201bc4fe3112869942322b47ddd2ce1327ed | [
"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 | 28,356 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Simon Hudon, Scott Morrison, Keeley Hoek
-/
import data.dlist.basic category.basic
namespace name
meta def deinternalize_field : name → name
| (name.mk_string s name.... |
54cc199b43363faf764bbf52605020733fbaa72b | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/special_functions/trigonometric/inverse_deriv.lean | 152623840582c746cd8c0c8e658b74665a374de4 | [
"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 | 7,703 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne, Benjamin Davidson
-/
import analysis.special_functions.trigonometric.inverse
import analysis.special_functions.trigonometric... |
06dbdf46b611840308471c9ebdcf2fd3863fddb8 | 88fb7558b0636ec6b181f2a548ac11ad3919f8a5 | /leanpkg/leanpkg/resolve.lean | 76d6e66b2bf107d7c60e624e621c4949f2fbd0df | [
"Apache-2.0"
] | permissive | moritayasuaki/lean | 9f666c323cb6fa1f31ac597d777914aed41e3b7a | ae96ebf6ee953088c235ff7ae0e8c95066ba8001 | refs/heads/master | 1,611,135,440,814 | 1,493,852,869,000 | 1,493,852,869,000 | 90,269,903 | 0 | 0 | null | 1,493,906,291,000 | 1,493,906,291,000 | null | UTF-8 | Lean | false | false | 3,471 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Gabriel Ebner
-/
import leanpkg.manifest system.io data.hash_map leanpkg.proc
variable [io.interface]
namespace leanpkg
def assignment := hash_map string (λ _, string)
-- TODO(... |
17405c88fe8e476db796bbfde761991029430434 | 2385ce0e3b60d8dbea33dd439902a2070cca7a24 | /tests/lean/1603.lean | 49cf4953b032142e93971cf3a565d3cf65192ceb | [
"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 | 223 | lean | def some_lets : ℕ → ℕ → ℕ
| 0 v := v
| (nat.succ n) v := let k := some_lets n v + v in k
def some_unfolded_lets (n : ℕ) : ∃ v : ℕ , v = some_lets 5 n :=
begin
dunfold some_lets,
-- sorry
end
|
75090fabdb8d0bfa6300d653dc7e83dbb3b4dc0d | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /library/init/algebra/order.lean | 5ed0a49f71d37c7bf43cd68146e1b827498c77c6 | [
"Apache-2.0"
] | permissive | bjoeris/lean | 0ed95125d762b17bfcb54dad1f9721f953f92eeb | 4e496b78d5e73545fa4f9a807155113d8e6b0561 | refs/heads/master | 1,611,251,218,281 | 1,495,337,658,000 | 1,495,337,658,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,797 | 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.logic
/- Make sure instances defined in this file have lower priority than the ones
defined for concrete structures -/
set_option def... |
607fa4a0a6a379417f003ca0d5e8b2c0736a565d | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/macroPrio.lean | 6ff84b47d811e04a7974e8ab9d1a082c757f9681 | [
"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 | 518 | lean | import Lean
macro "foo!" x:term:max : term => `($x + 1)
#check foo! 0
theorem ex1 : foo! 2 = 3 :=
rfl
macro "foo!" x:term:max : term => `($x * 2)
#check foo! 1 -- ambiguous
-- macro with higher priority
macro (priority := high) "foo!" x:term:max : term => `($x - 2)
#check foo! 2
theorem ex2 : foo! 2 = 0 :=
... |
8e996a61ef10a28450089f82d0ffc46045fe8689 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /stage0/src/Init/Lean/Elab/Tactic/Basic.lean | 0e685f43e5e955f9b5b7db93f21abe27234dba58 | [
"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 | 17,505 | 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
-/
prelude
import Init.Lean.Util.CollectMVars
import Init.Lean.Meta.Tactic.Assumption
import Init.Lean.Meta.Tactic.Intro
import Init.Lean.Me... |
744b60347c28e1978a92521fbb298f8e93bf8852 | 8cb37a089cdb4af3af9d8bf1002b417e407a8e9e | /library/data/rbtree/main.lean | fdffc54f68ed812393b044433217bc70b00cc8aa | [
"Apache-2.0"
] | permissive | kbuzzard/lean | ae3c3db4bb462d750dbf7419b28bafb3ec983ef7 | ed1788fd674bb8991acffc8fca585ec746711928 | refs/heads/master | 1,620,983,366,617 | 1,618,937,600,000 | 1,618,937,600,000 | 359,886,396 | 1 | 0 | Apache-2.0 | 1,618,936,987,000 | 1,618,936,987,000 | null | UTF-8 | Lean | false | false | 8,380 | 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 data.rbtree.insert data.rbtree.min_max
universes u
namespace rbnode
variables {α : Type u} {lt : α → α → Prop}
lemma is_searchable... |
976c7c6783c1f04e6def058aaae6317dad42994e | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/671.lean | cfa840046619dd06da53e7079422433c75e0fc55 | [
"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 | 15 | lean | #print nat.add
|
0a8984df7dfaa28027a8740d1fae78bcde8b0f45 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /test/matrix.lean | 01aefc126484e2aaca7b4a991b844a3aa1186a18 | [
"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,414 | lean | import data.matrix.notation
import linear_algebra.determinant
import group_theory.perm.fin
import tactic.norm_swap
variables {α β : Type} [semiring α] [ring β]
namespace matrix
open_locale matrix
example {a a' b b' c c' d d' : α} :
![![a, b], ![c, d]] + ![![a', b'], ![c', d']] = ![![a + a', b + b'], ![c + c', d +... |
f369a3b80c22793f172864fe4987ca6ab7175903 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/247.lean | 5cf2fff399f4a14d7d38c1fdef2f0a2e3b33a266 | [
"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 | 212 | lean | import Lean
namespace Lean.Meta
def f (e : Expr) : MetaM Bool := do
forallTelescope e fun xs b =>
match (← uinfoldDefinition? b) with
| none => pure true
| some _ => pure false
end Lean.Meta
|
8e84749dcb3552ad7a09439a9ca7e23dc8091791 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1842.lean | b101bd2d8244bf431810b48f62e636cfe0741527 | [
"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 | 753 | lean | variable (R : α → α → Prop)
inductive List.Pairwise : List α → Prop
| nil : Pairwise []
| cons : ∀ {a : α} {l : List α}, (∀ {a} (_ : a' ∈ l), R a a') → Pairwise l → Pairwise (a :: l)
theorem and_assoc : (a ∧ b) ∧ c ↔ a ∧ (b ∧ c) :=
⟨fun ⟨⟨ha, hb⟩, hc⟩ => ⟨ha, hb, hc⟩, fun ⟨ha, hb, hc⟩ => ⟨⟨ha, hb⟩, hc⟩⟩
theore... |
bab47a36e663bfd376c7bb4846572a54eddb90d6 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/algebra/field.lean | 782fcccd187bcf56042bf24ed0241a1acf49ac34 | [
"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 | 5,145 | 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
-/
import logic.basic algebra.ring algebra.group_with_zero
open set
universe u
variables {α : Type u}
@[priority 100] -- see Note [lower instance prior... |
6ae76b52cb30f68c39401faad9a0e35c3b76fa61 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/1766.lean | 16ece880ae4919c7d9dca3aa04b623c44eaab3c1 | [
"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 | 741 | lean | inductive is_some (x : option nat) : Prop
| mk : ∀ value : nat, x = some value → is_some
def value_1 (x : option nat) (H : is_some x)
: nat :=
begin
destruct x; intros,
{destruct H, -- ERROR: `is_some` can only eliminate into Prop
intros, clear _x_2, rw _x at _x_1, contradiction},
{assumption}
end
d... |
81c227e4cd6cc74ece1d6f424375a479850ab49c | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/inj2.lean | c3cb498e3e76677f2b00159f614b6feb42b13de8 | [
"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 | 1,142 | lean | new_frontend
universes u v
inductive Vec2 (α : Type u) (β : Type v) : Nat → Type (max u v)
| nil : Vec2 α β 0
| cons : α → β → forall {n}, Vec2 α β n → Vec2 α β (n+1)
inductive Fin2 : Nat → Type
| zero (n : Nat) : Fin2 (n+1)
| succ {n : Nat} (s : Fin2 n) : Fin2 (n+1)
theorem test1 {α β} {n} (a₁ a₂ : α... |
ceffeb6d74d172aaff0d2a018ab95c1fb8c71a7a | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/field_theory/separable_degree.lean | 62efddcfb545298deb8a3ce0609e8f6948b917b4 | [
"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 | 6,476 | lean | /-
Copyright (c) 2021 Jakob Scholbach. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob Scholbach
-/
import field_theory.separable
import algebra.algebra.basic
import data.polynomial.degree
import algebra.char_p.exp_char
/-!
# Separable degree
This file contains... |
75ab4f287922323e3478e55ab76ba5f40e8717a9 | 43390109ab88557e6090f3245c47479c123ee500 | /src/Topology/Problem_Sheets/ps_2_ex4a.lean | 8f26ac1c87cdf801d72b5591455e8515a31ea263 | [
"Apache-2.0"
] | permissive | Ja1941/xena-UROP-2018 | 41f0956519f94d56b8bf6834a8d39473f4923200 | b111fb87f343cf79eca3b886f99ee15c1dd9884b | refs/heads/master | 1,662,355,955,139 | 1,590,577,325,000 | 1,590,577,325,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,035 | lean | -- Setup for doing the topology problem sheet 2 exercise 4
import analysis.topology.continuity
import analysis.topology.topological_space
import analysis.topology.infinite_sum
import analysis.topology.topological_structures
import analysis.topology.uniform_space
universe u
open set filter lattice classical
-- A func... |
122740bb1e2f8f696c3b361d5b782a726b212242 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Lean/Meta/AppBuilder.lean | 85d23c70a1bc6761d39f41917dacce3d2af49877 | [
"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 | 17,884 | 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.Structure
import Lean.Util.Recognizers
import Lean.Meta.SynthInstance
import Lean.Meta.Check
namespace Lean.Meta
variables {m : Type → Type} [... |
70593bddc9b21696c6ce3f04c306efa43edfc40d | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/group_theory/perm/sign.lean | ff6c4edfad97850303332bd863cec04f860f74bd | [
"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 | 32,958 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.fintype
universes u v
open equiv function fintype finset
variables {α : Type u} {β : Type v}
namespace equiv.perm
def subtype_perm (f : perm α) {p : α → Pr... |
716b350d74449faff9dd42a1856af4727830bfeb | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/analysis/calculus/fderiv.lean | ca1ee8ad3722e6a477c5eb4701a42339b3f6390f | [
"Apache-2.0"
] | permissive | anthony2698/mathlib | 03cd69fe5c280b0916f6df2d07c614c8e1efe890 | 407615e05814e98b24b2ff322b14e8e3eb5e5d67 | refs/heads/master | 1,678,792,774,873 | 1,614,371,563,000 | 1,614,371,563,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 121,898 | lean | /-
Copyright (c) 2019 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Sébastien Gouëzel, Yury Kudryashov
-/
import analysis.calculus.tangent_cone
import analysis.normed_space.units
import analysis.asymptotics.asymptotic_equivalent
import an... |
f2640c087dfe76e6ce5034ca1ceaeb77119efc97 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/set_theory/cardinal/finite.lean | 537d6afb6d7e9cb32ef75e0077d3ee8a6067e236 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 4,031 | lean | /-
Copyright (c) 2021 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import data.zmod.defs
import set_theory.cardinal.basic
/-!
# Finite Cardinality Functions
## Main Definitions
* `nat.card α` is the cardinality of `α` as a natural... |
c87883f8218e12b2b2b519393bd558f97754a555 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/data/nat/choose/basic.lean | e1d811e9e8794b0b1630b2fc666da527983641f0 | [
"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 | 8,148 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Bhavik Mehta
-/
import data.nat.factorial
/-!
# Binomial coefficients
This file contains a definition of binomial coefficients and simple lemmas (i.e. those not
requiring ... |
c186d1c5e9ad5bc999aea09ba6cf3bd10d1d41d1 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Compiler/LCNF/ElimDead.lean | 28bdae95bf5886b2d6b441557582cc9dc088d678 | [
"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 | 3,116 | lean | /-
Copyright (c) 2022 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Compiler.LCNF.CompilerM
namespace Lean.Compiler.LCNF
abbrev UsedLocalDecls := FVarIdHashSet
/--
Collect set of (let) free variables in a LCNF... |
9a91794b880aba705022fb9ba95200f8f92cf553 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/interactive/t12.lean | c6213977172dca9a50ed8b644e793ce2db342f93 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,120 | lean | (*
import("tactic.lua")
-- Define a simple tactic using Lua
auto = Repeat(OrElse(assumption_tac(), conj_tac(), conj_hyp_tac()))
*)
theorem T1 (A B : Bool) : A /\ B -> B /\ A :=
fun assumption : A /\ B,
let lemma1 : A := (by auto),
lemma2 : B := (by auto)
in (sho... |
61ea9e50a39d41e12e14d5ae95544cdd362e7d1d | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/split_ifs.lean | 59905ced6a81c1fe2581e7dd83f215ada12eb32f | [
"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,304 | lean | /-
Copyright (c) 2018 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
Tactic to split if-then-else-expressions.
-/
import tactic.hint
open expr tactic
namespace tactic
open interactive
meta def find_if_cond : expr → option expr | e :=
e.... |
e73d48f8606f3692b70ffdaa5fc965d6fcdc303a | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/Server/InfoUtils.lean | 68d6fd0db164ae9cb89beeff36ea7ebc82cae70a | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | EdAyers/lean4 | 57ac632d6b0789cb91fab2170e8c9e40441221bd | 37ba0df5841bde51dbc2329da81ac23d4f6a4de4 | refs/heads/master | 1,676,463,245,298 | 1,660,619,433,000 | 1,660,619,433,000 | 183,433,437 | 1 | 0 | Apache-2.0 | 1,657,612,672,000 | 1,556,196,574,000 | Lean | UTF-8 | Lean | false | false | 14,087 | lean | /-
Copyright (c) 2021 Wojciech Nawrocki. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Wojciech Nawrocki
-/
import Lean.PrettyPrinter
protected structure String.Range where
start : String.Pos
stop : String.Pos
deriving Inhabited, Repr, BEq, Hashable
def Stri... |
15ef09174c330989539877dd6fc66472f5be1dac | 95dcf8dea2baf2b4b0a60d438f27c35ae3dd3990 | /src/category_theory/limits/preserves.lean | 4e5d0266087abae0bd80e137ced7f172bc710c07 | [
"Apache-2.0"
] | permissive | uniformity1/mathlib | 829341bad9dfa6d6be9adaacb8086a8a492e85a4 | dd0e9bd8f2e5ec267f68e72336f6973311909105 | refs/heads/master | 1,588,592,015,670 | 1,554,219,842,000 | 1,554,219,842,000 | 179,110,702 | 0 | 0 | Apache-2.0 | 1,554,220,076,000 | 1,554,220,076,000 | null | UTF-8 | Lean | false | false | 10,243 | lean | -- Copyright (c) 2018 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison, Reid Barton
-- Preservation and reflection of (co)limits.
import category_theory.whiskering
import category_theory.limits.limits
open category_theory
namespac... |
e42cf5113e1d7d8f4965c9128c753377f05f3ff3 | 5756a081670ba9c1d1d3fca7bd47cb4e31beae66 | /Mathport/Util/String.lean | 3448642c16fd3ac4b1566c34ac8c12a64ea337fe | [
"Apache-2.0"
] | permissive | leanprover-community/mathport | 2c9bdc8292168febf59799efdc5451dbf0450d4a | 13051f68064f7638970d39a8fecaede68ffbf9e1 | refs/heads/master | 1,693,841,364,079 | 1,693,813,111,000 | 1,693,813,111,000 | 379,357,010 | 27 | 10 | Apache-2.0 | 1,691,309,132,000 | 1,624,384,521,000 | Lean | UTF-8 | Lean | false | false | 1,366 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam
-/
namespace String
def snake2pascalCamel (snake : String) (lc : Bool) : String := Id.run do
let mut pascal := join (snake.splitOn "_" |>.map capitalize)
if l... |
049b7a57d329e187b3b0b5fef4f219d1f0e961c2 | fecda8e6b848337561d6467a1e30cf23176d6ad0 | /src/category_theory/limits/creates.lean | a90b09d246fc3c0cc78afcddb1bcef0cf67bbdda | [
"Apache-2.0"
] | permissive | spolu/mathlib | bacf18c3d2a561d00ecdc9413187729dd1f705ed | 480c92cdfe1cf3c2d083abded87e82162e8814f4 | refs/heads/master | 1,671,684,094,325 | 1,600,736,045,000 | 1,600,736,045,000 | 297,564,749 | 1 | 0 | null | 1,600,758,368,000 | 1,600,758,367,000 | null | UTF-8 | Lean | false | false | 16,844 | 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.preserves.basic
open category_theory category_theory.limits
noncomputable theory
namespace category_theory
universes v u₁ u₂ u₃
variabl... |
2475517410d354cc8b48dbe7c047145da9438cff | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/data/real/complete.lean | e56255bb60d74124779e208c77171bf10558c258 | [
"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 | 32,202 | lean | /-
Copyright (c) 2015 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Robert Y. Lewis
The real numbers, constructed as equivalence classes of Cauchy sequences of rationals.
This construction follows Bishop and Bridges (1985).
At this point, we no longer... |
ac6884f2bfdaa3b261dea0815df6c7a0b650911b | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/measure_theory/l1_space.lean | 11d0cb2251ab33c7836c45013c92581709021ded | [
"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 | 28,178 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
-/
import measure_theory.ae_eq_fun
/-!
# Integrable functions and `L¹` space
In the first part of this file, the predicate `integrable` is defined and basic properties ... |
f6936173dbffd2d29c8ac3283e2bdec1f6cdb8b7 | 9ad8d18fbe5f120c22b5e035bc240f711d2cbd7e | /src/undergraduate/MAS114/scratch.lean | a37539e4bb737e618eb88c570293813aa88d38ba | [] | no_license | agusakov/lean_lib | c0e9cc29fc7d2518004e224376adeb5e69b5cc1a | f88d162da2f990b87c4d34f5f46bbca2bbc5948e | refs/heads/master | 1,642,141,461,087 | 1,557,395,798,000 | 1,557,395,798,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,443 | lean | def half_Q : ℚ := 1 / 2
def neg_half_Q : ℚ := - half_Q
noncomputable def half_R : ℝ := half_Q
noncomputable def neg_half_R : ℝ := neg_half_Q
/-
Even basic identities like 1/2 - 1 = -1/2 cannot easily be
proved directly in ℝ, because there are no general algorithms
for exact calculation in ℝ. We need to work in ℚ ... |
0a3be761b173c831b21ec49fe306f99b9f9029d4 | 43d840497673d50aaf1058dc851b1edc51d1ab11 | /src/solutions/tuesday/morning.lean | 6cc67790308f0b6a5334d6e93c6866b37c875633 | [] | permissive | dhruva-divate/lftcm2020 | 6606bc857204fbfd8ab92812060c0e5114f67e0d | d2e1a31a4ad280eadef1d0ae6a89920b7345c823 | refs/heads/master | 1,668,432,237,346 | 1,594,377,206,000 | 1,594,377,206,000 | 278,630,020 | 0 | 0 | MIT | 1,594,384,713,000 | 1,594,384,712,000 | null | UTF-8 | Lean | false | false | 79 | lean | import tactic
example : true :=
begin
-- sorry
trivial,
-- sorry
end |
8528834d33461c863cb43ab521050cda91876213 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/pfunctor/univariate/M.lean | e59d13b8212e221c0e5b300be0af2c6fb9960e46 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,750 | lean | /-
Copyright (c) 2017 Simon Hudon All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.pfunctor.univariate.basic
import Mathlib.PostPort
universes u l w u_1
namespace Mathlib
/... |
088c5cd1ff90027dda7aeed7a26bec5f9575c3a0 | 359199d7253811b032ab92108191da7336eba86e | /src/mywork/mid-term_review/pre_exam_oh_notes.lean | 7b395e54641608b174a9ab182b5c5a8bc7438a92 | [] | no_license | arte-et-marte/my_cs2120f21 | 0bc6215cb5018a3b7c90d9d399a173233f587064 | 91609c3609ad81fda895bee8b97cc76813241e17 | refs/heads/main | 1,693,298,928,348 | 1,634,931,202,000 | 1,634,931,202,000 | 399,946,705 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 643 | lean | -- Is the exam open-note?
-- What does lemma mean?
/-
exists intro takes in two things _ _
- a witness, 3
- proof that 3 satisfies predicate
∃ (n : ℕ), ev n
exists.intro
3 ways to get to a goal of false:
1. some var of type false, can exact it (or contradiction?)
2. apply false elimination rule on a proof of false.... |
980146866fd4d36f06a5957d6db2bf58c3a49ef9 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/order/compactly_generated.lean | c6cd469de8db929398b5307ca53ea478b1a2333c | [
"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 | 22,030 | 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 tactic.tfae
import order.atoms
import order.order_iso_nat
import order.sup_indep
import order.zorn
import data.finset.order
import data.finite.default
/-!
# Compact... |
c37477d5952f1c4c7def153d963ee05a46867cc9 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/action.lean | 935da218803452d1a3b18198cadd5e5547ef364d | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 6,730 | lean | /-
Copyright (c) 2020 David Wärn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Wärn
-/
import category_theory.elements
import category_theory.is_connected
import category_theory.single_obj
import group_theory.group_action.quotient
import group_theory.semidirect... |
e5689ecceeeee64001691dcc00ccb2f98dc4a5ca | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/order/bounded_lattice.lean | 550af2082d68f407761c890fc885b00e0c8e7bce | [
"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 | 42,607 | 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
import data.option.basic
import tactic.pi_instances
import l... |
fc6278abdb1614f280eb9cd10192b479723edd2b | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/set_theory/game/winner.lean | 5dbd1cd012b5e86bb384da49e91aff92b281380a | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,445 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.set_theory.pgame
import Mathlib.PostPort
universes u_1
namespace Mathlib
/-!
# Basic definiti... |
d0b008be36949968b52ae13e92b685718ea37be0 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/order/filter/cofinite.lean | d126c43dd9446250a5593808219929173e414ec1 | [
"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,727 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Jeremy Avigad, Yury Kudryashov
-/
import order.filter.at_top_bot
import order.filter.pi
/-!
# The cofinite filter
In this file we define
`cofinite`: the filter of se... |
8cb3fce69befa7dbff79171587b2e54926a3e8bb | 0e175f34f8dca5ea099671777e8d7446d7d74227 | /library/init/meta/type_context.lean | 4598f38ad649003452806c84272796426620fa79 | [
"Apache-2.0"
] | permissive | utensil-contrib/lean | b31266738071c654d96dac8b35d9ccffc8172fda | a28b9c8f78d982a4e82b1e4f7ce7988d87183ae8 | refs/heads/master | 1,670,045,564,075 | 1,597,397,599,000 | 1,597,397,599,000 | 287,528,503 | 0 | 0 | Apache-2.0 | 1,597,408,338,000 | 1,597,408,337,000 | null | UTF-8 | Lean | false | false | 6,605 | lean | prelude
import init.control init.meta.local_context init.meta.tactic init.meta.fun_info
namespace tactic.unsafe
/-- A monad that exposes the functionality of the C++ class `type_context_old`.
The idea is that the methods to `type_context` are more powerful but _unsafe_ in the
sense that you can create terms that do not... |
af929dc5682f4bd81f5d55b1923894440794aae5 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Compiler/NeverExtractAttr.lean | 9a185da07451e7e6971315270bf898508179372c | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | EdAyers/lean4 | 57ac632d6b0789cb91fab2170e8c9e40441221bd | 37ba0df5841bde51dbc2329da81ac23d4f6a4de4 | refs/heads/master | 1,676,463,245,298 | 1,660,619,433,000 | 1,660,619,433,000 | 183,433,437 | 1 | 0 | Apache-2.0 | 1,657,612,672,000 | 1,556,196,574,000 | Lean | UTF-8 | Lean | false | false | 806 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Environment
import Lean.Attributes
namespace Lean
builtin_initialize neverExtractAttr : TagAttribute ←
registerTagAttribute `neverExtract "i... |
8cd5554963e89bc039900222517f5af272b1806b | 2d34dfb0a1cc250584282618dc10ea03d3fa858e | /src/by_exactI_hack.lean | 6bc7306d4c839abfae616b58b80ddacda2350be6 | [] | no_license | zeta1999/lean-liquid | 61e294ec5adae959d8ee1b65d015775484ff58c2 | 96bb0fa3afc3b451bcd1fb7d974348de2f290541 | refs/heads/master | 1,676,579,150,248 | 1,610,771,445,000 | 1,610,771,445,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 556 | lean | -- brilliant hack by Gabriel Ebner
-- thanks!!
open tactic expr
open lean
open lean.parser
open interactive
open tactic
reserve prefix ` `:100 -- zero-width space Unicode char
@[user_notation]
meta def exact_notation (_ : parse $ tk "") (e : parse (lean.parser.pexpr 0)) : parser pexpr := do
expr.macro d [_] ← pure... |
22b364394bf29261d6362e422cdf51251de87bd0 | 7a76361040c55ae1eba5856c1a637593117a6556 | /src/exercises/love04_functional_programming_exercise_solution.lean | b3579dd991652972f0bcb98424b2a3b94f17efa3 | [] | no_license | rgreenblatt/fpv2021 | c2cbe7b664b648cef7d240a654d6bdf97a559272 | c65d72e48c8fa827d2040ed6ea86c2be62db36fa | refs/heads/main | 1,692,245,693,819 | 1,633,364,621,000 | 1,633,364,621,000 | 407,231,487 | 0 | 0 | null | 1,631,808,608,000 | 1,631,808,608,000 | null | UTF-8 | Lean | false | false | 7,192 | lean | import ..lectures.love03_forward_proofs_demo
/-! # LoVe Exercise 4: Functional Programming -/
set_option pp.beta true
set_option pp.generalized_field_notation false
namespace LoVe
/-! ## Question 1: Reverse of a List
We define a new accumulator-based version of `reverse`. The first argument,
`as`, serves as the... |
cec9972cda7bea695a8b376361515f974794bc67 | 80746c6dba6a866de5431094bf9f8f841b043d77 | /src/analysis/exponential.lean | 8af0e806ed7713e1446fac39bb2fe110b93dd744 | [
"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 | 51,360 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import topology.instances.complex tactic.linarith data.complex.exponential
open finset filter metric
namespace complex
lemma tendsto_exp_zero_one : tendsto ... |
680ef37014652c1fa4f7b4bc50a9cd074675b7fb | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/category_theory/isomorphism.lean | b8849f1b315b882fb494c6b192a7cfaf543647e3 | [
"Apache-2.0"
] | permissive | ntzwq/mathlib | ca50b21079b0a7c6781c34b62199a396dd00cee2 | 36eec1a98f22df82eaccd354a758ef8576af2a7f | refs/heads/master | 1,675,193,391,478 | 1,607,822,996,000 | 1,607,822,996,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,227 | 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.functor
/-!
# Isomorphisms
This file defines isomorphisms between objects of a category.
## M... |
745ed547d4adf847b353863264720ccb6da324d8 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/readerThe.lean | c09115970989289ad4dddc102b74fdf5513be6d7 | [
"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 | 331 | lean |
abbrev M := ReaderT String $ StateT Nat $ ReaderT Bool $ IO
def f : M Nat := do
let s ← read
IO.println s
let b ← readThe Bool
IO.println b
let s ← get
pure s
#eval (f "hello").run' 10 true
def g : M Nat :=
let a : M Nat := withTheReader Bool not f
withReader (fun s => s ++ " world") a
#eval (g "hello").run' 10 ... |
7ec9a938b8b1b71caf27034c04675b5902d33e40 | 359199d7253811b032ab92108191da7336eba86e | /src/mywork/my_lect_14.lean | dabc089b60d9573238eb3ff1164a1cc21627586d | [] | no_license | arte-et-marte/my_cs2120f21 | 0bc6215cb5018a3b7c90d9d399a173233f587064 | 91609c3609ad81fda895bee8b97cc76813241e17 | refs/heads/main | 1,693,298,928,348 | 1,634,931,202,000 | 1,634,931,202,000 | 399,946,705 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 966 | lean | axioms
(Person : Type)
(Likes : Person → Person → Prop) -- Likes is a binary relation (using a 2-place predicate)
example: ¬(∀ (p : Person), Likes p p) ↔ ∃ (p : Person), ¬ Likes p p := -- uninhabitated type = no values/proofs/instances of that type
begin
apply iff.intro _ _,
-- forwards
assume h,
-- elim r... |
955bb60bbcb4796e961b85b6e4d5d22e8b134e83 | 97c8e5d8aca4afeebb5b335f26a492c53680efc8 | /ground_zero/HITs/int.lean | 539a59efc1514f0ff7b978360ecbb98e051d7bf9 | [] | no_license | jfrancese/lean | cf32f0d8d5520b6f0e9d3987deb95841c553c53c | 06e7efaecce4093d97fb5ecc75479df2ef1dbbdb | refs/heads/master | 1,587,915,151,351 | 1,551,012,140,000 | 1,551,012,140,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,302 | lean | import ground_zero.types.heq
/-
Integers ℤ as a quotient of ℕ × ℕ.
* HoTT 6.10, remark 6.10.7
-/
abbreviation builtin.int := int
namespace ground_zero.HITs
def int.rel : ℕ × ℕ → ℕ × ℕ → Prop
| ⟨a, b⟩ ⟨c, d⟩ := a + d = b + c
def int := quot int.rel
local notation ℤ := int
namespace nat.product
def add (x y :... |
9547a3beb78711b485fc8afff0d8d1289715267f | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/blast_cc13.lean | d8673733a01aab406e770a24a85b8f043041ea24 | [
"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 | 565 | lean | set_option blast.strategy "cc"
example (p : nat → nat → Prop) (f : nat → nat) (a b c d : nat) :
p (f a) (f b) → a = c → b = d → b = c → p (f c) (f c) :=
by blast
example (p : nat → nat → Prop) (a b c d : nat) :
p a b → a = c → b = d → p c d :=
by blast
example (p : nat → nat → Prop) (f : nat → nat) (... |
87ea776937f8742ad56f8ab1940688bf86a1ff08 | 38ee9024fb5974f555fb578fcf5a5a7b71e669b5 | /Mathlib/Mathport/SpecialNames.lean | 4794ab14ff48a3c6bca64592d8cbd5f70f0fd8b6 | [
"Apache-2.0"
] | permissive | denayd/mathlib4 | 750e0dcd106554640a1ac701e51517501a574715 | 7f40a5c514066801ab3c6d431e9f405baa9b9c58 | refs/heads/master | 1,693,743,991,894 | 1,636,618,048,000 | 1,636,618,048,000 | 373,926,241 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,804 | 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 Mathlib.Mathport.Rename
namespace Mathlib.Prelude
-- Note: we do not currently auto-align constants.
#align quot Quot
#align quot.mk Quot.mk
#align quo... |
ffe9412bf8e89c3db03d0abba34afc85c21edbea | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/cases_unsupported_equality.lean | d69e75de9e7eccfe35922adfa77340bac4ef904a | [
"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 | 131 | lean | inductive foo : ℕ → Type
| a : foo 0
| b : ∀ n, foo (n+1)
example (n) (f : ℕ → ℕ) (h : foo (f n)) : true :=
by cases h |
f1e3fcc156979d3ab1901fd0aee6805b99c41b5d | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/group_theory/coset.lean | a2d4c3d13bb296a22cd4f9d2b7d56023e22892c0 | [
"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 | 15,025 | lean | /-
Copyright (c) 2018 Mitchell Rowett. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mitchell Rowett, Scott Morrison
-/
import group_theory.subgroup
/-!
# Cosets
This file develops the basic theory of left and right cosets.
## Main definitions
* `left_coset a s`:... |
bb1ed1a2afb53d1330690c4de82f6f3026467ab3 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/linear_algebra/isomorphisms.lean | ee1181632dcacba663cfda6ffff9b2f82d63cb1a | [
"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,891 | 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
-/
import linear_algebra.quotient
/-!
# Isomorphism theorems for modules.
* The Noether's first, second, and third isom... |
bf4d148bfd6d3a3b6bf9de05d5f2d6b5d1c1afac | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/linear_algebra/projective_space/subspace.lean | d15d8c751ec4a0f1d00b29eca0ebe0dcee42a786 | [
"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,298 | lean | /-
Copyright (c) 2022 Michael Blyth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Michael Blyth
-/
import linear_algebra.projective_space.basic
/-!
# Subspaces of Projective Space
In this file we define subspaces of a projective space, and show that the subspaces ... |
4f453c8e31b740c4f7a615656d0694b5a389cbb3 | e6b8240a90527fd55d42d0ec6649253d5d0bd414 | /src/topology/metric_space/closeds.lean | 656f3b42721c3e3e3af9a21b0aeee7f99c51f92c | [
"Apache-2.0"
] | permissive | mattearnshaw/mathlib | ac90f9fb8168aa642223bea3ffd0286b0cfde44f | d8dc1445cf8a8c74f8df60b9f7a1f5cf10946666 | refs/heads/master | 1,606,308,351,137 | 1,576,594,130,000 | 1,576,594,130,000 | 228,666,195 | 0 | 0 | Apache-2.0 | 1,576,603,094,000 | 1,576,603,093,000 | null | UTF-8 | Lean | false | false | 22,489 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sébastien Gouëzel
-/
import topology.metric_space.hausdorff_distance topology.opens
/-!
# Closed subsets
This file defines the metric and emetric space structure on the types of c... |
90218b43b41d420178856f4031b5ddc9a1061f32 | 2cf781335f4a6706b7452ab07ce323201e2e101f | /lean/elf.lean | 357bc87909e60e168c88a46ccba97de8c1de7db9 | [
"Apache-2.0"
] | permissive | simonjwinwood/reopt-vcg | 697cdd5e68366b5aa3298845eebc34fc97ccfbe2 | 6aca24e759bff4f2230bb58270bac6746c13665e | refs/heads/master | 1,586,353,878,347 | 1,549,667,148,000 | 1,549,667,148,000 | 159,409,828 | 0 | 0 | null | 1,543,358,444,000 | 1,543,358,444,000 | null | UTF-8 | Lean | false | false | 17,193 | lean | /-
This file contains the start of an Elf parser for Lean. It currently has facilities for parsing
Elf
-/
import system.io
import init.category.reader
import init.category.state
import decodex86
import .imap
import .file_input
def repeat {α : Type} {m : Type → Type} [applicative m] : ℕ → m α → m (list α)
| 0 m := pur... |
2cd8369d2eefce30e2b0bcbb714bf8fe827c98ec | a721fe7446524f18ba361625fc01033d9c8b7a78 | /elaborate/strong_induction.stripped.lean | 4e6a8271b4d798f3f1eac588b7c9e6a3a0512247 | [] | 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 | 11,368 | lean | λ (statement : mynat → Prop) (base_case : statement zero) (inductive_step : ∀ (n : mynat), (∀ (m : mynat), (∃ (k : mynat), n = add m k) → statement m) → statement (succ n)) (k : mynat), mynat.rec (λ (M : mynat) (hMl0 : ∃ (k : mynat), zero = add M k), eq.rec base_case (eq.rec (eq.refl (statement M)) (eq.rec (eq.refl (st... |
137a3184acbf70a6d71225b0a4ac5a3e03e5bd50 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/multiset/range.lean | a074ad5a805e01275c5bb300ddec41c2f87ad1a5 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 1,658 | 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.multiset.basic
import data.list.range
/-! # `multiset.range n` gives `{0, 1, ..., n-1}` as a multiset. -/
open list nat
namespace multiset
/- r... |
674c04d42feadb359a85d2d0929f1e9242945b4f | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/CompilerFloatLetIn.lean | 5af1e09f9744ab4689ed98d4a972b9c42a569c86 | [
"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 | 773 | lean | import Lean.Compiler.Main
import Lean.Compiler.LCNF.Testing
import Lean.Elab.Do
open Lean
open Lean.Compiler.LCNF
-- Run compilation twice to avoid the output caused by the inliner
#eval Compiler.compile #[``Lean.Meta.synthInstance, ``Lean.Elab.Term.Do.elabDo]
-- #eval fails if we uncomment this pass after I added a... |
f1a3e90706b3cdb3d71b6bc1b26420090a7b2462 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/newfrontend1.lean | 1ee4593519d29353869866af1d249f82c3dfbfa9 | [
"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 | 6,165 | lean | def x := 1
new_frontend
#check x
variables {α : Type}
def f (a : α) : α :=
a
def tst (xs : List Nat) : Nat :=
xs.foldl (init := 10) (· + ·)
#check tst [1, 2, 3]
#check tst
#check (fun stx => if True then let e := stx; HasPure.pure e else HasPure.pure stx : Nat → Id Nat)
#check let x : Nat := 1; x
def foo (a :... |
6809213ad5ce5c06cffb68211ee71aed12572e3d | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/locally_convex/basic.lean | e85a878843e3b32bb490047aabd532cbec164f94 | [
"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 | 12,094 | lean | /-
Copyright (c) 2019 Jean Lo. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean Lo, Bhavik Mehta, Yaël Dillies
-/
import analysis.normed_space.basic
/-!
# Local convexity
This file defines absorbent and balanced sets.
An absorbent set is one that "surrounds" the ... |
5bbe7190282e9face41d318d44223d6b668977b7 | df561f413cfe0a88b1056655515399c546ff32a5 | /3-multiplication-world/l4.lean | b24d5811910b6824f5be44375211ea00c93583ae | [] | no_license | nicholaspun/natural-number-game-solutions | 31d5158415c6f582694680044c5c6469032c2a06 | 1e2aed86d2e76a3f4a275c6d99e795ad30cf6df0 | refs/heads/main | 1,675,123,625,012 | 1,607,633,548,000 | 1,607,633,548,000 | 318,933,860 | 3 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 210 | lean | lemma mul_add (t a b : mynat) : t * (a + b) = t * a + t * b :=
begin
induction b with k Pk,
rw mul_zero,
repeat { rw add_zero },
rw mul_succ,
rw ← add_assoc,
rw ← Pk,
rw ← mul_succ,
rw add_succ,
refl,
end |
9f61ea116f139516afa600e097c46e462298ce93 | 38193807b9085b93599c814229d2b0dacb64ba22 | /benchmarks/optimize/Optimize.lean | 8698062592f113ee2afa943d9d195658ec0d29d9 | [] | no_license | zgrannan/rest-old | d650363e403a9d5322fb44ee892b743aec558e1b | 6a6974641b25259cb8701af4302169db22b33b6b | refs/heads/master | 1,670,816,037,466 | 1,599,571,928,000 | 1,599,571,928,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 327 | lean | open nat
def sumSeries : ℕ → ℕ
| zero := zero
| (succ n) := succ n + sumSeries n
def sumSeries' : ℕ → ℕ
| n := (n * (succ n)) / 2
theorem isOpt : ∀ (n : ℕ) , sumSeries n = sumSeries' n := sorry
theorem proof (n : ℕ) (f : ℕ -> ℕ → ℕ) : f (sumSeries n) = f (sumSeries' n) := by simp [isOpt]
|
e85d4813b1d6fa7672844a7441860c7d83edf440 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /stage0/src/Lean/Server/InfoUtils.lean | 101a835b7d506566f1c1c2b24455ea5c4e2e45dd | [
"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 | 4,807 | lean | /-
Copyright (c) 2021 Wojciech Nawrocki. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Wojciech Nawrocki
-/
import Lean.DocString
import Lean.Elab.InfoTree
import Lean.Util.Sorry
namespace Lean.Elab
/-- Find the deepest node matching `p` in the first subtree which ... |
cf6146f18be9da36f119acb684b86220a7398484 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/nat/bitwise.lean | 159359c85cfa2bb75ffceee14f938b6dc6d824e3 | [
"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 | 9,661 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import data.nat.bits
import tactic.linarith
/-!
# Bitwise operations on natural numbers
In the first half of this file, we provide theorems for reasoning about natura... |
9ce56b2d1d66af5f5e43974be26814b2582b2633 | 05b503addd423dd68145d68b8cde5cd595d74365 | /src/topology/separation.lean | ef241a065f60f8e1b8ebb108c50928c7b6d53762 | [
"Apache-2.0"
] | permissive | aestriplex/mathlib | 77513ff2b176d74a3bec114f33b519069788811d | e2fa8b2b1b732d7c25119229e3cdfba8370cb00f | refs/heads/master | 1,621,969,960,692 | 1,586,279,279,000 | 1,586,279,279,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,724 | 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
Separation properties of topological spaces.
-/
import topology.subset_properties
open set filter
open_locale topological_space
local attribute [insta... |
a5068f60f4e01d9fa607b9625013980f6ba09d97 | a7dd8b83f933e72c40845fd168dde330f050b1c9 | /docs/tutorial/category_theory/calculating_colimits_in_Top.lean | 2b86ab64ad1d4301c058068cf9099b2ee9821c72 | [
"Apache-2.0"
] | permissive | NeilStrickland/mathlib | 10420e92ee5cb7aba1163c9a01dea2f04652ed67 | 3efbd6f6dff0fb9b0946849b43b39948560a1ffe | refs/heads/master | 1,589,043,046,346 | 1,558,938,706,000 | 1,558,938,706,000 | 181,285,984 | 0 | 0 | Apache-2.0 | 1,568,941,848,000 | 1,555,233,833,000 | Lean | UTF-8 | Lean | false | false | 2,934 | lean | import category_theory.instances.Top.limits
import category_theory.limits.shapes
import topology.instances.real
/- This file contains some demos of using the (co)limits API to do topology. -/
noncomputable theory
open category_theory
open category_theory.instances
open category_theory.limits
def R : Top := Top.of ℝ... |
8c5fa588af04c4bd6ff2a1d49f223112440daf1a | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/run/class7.lean | 8e4f710439edea8ce84a7772e1e2d7150564aefb | [
"Apache-2.0"
] | permissive | codyroux/lean | 7f8dff750722c5382bdd0a9a9275dc4bb2c58dd3 | 0cca265db19f7296531e339192e9b9bae4a31f8b | refs/heads/master | 1,610,909,964,159 | 1,407,084,399,000 | 1,416,857,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 472 | lean | import logic
open tactic
inductive inh [class] (A : Type) : Type :=
intro : A -> inh A
theorem inh_bool [instance] : inh Prop
:= inh.intro true
set_option elaborator.trace_instances true
theorem inh_fun [instance] {A B : Type} (H : inh B) : inh (A → B)
:= inh.rec (λ b, inh.intro (λ a : A, b)) H
theorem tst {A B : ... |
161a19614a0eba27d46905f9ab94f9cc210a7556 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /tests/lean/run/matchArrayLit.lean | d0430ea3ec0cf4e474428fad64bd61615bba4d19 | [
"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 | 2,475 | lean | universe u v
theorem eqLitOfSize0 {α : Type u} (a : Array α) (hsz : a.size = 0) : a = #[] :=
a.toArrayLitEq 0 hsz
theorem eqLitOfSize1 {α : Type u} (a : Array α) (hsz : a.size = 1) : a = #[a.getLit 0 hsz (ofDecideEqTrue rfl)] :=
a.toArrayLitEq 1 hsz
theorem eqLitOfSize2 {α : Type u} (a : Array α) (hsz : a.size = 2) ... |
ca60603475882a0d8d0965b67f98717985012bba | 7c2dd01406c42053207061adb11703dc7ce0b5e5 | /src/exercises/06_sub_sequences.lean | 986acc2f343f332777097d5efbb15c7857d45552 | [
"Apache-2.0"
] | permissive | leanprover-community/tutorials | 50ec79564cbf2ad1afd1ac43d8ee3c592c2883a8 | 79a6872a755c4ae0c2aca57e1adfdac38b1d8bb1 | refs/heads/master | 1,687,466,144,386 | 1,672,061,276,000 | 1,672,061,276,000 | 189,169,918 | 186 | 81 | Apache-2.0 | 1,686,350,300,000 | 1,559,113,678,000 | Lean | UTF-8 | Lean | false | false | 3,271 | lean | import tuto_lib
/-
This file continues the elementary study of limits of sequences.
It can be skipped if the previous file was too easy, it won't introduce
any new tactic or trick.
Remember useful lemmas:
abs_le {x y : ℝ} : |x| ≤ y ↔ -y ≤ x ∧ x ≤ y
abs_add (x y : ℝ) : |x + y| ≤ |x| + |y|
abs_sub_comm (x y : ℝ) : |... |
903999f5533cb53df5601bd4e2aa104b0aa666d0 | e898bfefd5cb60a60220830c5eba68cab8d02c79 | /uexp/src/uexp/rules/pullConstantThroughUnion3.lean | bfc2e6f6c4f98d57f1663e98919bcd8da81eb657 | [
"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,017 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..UDP
set_option profiler true
open Expr
open Proj
open Pred
open SQL
open tree
notation `int` := datatypes.int
constant integer_2: const int
constant integer_3: const int
theorem Rule: forall (Γ scm_t scm_account scm_bonus scm_de... |
c47d4242d2470d0fb5517d71204727a46e7b5ff7 | fe84e287c662151bb313504482b218a503b972f3 | /src/combinatorics/domino.lean | 231474360beb1ed43de159db3f798a5d4f62b19b | [] | no_license | NeilStrickland/lean_lib | 91e163f514b829c42fe75636407138b5c75cba83 | 6a9563de93748ace509d9db4302db6cd77d8f92c | refs/heads/master | 1,653,408,198,261 | 1,652,996,419,000 | 1,652,996,419,000 | 181,006,067 | 4 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 11,763 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
(This is part of an attempt to formalise some material from
a basic undergraduate combinatorics course.)
A "domino" means a subset of ℕ × ℕ of the form
{i} × {j,... |
230e6af9434ea70f038a58d73e2daad1c67c3ec7 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/number_theory/zsqrtd/basic.lean | 89d07fd537d81a6618215812ef0a02052a368128 | [
"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 | 33,343 | 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 algebra.associated
import ring_theory.int.basic
import tactic.ring
/-! # ℤ[√d]
The ring of integers adjoined with a square root of `d : ℤ`.
After defining t... |
0b2b3bbf4724b4a064c5133cfc7095a6d8ece5e0 | 1abd1ed12aa68b375cdef28959f39531c6e95b84 | /src/number_theory/fermat4.lean | 9e1d004c2ff4942ce93c70d3ed92833af262f997 | [
"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 | 12,333 | lean | /-
Copyright (c) 2020 Paul van Wamelen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Paul van Wamelen
-/
import number_theory.pythagorean_triples
import ring_theory.coprime.lemmas
/-!
# Fermat's Last Theorem for the case n = 4
There are no non-zero integers `a`, `b`... |
17cda8e706517b14bcbbb60f27996a9b19c24ba5 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/ordered_pi_auto.lean | 0ef9dd0b2e23ee8d31d154ff7621378b25cab95e | [] | 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,233 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Patrick Massot
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.group.pi
import Mathlib.algebra.ordered_group
import Mathlib.tactic.pi_in... |
8f630587b59dd60f20084360493679aef3bfdfc4 | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/lean/eqncompiler/matchpattern.lean | 8f815b8fed0fdd1cfd9eb8b735565600418a3cbf | [
"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 | 702 | 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
namespace Lean
namespace EqnCompiler
def mkMatchPatternAttr : IO TagAttribute :=
registerTagAttribute `matchPattern "m... |
a323b3eaee14bc9cbcce37b774e836516d872736 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/order/bounds.lean | b9835fab1511e352299bb58a11eeb456da9f8db0 | [
"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 | 38,149 | 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.set.intervals.basic
/-!
# Upper / lower bounds
In this file we define:
* `upper_bounds`, `lower_bounds` : the set of upper bounds (re... |
5334a2524d9aa1e6680cf6b20f2e3a72ac416836 | 76ce87faa6bc3c2aa9af5962009e01e04f2a074a | /03_Conjunction/00_and.lean | 4b7f62322cc036e5d0119a52c21c1cffb120c7e5 | [] | no_license | Mnormansell/Discrete-Notes | db423dd9206bbe7080aecb84b4c2d275b758af97 | 61f13b98be590269fc4822be7b47924a6ddc1261 | refs/heads/master | 1,585,412,435,424 | 1,540,919,483,000 | 1,540,919,483,000 | 148,684,638 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,182 | lean | /-
Intuitively, if a proposition P is true and a
second proposition Q is true, then the more
complex proposition, "P and Q" is also true.
This proposition is written symbolically as
P ∧ Q. In mathematical logic, we say that
the proposition, P ∧ Q, is the conjunction
of the individual propositions, P and Q.
There's ... |
405dab56f2a8c7700c2c46825d50cf0957eb4a64 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/letrecInProofs.lean | 853b9f821a0ed7f0ad0093aa2d97c50b96085c2c | [
"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,702 | lean | import Lean
inductive Tree
| leaf : Tree
| node : Tree → Tree → Tree
abbrev notSubtree (x : Tree) (t : Tree) : Prop :=
Tree.ibelow (motive := fun z => x ≠ z) t
infix:50 "≮" => notSubtree
theorem Tree.acyclic (x t : Tree) : x = t → x ≮ t := by
let rec right (x s : Tree) (b : Tree) (h : x ≮ b) : node s x ≠ b ... |
94ef9b080465735cce674ae907add63c9a3bb30e | 3bdd27ffdff3ffa22d4bb010eba695afcc96bc4a | /src/combinatorics/simplicial_complex/polytope.lean | 7667aa442e21d6f4c0820cc041c14fd56af87955 | [] | no_license | mmasdeu/brouwerfixedpoint | 684d712c982c6a8b258b4e2c6b2eab923f2f1289 | 548270f79ecf12d7e20a256806ccb9fcf57b87e2 | refs/heads/main | 1,690,539,793,996 | 1,631,801,831,000 | 1,631,801,831,000 | 368,139,809 | 4 | 3 | null | 1,624,453,250,000 | 1,621,246,034,000 | Lean | UTF-8 | Lean | false | false | 6,037 | lean | /-
Copyright (c) 2021 Yaël Dillies, Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies, Bhavik Mehta
-/
import combinatorics.simplicial_complex.convex_independence
import combinatorics.simplicial_complex.glued
open set affine
namespace poly
vari... |
1dd54f00a3ebe52cd7dbebfb3451eb2f4309b7f4 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/list/sigma.lean | 3e99184fe09f32ff0e69dfbd0fae0bc0c6ee481d | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 24,689 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Sean Leather
Functions on lists of sigma types.
-/
import data.list.perm
import data.list.range
import data.sigma
universes u v
namespace list
variables {α : Type u}... |
cba23b49c19d766e459f14ec07aa8b517f120052 | 367134ba5a65885e863bdc4507601606690974c1 | /src/category_theory/limits/punit.lean | a9e045c56e8c10ca66f19cc6fa659fca3e844187 | [
"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 | 974 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.punit
import category_theory.limits.limits
/-!
# `discrete punit` has limits and colimits
Mostly for the sake of constructing trivial exampl... |
c54357bb4b93e15e57d709c04153cfe94c5b83c2 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/data/rat/cast.lean | bf44984c62b12a5b2b366700ebcdf0307eecb819 | [
"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 | 11,488 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import data.rat.order
/-!
# Casts for Rational Numbers
## Summary
We define the canonical injection from ℚ into an arbitrary division ring and prove... |
1f1fc951aa049f15638658104453e229780cc22d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/monad/basic.lean | 69302b5bd815bf0fd1f45b9c8a7a43480c486aae | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 11,452 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta, Adam Topaz
-/
import category_theory.functor.category
import category_theory.functor.fully_faithful
import category_theory.functor.reflects_isomorphisms
... |
c9d305bad4e56279b3f1220be06d8b994a8b30a1 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/tst4.lean | 93104e72c8c90ad883343b9db10904457d78b2b0 | [
"Apache-2.0"
] | permissive | codyroux/lean0.1 | 1ce92751d664aacff0529e139083304a7bbc8a71 | 0dc6fb974aa85ed6f305a2f4b10a53a44ee5f0ef | refs/heads/master | 1,610,830,535,062 | 1,402,150,480,000 | 1,402,150,480,000 | 19,588,851 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 503 | lean | variable f {A : Type} (a b : A) : A
variable N : Type
variable n1 : N
variable n2 : N
set_option lean::pp::implicit true
print f n1 n2
print f (fun x : N -> N, x) (fun y : _, y)
variable EqNice {A : Type} (lhs rhs : A) : Bool
infix 50 === : EqNice
print n1 === n2
check f n1 n2
check @congr
print f n1 n2
variable a : N
... |
11a69c0c5f94f1d38588fedb9d48842f830866ef | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/special_functions/arsinh.lean | 545a87e21093281789922179cc32607e5cfc6632 | [
"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,741 | lean | /-
Copyright (c) 2020 James Arthur. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Arthur, Chris Hughes, Shing Tak Lam
-/
import analysis.special_functions.trigonometric.deriv
import analysis.special_functions.log.basic
/-!
# Inverse of the sinh function
In thi... |
b975539358cfc556aa30d851e1180c578b14b29f | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/polynomial/erase_lead.lean | c17b0e7673ad41414cf80ed82c87d6122927ba4e | [
"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 | 6,975 | lean | /-
Copyright (c) 2020 Damiano Testa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa
-/
import data.polynomial.degree
import data.polynomial.degree.trailing_degree
/-!
# Erase the leading term of a univariate polynomial
## Definition
* `erase_lead f`: t... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.