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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
fceab1d0f7da59659585f22d0017f0bd94eeff97 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /scripts/modules_used.lean | 43348c2a6b221435823d27e293ef5fd0b194cd86 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 3,153 | lean | import all
import system.io
import tactic.algebra
/-!
# Find all imported modules which are used by the declarations in the target module.
```
lean --run scripts/modules_used.lean data.nat.order.basic
```
returns
```
order.synonym
order.rel_classes
order.monotone.basic
order.lattice
order.heyting.basic
order.bounde... |
df35498af65c5b54d75ab692f73e0ba08ff7aaed | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/ppSyntax.lean | 6d0889b237f3cdadd229b4864ebd32741f34db9a | [
"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 | 178 | lean | import Lean
open Lean
def test (stx : Unhygienic Term) : MetaM Unit := do
IO.println (← PrettyPrinter.ppTerm stx.run)
-- test imported `ParserDescr`
#eval test `(s!"hi!")
|
4c98222f6a0424dd2c3951c59b806443103e93e8 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/data/nat/digits.lean | 9f940204aefe1b3634cab9648a3eb73d8d92aca2 | [
"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 | 14,613 | 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 data.int.modeq
import tactic.interval_cases
import tactic.linarith
/-!
# Digits of a natural number
This provides a basic API for extracting the digits of a ... |
d690fba8efe0772950aa7a76c95a7f1b0d2645cd | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/adjunction/lifting.lean | 56580ff1cf95bdc7e110738af959be96906a93ce | [
"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 | 11,691 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import category_theory.limits.shapes.equalizers
import category_theory.limits.shapes.reflexive
import category_theory.monad.adjunction
import category_theory.monad.coequa... |
fa8da171ee1a888da09d34855cd5533eb9f4ce04 | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/geo/test1.lean | 6b7fddc3e0dec37fe7dde17e6c7f362ee8e24dc1 | [] | 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 | 78 | lean | import system.io
open io
def main : io unit :=
put_str "Hello, world!\n" |
a5a83321b37970628fb2ae0a57452f1cf8536334 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/polynomial/group_ring_action.lean | ee9c71ae70bfb57395c731915f944a7d48585507 | [
"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 | 4,874 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.group_ring_action
import algebra.hom.group_action
import data.polynomial.algebra_map
import data.polynomial.monic
/-!
# Group action on rings applied to polyno... |
3bc3e18250422117c273a74b536180c7e0b19552 | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /library/data/int/bigops.lean | 8f830733a5da1b9f33f3776b38af4cff79c6f453 | [
"Apache-2.0"
] | permissive | YHVHvx/lean | 732bf0fb7a298cd7fe0f15d82f8e248c11db49e9 | 038369533e0136dd395dc252084d3c1853accbf2 | refs/heads/master | 1,610,701,080,210 | 1,449,128,595,000 | 1,449,128,595,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,873 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad
Finite products and sums on the integers.
-/
import data.int.order algebra.group_bigops algebra.group_set_bigops
open list
namespace int
open [classes] algebra
lo... |
32933f63c85c2cd449c53920d5d5a7b9bb105d1d | 9028d228ac200bbefe3a711342514dd4e4458bff | /src/topology/continuous_on.lean | 260ee0d603e2a4f5385d9e1665685c218295444f | [
"Apache-2.0"
] | permissive | mcncm/mathlib | 8d25099344d9d2bee62822cb9ed43aa3e09fa05e | fde3d78cadeec5ef827b16ae55664ef115e66f57 | refs/heads/master | 1,672,743,316,277 | 1,602,618,514,000 | 1,602,618,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 34,783 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import topology.constructions
/-!
# Neighborhoods and continuity relative to a subset
This file defines relative versions
* `nhds_within` of `nhds`
* `co... |
fa19024f5d19fd1cee15b77f08bef2fd4050717d | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/equiv/ring_aut.lean | 1da9e22e584d75d8b887a80e8719d70a1fa858b0 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 2,178 | 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, Callum Sutton, Yury Kudryashov
-/
import data.equiv.ring
import data.equiv.mul_add_aut
/-!
# Ring automorphisms
This file defines the automorphism group structure on ... |
74512b32047684b8ac8252c4b64b54f24fec8a20 | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/data/padics/padic_norm.lean | 240ddf87fd1030c751aacb4f05c3d640deabb780 | [
"Apache-2.0"
] | permissive | roro47/mathlib | 761fdc002aef92f77818f3fef06bf6ec6fc1a28e | 80aa7d52537571a2ca62a3fdf71c9533a09422cf | refs/heads/master | 1,599,656,410,625 | 1,573,649,488,000 | 1,573,649,488,000 | 221,452,951 | 0 | 0 | Apache-2.0 | 1,573,647,693,000 | 1,573,647,692,000 | null | UTF-8 | Lean | false | false | 17,015 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import data.rat algebra.gcd_domain algebra.field_power
import ring_theory.multiplicity tactic.ring
import data.real.cau_seq
import tactic.norm_cast
/-!
# p-adic n... |
5599b1258a1d7b561aef1357d2dd7b8735ca0be8 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/topology/Top/default.lean | 82416eca687cb6158c02c3f0e49a8c735a9991cf | [
"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 | 154 | lean | import topology.Top.basic
import topology.Top.limits
import topology.Top.epi_mono
import topology.Top.open_nhds
import topology.Top.presheaf_of_functions
|
f0329174feafd3c03214aa629aeefc564e0e949c | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/rw_set3.lean | edf6c0e0167426a8c36d2f2f401d68cf109649e7 | [
"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 | 214 | lean | open tactic nat
constant f : nat → nat
constant g : nat → nat
axiom foo : ∀ x, f x = 1
axiom bla : ∀ x, f x = 2
attribute foo [simp]
attribute bla [simp]
print [simp] simp
example : f 5 = 2 := by simp
|
2fe0b5b5a6cd7f210de0c3b08f9f328485af6cab | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/set_opt_tac.lean | 62db3b67f2d9d55ac1eb27b44edea4c0f3f961e8 | [
"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 | 320 | lean | open tactic bool
example (a b : nat) (H : a + b = 0) : a = a :=
by do
H ← get_local `H,
t ← infer_type H,
trace t,
set_bool_option `pp.all tt,
trace "after pp.all true",
trace t,
rfl_e ← mk_const `rfl,
apply rfl_e
#print "set_bool_option tactic does not affect other commands"
#check (0:nat) + 1
|
ee6ef203ff31005488167bb0a9aca9df93d2cd02 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/order/copy.lean | 2f55f0cb644e78b7eb44fc6855c75d311e2bbca7 | [
"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,546 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import order.conditionally_complete_lattice
/-!
# Tooling to make copies of lattice structures
Sometimes it is useful to make a copy of a lattice structure
where on... |
4f903387c5510d1ae78f6bf1ddafdc20ea7fb2cc | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/with_cases.lean | 6c086639d53c5fecc86f490d0acbd971790c9ee8 | [
"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 | 506 | lean | open tactic
example (p q : Prop) [s₁ : decidable p] [s₂ : decidable q] : true :=
begin
unfreeze_local_instances,
with_cases { cases s₁; cases s₂ },
trace_state,
all_goals { intros, trivial }
end
def split (p : Prop) {q : Prop} [decidable p] (pos : p → q) (neg : ¬ p → q) : q :=
decidable.by_cases pos neg
exam... |
3ec83804508834f91bd5f9628cc8c16b34cc69a4 | a9e33f9c83301c461f3c3ebc6799d9de1f6d4d20 | /assignments/hw4_recursion_inductive.lean | 774f67c4d39c59d31e0c327671883eaf3cf371d7 | [] | no_license | yl4df/Discrete-Mathematics | f1c9a6cf8cfb4686fb617637f69a481e1522f0c2 | c93ce9f6a6e36d194e350d9fa0a0360191e97fa0 | refs/heads/master | 1,598,714,938,443 | 1,572,275,647,000 | 1,572,275,647,000 | 218,074,726 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,073 | lean | /-
Problem #1. We give you a simple "natural
number arithmetic abstract data type based
on our own mnat type for representing the
natural numbers. You are to extend it by
adding definitions of several operations
(functions).
The first is a boolean "less than"
operator. It will take two natural
numbers and return... |
179684315ac02507384ab55befd1c0c0d8e2fb5f | dcf093fda1f51c094394c50e182cfb9dec39635a | /rel.lean | 8c5becf4decdbfa1adc4f308c424e8aaf62d92e6 | [] | no_license | dselsam/cs103 | 7ac496d0293befca95d3045add91c5270a5d291f | 31ab9784a6f65f226efb702a0da52f907c616a71 | refs/heads/master | 1,611,092,644,140 | 1,492,571,015,000 | 1,492,571,015,000 | 88,693,969 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,981 | lean | import data.set classical algebra.order data.nat
open set eq.ops
namespace relations
variable {T : Type}
/- [KS]
Given a set S, a partition of S is a set X ⊆ ℘(S) (that is, a set of subsets of S) with the following properties:
1. The union of all sets in X is equal to S.
2. For any S1, S2 ∈ X with S1 ≠ S2, we have t... |
06050d57968491317665dc688b128c58f57eb1e6 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/ring/comp_typeclasses.lean | 7ab5690049c69a74de826a399bcebfd3f335eb30 | [
"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 | 6,456 | lean | /-
Copyright (c) 2021 Frédéric Dupuis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frédéric Dupuis, Heather Macbeth
-/
import algebra.ring.equiv
/-!
# Propositional typeclasses on several ring homs
This file contains three typeclasses used in the definition of (s... |
1edc59c7b76831e1ce6125cffda7c22bf5de2a2b | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/init/bool.lean | bcb60b75591f608f9567279da420db2f0b1b16b1 | [
"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 | 584 | lean | -- Copyright (c) 2014 Microsoft Corporation. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Leonardo de Moura
prelude
import init.datatypes init.reserved_notation
namespace bool
definition cond {A : Type} (b : bool) (t e : A) :=
bool.rec_on b e t
definitio... |
816bcd98ada8c81036c8a339750abc4052a39850 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/json.lean | 808237893b2a964a34620b0b6ee495de9fbae6b2 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 595 | lean | import Lean.Data.Json.Parser
import Lean.Data.Json.Printer
def test (s : String) : String :=
match Lean.Json.parse s with
| Except.ok res => toString res
| Except.error err => err
#eval test "null"
#eval test "false"
#eval test "true"
#eval test "123.456e-7"
#eval test "-0.01e8"
#eval test "\"\""
#eval test "\"abc... |
38f7c61395cd62424de18ea6ecb580ad51bef07b | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/wf.lean | ffc4ce2ca2658cd6308a8b4addcd2d770f23a1c6 | [] | 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 | 9,090 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.data.nat.basic
import Mathlib.Lean3Lib.init.data.prod
universes u l v
namespace Mathlib
inductive a... |
34b8306ec45d8ee64365596061034e268e282450 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/calculus/tangent_cone.lean | 020647baa8a8ea07942f64ebd1a128a5e2495cd3 | [
"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 | 18,719 | 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.convex.basic
import analysis.normed_space.basic
import analysis.specific_limits.basic
/-!
# Tangent cone
In this file, we define two predicate... |
a4e1154fc756c80fe80fc68d345a6c8db17306c8 | 67190c9aacc0cac64fb4463d93e84c696a5be896 | /Lists of exercises/List 4/vestidos.lean | f80230190d4f6d9ec1e2d0e9c627e8c79a51315e | [] | no_license | lucasresck/Discrete-Mathematics | ffbaf55943e7ce2c7bc50cef7e3ef66a0212f738 | 0a08081c5f393e5765259d3f1253c3a6dd043dac | refs/heads/master | 1,596,627,857,734 | 1,573,411,500,000 | 1,573,411,500,000 | 212,489,764 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 805 | lean | /-
Alunos:
- Fulano da Silva
- Beltrano Rodrigues
Formalize em FOL:
Três irmãs - Ana, Maria e Cláudia - foram a uma festa com vestidos de
cores diferentes. Uma vestia azul, a outra branco e a Terceira
preto. Chegando à festa, o anfitrião perguntou quem era cada uma
delas. As respostas foram:
- A de azul responde... |
0bc6991ed4a6b02bd363c343fdb07468f861d0bb | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/order/floor.lean | c93af3024e19f240ee172b8ad9425bd2788d3eed | [
"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 | 28,478 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kevin Kappelmann
-/
import tactic.abel
import tactic.linarith
/-!
# Floor and ceil
## Summary
We define the natural- and integer-valued floor and ceil functions on l... |
0e2b8218e3fdba684498db4e93bcaf2ecabece0b | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/algebra/filter_basis.lean | 9df8133636bf280e229a4c31f316ff8676743efc | [
"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,933 | lean | /-
Copyright (c) 2021 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import order.filter.bases
import topology.algebra.module.basic
/-!
# Group and ring filter bases
A `group_filter_basis` is a `filter_basis` on a group with some pro... |
8fa04af670e3da4c93de5523d3df2a2d9a0e825a | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /hott/hit/quotient_functor.hlean | 36d09b0ae725dc1d2a4672e6c8966bb799be4c76 | [
"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 | 5,414 | hlean | /-
Copyright (c) 2015 Ulrik Buchholtz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ulrik Buchholtz
Functoriality of quotients and a condition for when an equivalence is induced.
-/
import types.sigma .quotient
open eq is_equiv equiv prod prod.ops sigma sigma.ops
... |
bcc3c07ca5bd83e49e7d963c6521f5a9b70f594c | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/polynomial/degree.lean | c897f7136402c0782c757297e6fb57cc245b46ce | [
"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 | 4,340 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import data.polynomial.eval
/-!
# Theory of degrees of polynomials
Some of the main results include
- `nat_degree_comp_l... |
20e35c0e1b0db529782aafe3c94f894beae0d0ca | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/order/iterate.lean | 3e6cc8f169aa2a2f6b81ce97cfe3a2c352063afb | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,192 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import order.basic
import logic.function.iterate
import data.nat.basic
/-!
# Inequalities on iterates
In this file we prove some inequalities comparing `f^[... |
237f4061adb09833d6bbbcd1954e67a06825eb03 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/group_theory/submonoid/basic_auto.lean | f00fcac1f1fa005be3af87aa841d0f819b2c4f05 | [] | 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,840 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathl... |
38d07d9e1ef2c392b4a0722f55691b67b7cae796 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tests/compiler/expr.lean | 30c712d6448317aed81d12614b3ed6252a236911 | [
"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 | 204 | lean | import Init.Lean.Expr
open Lean
def main : IO UInt32 :=
do
let e := mkAppN (mkConst `f) #[mkConst `a, mkConst `b];
IO.println e;
IO.println ("hash: " ++ toString e.hash);
IO.println e.getAppArgs;
pure 0
|
74b15d7c5d879b76e7d1fc566a9b0ae62420c094 | 22e97a5d648fc451e25a06c668dc03ac7ed7bc25 | /src/group_theory/subgroup.lean | 32d3d541697270d925ad6028462971b56f57b663 | [
"Apache-2.0"
] | permissive | keeferrowan/mathlib | f2818da875dbc7780830d09bd4c526b0764a4e50 | aad2dfc40e8e6a7e258287a7c1580318e865817e | refs/heads/master | 1,661,736,426,952 | 1,590,438,032,000 | 1,590,438,032,000 | 266,892,663 | 0 | 0 | Apache-2.0 | 1,590,445,835,000 | 1,590,445,835,000 | null | UTF-8 | Lean | false | false | 29,244 | 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, Mitchell Rowett, Scott Morrison, Johan Commelin, Mario Carneiro,
Michael Howes
-/
import group_theory.submonoid
open set function
variables {G : Type*} {H : Type*} {... |
396be21c87b47456744bfa782084d8a96cb0c4e9 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/ring_theory/free_comm_ring.lean | ac606bfed9a64b9ac6482ff93207aaf1421efd7f | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 14,330 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Johan Commelin
-/
import data.equiv.functor
import data.mv_polynomial.equiv
import data.mv_polynomial.comm_ring
import ring_theory.free_ring
/-!
# Free commutative rings
The th... |
5879cbecfa9ff29531bf91419f7b906ba987576f | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/nary_existsi.lean | 246e1fa40d12a3174874690f509fa0be83d112df | [
"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 | 98 | lean | example : ∃ a b c : nat, a = b + c :=
begin
existsi [_, _, _],
refl,
repeat {exact 0}
end
|
86ec15f7273faf5afebaea9b1817e39e3efd2232 | 1dd482be3f611941db7801003235dc84147ec60a | /src/topology/basic.lean | 2ae2a9e93b686062b309452413f169b0e25b2a10 | [
"Apache-2.0"
] | permissive | sanderdahmen/mathlib | 479039302bd66434bb5672c2a4cecf8d69981458 | 8f0eae75cd2d8b7a083cf935666fcce4565df076 | refs/heads/master | 1,587,491,322,775 | 1,549,672,060,000 | 1,549,672,060,000 | 169,748,224 | 0 | 0 | Apache-2.0 | 1,549,636,694,000 | 1,549,636,694,000 | null | UTF-8 | Lean | false | false | 99,462 | 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, Jeremy Avigad
Theory of topological spaces.
Parts of the formalization is based on the books:
N. Bourbaki: General Topology
I. M. James: Topologie... |
8af4523e444062ee675dd146666879dde7bc6ec7 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/order/minimal.lean | 3fa840b4b353bc7ba54b2221562bdf555f683ee5 | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 5,629 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import order.antichain
import order.upper_lower
/-!
# Minimal/maximal elements of a set
This file defines minimal and maximal of a set with respect to an arbitrary rela... |
9ba0cee092fab4f885045b3ed51a6ad2d44c41f8 | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/algebra/group/type_tags.lean | 4c4108e6be76440764396f4fb2e62b3bab1d22ec | [
"Apache-2.0"
] | permissive | ayush1801/mathlib | 78949b9f789f488148142221606bf15c02b960d2 | ce164e28f262acbb3de6281b3b03660a9f744e3c | refs/heads/master | 1,692,886,907,941 | 1,635,270,866,000 | 1,635,270,866,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,157 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import algebra.group.hom
import data.equiv.basic
/-!
# Type tags that turn additive structures into multiplicative, and vice versa
We define two type tags:
* `addit... |
604375696955a0e94ef683909b11592a4b2db8d3 | e91b0bc0bcf14cf6e1bfc20ad1f00ad7cfa5fa76 | /src/sheaves/presheaf_of_rings.lean | 9a96630861a9f9e3903e828dce6be530048e3f1b | [] | 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 | 1,105 | lean | import sheaves.presheaf_of_types
universe u
-- Definition of a presheaf of rings.
structure presheaf_of_rings (α : Type u) [T : topological_space α]
extends presheaf_of_types α :=
(Fring : ∀ {U} (OU : T.is_open U), comm_ring (F OU))
(res_is_ring_hom : ∀ {U V} (OU : T.is_open U) (OV : T.is_open V) (HVU : V... |
eafd58a4099e4fdeab428ddafc07ed4ce66d87d0 | 0c1546a496eccfb56620165cad015f88d56190c5 | /library/init/algebra/ordered_field.lean | c5ea4dc83e09a0db90203e73917e9021487a7e37 | [
"Apache-2.0"
] | permissive | Solertis/lean | 491e0939957486f664498fbfb02546e042699958 | 84188c5aa1673fdf37a082b2de8562dddf53df3f | refs/heads/master | 1,610,174,257,606 | 1,486,263,620,000 | 1,486,263,620,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,325 | 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
-/
prelude
import init.algebra.ordered_ring init.algebra.field
universe variables u
class linear_ordered_field (α : Type u) extends linear_ordered_ring ... |
226bd6c64915c718bb2ac82bff4b34f25783c667 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/polynomial/induction.lean | 1e3bc5322802039d39e8e6401ad2efc0aa1e71fa | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 3,193 | 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 ring_theory.ideal.basic
import data.polynomial.basic
/-!
# Induction on polynomials
> THIS FILE IS SYNCHRONIZED W... |
29f0f94fceb8641324348b70e302109c901d9a75 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/category_theory/sites/cover_preserving.lean | c552380d36d231da5b2c612b5a48ab934e25a347 | [
"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 | 7,163 | lean | /-
Copyright (c) 2021 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import category_theory.sites.sheaf
/-!
# Cover-preserving functors between sites.
We define cover-preserving functors between sites as functors that push covering sieves ... |
0c453695c9376af5fc71eb2af0c4e7bc974f188f | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/group_theory/solvable.lean | da7b82eb4389c9b78e0ca904b960b77be81dec4b | [
"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 | 10,142 | lean | /-
Copyright (c) 2021 Jordan Brown, Thomas Browning, Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jordan Brown, Thomas Browning, Patrick Lutz
-/
import data.fin.vec_notation
import group_theory.abelianization
import set_theory.cardinal
import group_the... |
d52325ace1343855aac540795b101d41222a026b | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/def19.lean | 91a2203c343cc85f5a19187ada8a2b3883dd16d5 | [
"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,684 | lean | universe u
inductive Vec (α : Type u) : Nat → Type u
| nil : Vec α 0
| cons : α → {n : Nat} → Vec α n → Vec α (n+1)
def Vec.append1 {α} : {m n : Nat} → Vec α m → Vec α n → Vec α (n + m)
| _, m, nil, ys => ys
| _, m, cons x xs, ys => cons x (append1 xs ys)
def Vec.append2 {α} : {m n : Nat} → Vec α m → Vec α n ... |
dfb84a9e6aa68227dcdd1e69adaf3051eda32d33 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/monoidal/transport.lean | 954619dd5049826c5f80ac5d7ea12f11828b9ec3 | [
"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 | 9,368 | 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.monoidal.natural_transformation
/-!
# Transport a monoidal structure along an equivalence.
When `C` and `D` are equivalent as categories,
we ... |
468cd4349b1af423d719ecbc1715f8e43d16a8c0 | fe84e287c662151bb313504482b218a503b972f3 | /src/data/heq_extra.lean | 4e58bb7fc4b9cbe1683321baa9b11f4504f4556f | [] | 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 | 3,850 | 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 contains some additional lemmas for working with heterogenous
equality. It is far from clear that the approach taken here
(or in places where these results ar... |
16251e5fe16cab8049a94ebbdcba3710bfd31add | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/algebra/group_bigops.lean | d03a52f1e5e132413fb2f5ce9f9cf8ed7ba73ee6 | [
"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 | 22,842 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad
Finite products on a monoid, and finite sums on an additive monoid. There are three versions:
Prodl, Suml : products and sums over lists
Prod, Sum... |
3a88812438861ec8bdf726388e2fe122eef63d9a | 4f643cce24b2d005aeeb5004c2316a8d6cc7f3b1 | /src/o_minimal/examples/isolating.lean | 988124116c150e4d2882ad802b036c6534a40329 | [] | no_license | rwbarton/lean-omin | da209ed061d64db65a8f7f71f198064986f30eb9 | fd733c6d95ef6f4743aae97de5e15df79877c00e | refs/heads/master | 1,674,408,673,325 | 1,607,343,535,000 | 1,607,343,535,000 | 285,150,399 | 9 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,242 | lean | import for_mathlib.nat
import o_minimal.examples.from_function_family
import o_minimal.o_minimal
/-
A function family on a linear order R is *isolating*
if any constraint f(x) = g(x) or f(x) < g(x) in n+1 variables x = (x₀, ..., xₙ)
is equivalent to one of the below:
- true;
- false;
- a constraint of one of the forms... |
e8156fb35e8f1f9710a5d4dbbf093198404a8911 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/algebra/hom/equiv.lean | afaa61705f72850d884fd4fea190f14c5c12e2e6 | [
"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 | 29,368 | 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, Callum Sutton, Yury Kudryashov
-/
import algebra.group.type_tags
import algebra.group_with_zero.basic
import data.pi.algebra
/-!
# Multiplicative and additive equivs
... |
379cb45b19c1ad5c47c92f8fd8230805e76da053 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/topology/instances/irrational.lean | 679e63c2a2cdfc4b17ac289f6c0adeccf9d8ebe3 | [
"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 | 3,376 | lean | /-
Copyright (c) 2021 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import topology.metric_space.hausdorff_distance
import topology.metric_space.baire
import data.real.irrational
/-!
# Topology of irrational numbers
In this ... |
3a96f2c5d70cb015c9714bba60346caf25bb97ca | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /src/Init/Lean/Modifiers.lean | 46ec9156cd2fe225ce5263115a4cc8fdd9f7033e | [
"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,500 | 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.Environment
namespace Lean
def mkProtectedExtension : IO TagDeclarationExtension :=
mkTagDeclarationExtension `protected
@[init ... |
b3d2cd40f8dc2500ae245d55d0b7e6be7dba57cc | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /library/algebra/category/basic.lean | 723f1298e8d61152cfbfd5036115b0748fe22632 | [
"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 | 2,858 | lean | -- Copyright (c) 2014 Floris van Doorn. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Floris van Doorn
import logic.axioms.funext
open eq eq.ops
inductive category [class] (ob : Type) : Type :=
mk : Π (hom : ob → ob → Type)
(comp : Π⦃a b c : ob⦄, hom b ... |
95705c0c71e48abe35000f4ffeda2ad6be62a3c9 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/option/basic.lean | f8587890de76a205f2ea9548b93f286e82a893e0 | [
"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 | 19,017 | 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 logic.is_empty
import tactic.basic
import logic.relator
/-!
# Option of a type
This file develops the basic theory of option types.
If `α` is a type, then `... |
ded65c4820908c41080a50e770a3b73d5accb33e | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/inductive1.lean | f8f4785e24ded8b73fa2340b189e0cdf6ae9e643 | [
"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,307 | lean | new_frontend
inductive L1.{u} (α : Type u)
| nil
| cons : α → L1 α → L1 α
#check L1
#check @L1.cons
inductive L2.{u} (α : Type u)
| nil
| cons (head : α) (tail : L2 α)
#check @L2.cons
universes u v
variable (α : Type u)
inductive A (β : Type v)
| nil {}
| protected cons : α → β → A β → A β
#check @A.cons
#check ... |
743ee41dd4e38bc2d352df42f7915b62de83c64e | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/set/pointwise/interval.lean | 723d973f360d33b711bf5223acb0aa012547fa2f | [
"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,939 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov, Patrick Massot
-/
import data.set.intervals.unordered_interval
import data.set.intervals.monoid
import data.set.pointwise.basic
import algebra.order.field.basic... |
00224c4d25777566ecef62154871a107791480fa | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebraic_topology/split_simplicial_object.lean | 30b18af9c349eacbaaa185c140dc55986e5d17ec | [
"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 | 11,848 | lean | /-
Copyright (c) 2022 Joël Riou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joël Riou
-/
import algebraic_topology.simplicial_object
import category_theory.limits.shapes.finite_products
/-!
# Split simplicial objects
In this file, we introduce the notion of spl... |
2bc21df0a69fce80cc07344fb81771c00e18fb76 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/tactic/lint/misc.lean | c6fde7384421f24f2334d30c5648a56174268c29 | [
"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 | 21,199 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Robert Y. Lewis
-/
import tactic.lint.basic
/-!
# Various linters
This file defines several small linters:
- `ge_or_gt` checks that `>` and `≥` do not occur in ... |
6493bd620e94116b53990d08302e521c46004757 | e514e8b939af519a1d5e9b30a850769d058df4e9 | /src/tactic/rewrite_search/default.lean | 2ce58b8bc7c37fff2ec03e093c3ab16641c7312a | [] | no_license | semorrison/lean-rewrite-search | dca317c5a52e170fb6ffc87c5ab767afb5e3e51a | e804b8f2753366b8957be839908230ee73f9e89f | refs/heads/master | 1,624,051,754,485 | 1,614,160,817,000 | 1,614,160,817,000 | 162,660,605 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 337 | lean | -- Provide the interactive tactics
import .interactive
-- We include the shipped library of strategies, metrics, and tracers
import .strategy
import .metric
import .tracer
-- Include the library of bundles
import .bundles
-- Include the `suggestion` command for convenient hint semantics
import tactic.rewrite_search.c... |
7823ea5072717541ef83a6fa666d355417b7cb17 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/1027.lean | a67a64f8532e52b6855dabee2641b3bc3d05f0a1 | [
"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 | 68 | lean | example (h : x ≠ 0) : Unit := by
simp_all
trace_state
sorry
|
f746a3b4c2f8d6e4344c432bcfc1865a2e00c8b5 | 4e3bf8e2b29061457a887ac8889e88fa5aa0e34c | /lean/love01_definitions_and_lemma_statements_demo.lean | fcfa81eeb2dc4de3b378811b964254ca3c462156 | [] | no_license | mukeshtiwari/logical_verification_2019 | 9f964c067a71f65eb8884743273fbeef99e6503d | 16f62717f55ed5b7b87e03ae0134791a9bef9b9a | refs/heads/master | 1,619,158,844,208 | 1,585,139,500,000 | 1,585,139,500,000 | 249,906,380 | 0 | 0 | null | 1,585,118,728,000 | 1,585,118,727,000 | null | UTF-8 | Lean | false | false | 5,204 | lean | /- LoVe Demo 1: Definitions and Lemma Statements -/
import .lovelib
namespace LoVe
/- Types and Terms -/
#eval 1 + 1
#check ℕ
#check ℤ
#check empty
#check unit
#check bool
#check ℕ → ℤ
#check ℤ → ℕ
#check bool → ℕ → ℤ
#check (bool → ℕ) → ℤ
#check ℕ → (bool → ℕ) → ℤ
#check λx : ℕ, x
#check λf : ℕ → ℕ, λg : ℕ → ℕ,... |
965f2f789156483eab237734d2a7f91a7c95f742 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/triangulated/pretriangulated.lean | 458d221180f72ec4f5d801846bc2711e8b460dd6 | [
"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,542 | lean | /-
Copyright (c) 2021 Luke Kershaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Luke Kershaw
-/
import category_theory.preadditive.additive_functor
import category_theory.shift
import category_theory.triangulated.rotate
/-!
# Pretriangulated Categories
This file c... |
1255a489911f72deae27e6093f68d693c5fe2cce | 5c7fe6c4a9d4079b5457ffa5f061797d42a1cd65 | /src/exercises/src_30_preimages_of_functions.lean | ab93e38fda5e0a8fd99bf2a5c85a6229bc0fff48 | [] | no_license | gihanmarasingha/mth1001_tutorial | 8e0817feeb96e7c1bb3bac49b63e3c9a3a329061 | bb277eebd5013766e1418365b91416b406275130 | refs/heads/master | 1,675,008,746,310 | 1,607,993,443,000 | 1,607,993,443,000 | 321,511,270 | 3 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,933 | lean | import data.set
import .src_17_even_odd_further
open set function
namespace mth1001
section pre_image
/-
Suppose `f : α → β` is a function from a type `α` to a type `β`. Suppose
`B` is a set on `β`. The *preimage* of `B` under `f` is `{x : α | f x ∈ B}`.
It is denoted `f⁻¹ B` in matheamtics and either `preimage f B`... |
95ce849331c156fcc58199375b9a9d56833ce152 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Lean/PrettyPrinter.lean | 531c6f0f1dda86b15bd3a44cd8a810db64636332 | [
"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 | 4,373 | lean | /-
Copyright (c) 2020 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.PrettyPrinter.Delaborator
import Lean.PrettyPrinter.Parenthesizer
import Lean.PrettyPrinter.Formatter
import Lean.Parser.Module
import Lean.ParserCo... |
0896ad92f97068976a09b07f8c21ad0d6b548cf2 | a9e33f9c83301c461f3c3ebc6799d9de1f6d4d20 | /notes/2019.09.24.lean | 468f8e75d6f007363e52b518ddcead0ecd41a7a1 | [] | no_license | yl4df/Discrete-Mathematics | f1c9a6cf8cfb4686fb617637f69a481e1522f0c2 | c93ce9f6a6e36d194e350d9fa0a0360191e97fa0 | refs/heads/master | 1,598,714,938,443 | 1,572,275,647,000 | 1,572,275,647,000 | 218,074,726 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,460 | lean | namespace mlist
open list -- Lean-provided data type
/-
Lists in Lean are "polymorphic." They
can contain elements of any specified
type. Your homework is to implement lists of natural numbers in particular.
Soon you'll see how to make the type of
list elements into a parameter/argument.
To help with your homework... |
881d8c63ca89eebd7ab073468828a80b6ce63d6a | 367134ba5a65885e863bdc4507601606690974c1 | /src/ring_theory/multiplicity.lean | fb46b95ac5f15005349a220ca5c3e68a4d850c13 | [
"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 | 18,011 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis, Chris Hughes
-/
import algebra.associated
import algebra.big_operators.basic
import ring_theory.valuation.basic
/-!
# Multiplicity of a divisor
For a commutative mo... |
c3afc35ada86fb5f88b14537d8c7497b2a05be59 | 7cdf3413c097e5d36492d12cdd07030eb991d394 | /src/game/world4/level2.lean | f714555805d8e8af9389ff3bdf7383a857bb028f | [] | no_license | alreadydone/natural_number_game | 3135b9385a9f43e74cfbf79513fc37e69b99e0b3 | 1a39e693df4f4e871eb449890d3c7715a25c2ec9 | refs/heads/master | 1,599,387,390,105 | 1,573,200,587,000 | 1,573,200,691,000 | 220,397,084 | 0 | 0 | null | 1,573,192,734,000 | 1,573,192,733,000 | null | UTF-8 | Lean | false | false | 322 | lean | import game.world4.level1 -- hide
namespace mynat -- hide
/-
# World 4 : Power World
## Level 2: `zero_pow_succ`
-/
/- Lemma
For all naturals $m$, $0 ^{succ (m)} = 0$.
-/
lemma zero_pow_succ (m : mynat) : (0 : mynat) ^ (succ m) = 0 :=
begin [less_leaky]
rw pow_succ,
rw mul_zero,
refl,
end
end mynat -- hid... |
0a2f442efbc3533905d69b86bac02956dbf82c75 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/measure_theory/simple_func_dense.lean | ccf57c5012773428183b64b0d4fedde64da497de | [
"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 | 15,154 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
Show that each Borel measurable function can be approximated,
both pointwise and in L¹ norm, by a sequence of simple functions.
-/
import measure_theory.l1_space
noncom... |
21ebaa43f59ae4ae4dc254d95a08e441e61262a5 | 737dc4b96c97368cb66b925eeea3ab633ec3d702 | /stage0/src/Lean/Elab/Tactic/Induction.lean | 0dad59368b12cf0c7abfc90cd9bb7d145a22e0c7 | [
"Apache-2.0"
] | permissive | Bioye97/lean4 | 1ace34638efd9913dc5991443777b01a08983289 | bc3900cbb9adda83eed7e6affeaade7cfd07716d | refs/heads/master | 1,690,589,820,211 | 1,631,051,000,000 | 1,631,067,598,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 19,024 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Util.CollectFVars
import Lean.Parser.Term
import Lean.Meta.RecursorInfo
import Lean.Meta.CollectMVars
import Lean.Meta.Tactic... |
012fe3d1740b76d7f2757d05d383f27144a600b5 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/special_functions/trigonometric/complex.lean | baa8f999576c3296a3de29ee3f4f9d6533468afa | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 9,455 | 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 algebra.quadratic_discriminant
import analysis.complex.polynomial
import field_theory.is_alg_clo... |
61e1294aa2da1f5a2edc0da52399a71a91f33499 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/run/new_inductive.lean | 24dc692f26e335b22e0129ee8a1e14495f42746f | [
"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 | 2,097 | lean | universes u v
inductive myList (α : Type u)
| nil : myList α
| cons : α → myList α → myList α
inductive myPair (α : Type u) (β : Type v)
| mk : α → β → myPair α β
mutual
variable (α : Type u) (m : α → Type v)
inductive bla : Nat → Type (max u v)
| mk₁ (n : Nat) : α → boo n → bla (n+1)
| mk₂ (a : α) : m a → String... |
1094b57b6d06ab0ca0e9706898ec38977e5dcea9 | 83bd3c3824dd952c0fef702bace6c34c78226af8 | /library/init/meta/tactic.lean | aa2dd6b7b7ee3b6168656d489e832601741ef6fb | [
"Apache-2.0"
] | permissive | heruix/lean | cb0767295dc8cdfa2892601f04d3954606e81e03 | 39270fd46f49fecb30649f5ec527da7bbd4cdb13 | refs/heads/master | 1,611,580,745,403 | 1,519,814,958,000 | 1,519,843,130,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 52,882 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.function init.data.option.basic init.util
import init.category.combinators init.category.monad init.category.alternative init.category.m... |
8274d48c82cf98ed8e0def1a1f98930cef926671 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/sharecommon.lean | a093c59c301e60f36c702cc1ddc024eb07a7059b | [
"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 | 3,929 | lean | import Std.ShareCommon
open Std
def check (b : Bool) : ShareCommonT IO Unit := do
unless b do throw $ IO.userError "check failed"
unsafe def tst1 : ShareCommonT IO Unit := do
let x := [1]
let y := [0].map (fun x => x + 1)
check $ ptrAddrUnsafe x != ptrAddrUnsafe y
let x ← shareCommonM x
let y ← shareCommonM y
check $... |
880400275779d2ed662594ffdab773d04d9a1685 | c5b07d17b3c9fb19e4b302465d237fd1d988c14f | /src/data/iso.lean | 27c49c45cd20861ec75dd22af335811dc6f8b47a | [
"MIT"
] | permissive | skaslev/papers | acaec61602b28c33d6115e53913b2002136aa29b | f15b379f3c43bbd0a37ac7bb75f4278f7e901389 | refs/heads/master | 1,665,505,770,318 | 1,660,378,602,000 | 1,660,378,602,000 | 14,101,547 | 0 | 1 | MIT | 1,595,414,522,000 | 1,383,542,702,000 | Lean | UTF-8 | Lean | false | false | 11,823 | lean | import function
import type
structure {u v} iso (A : Sort u) (B : Sort v) :=
(f : A → B)
(g : B → A)
(gf : Π x, g (f x) = x)
(fg : Π x, f (g x) = x)
notation a ` ≃ ` b := iso a b
instance {A B} : has_coe_to_fun (A ≃ B) :=
{ F := λ i, A → B, coe := λ i, i.1 }
-- Types Algebra
-- A a
-- A ⊕ B ... |
80e5994dff3a6cddf232cc03eebb49235839d14a | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/topology/instances/real.lean | 14f4301de6ea86a654549579ee498cbef8ae7d15 | [
"Apache-2.0"
] | permissive | stjordanis/mathlib | 51e286d19140e3788ef2c470bc7b953e4991f0c9 | 2568d41bca08f5d6bf39d915434c8447e21f42ee | refs/heads/master | 1,631,748,053,501 | 1,627,938,886,000 | 1,627,938,886,000 | 228,728,358 | 0 | 0 | Apache-2.0 | 1,576,630,588,000 | 1,576,630,587,000 | null | UTF-8 | Lean | false | false | 15,683 | 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 topology.metric_space.basic
import topology.algebra.uniform_group
import topology.algebra.ring
import ring_theory.subring
import group_theory.a... |
37bca156983921ea88b0a88d36957d38e7eedca3 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /hott/algebra/category/basic.hlean | 15883de25978d73edf052baf9011e542cffa571e | [
"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 | 1,297 | hlean | -- Copyright (c) 2014 Jakob von Raumer. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Jakob von Raumer
import ..precategory.basic ..precategory.morphism ..precategory.iso
open precategory morphism is_equiv eq truncation nat sigma sigma.ops
-- A category is a p... |
0e0db3037e6f653150812935f1dec89914b85e35 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/box_integral/partition/tagged.lean | 8bd1c84db790212733452f694b1ed288314948ec | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 16,017 | 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
/-!
# Tagged partitions
A tagged (pre)partition is a (pre)partition `π` enriched with a tagged point for each box of
... |
28b092fb5b6bcc9b0e5f7922842951e6afe1057b | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /test/tauto.lean | b7b43a9c83e5ea7688a661ea942c1499348db6eb | [
"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,264 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import tactic.tauto
section tauto₀
variables p q r : Prop
variables h : p ∧ q ∨ p ∧ r
include h
example : p ∧ p :=
by tauto
end tauto₀
section tauto₁
variables α : Type
... |
9e6b5f4227f925291baa4fa4493f35cafabc5e98 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/complex/module.lean | 4490993562cf0fbf82b6bb4a4f46d8328378560b | [
"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 | 11,590 | lean | /-
Copyright (c) 2020 Alexander Bentkamp, Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alexander Bentkamp, Sébastien Gouëzel, Eric Wieser
-/
import algebra.order.smul
import data.complex.basic
import data.fin.vec_notation
import field_theory.tower
... |
bfe9d51548741b107138ddf187f68bca76d1bd74 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/eqn_preprocessor1.lean | b91f7b20f73e068d41da86755a32f907232d9cfb | [
"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,613 | lean | open nat
inductive Vec (A : Type) : nat → Type
| nil {} : Vec 0
| cons : Π {n}, A → Vec n → Vec (succ n)
open Vec
def append1 {A : Type} : Π {m n : nat}, Vec A m -> Vec A n -> Vec A (n + m)
| _ m nil ys := ys
| _ m (cons x xs) ys := cons x (append1 xs ys)
def append2 {A : Type} : Π {m n : nat}, Vec A m ->... |
ca6e6ef4fe942b75351e89ef82dd7e9fd14183b7 | df561f413cfe0a88b1056655515399c546ff32a5 | /8-inequality-world/l14.lean | f051e4305b76f9dd2b2c8edc843c803f6ff7e60a | [] | 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 | 149 | lean | theorem add_le_add_left {a b : mynat} (h : a ≤ b) (t : mynat) :
t + a ≤ t + b :=
begin
cases h with c hc,
rw hc,
use c,
rw add_assoc,
refl,
end |
8d2a70f67dc567663cba4545673fd468ed3bdf35 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/interactive/completion3.lean | fd381c4ff3b7434291238d3518ac224ac377517a | [
"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 | 385 | lean | structure S where
x : Nat
y : String
b : Bool
def f (s : S) : Nat :=
let rec foo (s : S) :=
if s. then 1 else 2
--^ textDocument/completion
foo s
def g1 (s : S) : Nat × Nat :=
(s. )
--^ textDocument/completion
def g2 (s : S) : Nat × Nat :=
(s.
--^ textDocument/completion
def g3 (s : S... |
163fa8255ca595c572e86f38ecd0b882be15a5c3 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/data/nat/factorial.lean | 6f35f5e9a1b63cdba3b0338dac46e122f4155203 | [
"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 | 14,453 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Chris Hughes, Floris van Doorn, Yaël Dillies
-/
import data.nat.basic
import data.nat.pow
/-!
# Factorial and variants
This file defines the factorial, along with the... |
8214091245142a008450d65765f952274ca3ea21 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/category_theory/punit.lean | 9e5256df8f55ac8c9287af3cc3762f3720c0b6b4 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 2,034 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta
-/
import category_theory.const
import category_theory.discrete_category
/-!
# The category `discrete punit`
We define `star : C ⥤ discrete punit` sendin... |
8c7406eb93eea71dfd6409322543300747b8a6ee | a721fe7446524f18ba361625fc01033d9c8b7a78 | /src/principia/experimental/oldint/add.lean | 4db77f8cbeaf20ddb864a87206059fb22909fd25 | [] | 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,860 | lean | import .basic
namespace hidden
namespace oldint
open mynat
open oldint
def add: oldint → oldint → oldint
| (of_nat m) (of_nat n) := of_nat (m + n)
| -[1+ m] (of_nat n) := sub_nat_nat n (succ m)
| (of_nat m) -[1+ n] := sub_nat_nat m (succ n)
| -[1+ m] -[1+ n] := -[1+ succ (m + n)]
instance: has_add oldin... |
d4cf51f3957ce588786f48fe6845977547dad5fc | d9ed0fce1c218297bcba93e046cb4e79c83c3af8 | /library/tools/super/cdcl_solver.lean | 0686513a1e26b824c10acfbff0a31e8634efebfc | [
"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 | 13,450 | 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 data.monad.transformers
open tactic expr monad super
namespace cdcl
@[reducible] meta def prop_var := expr
@[reducible] meta def proof_term := expr
@[r... |
735d1898e99b0ef0dd74d4850ad4249fad2729a5 | ff5230333a701471f46c57e8c115a073ebaaa448 | /library/init/data/bool/lemmas.lean | f648e60c34fd9b431e8b2961396730e1904006d7 | [
"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 | 4,816 | 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
-/
prelude
import init.data.bool.basic init.meta
attribute [simp] cond bor band bnot bxor
@[simp] lemma {u} cond_a_a {α : Type u} (b : bool) (a : α) : cond b... |
7d4c40a0e54f8677aee2fa9bc5543d2519ff0c99 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/measure_theory/measurable_space_def.lean | ab7649d31b8cfeebef4dd6863f0b60dbe14d8d18 | [
"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 | 17,569 | 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 algebra.indicator_function
import data.equiv.encodable.lattice
import data.set.countable
import order.disjointed
import order.filter.basic
impo... |
42716d85e09ae9952294f384dfe6f3a4805a14aa | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/CompilerFindJoinPoints.lean | 8b9ae51d773846baa47af4bf7ef6eec1c84de180 | [
"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 | 794 | 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, ``Lean.MetavarContext.MkBinding.collectForwardDeps]
@[cpa... |
af6e4b82cd45aadd6f897cbe240af1b2f9841df5 | ec62863c729b7eedee77b86d974f2c529fa79d25 | /13/b.lean | 893412d7c21b3d6c2412b35cd8222c73b53027a5 | [] | no_license | rwbarton/advent-of-lean-4 | 2ac9b17ba708f66051e3d8cd694b0249bc433b65 | 417c7e2718253ba7148c0279fcb251b6fc291477 | refs/heads/main | 1,675,917,092,057 | 1,609,864,581,000 | 1,609,864,581,000 | 317,700,289 | 24 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 944 | lean | partial def egcd (x y : Int) : Int × Int :=
if x == 1 then (1, 0) else
let ⟨q, r⟩ := (y / x, y % x)
let ⟨a, b⟩ := egcd r x
-- y = q * x + r
-- a * r + b * x = 1
-- (b - a * q) * x + a * y = 1
(b - a * q, a)
def crt (a₁ n₁ a₂ n₂ : Int) : Int :=
let ⟨b₁, b₂⟩ := egcd n₁ n₂
-- b₁ * n₁ + b₂ * n₂ = 1
-- b₁ * n₁ ≡ 0 (mod n₁)... |
4199b4c40b585e5868afd704888ff3d23c750344 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/topology/metric_space/lipschitz.lean | ee4901deb52d1ae0494948e8592f72602aef53a7 | [
"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 | 11,374 | lean | /-
Copyright (c) 2018 Rohan Mitta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rohan Mitta, Kevin Buzzard, Alistair Tucker, Johannes Hölzl, Yury Kudryashov
-/
import topology.metric_space.basic
import category_theory.endomorphism
import category_theory.types
/-!
# ... |
497fbc287b71658a7e0808bbed86c109b66f265f | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/combinatorics/composition.lean | 6143352983b1130b186131eaf1661a37021741e8 | [
"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 | 36,103 | 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 data.fintype.card
import data.finset.sort
import tactic.omega
import algebra.big_operators.order
/-!
# Compositions
A composition of a natural number `... |
5f376f39027b25aeee3dca4e44f1cc16482d0f64 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/set_theory/pgame.lean | 5500c424eaa9e3bd9e3dea7c4aac30b4e144c819 | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 38,671 | lean | /-
Copyright (c) 2019 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Mario Carneiro, Isabel Longbottom, Scott Morrison
-/
import data.equiv.basic logic.embedding
import data.nat.cast
import data.finset data.fintype
/-!
# Combinatorial (pre... |
4c255864b04273d27d21b209417e9edb7127f84e | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/polynomial/lifts.lean | 31a916b527df449977d3fdceaa86795c836da271 | [
"Apache-2.0"
] | permissive | stjordanis/mathlib | 51e286d19140e3788ef2c470bc7b953e4991f0c9 | 2568d41bca08f5d6bf39d915434c8447e21f42ee | refs/heads/master | 1,631,748,053,501 | 1,627,938,886,000 | 1,627,938,886,000 | 228,728,358 | 0 | 0 | Apache-2.0 | 1,576,630,588,000 | 1,576,630,587,000 | null | UTF-8 | Lean | false | false | 11,016 | lean | /-
Copyright (c) 2020 Riccardo Brasca. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Riccardo Brasca
-/
import data.polynomial.algebra_map
import algebra.algebra.subalgebra
import algebra.polynomial.big_operators
import data.polynomial.erase_lead
/-!
# Polynomials t... |
63375a2979f153c8e90ac157cfb411cf44a033ae | 5b0c53e5aaa0e60538d10f6b619a464aaf463815 | /ch3.hlean | d7cf87608bf9683770cc935e1a75aca0489b472d | [
"Apache-2.0"
] | permissive | bbentzen/hott-book-in-lean | f845a19ef09d48d2fb813624b4650d5832a47e10 | 9e262e633e653280b9cde5d287631fcec8501f64 | refs/heads/master | 1,586,430,679,994 | 1,519,975,089,000 | 1,519,975,089,000 | 50,330,220 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,890 | hlean | /-
Copyright (c) 2016 Bruno Bentzen. All rights reserved.
Released under the Apache License 2.0 (see "License");
Theorems and exercises of the HoTT book (Chapter 3)
-/
import .ch2 types.bool
open eq prod unit bool sum sigma ua funext nat lift
/- ************************************** -/
/- Ch.3 Sets and Logic ... |
b97eaad02b6e011759209cbcc6ff1427460f595c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/mv_polynomial/variables_auto.lean | ee034a45c588853cdbc20abd106dfb17004fb878 | [] | 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,522 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Johan Commelin, Mario Carneiro
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.mv_polynomial.monad
import Mathlib.data.set.disjointed... |
6bccec501f60483fed1006166fc9f67bd5fd9cef | 3ef5255cebe505e5ab251615d9fbf31a132f461d | /lean/old/axioms_test.lean | b07d0fed0ce609a0bd4799c7bde7d7eebb8df725 | [] | no_license | avigad/scratch | 42441a2ea94918049391e44d7adab304d3adea51 | 3fb9cef15bc5581c9602561427a7f295917990a2 | refs/heads/master | 1,608,917,412,424 | 1,473,078,921,000 | 1,473,078,921,000 | 17,224,172 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,844 | lean | ----------------------------------------------------------------------------------------------------
--
-- axioms_test.lean
-- Jeremy Avigad
--
-- playing with the axioms
--
----------------------------------------------------------------------------------------------------
import macros
-- the natural axioms for eq... |
cc8c1ee5c08088699590de9e44ef7ea355f0be9e | 1a61aba1b67cddccce19532a9596efe44be4285f | /library/data/hf.lean | f9a3a2b4d308a15bc7073a2cb292caeba1e4aa79 | [
"Apache-2.0"
] | permissive | eigengrau/lean | 07986a0f2548688c13ba36231f6cdbee82abf4c6 | f8a773be1112015e2d232661ce616d23f12874d0 | refs/heads/master | 1,610,939,198,566 | 1,441,352,386,000 | 1,441,352,494,000 | 41,903,576 | 0 | 0 | null | 1,441,352,210,000 | 1,441,352,210,000 | null | UTF-8 | Lean | false | false | 25,365 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
Hereditarily finite sets: finite sets whose elements are all hereditarily finite sets.
Remark: all definitions compute, however the performace is quite poor s... |
568351f3ff7c9058c8a138a8d6aeabe0d92d9fac | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/group_theory/specific_groups/quaternion.lean | fac7aa55f99070c5edf59cb5e5e4f5ca92cc21ce | [
"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,806 | lean | /-
Copyright (c) 2021 Julian Kuelshammer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Julian Kuelshammer
-/
import data.zmod.basic
import data.nat.basic
import tactic.interval_cases
import group_theory.specific_groups.dihedral
import group_theory.specific_groups.cyc... |
e7283d6603c0186b20658479d9f131eb56216a1e | 437dc96105f48409c3981d46fb48e57c9ac3a3e4 | /src/algebra/ring.lean | f21695ac35b1222b873e2195f2e0f0e291f827ef | [
"Apache-2.0"
] | permissive | dan-c-k/mathlib | 08efec79bd7481ee6da9cc44c24a653bff4fbe0d | 96efc220f6225bc7a5ed8349900391a33a38cc56 | refs/heads/master | 1,658,082,847,093 | 1,589,013,201,000 | 1,589,013,201,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 29,477 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Floris van Doorn, Amelia Livingston
-/
import algebra.group.with_one
import deprecated.group
import tactic.norm_cast
/-!
# Properties and homomorphism... |
7dea7a578253bcc7b89173cb5ac787d39c146f32 | 1a61aba1b67cddccce19532a9596efe44be4285f | /library/data/examples/vector.lean | 66ccfdf34b643d94bf7f49781456ec408046b51b | [
"Apache-2.0"
] | permissive | eigengrau/lean | 07986a0f2548688c13ba36231f6cdbee82abf4c6 | f8a773be1112015e2d232661ce616d23f12874d0 | refs/heads/master | 1,610,939,198,566 | 1,441,352,386,000 | 1,441,352,494,000 | 41,903,576 | 0 | 0 | null | 1,441,352,210,000 | 1,441,352,210,000 | null | UTF-8 | Lean | false | false | 13,166 | lean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn, Leonardo de Moura
This file demonstrates how to encode vectors using indexed inductive families.
In standard library we do not use this approach.
-/
import data.nat... |
5c28a888128796253ab3bb2edf075d74b5e2c6da | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/ring_theory/algebra_operations.lean | 8dd274fffbc462a19c1a159ddf6570966bed2f5b | [
"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 | 9,725 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
Multiplication and division of submodules of an algebra.
-/
import ring_theory.algebra
import ring_theory.ideals
import algebra.pointwise
universes u v
open algebra
local attr... |
8e9a3232811b357eec8df47903f79d162c5a3f08 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/ring_theory/ring_hom/finite.lean | fb5a12a3c455d8cb6bd7cef8ca5f1855a3a5fc85 | [
"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 | 1,012 | lean | /-
Copyright (c) 2021 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import ring_theory.local_properties
/-!
# The meta properties of finite ring homomorphisms.
-/
namespace ring_hom
open_locale tensor_product
open tensor_product algeb... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.