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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
a7314c2229bc0effca9c572600b948a6c5d853a2 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/ring/defs.lean | fe52249fb3230690ca53f302a8d3bae68e7801ce | [
"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 | 16,876 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Yury Kudryashov, Neil Strickland
-/
import algebra.group.basic
import algebra.group_with_zero.defs
import data.int.cast.defs
/-!
# S... |
cff82d4c7fb801fb7b978249fe1945215cf15d52 | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/probability_theory/independence.lean | 532c04da5a3e7b0f5c1507e05d3399bb932f8fbf | [
"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 | 15,481 | lean | /-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Rémy Degenne
-/
import measure_theory.measure_space
import algebra.big_operators.intervals
import data.finset.intervals
/-!
# Independence of sets of sets and measure spaces (σ-algebras)... |
9d094ddc2edc7267d90759decbab9b3e256d45cf | 4f065978c49388d188224610d9984673079f7d91 | /polynomial.lean | 7363523f3c4de687350e992e2357778178f0ba40 | [] | no_license | kckennylau/Lean | b323103f52706304907adcfaee6f5cb8095d4a33 | 907d0a4d2bd8f23785abd6142ad53d308c54fdcb | refs/heads/master | 1,624,623,720,653 | 1,563,901,820,000 | 1,563,901,820,000 | 109,506,702 | 3 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 6,223 | lean | import data.polynomial
class algebra (R : out_param $ Type*) [comm_ring R] (A : Type*) extends ring A :=
(f : R → A) [hom : is_ring_hom f]
(commutes : ∀ r s, s * f r = f r * s)
attribute [instance] algebra.hom
namespace algebra
variables (R : Type*) (A : Type*)
variables [comm_ring R] [algebra R A]
@[simp] lemma f... |
ca511977644719d9ffb09ed2549ece475b4f903b | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/choiceMacroRules.lean | d5a3ebf625d547debf3290e770270ee13de6b92c | [
"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 | 538 | lean | new_frontend
syntax:65 [myAdd1] term "+++" term:65 : term
syntax:65 [myAdd2] term "+++" term:65 : term
macro_rules [myAdd1]
| `($a +++ $b) => `($a + $b)
macro_rules [myAdd2]
| `($a +++ $b) => `($a ++ $b)
#check (1:Nat) +++ 3
theorem tst1 : ((1:Nat) +++ 3) = 1 + 3 :=
rfl
#check fun (x : Nat) => if x +++ 3 = x then... |
9918da653f8796bc473899e6e81a6f084ce50ed1 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/rec_eq_ematch_bug.lean | 3e1b53a8ba68e3d49eb24fd23332b07d6468f8e5 | [
"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 | 722 | lean | inductive Nat
| Z : Nat
| S : Nat → Nat
open Nat
constant Add : Nat → Nat → Nat
axiom Add_Zero : ∀ a, Add a Z = a
axiom Zero_Add : ∀ a, Add Z a = a
axiom Add_Succ : ∀ a b, Add a (S b) = S (Add a b)
axiom Succ_Add : ∀ a b, Add (S a) b = S (Add a b)
local attribute [ematch] Add_Zero Zero_Add Add_Succ Succ_Add
open smt... |
cc630548c2d12d2486e7607a7c2910ba89232cfc | bb31430994044506fa42fd667e2d556327e18dfe | /src/group_theory/congruence.lean | 11748fd953fb42da310c5e01df13fb94e78a4154 | [
"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 | 52,680 | lean | /-
Copyright (c) 2019 Amelia Livingston. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Amelia Livingston
-/
import algebra.group.prod
import algebra.hom.equiv.basic
import data.setoid.basic
import group_theory.submonoid.operations
/-!
# Congruence relations
This fil... |
1171a1cdfc1a8cccb77fc0f2b64788e0c86e2eff | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/tactic/delta_instance.lean | 142a3e4fee6a7671a3b58ed9021ae330b141b57d | [
"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 | 2,632 | lean | /-
Copyright (c) 2019 Rob Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rob Lewis
-/
import tactic.simp_result
namespace tactic
/--
`delta_instance ids` tries to solve the goal by calling `apply_instance`,
first unfolding the definitions in `ids`.
-/
-- We ca... |
60476a4e37bddb8f680aca208d82a3281971caad | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /src/Lean/Compiler/LCNF/Simp/Config.lean | dea2346528f480a92c04c3f58a731600a028acde | [
"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 | 1,270 | 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
-/
namespace Lean.Compiler.LCNF
namespace Simp
/--
Configuration options for `Simp` that are not controlled using `set_option`.
Recall that we have multiple `... |
b2b6e9e0bf48ccde4f2c43364e1ae3e4ce1490ce | 35b83be3126daae10419b573c55e1fed009d3ae8 | /_target/deps/mathlib/data/list/basic.lean | c27c27a07f895e28f627f204c37b2d478e1b00e1 | [] | no_license | AHassan1024/Lean_Playground | ccb25b72029d199c0d23d002db2d32a9f2689ebc | a00b004c3a2eb9e3e863c361aa2b115260472414 | refs/heads/master | 1,586,221,905,125 | 1,544,951,310,000 | 1,544,951,310,000 | 157,934,290 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 182,159 | lean | /-
Copyright (c) 2014 Parikshit Khanna. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Parikshit Khanna, Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Mario Carneiro
Basic properties of lists.
-/
import
tactic.interactive tactic.mk_iff_of_inductive_prop tactic... |
0897c1fafd7b829e1b6ecc5c8af69ff2abc2338a | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /archive/imo/imo2021_q1.lean | 18790bcf65915f845ffe3ea531ecebc76dff1ff3 | [
"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 | 8,311 | lean | /-
Copyright (c) 2021 Mantas Bakšys. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mantas Bakšys
-/
import data.real.sqrt
import tactic.interval_cases
import tactic.linarith
import tactic.norm_cast
import tactic.norm_num
import tactic.ring_exp
/-!
# IMO 2021 Q1
Let... |
5d6624fabe48da9e41c29dc28129cda420c88c8a | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/order/filter/filter_product.lean | 153acfeab47f034fe416e4a2e59bad811b77e339 | [
"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 | 8,290 | lean | /-
Copyright (c) 2019 Abhimanyu Pallavi Sudhir. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Abhimanyu Pallavi Sudhir
-/
import order.filter.ultrafilter
import order.filter.germ
/-!
# Ultraproducts
If `φ` is an ultrafilter, then the space of germs of functions `f :... |
0b52c9b61c0545ccd52e52f718f45ff665af7453 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/tactic19.lean | 155bfc8a5e71eee2448d6db94f3b2eb125462981 | [
"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 | 197 | lean | import logic
open tactic
theorem tst {A : Type} {f : A → A → A} {a b c : A} (H1 : a = b) (H2 : b = c) : f a b = f b c
:= by apply (eq.subst H2);
apply (eq.subst H1);
apply eq.refl
|
a0dc01bcc4770503f01e00b3e289899c4e554f0f | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/lean/parser.lean | c4c7259a059f7ac5eddbf5f32a24520c9a2cbb11 | [] | 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 | 400 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.meta.tactic
import Mathlib.Lean3Lib.init.meta.has_reflect
import Mathlib.Lean3Lib.init.control.alternati... |
40f9ddb791930942dd31cbdbed9495259c082c0f | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/order/filter/filter_product.lean | 61c285fe41489b45de3617f3c023420df5c947a9 | [
"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 | 8,290 | lean | /-
Copyright (c) 2019 Abhimanyu Pallavi Sudhir. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Abhimanyu Pallavi Sudhir
-/
import order.filter.ultrafilter
import order.filter.germ
/-!
# Ultraproducts
If `φ` is an ultrafilter, then the space of germs of functions `f :... |
e345c160238f9e39523ff48f3ad643f16ef262dd | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/lean/run/macro3.lean | a01370fa133230366fdfb3d24b08951a6df081b5 | [
"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 | 165 | lean | new_frontend
syntax "call" term:max "(" (sepBy1 term ",") ")" : term
macro_rules
| `(call $f ($args*)) => `($f $(args.getSepElems)*)
#check call Nat.add (1+2, 3)
|
22d6601da46b407cba8f3b6c2a5e9fa7abe3979f | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/topology/continuous_function/compact.lean | a21adb78218938ae0a500337e3fee39f00e88cf9 | [
"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 | 15,188 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import topology.continuous_function.bounded
import topology.uniform_space.compact_separated
/-!
# Continuous functions on a compact space
Continuous functions `C(α,... |
d4e69bc747e2a78c2340759fad2474844d4e58ff | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/pkg/deriving/UserDeriving/Simple.lean | f8545ad901dbe2b0eb0f79ee5ebf5cd81a8632d5 | [
"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 | 659 | lean | import Lean
class Simple (α : Type u) where
val : α
open Lean
open Lean.Elab
open Lean.Elab.Command
def mkSimpleHandler (declNames : Array Name) : CommandElabM Bool := do
dbg_trace ">> mkSimpleHandler {declNames}"
-- TODO: see examples at src/Lean/Elab/Deriving
return true
def mkMyInhabitedHandler (declNames... |
66c31cf3f4d025c5507fe9650f8e23c709daf153 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /stage0/src/Lean/Compiler/IR/Checker.lean | 0eae0668effc1e7a6f6c96f55534be9f2c4bf39c | [
"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 | 7,174 | 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.Compiler.IR.CompilerM
import Lean.Compiler.IR.Format
namespace Lean.IR.Checker
@[extern c inline "lean_box(LEAN_MAX_CTOR_FIELDS)"]
opaque getM... |
a2279625a6fef5ed425378eb25864a0bbba6b3b8 | ba4794a0deca1d2aaa68914cd285d77880907b5c | /src/game/world4/level4.lean | ca8dfe6fcbc8eafc822f0b8dfb4b30df92c05249 | [
"Apache-2.0"
] | permissive | ChrisHughes24/natural_number_game | c7c00aa1f6a95004286fd456ed13cf6e113159ce | 9d09925424da9f6275e6cfe427c8bcf12bb0944f | refs/heads/master | 1,600,715,773,528 | 1,573,910,462,000 | 1,573,910,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 344 | lean | import game.world4.level3 -- hide
namespace mynat -- hide
/-
# Power World
## Level 4: `one_pow`
-/
/- Lemma
For all naturals $m$, $1 ^ m = 1$.
-/
lemma one_pow (m : mynat) : (1 : mynat) ^ m = 1 :=
begin [less_leaky]
induction m with t ht,
rw pow_zero,
refl,
rw pow_succ,
rw ht,
rw mul_one,
refl,
... |
69c58d35048b8809545fa7690f09c2268d370a12 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/1298.lean | 9c9848623c90647920704b45677170bed7cd8592 | [
"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 | 422 | lean | class Semiring (R : Type u) extends Add R, HPow R Nat R, Mul R where
zero : R
instance [Semiring R] : OfNat R n where
ofNat := Semiring.zero
def Nat.cast [Semiring R] (n : Nat) : R := let _ := n = n; Semiring.zero
@[default_instance high] instance [Semiring R] : HPow R Nat R := inferInstance
instance [Semiring ... |
2e729b66032d38c1def09956704bdf24b1749c15 | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_995.lean | ac2d13f73cdfc4dfee1c249dc650541b14c57c66 | [] | no_license | jamescheuk91/mathematics_in_lean | 09f1f87d2b0dce53464ff0cbe592c568ff59cf5e | 4452499264e2975bca2f42565c0925506ba5dda3 | refs/heads/master | 1,679,716,410,967 | 1,613,957,947,000 | 1,613,957,947,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 185 | lean | import data.real.basic
open function
-- BEGIN
example {f : ℝ → ℝ} (h : surjective f) : ∃ x, (f x)^2 = 4 :=
begin
cases h 2 with x hx,
use x,
rw hx,
norm_num
end
-- END |
6fe2cf88b8153e1e2e16f625e38c940592dd0011 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/analysis/normed_space/operator_norm.lean | e0579c2340e57733789386b356a431c6a532481f | [
"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 | 12,340 | lean | /-
Copyright (c) 2019 Jan-David Salchow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jan-David Salchow, Sébastien Gouëzel, Jean Lo
The space of bounded linear maps
Define the set of bounded linear maps between normed spaces and show basic facts about it. In
partic... |
9cc0712e4c1328d74cfc4a6a13ace2d8ea5adc18 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /test/ring.lean | e2aa5b6c2fdd4ab95e298aa9f9cffa07ebaec0e6 | [
"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 | 1,895 | lean | import tactic.ring data.real.basic
example (x y : ℕ) : x + y = y + x := by ring
example (x y : ℕ) : x + y + y = 2 * y + x := by ring
example (x y : ℕ) : x + id y = y + id x := by ring!
example {α} [comm_ring α] (x y : α) : x + y + y - x = 2 * y := by ring
example (x y : ℚ) : x / 2 + x / 2 = x := by ring
example (x y :... |
b18d777dc6d479f1fe9960686d6c0f244465a1df | ff5230333a701471f46c57e8c115a073ebaaa448 | /library/init/meta/local_context.lean | cd0a0cd7c2e5ca21ef25e13658b24fae118a643e | [
"Apache-2.0"
] | permissive | stanford-cs242/lean | f81721d2b5d00bc175f2e58c57b710d465e6c858 | 7bd861261f4a37326dcf8d7a17f1f1f330e4548c | refs/heads/master | 1,600,957,431,849 | 1,576,465,093,000 | 1,576,465,093,000 | 225,779,423 | 0 | 3 | Apache-2.0 | 1,575,433,936,000 | 1,575,433,935,000 | null | UTF-8 | Lean | false | false | 1,293 | lean | prelude
import init.meta.name init.meta.expr
meta structure local_decl :=
(unique_name : name)
(pp_name : name)
(type : expr)
(value : option expr)
(bi : binder_info)
(idx : nat)
/-- A local context is a list of local constant declarations.
Each metavariable in a metavariable context holds a local_context
to d... |
166e43ade3db5c959bacffd6730bb9487a72d6d7 | 522405df6e2c9cbc59a292c30fe49b32bc7f2781 | /src/extend.lean | e4e084ea7de6739d0c52ceaa97b7154e1ebf5ae8 | [] | no_license | Ruben-VandeVelde/premathlib | 539735aa9ac073cd62f979bdbe61ea8056d282d2 | c126ad6fdbd04a225e4e4f76520ce711846cca23 | refs/heads/master | 1,662,351,323,440 | 1,590,959,549,000 | 1,590,959,549,000 | 267,713,324 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,605 | lean | import analysis.complex.basic
import analysis.normed_space.operator_norm
open complex
variables {F : Type*} [normed_group F] [normed_space ℂ F]
-- Extend `fr : F →ₗ[ℝ] ℝ` to `F →ₗ[ℂ] ℂ` in a way that will also be continuous and have its norm
-- bounded by `∥fr∥` if `fr` is continuous.
noncomputable def linear_map.ex... |
0de65692c7e4484b0dad98b5d167c69f49c5bb43 | 5749d8999a76f3a8fddceca1f6941981e33aaa96 | /src/data/fintype.lean | 385565fd765857174bc3a2c0acecfd47c7dc6331 | [
"Apache-2.0"
] | permissive | jdsalchow/mathlib | 13ab43ef0d0515a17e550b16d09bd14b76125276 | 497e692b946d93906900bb33a51fd243e7649406 | refs/heads/master | 1,585,819,143,348 | 1,580,072,892,000 | 1,580,072,892,000 | 154,287,128 | 0 | 0 | Apache-2.0 | 1,540,281,610,000 | 1,540,281,609,000 | null | UTF-8 | Lean | false | false | 36,396 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Finite types.
-/
import data.finset algebra.big_operators data.array.lemmas logic.unique
import tactic.wlog
universes u v
variables {α : Type*} {β : Type*} {γ : Type*}
... |
55619091b0d68f023980ac2afbd831f366d6532c | 1437b3495ef9020d5413178aa33c0a625f15f15f | /analysis/topology/topological_space.lean | 9ac41fc446254fdbf9c580a532ab22cb0a545317 | [
"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 | 90,007 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
Theory of topological spaces.
Parts of the formalization is based on the books:
N. Bourbaki: General Topology
I. M. James: Topologies and Uniformit... |
89f970df90202aebad9270fe8157c931b0025944 | 842b7df4a999c5c50bbd215b8617dd705e43c2e1 | /LeanTutorial/Chapter2.4.lean | a71021b93702b3136f1c15a2f722d865da6f93c7 | [] | no_license | Samyak-Surti/LeanCode | 1c245631f74b00057d20483c8ac75916e8643b14 | 944eac3e5f43e2614ed246083b97fbdf24181d83 | refs/heads/master | 1,669,023,730,828 | 1,595,534,784,000 | 1,595,534,784,000 | 282,037,186 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,007 | lean | def foo : (ℕ → ℕ) → ℕ := λ f, f 0
#check foo
#print foo
def foo' := λ f : ℕ → ℕ, f 0
-- General Form: def foo : α := bar
def double (x : ℕ) : ℕ := x + x
#print double
#check double 3
#reduce double 3
def square (x : ℕ) : ℕ := x * x
#print square
#check square 3
#reduce square 3
def do_twice (f : ℕ → ℕ) (x : ℕ) : ... |
3bf720eaba0da21398ab9db78474da12e7e4eee1 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/wfEqns3.lean | d7c8c36943b5d1d27a710008ad3e4db39a019694 | [
"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 | 322 | lean | import Lean
open Lean
open Lean.Meta
def tst (declName : Name) : MetaM Unit := do
IO.println (← getUnfoldEqnFor? declName)
def f (x : Nat) : Nat :=
if h : x = 0 then
1
else
f (x - 1) * 2
termination_by' measure id
decreasing_by
apply Nat.pred_lt
exact h
#eval tst ``f
#check f._eq_1
#check f._unfold
|
5ebe06548e9a2b557cf71d413537cf5f16ce318d | 556aeb81a103e9e0ac4e1fe0ce1bc6e6161c3c5e | /src/starkware/cairo/common/cairo_secp/verification/verification/signature_recover_public_key_validate_reduced_field_element_soundness.lean | 0ea1ba14c882eee47ea3e8e85dc9182935e686b3 | [] | 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 | 24,490 | lean | /-
File: signature_recover_public_key_validate_reduced_field_element_soundness.lean
Autogenerated file.
-/
import starkware.cairo.lean.semantics.soundness.hoare
import .signature_recover_public_key_code
import ..signature_recover_public_key_spec
import .signature_recover_public_key_assert_nn_le_soundness
open tactic
... |
829a2e56596bc2f2f0393538fa8c7f81615ab37e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/runTacticMustCatchExceptions.lean | 534dda26704b0e76730f7580eb53eda17067a25e | [
"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 | 241 | lean | example (a b : Nat) : 1 ≤ 2 :=
have : 1 ≤ a + b := by rfl
have : a + b ≤ b := by rfl
have : b ≤ 2 := by rfl
by decide
example (a b : Nat) : 1 ≤ 2 :=
calc
1 ≤ a + b := by rfl
_ ≤ b := by rfl
_ ≤ 2 := by rfl
|
45dfcc5e377184e740188c6ac39b31927bf1cdf7 | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /src/Init/Data/Int/Basic.lean | eabaf743eae83d1886b92cdd6b48a64df9a907cc | [
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"Apache-2.0",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | gebner/lean4 | d51c4922640a52a6f7426536ea669ef18a1d9af5 | 8cd9ce06843c9d42d6d6dc43d3e81e3b49dfc20f | refs/heads/master | 1,685,732,780,391 | 1,672,962,627,000 | 1,673,459,398,000 | 373,307,283 | 0 | 0 | Apache-2.0 | 1,691,316,730,000 | 1,622,669,271,000 | Lean | UTF-8 | Lean | false | false | 4,672 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
The integers, with addition, multiplication, and subtraction.
-/
prelude
import Init.Coe
import Init.Data.Nat.Div
import Init.Data.List.Basic
open Nat
... |
afa0f0e535ec74478265a8588ddf491535c1e708 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/pp_space_check.lean | 7701b064da9007a941924cae02f9d535120736ca | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 1,317 | lean | -- some space-sensitive tests
#check (- - 2 : int)
universe u
variables (A : Type u) (a b : A) (H : a = b)
lemma symm₂ : b = a := eq.symm H
#check @symm₂ -- double space before type?
run_cmd do
f1 ← tactic.to_expr ```(@symm₂) >>= tactic.infer_type >>= tactic.pp,
f2 : format ← pure $ to_fmt "∀ (A : Type ?) (a b : A... |
6a52a446ddc7765d2df5af27320a39cec0cb5866 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /archive/imo/imo1998_q2.lean | 206fed82be3703bddcc9b6de74e3ee4ba595ca5b | [
"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 | 9,574 | lean | /-
Copyright (c) 2020 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import data.fintype.basic
import data.int.parity
import algebra.big_operators.order
import tactic.ring
import tactic.noncomm_ring
/-!
# IMO 1998 Q2
In a competition, there... |
8f98946db4be536d00464ec24f03eb419e8d93fe | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/set/basic.lean | 661e500e3b9cfab9d93de0a0c6956cc819bc519f | [
"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 | 76,084 | 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 order.symm_diff
import logic.function.iterate
/-!
# Basic properties of sets
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to thi... |
022478f4cbdd999ba3cd695a276d469fa9df76cb | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/homology/homotopy.lean | df7241c4395d3aec178216ea6fc6a18e342399ac | [
"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 | 30,932 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.homology.additive
import tactic.abel
/-!
# Chain homotopies
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a correspon... |
8c72d51015d0c7a1392c5f1e10e1bb1f4ebd83e5 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/list/of_fn.lean | f131ed93579ed08f167801adbba7d2e496305d83 | [
"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,901 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import data.fin.tuple.basic
import data.list.basic
import data.list.join
/-!
# Lists from functions
Theorems and lemmas for dealing with `list.of_fn`, which convert... |
42e421702a0f2ca6cfef4e6af8686508448c85b5 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/tactic/transfer.lean | e1115edb23dca01289214bdf0508414313eb331d | [
"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 | 7,450 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl (CMU)
-/
prelude
import init.meta.tactic init.meta.match_tactic init.meta.mk_dec_eq_instance
import init.data.list.instances logic.relator
namespace transfer
open tactic... |
400d9d160a83bd789e303b8db7cec5247e0382d7 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/group_theory/free_abelian_group_finsupp.lean | abfc54c4af2ae932bff9b26b87bcbfffe33e4999 | [
"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 | 6,997 | lean | /-
Copyright (c) 2021 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import algebra.module.equiv
import data.finsupp.basic
import group_theory.free_abelian_group
import group_theory.is_free_group
import linear_algebra.dimension
/-!
#... |
6390d4e4e56327e4316dc4e1df4a9c228a3c9b00 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/order/module.lean | 6c236a59482b4c2ac6665851b87d4e8b0df98da7 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 8,997 | lean | /-
Copyright (c) 2020 Frédéric Dupuis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frédéric Dupuis, Yaël Dillies
-/
import algebra.module.pi
import algebra.module.prod
import algebra.order.pi
import algebra.order.smul
import data.set.pointwise
/-!
# Ordered module
... |
45c0b630ad5229cc322725c2a24a1189608cadb8 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /library/data/nat/bquant.lean | 12233bb5737583c420a25798f8c4901e24b0e6de | [
"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 | 3,308 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.nat.bquant
Author: Leonardo de Moura
Show that "bounded" quantifiers: (∃x, x < n ∧ P x) and (∀x, x < n → P x)
are decidable when P is decidable.
This module allow us to w... |
f0a1fc057d9668c3a64c51e9c4c4106d36f0f9de | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/calculus/fderiv_analytic.lean | 58483589cadf0fba369f25bb5edc378f516c629f | [
"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,194 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import analysis.calculus.deriv
import analysis.analytic.basic
import analysis.calculus.cont_diff
/-!
# Frechet derivatives of analytic functions.
A function expre... |
fd650d99c2c1dbb4e9af119850aaac0ae799905b | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/inj2.lean | 6359d09a2b95086c4dc86a0218bed84018f0c56e | [
"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 | 1,125 | lean | universe 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₂ : α) (b₁ b₂ : β) (... |
0a9593f37fcd60ba97c99473b38466f9fd62e199 | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/ring_theory/polynomial/basic.lean | 7215765ef666af9e863e204a341f69829b68232e | [
"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 | 39,444 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.char_p.basic
import data.mv_polynomial.comm_ring
import data.mv_polynomial.equiv
import data.polynomial.field_division
import ring_theory.principal_ideal_domain... |
6101633ebc68cc92380301b877a9df372dc0dc8e | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/using_bug1.lean | 1ff3c98714132ab94761f037ee6b0d87981b669b | [
"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 | 420 | lean | variables a b c d : Nat
axiom H : a + (b + c) = a + (b + d)
set_option pp::implicit true
using Nat
check add_succr a
theorem mul_zerol2 (a : Nat) : 0 * a = 0
:= induction_on a
(show 0 * 0 = 0, from mul_zeror 0)
(λ (n : Nat) (iH : 0 * n = 0),
calc 0 * (n + 1) = (0 * n) + 0 : mul_succr 0 n
... |
513ae6cde44b63289f792272918ea961bcb0e9dd | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/project_1_a_decrire/lean-scheme-submission/src/spectrum_of_a_ring/spec_locally_ringed_space.lean | fbc1daabc157b8015ec14f38707dc3091ff50719 | [] | 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 | 308 | lean | import spectrum_of_a_ring.structure_sheaf
import spectrum_of_a_ring.strucutre_sheaf_stalks
universe u
noncomputable theory
variables (R : Type u) [comm_ring R]
def Spec.locally_ringed_space : locally_ringed_space (Spec R) :=
{ O := structure_sheaf R,
Hstalks := λ P, structure_sheaf.stalk_local P, }
|
4e3c9d99caa688fd3c66f65a04b8462094aa35e2 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebraic_topology/simplex_category.lean | 082269eef2bb94e790bb4019eab5d5791c1a81a6 | [
"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 | 17,621 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Scott Morrison, Adam Topaz
-/
import order.category.NonemptyFinLinOrd
import category_theory.skeletal
import data.finset.sort
import tactic.linarith
/-! # The simplex... |
9b886bbe193446a404ed6a51a13d25fd317b058c | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/box_integral/partition/split.lean | 4ff176158bffc96d4d8859f13776bf7a6dcddce8 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 15,629 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import analysis.box_integral.partition.basic
/-!
# Split a box along one or more hyperplanes
## Main definitions
A hyperplane `{x : ι → ℝ | x i = a}` splits a re... |
c88eb63ee9dcf012dd2fc81bb42e45724cf13c51 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/Server/ServerBin.lean | a6ac11a92e131b74f7c1d8aa93845601c9b8c426 | [
"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 | 441 | lean | /-
Copyright (c) 2020 Wojciech Nawrocki. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Wojciech Nawrocki
-/
import Init.System.IO
import Lean.Server
def main (n : List String) : IO UInt32 := do
let i ← IO.getStdin
let o ← IO.getStdout
let e ← IO.getStderr
Le... |
72e0af176844e56cda0564003cd3d72ed20f1c75 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/compiler/closure_bug6.lean | 22a55348e0b60f29a1c1ff30f7b1101d2409e04e | [
"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 | 512 | lean |
def f (x : Nat) : Nat × (Nat → String) :=
let x1 := x + 1;
let x2 := x + 2;
let x3 := x + 3;
let x4 := x + 4;
let x5 := x + 5;
let x6 := x + 6;
let x7 := x + 7;
let x8 := x + 8;
let x9 := x + 9;
let x10 := x + 10;
let x11 := x + 11;
let x12 := x + 12;
let x13 := x + 13;
let x14 := x + 14;
let x15 := x + 15;
let x16 :=... |
445a95d1586fd633f8374570d2a88ea3f7fb894c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/pnat/intervals_auto.lean | d35ec6f81530d882c22ec102d9c3d988178f7ce4 | [] | 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 | 876 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.pnat.basic
import Mathlib.data.finset.intervals
import Mathlib.PostPort
namespace Math... |
b4f11f6e6702ec7170498a2579e88f6534a29f34 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/973b.lean | ad1a17f1f4d1f48068cf3ffb899c25a9a2db5dc2 | [
"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 | 264 | lean | opaque f : Nat → Nat
opaque q : Nat → (Nat → Prop) → Nat
@[simp]
theorem ex {x : Nat} {p : Nat → Prop} (h₁ : p x) (h₂ : q x p = x) : f x = x :=
sorry
set_option trace.Meta.Tactic.simp.discharge true
theorem foo : f (f x) = x := by
simp
sorry
|
fd635094b07878135d8a5f9f8d868a97156846f8 | fecda8e6b848337561d6467a1e30cf23176d6ad0 | /src/ring_theory/integral_closure.lean | 4ddeb73dc0dadd85e32136f288de28b571d11845 | [
"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 | 20,450 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import ring_theory.algebra_tower
import ring_theory.polynomial.scale_roots
/-!
# Integral closure of a subring.
If A is an R-algebra then `a : A` is integral over R if it is ... |
c41aa02841d9238c73d66311360dcafa512d6b51 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/data/real/hyperreal.lean | b57c33d19f0c53f325330146e9cb14f52bf6ed22 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 36,897 | lean | /-
Copyright (c) 2019 Abhimanyu Pallavi Sudhir. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Abhimanyu Pallavi Sudhir
-/
import order.filter.filter_product
import analysis.specific_limits
/-!
# Construction of the hyperreal numbers as an ultraproduct of real sequenc... |
c526cb8f3e1820b03b8cb153c0aa1d88c9d615aa | 48eee836fdb5c613d9a20741c17db44c8e12e61c | /src/algebra/notations/basic.lean | 9edbbf4e326893b5dd4c908ce3e64fb455d0c8f6 | [
"Apache-2.0"
] | permissive | fgdorais/lean-universal | 06430443a4abe51e303e602684c2977d1f5c0834 | 9259b0f7fb3aa83a9e0a7a3eaa44c262e42cc9b1 | refs/heads/master | 1,592,479,744,136 | 1,589,473,399,000 | 1,589,473,399,000 | 196,287,552 | 1 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 259 | lean | -- Copyright © 2019 François G. Dorais. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
import .reserved
class {u v} has_lmul (α : Type u) (β : Type v) := (lmul : α → β → β)
infixl ∙ := has_lmul.lmul
|
2c229f42889ab45ec4e464063496433bd9f1f133 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/sigma/basic.lean | 0df3a86f44787335e8757a63b83b35fd8584d263 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 8,511 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import tactic.lint
import tactic.ext
/-!
# Sigma types
This file proves basic results about sigma types.
A sigma type is a dependent pair type. Like `α × β` but wh... |
4112d8669a53e9ce45880a9cdd3724a4b29cb3b6 | 367134ba5a65885e863bdc4507601606690974c1 | /src/algebra/module/pi.lean | 3154758a0438b7b80778f6307deff20c77254d13 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 5,486 | 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 algebra.module.basic
import algebra.ring.pi
/-!
# Pi instances for module and multiplicative actions
This file defines instances for module, mul_ac... |
37cec245a4d888c09bb08d383a708f134dbb71a2 | bd12a817ba941113eb7fdb7ddf0979d9ed9386a0 | /src/category_theory/functor.lean | 657d64a5bc37efcc44a1d22f873347f60de582ff | [
"Apache-2.0"
] | permissive | flypitch/mathlib | 563d9c3356c2885eb6cefaa704d8d86b89b74b15 | 70cd00bc20ad304f2ac0886b2291b44261787607 | refs/heads/master | 1,590,167,818,658 | 1,557,762,121,000 | 1,557,762,121,000 | 186,450,076 | 0 | 0 | Apache-2.0 | 1,557,762,289,000 | 1,557,762,288,000 | null | UTF-8 | Lean | false | false | 3,099 | 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... |
5fad7606d2ab4b368380c693bdd87a9fa37f030e | 367134ba5a65885e863bdc4507601606690974c1 | /src/group_theory/submonoid/basic.lean | a5b024b75e518803930f5e0e85fc525728886909 | [
"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 | 17,365 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Kenny Lau, Johan Commelin, Mario Carneiro, Kevin Buzzard,
Amelia Livingston, Yury Kudryashov
-/
import data.set.lattice
/-!
# Submonoids: definition and `complete_latt... |
dde774e406c2f81702beef22a50b2bf4f18fe1f8 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/combinatorics/simple_graph/matching.lean | e3803b5e26a3ecc1e38b67b62e207ce6d3b042c8 | [
"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 | 4,703 | lean | /-
Copyright (c) 2020 Alena Gusakov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alena Gusakov, Arthur Paulino, Kyle Miller
-/
import combinatorics.simple_graph.degree_sum
import combinatorics.simple_graph.subgraph
/-!
# Matchings
> THIS FILE IS SYNCHRONIZED WITH ... |
f0d3b584fd9858ce463db6fad01fc48e047dc8e6 | a8a8012e62ebc4c8550b92736c0b20faab882ba0 | /closedcat.hlean | 27a529269ff5dc62e938715d1bf1506d47179969 | [] | no_license | fpvandoorn/Bergen-Lean | d02d173f79492498b0ee042ae6699a984108c6ef | 40638f1e04b6c681858127e85546c9012b62ab63 | refs/heads/master | 1,610,398,839,774 | 1,484,840,344,000 | 1,484,840,344,000 | 79,229,751 | 0 | 2 | null | null | null | null | UTF-8 | Lean | false | false | 4,152 | hlean | --Closed concrete infinity-category
import .ccat
open eq equiv is_equiv typeclass cCat
structure closedCat.{u v} extends CC:cCat.{u v} : Type.{(max u v)+1} :=
(closed : Π {A B : obj CC} , data (arr A B))
namespace closedCat
open function
variables {C : closedCat}
--The internal hom
definition hom (A B : obj... |
7fd2649c4019f3a6dfd13a2de36b91478f635dc4 | 4b846d8dabdc64e7ea03552bad8f7fa74763fc67 | /tests/lean/run/IO1.lean | 7bfa8029c53f86c31ba2f534083d3d2683ba799d | [
"Apache-2.0"
] | permissive | pacchiano/lean | 9324b33f3ac3b5c5647285160f9f6ea8d0d767dc | fdadada3a970377a6df8afcd629a6f2eab6e84e8 | refs/heads/master | 1,611,357,380,399 | 1,489,870,101,000 | 1,489,870,101,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 981 | lean | import system.io
open list
open io
-- set_option pp.all true
definition main : io unit :=
do l₁ ← get_line,
l₂ ← get_line,
put_str (l₂ ++ l₁)
-- vm_eval main
-- set_option trace.compiler.code_gen true
#eval put_str "hello\n"
#print "************************"
definition aux (n : nat) : io unit :=
do p... |
ebf42c19c5ec202a32177214d49e44766ff33cf3 | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /tests/lean/run/cases_tac1.lean | 5d9b0dcf57654c89333010aab4c9a37558b71c64 | [
"Apache-2.0"
] | permissive | jcarlson23/lean | b00098763291397e0ac76b37a2dd96bc013bd247 | 8de88701247f54d325edd46c0eed57aeacb64baf | refs/heads/master | 1,611,571,813,719 | 1,497,020,963,000 | 1,497,021,515,000 | 93,882,536 | 1 | 0 | null | 1,497,029,896,000 | 1,497,029,896,000 | null | UTF-8 | Lean | false | false | 1,023 | lean | inductive {u} vec (A : Type u) : nat → Type u
| nil : vec 0
| cons : ∀ {n}, A → vec n → vec (n+1)
open tactic nat vec
def head {A : Type*} : ∀ {n : nat}, vec A (n+1) → A
| n (cons h t) := h
def tail {A : Type*} : ∀ {n : nat}, vec A (n+1) → vec A n
| n (cons h t) := t
@[simp] lemma head_cons {A : Type*} {n : nat} (... |
c8a723129bd47cf4bdc5b98370812eccd56e7a7d | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/algebra/ordered_field.lean | d8b7da27d6fd5d6d564d9efa5f379bc2da7be480 | [
"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 | 24,542 | lean | /-
Copyright (c) 2014 Robert Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Lewis, Leonardo de Moura, Mario Carneiro, Floris van Doorn
-/
import algebra.ordered_ring
import algebra.field
import tactic.monotonicity.basic
/-!
### Linear ordered fields
... |
3e820a217f4c27919159d5d4f0f00543729342c5 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/forInReturnPropagation.lean | 3b2f9acc6bbd7829efa451f287691cf1712bc60a | [
"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 | 176 | lean | def main (args : List String) : IO UInt32 := do
for (arg : String) in args do
match arg with
| "--print-cflags" =>
return 1
| _ =>
pure ()
return 0
|
2d1f6910b0760ab5da70ab64a92ea0a92f448100 | 367134ba5a65885e863bdc4507601606690974c1 | /src/control/functor/multivariate.lean | 667504aaf7e2c2b9fe8c83a73c335921bd5bb7a4 | [
"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 | 6,697 | lean | /-
Copyright (c) 2018 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Mario Carneiro, Simon Hudon
-/
import data.fin2
import data.typevec
import logic.function.basic
import tactic.basic
/-!
Functors between the category of tuples of types,... |
fd9219e20ed2ae192e4a8fda55950aae8ce54673 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/order/succ_pred.lean | 27ecf3ed555fb0b8555f88abf176698fbf9ba319 | [
"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 | 27,465 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import order.bounded_lattice
import order.galois_connection
import order.iterate
import tactic.monotonicity
/-!
# Successor and predecessor
This file defines successor ... |
2d851d4ece6b3df00d1ae615bca81ea0bcc2d437 | 05f637fa14ac28031cb1ea92086a0f4eb23ff2b1 | /tests/lean/lua3.lean | c206d843c40a391de65c9108633932f8fb7a8169 | [
"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 | 56 | lean | import Int.
variable x : Int
(*
dofile("script.lua")
*) |
6404c7683b2a4cc1db957c916e29efa18b2ba653 | c3f2fcd060adfa2ca29f924839d2d925e8f2c685 | /tests/lean/run/class7.lean | ae001064fc23d52ddac6250917126878c859d071 | [
"Apache-2.0"
] | permissive | respu/lean | 6582d19a2f2838a28ecd2b3c6f81c32d07b5341d | 8c76419c60b63d0d9f7bc04ebb0b99812d0ec654 | refs/heads/master | 1,610,882,451,231 | 1,427,747,084,000 | 1,427,747,429,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 467 | 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 class.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 : Type}... |
621860b5e59d5c07796cac6820601659ec1c0f84 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/order/complete_lattice_auto.lean | c157064589915313e432b4360d18947044f5c4a3 | [] | 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 | 53,829 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.order.bounds
import Mathlib.PostPort
universes u_6 l u_1 u_2 u_4 u_5 u_3
namespace Mathl... |
49b767a016991ee6b8ecf383193c09e0763b0d20 | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/data/polynomial/monomial.lean | 584743017ba0e5e93d2632924fffdd09869cff88 | [
"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 | 1,426 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import data.polynomial.coeff
/-!
# Univariate monomials
Preparatory lemmas for degree_basic.
-/
noncomputable theory
o... |
2db320404ad3e9443d7a9a2e24123bbaa45b5fc3 | aa5a655c05e5359a70646b7154e7cac59f0b4132 | /tests/lean/run/flat_expr.lean | 7a82d389731a916ef21c88051bfcb88900f4a6a6 | [
"Apache-2.0"
] | permissive | lambdaxymox/lean4 | ae943c960a42247e06eff25c35338268d07454cb | 278d47c77270664ef29715faab467feac8a0f446 | refs/heads/master | 1,677,891,867,340 | 1,612,500,005,000 | 1,612,500,005,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,381 | lean | import Std
inductive Expr where
| var (i : Nat)
| op (lhs rhs : Expr)
def List.getIdx : List α → Nat → α → α
| [], i, u => u
| a::as, 0, u => a
| a::as, i+1, u => getIdx as i u
structure Context (α : Type u) where
op : α → α → α
unit : α
assoc : (a b c : α) → op (op a b) c = op a (op b c)... |
8218d9fd33c247ebf8929eae8ad978fcf0248391 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/special_functions/log/base.lean | 032f344c49c4d13d692a2f8b587ff4dbe85ebbb1 | [
"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 | 12,466 | lean | /-
Copyright (c) 2022 Bolton Bailey. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bolton Bailey, Chris Hughes, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne
-/
import analysis.special_functions.log.basic
import analysis.special_functions.pow
import data.int.log
/-!... |
718021beb1be169d152878b3d3330509b3f7b3e2 | f618aea02cb4104ad34ecf3b9713065cc0d06103 | /src/order/basic.lean | 4b0bdd15e9e381f335683c7106eddb540011363e | [
"Apache-2.0"
] | permissive | joehendrix/mathlib | 84b6603f6be88a7e4d62f5b1b0cbb523bb82b9a5 | c15eab34ad754f9ecd738525cb8b5a870e834ddc | refs/heads/master | 1,589,606,591,630 | 1,555,946,393,000 | 1,555,946,393,000 | 182,813,854 | 0 | 0 | null | 1,555,946,309,000 | 1,555,946,308,000 | null | UTF-8 | Lean | false | false | 23,535 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Mario Carneiro
-/
import tactic.interactive logic.basic data.sum data.set.basic algebra.order
open function
/- TODO: automatic construction of dual definitions / theorem... |
44ccae5722d270aa7254a777472164c01ef3417e | e953c38599905267210b87fb5d82dcc3e52a4214 | /library/algebra/complete_lattice.lean | 0c8ad33945792a47220625f5268ee6ac7978bc45 | [
"Apache-2.0"
] | permissive | c-cube/lean | 563c1020bff98441c4f8ba60111fef6f6b46e31b | 0fb52a9a139f720be418dafac35104468e293b66 | refs/heads/master | 1,610,753,294,113 | 1,440,451,356,000 | 1,440,499,588,000 | 41,748,334 | 0 | 0 | null | 1,441,122,656,000 | 1,441,122,656,000 | null | UTF-8 | Lean | false | false | 10,017 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
Complete lattices
TODO: define dual complete lattice and simplify proof of dual theorems.
-/
import algebra.lattice data.set.basic
open set
namespace algebra... |
1642c0baa3c55f8e6e35aff8f0d66fdf4a1a45e5 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/topology/algebra/TopCommRing/basic.lean | ab092b219ea99bf100110e67719fc1f178b2b6de | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 2,807 | 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 algebra.CommRing.basic
import topology.Top.basic
import topology.instances.complex
universes u
open category_theory
structure TopCommRing :=
(α : Type u)
[i... |
46f092ad4440ae6c5e70405e4ac145162750a452 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/algebra/pointwise.lean | 7986a8e4e8f6ccc698711341243ad6153ec49551 | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 13,515 | lean | /-
Copyright (c) 2019 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Floris van Doorn
-/
import algebra.module
/-!
# Pointwise addition, multiplication, and scalar multiplication of sets.
This file defines pointwise algebraic operation... |
27b7c093b00e5f146a500f5aa5405f917b30f7ad | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Compiler/ConstFolding.lean | be7e357e7652775415b84fe221a133165c3e4748 | [
"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 | 7,230 | 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.Expr
import Lean.Compiler.Util
/- Constant folding for primitives that have special runtime support. -/
namespace Lean.Compiler
abbrev BinFol... |
5a67534f5e888435da796fb50dc834e9e4259ef3 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/category_theory/abelian/non_preadditive.lean | 29a888ea86dca6cc2a659e7d57cd992f3453abbe | [
"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 | 32,781 | 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 category_theory.limits.shapes.finite_products
import category_theory.limits.shapes.kernels
import category_theory.limits.shapes.pullbacks
import category_theory.... |
b3d88e02f8b9da806078ae8b549b188e7acea43a | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/equiv/local_equiv.lean | eb4d33f07675b068a9af1bd2ceb0415d95ec9fe8 | [
"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 | 33,846 | 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... |
38233ed3e4f9ac09b5d3d5724e31591b52cbc094 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/analysis/normed_space/basic.lean | 6bc349193c8b28d47d33dbfc0cf52ece7d71d151 | [
"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 | 51,069 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
-/
import topology.instances.nnreal
import topology.instances.complex
import topology.algebra.module
import topology.metric_space.antilipschitz
/-!
# No... |
6cdfb2a5fc423b16d35c88d9e627d034d9548302 | 37fa6e77734d3aca013fed5a19c4ee1fe1c38857 | /library/init/meta/converter.lean | 132f7fe454a49ebb508afe0cf8bba39d6a1cdf26 | [
"Apache-2.0"
] | permissive | gazimahmud/lean | 8736ac0b0289850b4c7e7600604e2ce9fc8606ad | 08495eef27b33f68dfc681e3bcab23b4771cbf03 | refs/heads/master | 1,611,158,659,846 | 1,498,642,351,000 | 1,498,671,799,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,965 | 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
Converter monad for building simplifiers.
-/
prelude
import init.meta.tactic init.meta.simp_tactic
import init.meta.congr_lemma init.meta.match_tactic
open ta... |
4f8c441994380a0e846184c3b6a5d17955b05847 | c9e78e68dc955b2325401aec3a6d3240cd8b83f4 | /src/LTS/defs.lean | 775f93afd432ea464acd1dc2396a5d8971cae801 | [] | no_license | loganrjmurphy/lean-strategies | 4b8dd54771bb421c929a8bcb93a528ce6c1a70f1 | 832ea28077701b977b4fc59ed9a8ce6911654e59 | refs/heads/master | 1,682,732,168,860 | 1,621,444,295,000 | 1,621,444,295,000 | 278,458,841 | 3 | 0 | null | 1,613,755,728,000 | 1,594,324,763,000 | Lean | UTF-8 | Lean | false | false | 4,031 | lean | import data.set data.stream.basic
open stream
structure LTS:= (S : Type) (Act : Type)(TR : set (S × Act × S))
--structure LTS:= (S : Type) (A : Type) (Δ : set (S × Act × S))
structure path (M : LTS) :=
(init : M.S)
(s : stream (M.Act × M.S))
(sound : ((init, (s 0).1, (s 0).2) ∈ M.TR) ∧
∀ i : ℕ, ((s i).2,... |
64bc516593ad60799f0316094319629df86543fd | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/inner_product_space/pi_L2.lean | 1a460c59866709bc7c22f0bfa9a3348d8989deec | [
"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 | 36,980 | lean | /-
Copyright (c) 2020 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers, Sébastien Gouëzel, Heather Macbeth
-/
import analysis.inner_product_space.projection
import analysis.normed_space.pi_Lp
import linear_algebra.finite_dimensional
import line... |
0a867f53e98dc38fbdeeb98a2774e3b6668e46e5 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/analysis/calculus/times_cont_diff.lean | 9fa12597b175614f29eb3e61a6cc256b507675cc | [
"Apache-2.0"
] | permissive | kmill/mathlib | ea5a007b67ae4e9e18dd50d31d8aa60f650425ee | 1a419a9fea7b959317eddd556e1bb9639f4dcc05 | refs/heads/master | 1,668,578,197,719 | 1,593,629,163,000 | 1,593,629,163,000 | 276,482,939 | 0 | 0 | null | 1,593,637,960,000 | 1,593,637,959,000 | null | UTF-8 | Lean | false | false | 83,340 | 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 analysis.calculus.mean_value
/-!
# Higher differentiability
A function is `C^1` on a domain if it is differentiable there, and its derivative is contin... |
baab75ee7392a83ae7735e2701a398b19b6e0b54 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/normed_space/pi_Lp.lean | f0bf4fd1c32b2a71a0e4319267f1a6c526022ff9 | [
"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 | 15,356 | 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
-/
import analysis.mean_inequalities
/-!
# `L^p` distance on finite products of metric spaces
Given finitely many metric spaces, one can put the max distance on t... |
fea34a16324f2b17695f82705e060c51abe44640 | e91b0bc0bcf14cf6e1bfc20ad1f00ad7cfa5fa76 | /src/sheaves/sheaf_of_types.lean | 3b1871f0b7fe0f019d38f76224c432fe0a84fdfe | [] | no_license | kckennylau/lean-scheme | b2de50025289a0339d97798466ef777e1899b0f8 | 8dc513ef9606d2988227490e915b7c7e173a2791 | refs/heads/master | 1,587,165,137,978 | 1,548,172,249,000 | 1,548,172,249,000 | 167,025,881 | 0 | 0 | null | 1,548,173,930,000 | 1,548,173,924,000 | Lean | UTF-8 | Lean | false | false | 3,088 | lean | import sheaves.presheaf_of_types
universes u v
namespace presheaf_of_types
variables {α : Type u} [T : topological_space α]
include T
-- Restriction map from U to U ∩ V.
def res_to_inter_left (F : presheaf_of_types α)
{U V} (OU : T.is_open U) (OV : T.is_open V) :
(F OU) → (F (T.is_open_inter U V OU OV)) :=
F.r... |
dd496d610dafc62bf58751bd7255428c7e5750cd | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/category_theory/limits/shapes/constructions/pullbacks.lean | e88969b13b76acb8c451a573a0ae98729f44f9fa | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 64 | lean | -- TODO construct pullbacks from binary products and equalizers
|
2dd66686dc5b5c4d22d564edcca8caaab741abce | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Init/Data/Nat/Control.lean | 2c6adb8e2c01eb2b3942da31591d88477869aab2 | [
"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 | 1,537 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
prelude
import Init.Control.Basic
import Init.Data.Nat.Basic
namespace Nat
universe u v
@[inline] def forM {m} [Monad m] (n : Nat) (f : Nat → m Unit) : m U... |
c6ebfdade523e6a5d7cbeeb412752ecbb1aea530 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/data/dfinsupp/multiset.lean | de23e647e818ce2d7fa376918a1ddacebb88c4ef | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 3,085 | 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 data.dfinsupp.order
/-!
# Equivalence between `multiset` and `ℕ`-valued finitely supported functions
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to th... |
49c95e5c3da47b2259f663b7caa61645774c918a | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/meta/coinductive_predicates.lean | e84ad42a8491fd37bc905c5a984bd43207b8cd36 | [
"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 | 20,492 | 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 (CMU)
-/
import tactic.core
section
universe u
@[user_attribute]
meta def monotonicity : user_attribute :=
{ name := `monotonicity, descr := "Monotonicity rules for pr... |
21d6e2b5cf1c4e74e852272f8fd049de37da7936 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/634.lean | 5ff60981bb29283e905094f0933df8be8fee9135 | [
"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 | 297 | lean | open nat
namespace foo
section
parameter (X : Type)
definition A {n : ℕ} : Type := X
variable {n : ℕ}
set_option pp.implicit true
check @A n
set_option pp.full_names true
check @foo.A X n
check @A n
set_option pp.full_names false
check @foo.A X n
check @A n
end
end foo
|
7c2ba35b759526c9889e05d421aa318a654c648a | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/algebra/ordered_ring.lean | 498929b9a175a72a74436ff862b23ec9611f1f11 | [
"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 | 43,498 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro
-/
import algebra.ordered_group
set_option default_priority 100 -- see Note [default priority]
set_option old_structure_cmd true
unive... |
f0901621266f72895a46cb416c6ba6de68c78825 | 874a8d2247ab9a4516052498f80da2e32d0e3a48 | /Fermat_little_v3.lean | 290a8f6c65b18a1f5b95cab8f953be740aad1791 | [] | no_license | AlexKontorovich/Spring2020Math492 | 378b36c643ee029f5ab91c1677889baa591f5e85 | 659108c5d864ff5c75b9b3b13b847aa5cff4348a | refs/heads/master | 1,610,780,595,457 | 1,588,174,859,000 | 1,588,174,859,000 | 243,017,788 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 4,075 | lean | import data.nat.gcd
import algebra.big_operators
import data.zmod.basic
def divides (d n: ℤ):= ∃l:ℤ, n = d*l
def is_congruent_mod_n (a b n: ℤ) := divides n (b-a)
def relatively_prime(a b:ℤ) := ∀l:ℤ,
l≥ 2 → (divides l a) → ¬(divides l b)
theorem relatively_prime_sum_to_one (a b : ℤ) (h : relatively_prime a b) :
∃... |
0521193a540a1d2001a70da80567b1a5c63946dc | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Meta/LevelDefEq.lean | d8bdfef12349c0f1385de7164ac9238a6a36b559 | [
"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 | 4,762 | 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.Util.CollectMVars
import Lean.Meta.Basic
import Lean.Meta.InferType
import Lean.Meta.DecLevel
namespace Lean.Meta
/--
Return true iff `lvl` ... |
0d7dfec1ccf164d3360d63a2233803c1d08c5b6c | 08bd4ba4ca87dba1f09d2c96a26f5d65da81f4b4 | /tests/lean/run/1711.lean | 0d76cf8ad118d883dbb0170adb61789346e991d8 | [
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"Apache-2.0",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | gebner/lean4 | d51c4922640a52a6f7426536ea669ef18a1d9af5 | 8cd9ce06843c9d42d6d6dc43d3e81e3b49dfc20f | refs/heads/master | 1,685,732,780,391 | 1,672,962,627,000 | 1,673,459,398,000 | 373,307,283 | 0 | 0 | Apache-2.0 | 1,691,316,730,000 | 1,622,669,271,000 | Lean | UTF-8 | Lean | false | false | 928 | lean | class One (α : Type u) where
one : α
instance One.toOfNat1 {α} [One α] : OfNat α (nat_lit 1) where
ofNat := ‹One α›.1
class MulOneClass (M : Type u) extends One M, Mul M where
one_mul : ∀ a : M, 1 * a = a
mul_one : ∀ a : M, a * 1 = a
theorem MulOneClass.ext {M : Type u} : ∀ ⦃m₁ m₂ : MulOneClass M⦄, m₁.mul = ... |
7219dc2f9c579e120320a4c85649e448f4e7251f | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/project_1_a_decrire/projet_A2/A2_disc.lean | bdc35261217730dc91bd04cd0b0f6eeb0a17d255 | [] | no_license | Or7ando/lean | cc003e6c41048eae7c34aa6bada51c9e9add9e66 | d41169cf4e416a0d42092fb6bdc14131cee9dd15 | refs/heads/master | 1,650,600,589,722 | 1,587,262,906,000 | 1,587,262,906,000 | 255,387,160 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,328 | lean | import .sous_foncteur
import category_theory.elements
import .A2
open category_theory
open A2
open int
-- universes v u
lemma int_commute_with_morph {A B :Type }[comm_ring A][comm_ring B](f : A → B)[is_ring_hom f](n : ℕ) : ∀ x : A, f( n*x ) = n *(f x) := λ x,
nat.rec_on n (show f(0*x) = 0* (f x), {rw [zero_mu... |
cb6a7e13e90bfe2390f403b99c5293911dfa5846 | dd4e652c749fea9ac77e404005cb3470e5f75469 | /src/missing_mathlib/data/nat/basic.lean | d648075a374d88875acf6febe79352b9d4bf607b | [] | no_license | skbaek/cvx | e32822ad5943541539966a37dee162b0a5495f55 | c50c790c9116f9fac8dfe742903a62bdd7292c15 | refs/heads/master | 1,623,803,010,339 | 1,618,058,958,000 | 1,618,058,958,000 | 176,293,135 | 3 | 2 | null | null | null | null | UTF-8 | Lean | false | false | 85 | lean | import data.nat.basic
universes u v
namespace nat
variables {m n k : ℕ}
end nat |
f35b5104b5b98ac754732b874b0d9c802bf87873 | ba306bac106b8f27befb2a800f4357237f86c760 | /lean/love09_hoare_logic_demo.lean | 21a976669841d08c53ad46b79e59473744f4a62a | [] | no_license | qyqnl/logical_verification_2020 | 406aa4cc47797501275ea07de5d6f59f01e977d0 | 17dff35b56336acb671ddfb36871f98475bc0b96 | refs/heads/master | 1,672,501,336,112 | 1,603,724,260,000 | 1,603,724,260,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,717 | lean | import .love08_operational_semantics_demo
/- # LoVe Demo 9: Hoare Logic
We review a second way to specify the semantics of a programming language: Hoare
logic. If operational semantics corresponds to an idealized interpreter,
__Hoare logic__ (also called __axiomatic semantics__) corresponds to a verifier.
Hoare logi... |
86c8acf68afc5095ee4a35a38fac01fd7c6f34a6 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/ring_theory/localization.lean | 8f50660eb9368c0ba4dd133b63832b6c275b0495 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 75,754 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Mario Carneiro, Johan Commelin, Amelia Livingston
-/
import data.equiv.ring
import group_theory.monoid_localization
import ring_theory.ideal.operations
import ring_theory.algebr... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.