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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1b00cb01fa66cea297106dedb5102dfbba83600b | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/add_decl.lean | fd0471499365620ced6280b22c2e965d6680b9cc | [
"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,465 | lean | prelude
import init.meta.tactic
open tactic expr
/-
inductive foo (α : Type)
| constr : foo
-/
run_cmd do
α ← mk_local_def `α `(Type),
let c : expr := (@const tt `foo []).app α,
env ← get_env,
env.add_ginductive options.mk
[] [α] [((`foo, `(Type)), [⟨`foo.constr, c, default⟩])] ff >>= set_env
#print foo
... |
4ff8d08cac5e38add575979d78af8b03fb2898b7 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/Reparen.lean | 1683203355121d4506e264564ab02c92faa0c9a1 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 2,270 | lean | import Lean.Parser
/-! Reprint file after removing all parentheses and then passing it through the parenthesizer -/
open Lean
open Std.Format open Std
def unparenAux (parens body : Syntax) : Syntax :=
match parens.getHeadInfo, body.getHeadInfo, body.getTailInfo, parens.getTailInfo with
| SourceInfo.original lead _ _ ... |
191e53c02082e08b17ec74ecde3c87dc506329e8 | 8c9f90127b78cbeb5bb17fd6b5db1db2ffa3cbc4 | /existsExercise.lean | 5f4e00958b015d5f3985281ed48eb25cf742e863 | [] | no_license | picrin/lean | 420f4d08bb3796b911d56d0938e4410e1da0e072 | 3d10c509c79704aa3a88ebfb24d08b30ce1137cc | refs/heads/master | 1,611,166,610,726 | 1,536,671,438,000 | 1,536,671,438,000 | 60,029,899 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,633 | lean | open classical
variables (A : Type) (p q : A → Prop)
variable a : A
variable r : Prop
lemma doubleNegate {r : Prop} : r → ¬ ¬ r := assume (Hr : r) (nHr : ¬ r), nHr Hr
lemma doubleNegateRev {r : Prop} : ¬ ¬ r → r :=
assume (Hr : ¬ ¬ r),
have J : r ∨ ¬ r, from em r,
or.elim J (λ (H : r), H) (λ (H :... |
c8ff0557a74f5917b3e82a15d8bb9ea9315ec432 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/hom/units.lean | 47a65c30dcdf33a10ef48afbf9e8da6509ed5359 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 5,205 | lean | /-
Copyright (c) 2018 Johan Commelin All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Chris Hughes, Kevin Buzzard
-/
import algebra.hom.group
/-!
# Lift monoid homomorphisms to group homomorphisms of their units subgroups.
-/
universes u v w
namespace ... |
39f3e2aad987ef9d3bce33aaae91217ab6148262 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/tactic/monotonicity/interactive.lean | 48e9ab0f82b0588872fc836c0ab98fca287057e3 | [
"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 | 23,531 | lean | /-
Copyright (c) 2019 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import tactic.monotonicity.basic
import control.traversable
import control.traversable.derive
import data.dlist
variables {a b c p : Prop}
namespace tactic.interactive
o... |
a097db1bf5242fc2cb4d8fe41b54ff3c0dccdd84 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/sites/whiskering.lean | c437b9d5be03c7de1be9cb462ef5609f25cb755e | [
"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,358 | lean | /-
Copyright (c) 2021 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import category_theory.sites.sheaf
/-!
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.
In this file we const... |
8ee149c125f092c46064e8cf04e791bdae7c881c | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/analysis/asymptotic_equivalent.lean | 6bb449a935368670fc2e2d3d9baa83103cb83795 | [
"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 | 9,253 | lean | /-
Copyright (c) 2020 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker
-/
import analysis.asymptotics
import analysis.normed_space.ordered
import analysis.normed_space.bounded_linear_maps
/-!
# Asymptotic equivalence
In this file, we ... |
29cda2382b3321d21d4b6a95a687ceeaf2a411e5 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /library/hott/inhabited.lean | cb609329b1943c0e58c3a1d84613a50ee742db62 | [
"Apache-2.0"
] | permissive | silky/lean | 79c20c15c93feef47bb659a2cc139b26f3614642 | df8b88dca2f8da1a422cb618cd476ef5be730546 | refs/heads/master | 1,610,737,587,697 | 1,406,574,534,000 | 1,406,574,534,000 | 22,362,176 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,317 | 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 logic bool
using logic
inductive inhabited (A : Type) : Type :=
| inhabited_intro : A → inhabited A
theorem inhabited_elim {A : Type} {B : Type} ... |
8e5b11f677b743d4bfa3fe425e34a0395405df4d | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/category_theory/closed/ideal.lean | c759c15153fddfa7e82a07cac66a42b2ae582480 | [
"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 | 11,837 | lean | /-
Copyright (c) 2021 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import category_theory.limits.preserves.shapes.binary_products
import category_theory.limits.constructions.finite_products_of_binary_products
import category_theory.monad... |
3ab835bd218aa13b1a77161cb9ab56a07f513e8a | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/ring_theory/noetherian.lean | 5872d0a83528dac5afb94e6b28b8e9f187bc9fe1 | [
"Apache-2.0"
] | permissive | molodiuc/mathlib | cae2ba3ef1601c1f42ca0b625c79b061b63fef5b | 98ebe5a6739fbe254f9ee9d401882d4388f91035 | refs/heads/master | 1,674,237,127,059 | 1,606,353,533,000 | 1,606,353,533,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 27,750 | lean | /-
Copyright (c) 2018 Mario Carneiro and Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kevin Buzzard
-/
import algebraic_geometry.prime_spectrum
import data.multiset.finset_ops
import linear_algebra.linear_independent
import order.order_... |
189157e8cded23ca01ff92f3bdcacdfe6eefec22 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/group_ring_action_auto.lean | d8b52f4eb6ee614c7294e0661f3bef1f59aa67cb | [] | 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 | 5,921 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.group_theory.group_action.group
import Mathlib.data.equiv.ring
import Mathlib.deprecated.subring
impo... |
59dd77255a4b2a5d5acf7699cbb783d06d63daaf | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/group_theory/p_group.lean | 0a4c8224a053650809e1362bcee2c9f295f57c03 | [
"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,376 | lean | /-
Copyright (c) 2018 . All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Thomas Browning
-/
import data.zmod.basic
import group_theory.index
import group_theory.group_action.conj_act
import group_theory.group_action.quotient
import group_theory.perm.cycle.... |
ac178c90de676e14d739b83e1abdd640d1eb2245 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/dependencies.lean | 46850fc385c25af9e301457d578761556e125abe | [
"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 | 30,420 | lean | /-
Copyright (c) 2020 Jannis Limperg. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jannis Limperg
-/
import tactic.core
/-!
# Tactics About Dependencies
This module provides tactics to compute dependencies and reverse dependencies of
hypotheses. An expression `e` d... |
1c0393d5086c430fb660f60b6ec1a93f4380bce7 | ef6b7797dbbd7b1dfff69894d190a965b101c5ff | /src/hilbert_props.lean | aa6f172a0734842e65a9c4e04dad7acc248be71b | [] | no_license | utensil-star/leanteach2020 | 43d57f1b23eded178e2049a0957b7ec38fd4e1a7 | 93326a5e5b0efeba30d9dc9ee85d52b1029cb24d | refs/heads/master | 1,666,413,811,198 | 1,592,598,394,000 | 1,592,598,394,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,259 | lean | import tactic
import .hilbert
noncomputable theory
open_locale classical
local infix ` ≃ `:55 := C -- \ equiv == equivalence/congruence
local infix `⬝`:56 := Segment.mk -- \ cdot == center-dot
-------------------------------
-- |#Instructions For Hilbert# |
-------------------------------
-- Alex: I copie... |
8208050ff16bb4639345e7251b0894361fad6a0f | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/probability/process/stopping.lean | cec8a181ef003823eac59b8e4dc13ad367c335e1 | [
"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 | 54,329 | lean | /-
Copyright (c) 2021 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying, Rémy Degenne
-/
import probability.process.adapted
/-!
# Stopping times, stopped processes and stopped values
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to t... |
ef1f8b5fa3eaf5efb6c6998fa12c1761bf6d42c0 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/ring_theory/coprime/ideal.lean | aa22abce01acaf552cb678c2e4ccdf5b0ec19024 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 4,205 | lean | /-
Copyright (c) 2022 Pierre-Alexandre Bazin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Pierre-Alexandre Bazin
-/
import linear_algebra.dfinsupp
import ring_theory.ideal.operations
/-!
# An additional lemma about coprime ideals
This lemma generalises `exists_sum... |
97d9db08b9ae0e3720ce2527de6ce53f07b517c3 | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/category_theory/limits/shapes/biproducts.lean | 16b92ac7c995cf32d43f85fe88b922914d22f3a8 | [
"Apache-2.0"
] | permissive | khoek/mathlib | bc49a842910af13a3c372748310e86467d1dc766 | aa55f8b50354b3e11ba64792dcb06cccb2d8ee28 | refs/heads/master | 1,588,232,063,837 | 1,587,304,803,000 | 1,587,304,803,000 | 176,688,517 | 0 | 0 | Apache-2.0 | 1,553,070,585,000 | 1,553,070,585,000 | null | UTF-8 | Lean | false | false | 11,785 | 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 category_theory.epi_mono
import category_theory.limits.shapes.products
import category_theory.limits.shapes.binary_products
/-!
# Biproducts and binary biprod... |
afc767fdbaa1a3ebd479e3c4f049bb2406a38365 | 8a8d9c511db749b9c0205ee48d6df1e2c6dd1e6f | /library/algebra/ordered_ring.lean | db711c5ea54510617ec8ee6b1a1ee15e86965217 | [
"Apache-2.0"
] | permissive | rpglover64/lean | 4d92db4b316b543b8a49797e2109532ed5eb88bb | cbac8d13006782c71a2281c3dd76854ccf8623a7 | refs/heads/master | 1,582,731,391,459 | 1,427,585,012,000 | 1,427,585,012,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 20,927 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: algebra.ordered_ring
Authors: Jeremy Avigad
Here an "ordered_ring" is partially ordered ring, which is ordered with respect to both a weak
order and an associated strict order. Our num... |
80fb7c0157ca57c835f59560eef61a2d6cf532fc | e39f04f6ff425fe3b3f5e26a8998b817d1dba80f | /category_theory/natural_isomorphism.lean | e1ba6d3768f08f370e496c951a49af9fd962e610 | [
"Apache-2.0"
] | permissive | kristychoi/mathlib | c504b5e8f84e272ea1d8966693c42de7523bf0ec | 257fd84fe98927ff4a5ffe044f68c4e9d235cc75 | refs/heads/master | 1,586,520,722,896 | 1,544,030,145,000 | 1,544,031,933,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,385 | 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
import category_theory.isomorphism
import category_theory.functor_category
open category_theory
namespace category_theory.nat_iso
... |
0b7da914bea802ff80ab215c5269bd49968a9d5c | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/set/sigma.lean | d66f01ca457dd42754240cd718514b2d1f142ddc | [
"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,001 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import data.set.basic
/-!
# Sets in sigma types
This file defines `set.sigma`, the indexed sum of sets.
-/
namespace set
variables {ι ι' : Type*} {α β : ι → Type*} {s ... |
e863d64775b1827179188cf1d215c65c71a66cd8 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /hott/init/util.hlean | 650904a28d9c8ee2504792173d269e64ecd794f9 | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 538 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: init.util
Author: Leonardo de Moura
Auxiliary definitions used by automation
-/
prelude
import init.trunc
open is_trunc
definition eq_rec_eq.{l₁ l₂} {A : Type.{l₁}} {B : A →... |
4b421357a37a63eed59da8b6d6a349a8fd7e6f57 | 2765b6350acb5144a537270d178c576b75af60e5 | /abdullah-conjecture/abdullah.lean | fec5b6656e534d88eaac3e1755cb1b54843a7ebd | [] | no_license | Lambda-Jakarta/research | c46506173ef935f3670c02de8bd3dd8c80c8a257 | 6804cc0e6283fa1dbe7470c9fc4c770aaf6549f6 | refs/heads/master | 1,617,984,886,327 | 1,522,358,325,000 | 1,522,358,339,000 | 125,716,718 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,281 | lean | -- 2018-01-04
-- Erik Dominikus
-- These are the definitions required to state the things we want to prove.
definition Cont (r : Type) (a : Type) : Type := (a → r) → r
structure Functor (m : Type → Type) : Type 1 := mk ::
(map : Π {a b}, (a → b) → m a → m b)
(pure : Π {a}, a → m a)
(p0 : Π {a}, @map a a ... |
d6dea95f57b85a0338d5b0c58f77b5a45aa391c8 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/change_tac.lean | da2b9cb838f44a7d541f38c6fadd68d7603f56ba | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 711 | lean | example : 1 + 2 = 3 :=
begin
change 2 + 1 = 3,
trace_state,
refl
end
example : 1 + 2 = 3 :=
begin
change 2 + 2 = 3 -- ERROR
end
example (h : 1 + 2 = 3) : 2 + 2 = 4 :=
begin
change 2 + 1 = 3 at h,
trace_state,
refl
end
example (h : 1 + 2 = 3) : 2 + 2 = 4 :=
begin
change 2 + 1 = 3 at h h, -- ERROR
end
... |
c7c036a28d3bed500bfdb711922f4ed31764dc90 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/group_theory/coset_auto.lean | 8ba77bc74d832dcc832ef07946b8ff8a7a127a1e | [] | 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,757 | lean | /-
Copyright (c) 2018 Mitchell Rowett. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mitchell Rowett, Scott Morrison
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.group_theory.subgroup
import Mathlib.PostPort
universes u_1
namespace ... |
627fdfde0ea9f7995486950582041c4cfae19391 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/group_theory/perm/concrete_cycle.lean | e0cdd83978f47fa72820d5f24a75ed3d45bdc5a4 | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,944 | lean | /-
Copyright (c) 2021 Yakov Pechersky. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yakov Pechersky
-/
import group_theory.perm.list
import data.list.cycle
import group_theory.perm.cycle_type
/-!
# Properties of cyclic permutations constructed from lists
In the fo... |
e59a42f8ca0265fb631905b05f14267ff39729b6 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /library/type.lean | bc25cc3208e5595c6c6f2b041ef3ada29f25af47 | [
"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 | 384 | lean | -- Copyright (c) 2014 Microsoft Corporation. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Leonardo de Moura
notation `Prop` := Type.{0}
notation [parsing-only] `Type'` := Type.{_+1}
notation [parsing-only] `Type₊` := Type.{_+1}
notation `Type₁` := Type.{1}
no... |
1ecae59de7a4e27bdbf475d77ce4d2d2a28fea7b | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/run/unicode.lean | 774efb2d0541d12b1b99c7bd3d32ac4382c8fbd4 | [
"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 | 144 | lean | import standard
variable N : Type
variable α : N
variable β₁ : N
check β₁
variable δ : N
check δ
variable δ₁₁ : N
check δ₁₁
|
91b2338bb2fd46a3098bde24789d088ba769d113 | df561f413cfe0a88b1056655515399c546ff32a5 | /1-tutorial-world/l2.lean | 188b99c9287d691d7176822b866355a48927b0c9 | [] | 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 | 95 | lean | lemma example2 (x y : mynat) (h : y = x + 7) : 2 * y = 2 * (x + 7) :=
begin
rw ← h,
refl,
end |
1bd2a4c912f199c4b0d006455d838fdfcd7ad1b8 | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/lean/parser/parser.lean | a65caba7371e134c24bd797feeded4a149db4970 | [
"Apache-2.0"
] | permissive | GaloisInc/lean4 | 74c267eb0e900bfaa23df8de86039483ecbd60b7 | 228ddd5fdcd98dd4e9c009f425284e86917938aa | refs/heads/master | 1,643,131,356,301 | 1,562,715,572,000 | 1,562,715,572,000 | 192,390,898 | 0 | 0 | null | 1,560,792,750,000 | 1,560,792,749,000 | null | UTF-8 | Lean | false | false | 44,149 | 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, Sebastian Ullrich
-/
prelude
import init.lean.position
import init.lean.syntax
import init.lean.toexpr
import init.lean.environment
import init.lean.attribute... |
517ee95a0ccf2e80340b084a2261eaac180b81f5 | abd85493667895c57a7507870867b28124b3998f | /src/ring_theory/algebra_operations.lean | 2b3f0a0cb725d11e5d8d7adc2212caf0b0db8e45 | [
"Apache-2.0"
] | permissive | pechersky/mathlib | d56eef16bddb0bfc8bc552b05b7270aff5944393 | f1df14c2214ee114c9738e733efd5de174deb95d | refs/heads/master | 1,666,714,392,571 | 1,591,747,567,000 | 1,591,747,567,000 | 270,557,274 | 0 | 0 | Apache-2.0 | 1,591,597,975,000 | 1,591,597,974,000 | null | UTF-8 | Lean | false | false | 9,594 | 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... |
160b19c3945a3c9a709e4d9dc192226aa70b9834 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/linarith/datatypes.lean | e94ab033e108f6fc7156c135b5161666b56c7a8f | [
"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 | 12,771 | lean | /-
Copyright (c) 2020 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import meta.rb_map
import tactic.ring
import tactic.linarith.lemmas
/-!
# Datatypes for `linarith`
Some of the data structures here are used in multiple parts of... |
8b2d85a374ac6a2a27ae9442c97e95f8010ad9a7 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/tropical/basic.lean | 463ad1f35fec0b9a1ae2ee4de523da58a009eaa1 | [
"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,427 | lean | /-
Copyright (c) 2021 Yakov Pechersky. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yakov Pechersky
-/
import algebra.group_power.order
import algebra.order.monoid.with_top
import algebra.smul_with_zero
import algebra.order.monoid.min_max
/-!
# Tropical algebraic s... |
12a74f939fe25c0ff5b875be29bf628bb6c881ca | 0ddf2dd8409bcb923d11603846800bd9699616ea | /chapter9.lean | 8c7a91b0b3881ddca503521674e2b989f1dd7793 | [] | no_license | tounaishouta/Lean | 0cbaaa9340e7f8f884504ea170243e07a54f0566 | 1d75311f5506ca2bfd8b7ccec0b7d70c3319d555 | refs/heads/master | 1,610,229,383,935 | 1,459,950,226,000 | 1,459,950,226,000 | 50,836,185 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,854 | lean | import standard
print classes
print instances inhabited
open nat
print default
eval default ℕ
check (rfl : 0 = default ℕ)
print arbitrary
eval arbitrary ℕ
check (rfl : 0 = arbitrary ℕ) --> Error
definition func_is_inhabited [instance]
{A B : Type} [inhabited B] :
inhabited (A → B) :=
inhabited.mk (λ x : A, d... |
8d267787633f326bdbc89af149c72b05994b111f | 271e26e338b0c14544a889c31c30b39c989f2e0f | /stage0/src/Init/Data/RBTree/Basic.lean | a4b379d9032a65bc219bed8d7b4cf13dea005e9d | [
"Apache-2.0"
] | permissive | dgorokho/lean4 | 805f99b0b60c545b64ac34ab8237a8504f89d7d4 | e949a052bad59b1c7b54a82d24d516a656487d8a | refs/heads/master | 1,607,061,363,851 | 1,578,006,086,000 | 1,578,006,086,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,883 | 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.RBMap.Basic
universes u v w
def RBTree (α : Type u) (lt : α → α → Bool) : Type u :=
RBMap α Unit lt
@[inline] def mkRBTree (α : T... |
ab95c8b47eb236e02095803a865bbedfd6aa762c | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/precissues.lean | 5de542cb418a5f4a2426c662e25c7c0f63d6b302 | [
"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 | 703 | lean | new_frontend
#check id fun x => x -- should work
#check 0
def f (x : Nat) (g : Nat → Nat) := g x
#check f 1 fun x => x -- should fail
#check 0
#check f 1 (fun x => x)
#check id have True from ⟨⟩; this -- should fail
#check id let x := 10; x
#check 1
#check id (have True from ⟨⟩; this)
#check 0 = have Nat fro... |
51882c99b0e577767222f93921a7e6917763efc1 | 88fb7558b0636ec6b181f2a548ac11ad3919f8a5 | /tests/lean/run/pi_patterns.lean | f3cd6347bede82eb9bf7150ea31226b15a90650d | [
"Apache-2.0"
] | permissive | moritayasuaki/lean | 9f666c323cb6fa1f31ac597d777914aed41e3b7a | ae96ebf6ee953088c235ff7ae0e8c95066ba8001 | refs/heads/master | 1,611,135,440,814 | 1,493,852,869,000 | 1,493,852,869,000 | 90,269,903 | 0 | 0 | null | 1,493,906,291,000 | 1,493,906,291,000 | null | UTF-8 | Lean | false | false | 335 | lean | open tactic
run_cmd do ```(%%a → %%b) ← pure ```(nat → nat) | failed, skip
run_cmd do ```(%%a → %%b) ← pure ```(Π (b : nat), nat) | failed, skip
run_cmd do ```(λ a : %%a, (%%b : %%c)) ← pure ```(λ n, n + 1) | failed, skip
run_cmd do ```(let a := (%%a : %%c) in (%%b : %%d)) ← pure ```(let n := 1 in n) | failed, skip
|
a92949dab5467ee68528722f78c12869a94d0f85 | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/prop_logic_theory/unnamed_1576.lean | cf1f54f26c76fcd913c23c0149063ba51f6881d6 | [] | no_license | gihanmarasingha/mth1001_sphinx | 190a003269ba5e54717b448302a27ca26e31d491 | 05126586cbf5786e521be1ea2ef5b4ba3c44e74a | refs/heads/master | 1,672,913,933,677 | 1,604,516,583,000 | 1,604,516,583,000 | 309,245,750 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 231 | lean | variables p q r : Prop
-- BEGIN
example (h₁ : p ↔ q) (h₂ : q ↔ r) : p ↔ r :=
begin
rw h₁, -- Rewriting using `h₁`, the goal is to prove `q ↔ r`.
exact h₂, -- This holds by reiteration on `h₂`.
end
-- END |
65add4f2ba1b5c3e8a2cd669035b8d48c65f8c17 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/order/conditionally_complete_lattice.lean | f7bdaac992079c20ea9cba854cf9db5de6ee9992 | [
"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 | 35,516 | lean | /-
Copyright (c) 2018 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.nat.enat
import data.set.intervals.ord_connected
/-!
# Theory of conditionally complete lattices.
A conditionally complete lattice is a lattice in... |
eff98e1e8bf5283445d330380dd2548d7f8af6d0 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/category_theory/instances/Top/default.lean | 94a3855e2c630b64642e8343beee8ac1ec21541a | [
"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 | 341 | 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 category_theory.instances.Top.basic
import category_theory.instances.Top.limits
import category_theory.instances.Top.adjunctions
import category_theory.ins... |
9524ffcc2d54f26bb551c543e85ae71cca3b4add | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch6/ex0302.lean | 0d0089faa4d9f7c5a579c2c4e4b5fb5dd2f06e17 | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 61 | lean | def foo.bar : ℕ := 1
open foo
#check bar
#check foo.bar
|
1b19fb75ea8029c83167a97ac02df29732b13b78 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/smt_assert_define.lean | 819df0f814197bb5f79b0da7db1130352aa7877c | [
"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 | 934 | lean | open smt_tactic
constant p : nat → nat → Prop
constant f : nat → nat
axiom pf (a : nat) : p (f a) (f a) → p a a
local attribute [ematch] nat.add_zero
lemma ex1 (a b c : nat) : a = b + 0 → a + c = b + c :=
by using_smt $ do
pr ← tactic.to_expr ```(nat.add_zero b),
note `h none pr,
trace_state, return ()
lemma ... |
04f9c8badb25fd59bf9f10158bdf5aeaa6eb8888 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/abelian/opposite.lean | e9639b75b3d69d0ef109aeadec077d99726a1eec | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 6,249 | 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 category_theory.abelian.basic
import category_theory.preadditive.opposite
import category_theory.limits.opposites
/-!
# The opposite of an abelian category is... |
6686b503f77128928bd57de585c5ebe025f55105 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/analysis/locally_convex/bounded.lean | 7b2bd1cb6dd268a87f6ccfab3db3a7e61af5d2ef | [
"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 | 6,723 | lean | /-
Copyright (c) 2022 Moritz Doll. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Moritz Doll
-/
import analysis.locally_convex.basic
import topology.bornology.basic
import topology.algebra.uniform_group
import analysis.locally_convex.balanced_core_hull
/-!
# Von Neum... |
6770af85f47664981ba0648c89245a8acf68beb0 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/abstract_tac.lean | e27e70436459a679d7b62826bed226f325331dac | [
"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 | 229 | lean | def ex (a b c : nat) : a = b → c = b → a = c ∧ b = c :=
begin
intros,
split,
abstract { transitivity, trace "hello", trace_state, assumption, symmetry, assumption },
abstract { symmetry, assumption }
end
#print ex
|
11fdf91c9fac550d7179d82cc639aaf1cc6a92fb | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /hott/algebra/category/basic.hlean | 85ffbbe85b894ede9aaa06c2c857eb6081e7374a | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,409 | hlean | /-
Copyright (c) 2014 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: algebra.category.basic
Author: Jakob von Raumer
-/
import algebra.precategory.iso
open iso is_equiv eq is_trunc
-- A category is a precategory extended by a witness
-- that the fu... |
97046a03c4dd6a1e1f6a3c3d80eab4815e74ec69 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /stage0/src/Lean/MetavarContext.lean | 3b2d13cb0ee41eb2ca8ea2b7244c64cb9671c5b0 | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 51,744 | 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.MonadCache
import Lean.LocalContext
namespace Lean
/-
The metavariable context stores metavariable declarations and their
assignments. It... |
3632e9cdfc0874a02948b18025e190086479fefd | 9dc8cecdf3c4634764a18254e94d43da07142918 | /test/rcases.lean | 30b131d1ec3931aac30614d0c94adad91dbf26bc | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 9,069 | 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.rcases
instance {α} : has_inter (set α) := ⟨λ s t, {a | a ∈ s ∧ a ∈ t}⟩
universe u
variables {α β γ : Type u}
example (x : α × β × γ) : true :=
begin
rc... |
0083ad97d02e237b6748d60ff16b3e1a50c362d0 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/ring_theory/ideal/over.lean | a0e87d32d8116c7b580abec865a7f625f61eaa51 | [
"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 | 17,339 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import ring_theory.algebraic
import ring_theory.localization
/-!
# Ideals over/under ideals
This file concerns ideals lying over other ideals.
Let `f : R →+* S` be a rin... |
9ae495438aa407cf95a14a45b30f735406d56cbf | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/mv_polynomial/cardinal.lean | 9ae2103150290c71b1d9ceaaab23f2b62b5d848a | [
"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 | 2,142 | lean | /-
Copyright (c) 2021 Chris Hughes, Junyan Xu. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Junyan Xu
-/
import data.mv_polynomial.equiv
import set_theory.cardinal.ordinal
/-!
# Cardinality of Multivariate Polynomial Ring
The main result in this file i... |
638053129e5e4c56cb63ae45379af06e8ab2b2d7 | acc85b4be2c618b11fc7cb3005521ae6858a8d07 | /logic/function.lean | e782dc9fd404e72399049d96115a7f1927551294 | [
"Apache-2.0"
] | permissive | linpingchuan/mathlib | d49990b236574df2a45d9919ba43c923f693d341 | 5ad8020f67eb13896a41cc7691d072c9331b1f76 | refs/heads/master | 1,626,019,377,808 | 1,508,048,784,000 | 1,508,048,784,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,512 | lean | /-
Copyright (c) 2016 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
Miscellaneous function constructions and lemmas.
-/
import logic.basic
universes u v
variables {α : Type u} {β : Type v} {f : α → β}
namespace functio... |
1d98e30514d7e293f575a5ff8eec8bca37423c34 | f3a5af2927397cf346ec0e24312bfff077f00425 | /src/game/world10/level9.lean | 7643b61ea226766226d4e47bb6135c0e0a3e1b8b | [
"Apache-2.0"
] | permissive | ImperialCollegeLondon/natural_number_game | 05c39e1586408cfb563d1a12e1085a90726ab655 | f29b6c2884299fc63fdfc81ae5d7daaa3219f9fd | refs/heads/master | 1,688,570,964,990 | 1,636,908,242,000 | 1,636,908,242,000 | 195,403,790 | 277 | 84 | Apache-2.0 | 1,694,547,955,000 | 1,562,328,792,000 | Lean | UTF-8 | Lean | false | false | 631 | lean | import game.world10.level8 -- hide
namespace mynat -- hide
/-
# Inequality world.
## Level 9: `le_total`
-/
/- Lemma
For all naturals $a$ and $b$, either $a\le b$ or $b\le a$.
-/
theorem le_total (a b : mynat) : a ≤ b ∨ b ≤ a :=
begin [nat_num_game]
revert a,
induction b with d hd,
intro a,
right,
... |
b3b06e50ffc0430694968b93fbba735b6e065971 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Std/Data/PersistentHashMap.lean | 85bbbb98d98b73f1f6c19b368d6ebc25597011f4 | [
"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 | 13,369 | 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
-/
namespace Std
universe u v w w'
namespace PersistentHashMap
inductive Entry (α : Type u) (β : Type v) (σ : Type w) where
| entry (key : α) (val : β) : E... |
e79e4501db137876880e774623e8b63c868d960e | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/order/lattice_intervals.lean | cae0393181ef7dfd4b492d8dfbfdcae914b0b76e | [
"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,806 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import order.bounded_lattice
import data.set.intervals.basic
/-!
# Intervals in Lattices
In this file, we provide instances of lattice structures on intervals with... |
6a3f2e9ea77ed2aa04b090969e99a24cbe5cae65 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/topology/category/Compactum.lean | 3b07c3437be69a3f341a55f297b1bda9538e9e59 | [
"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 | 17,246 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import category_theory.monad.types
import category_theory.monad.limits
import category_theory.equivalence
import topology.category.CompHaus
import data.set.constructions
/-... |
f235874eed1375ef30e150838913231833a4ba30 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/geometry/manifold/local_invariant_properties.lean | ff005836cf718e000381be7c033cfe272e44f0bc | [] | 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 | 27,351 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.geometry.manifold.smooth_manifold_with_corners
import Mathlib.PostPort
universes u_1... |
64edd0d0e4270080d16f05b795dd5f4eaffe5719 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/complex/abs_max.lean | 9c42071ab16b7b661e86b00fbc8de3897fe53184 | [
"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 | 22,019 | lean | /-
Copyright (c) 2022 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import analysis.complex.cauchy_integral
import analysis.convex.integral
import analysis.normed_space.completion
import analysis.normed_space.extr
import topol... |
1a4ddaa8a779162981966622d90c03adc5a0193d | 6fca17f8d5025f89be1b2d9d15c9e0c4b4900cbf | /src/game/world4/level2.lean | 54f961fc49df771345c775906a8f8982955c6ea2 | [
"Apache-2.0"
] | permissive | arolihas/natural_number_game | 4f0c93feefec93b8824b2b96adff8b702b8b43ce | 8e4f7b4b42888a3b77429f90cce16292bd288138 | refs/heads/master | 1,621,872,426,808 | 1,586,270,467,000 | 1,586,270,467,000 | 253,648,466 | 0 | 0 | null | 1,586,219,694,000 | 1,586,219,694,000 | null | UTF-8 | Lean | false | false | 277 | lean | import game.world4.level1 -- hide
namespace mynat -- hide
/-
# 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 [nat_num_game]
end
end mynat -- hide
|
9bbd93be6675b9b15ddf57e400e321e5931338f1 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/number_theory/modular_forms/slash_invariant_forms.lean | 98b6074ce71eef42d1645e322b05230cadcfe5d1 | [
"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 | 6,316 | lean | /-
Copyright (c) 2022 Chris Birkbeck. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Birkbeck
-/
import number_theory.modular_forms.slash_actions
/-!
# Slash invariant forms
This file defines functions that are invariant under a `slash_action` which forms the b... |
1b4c5ae665f5415898aca1eeb613fa685dd72af0 | 4bcaca5dc83d49803f72b7b5920b75b6e7d9de2d | /src/Lean/Parser/Extra.lean | af88d4416363e5ae095b190dcfa759d7d3ee0519 | [
"Apache-2.0"
] | permissive | subfish-zhou/leanprover-zh_CN.github.io | 30b9fba9bd790720bd95764e61ae796697d2f603 | 8b2985d4a3d458ceda9361ac454c28168d920d3f | refs/heads/master | 1,689,709,967,820 | 1,632,503,056,000 | 1,632,503,056,000 | 409,962,097 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,131 | 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, Sebastian Ullrich
-/
import Lean.Parser.Extension
-- necessary for auto-generation
import Lean.PrettyPrinter.Parenthesizer
import Lean.PrettyPrinter.Formatter... |
8dd4f7b945e9fca88c7aff7119136f72de6b5430 | 88fb7558b0636ec6b181f2a548ac11ad3919f8a5 | /tests/lean/run/elab_crash1.lean | ffcd4d9816a4f9417885be6e0e50df41e43c16f0 | [
"Apache-2.0"
] | permissive | moritayasuaki/lean | 9f666c323cb6fa1f31ac597d777914aed41e3b7a | ae96ebf6ee953088c235ff7ae0e8c95066ba8001 | refs/heads/master | 1,611,135,440,814 | 1,493,852,869,000 | 1,493,852,869,000 | 90,269,903 | 0 | 0 | null | 1,493,906,291,000 | 1,493,906,291,000 | null | UTF-8 | Lean | false | false | 321 | lean | open expr tactic
meta definition to_expr_target (a : pexpr) : tactic expr :=
do tgt ← target,
to_expr `((%%a : %%tgt))
example (A : Type) (a : A) : A :=
by do to_expr_target `(sorry) >>= exact
example (A : Type) (a : A) : A :=
by do refine `(sorry)
example (a : nat) : nat :=
by do to_expr `(nat.zero) >>= exact
|
d66a78d6019212fdf74a5e460d36426e98905c66 | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /library/theories/group_theory/hom.lean | e13ae3f9f60e8dbca589f3caade4d307e493b38c | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,140 | lean | /-
Copyright (c) 2015 Haitao Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author : Haitao Zhang
-/
import algebra.group data.set .subgroup
namespace group
open algebra
-- ⁻¹ in eq.ops conflicts with group ⁻¹
-- open eq.ops
notation H1 ▸ H2 := eq.subst H1 H2
open set... |
d9c4a47ee5350ce512d3f0397cb7bce948784377 | ea80d7bb31b9673a3a06d5148363b44b66c53796 | /thys/core/pre.lean | 36c40364956bad438b1833c9db1f8346f40318f4 | [] | no_license | gitter-badger/electrolysis | 2a59d6e0fe1b6629a14a1202e31b1a8ff1c93ced | 4f63846e817cb52bdac4ae65ef3d17634e6ffc36 | refs/heads/master | 1,608,825,996,259 | 1,467,154,609,000 | 1,467,154,609,000 | 62,184,345 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,113 | lean | import data.nat data.list
import move
open bool
open eq.ops
open int
open nat
open option
open [notation] partial
open prod
open prod.ops
open sum
open option
notation `do` binder ` ← ` x `; ` r:(scoped f, option.bind f x) := r
open [class] classical
-- a general loop combinator for separating tail-recursive defi... |
02b32e2c144d7ead62f690707eea035d82aa266c | 67190c9aacc0cac64fb4463d93e84c696a5be896 | /Classes/2019-10-17.lean | 0b25e80e1d48c3476cf93d41f54231b4df5549bf | [] | 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 | 740 | lean | variable U : Type
variables A B C : set U
example : ∀ x, x ∈ A ∩ C → x ∈ A ∪ B :=
begin
assume x,
intro,
have h1, from a.left,
exact or.inl h1,
end
example : ∀ x, x ∈ A ∩ C → x ∈ A ∪ B :=
assume x,
show x ∈ A ∩ C → x ∈ A ∪ B, from
assume h1 : x ∈ A ∩ C,
... |
dbf23cae02d3a6ad0c9cb39b333eb9b626dcf218 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/fib_wrec.lean | 9272cf85c0d66e08740c935d3b7c866562b80583 | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 965 | lean | open nat
definition fib.F (n : nat) : (Π (m : nat), m < n → nat) → nat :=
nat.cases_on n
(λ (f : Π (m : nat), m < 0 → nat), succ 0)
(λ (n₁ : nat), nat.cases_on n₁
(λ (f : Π (m : nat), m < (succ 0) → nat), succ 0)
(λ (n₂ : nat) (f : Π (m : nat), m < (succ (succ n₂)) → nat),
have l₁ : succ n₂ < succ (... |
8d1ee046c56fc319d2dfd8327727771f1ed2dc6f | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/order/antisymmetrization.lean | ca73c3d0b8a098e9a5ccc763f0049faaa250372b | [
"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 | 9,188 | 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.hom.basic
import logic.relation
/-!
# Turning a preorder into a partial order
This file allows to make a preorder into a partial order by quotienting out t... |
23890139d2820f2ee21d479dca18dd250908eb0e | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/group_theory/commensurable.lean | 73e3da604faba37793798c63f26ac77d3cf2d8c9 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 4,182 | lean | /-
Copyright (c) 2021 Chris Birkbeck. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Birkbeck
-/
import group_theory.index
import group_theory.subgroup.pointwise
import group_theory.group_action.conj_act
/-!
# Commensurability for subgroups
This file defines com... |
92ae45d0206e39e00283e4dd79d85f4407092abe | 4fa161becb8ce7378a709f5992a594764699e268 | /src/data/seq/computation.lean | 48a71dde3c303b73a79eb38117594716eed32614 | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 37,548 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Coinductive formalization of unbounded computations.
-/
import data.stream
import tactic.basic
universes u v w
/-
coinductive computation (α : Type u) : Type u
|... |
9647a196233f2c835c675c4763ee6f460cde2a51 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/topology/algebra/uniform_group.lean | 32e163dcd874b3c81cae91958eba013845fc8967 | [
"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 | 18,134 | 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.uniform_space.uniform_embedding
import topology.uniform_space.complete_separated
import topology.algebra.group
import tactic.abel
/-!... |
aa18191ab0c57a01ab4c32dba239031021b7647f | 5c5878e769950eabe897ad08485b3ba1a619cea9 | /src/categories/tactics/default.lean | a55e47fb57fb4877e5d15a4a73741aff86ccf820 | [
"Apache-2.0"
] | permissive | semorrison/lean-category-theory-pr | 39dc2077fcb41b438e61be1685e4cbca298767ed | 7adc8d91835e883db0fe75aa33661bc1480dbe55 | refs/heads/master | 1,583,748,682,010 | 1,535,111,040,000 | 1,535,111,040,000 | 128,731,071 | 1 | 2 | Apache-2.0 | 1,528,069,880,000 | 1,523,258,452,000 | Lean | UTF-8 | Lean | false | false | 502 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Stephen Morgan, Scott Morrison
import tidy.at_least_one
import tidy.backwards_reasoning
import tidy.rewrite_all
import tidy.injections
import tidy.tidy
import tidy.transport
im... |
c3e1fddc08ba3ad3ffc91eb0b134b9de967571be | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/calculus/fderiv_symmetric.lean | a21d6ab8b1df8a1ca366f762faa7002f4a2dc5a9 | [
"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 | 19,113 | lean | /-
Copyright (c) 2021 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.deriv
import analysis.calculus.mean_value
import analysis.convex.topology
/-!
# Symmetry of the second derivative
We show that, over ... |
cf6bb00380b4ec232cc658b872005e5671bc2137 | 367134ba5a65885e863bdc4507601606690974c1 | /src/ring_theory/hahn_series.lean | 550870712abd4c8b492a77bee2b2c6d12136e6a7 | [
"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 | 21,417 | lean | /-
Copyright (c) 2021 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import order.well_founded_set
import algebra.big_operators
import algebra.module.pi
import ring_theory.power_series.basic
/-!
# Hahn Series
## Main Definitions
* ... |
a099e3ddc57371c766b14805ada036b6e08b2466 | d436468d80b739ba7e06843c4d0d2070e43448e5 | /src/ring_theory/maps.lean | 2ccb657793b57c65cd76131cffa9620561957e7e | [
"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 | 5,103 | lean | /-
Copyright (c) 2018 Andreas Swerdlow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andreas Swerdlow, Kenny Lau
-/
import data.equiv.algebra
/-!
# Ring antihomomorphisms, isomorphisms, antiisomorphisms and involutions
This file defines ring antihomomorphisms, a... |
ad9d1dc518102d7f8ef4a0372f1e07f237a8d23d | b2fe74b11b57d362c13326bc5651244f111fa6f4 | /src/dynamics/circle/rotation_number/translation_number.lean | 7ba9233bed8d210a582539d65045886c91aced56 | [
"Apache-2.0"
] | permissive | midfield/mathlib | c4db5fa898b5ac8f2f80ae0d00c95eb6f745f4c7 | 775edc615ecec631d65b6180dbcc7bc26c3abc26 | refs/heads/master | 1,675,330,551,921 | 1,608,304,514,000 | 1,608,304,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 39,629 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury G. Kudryashov
-/
import analysis.specific_limits
import order.iterate
import order.semiconj_Sup
import algebra.iterate_hom
/-!
# Translation number of a monotone real map that... |
f03fffef19c0c1718ef158db59649239ecad27da | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/Attributes.lean | d0f3cc911bd6ab13d52c400c6e95f7e418c8a9ac | [
"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 | 19,641 | 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.Syntax
import Lean.CoreM
import Lean.ResolveName
namespace Lean
inductive AttributeApplicationTime where
| afterTypeChecking | afterCompilat... |
a6c62d4cdd3846bcb7a4ffabaa017d0ea06b58fe | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/pi/lex.lean | a6f2d78919bc6ca8671a22fd041bc5ee3cb29aef | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 8,756 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import order.well_founded
import algebra.group.pi
import algebra.order.group.defs
/-!
# Lexicographic order on Pi types
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> An... |
bf6fd87e97ecd230e7bd6a6c588cb43f48e6f5d9 | 36c7a18fd72e5b57229bd8ba36493daf536a19ce | /library/data/int/order.lean | e88f5c4a8c850c58256a6cee49b66e51a16cfd1a | [
"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 | 17,799 | lean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Jeremy Avigad
The order relation on the integers. We show that int is an instance of linear_comm_ordered_ring
and transfer the results.
-/
import .basic algebra.or... |
f97cad6e5d4a49b763c25bd5dcf7328e8d6443e0 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/probability/cond_count.lean | 97ec5c4acea2ba728820ed4cbf54a4c09b52d08c | [
"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 | 8,351 | lean | /-
Copyright (c) 2022 Kexing Ying. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kexing Ying, Bhavik Mehta
-/
import probability.conditional_probability
/-!
# Classical probability
The classical formulation of probability states that the probability of an event occu... |
eb41fad4ae674505c58a8845c8c381f84bcccd32 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/tactic22.lean | a6623c176256cbb53f15d10e1d5fe5875d02b7e4 | [
"Apache-2.0"
] | permissive | silky/lean | 79c20c15c93feef47bb659a2cc139b26f3614642 | df8b88dca2f8da1a422cb618cd476ef5be730546 | refs/heads/master | 1,610,737,587,697 | 1,406,574,534,000 | 1,406,574,534,000 | 22,362,176 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 181 | lean | import standard
using tactic
theorem T (a b c d : Prop) (Ha : a) (Hb : b) (Hc : c) (Hd : d) : a ∧ b ∧ c ∧ d
:= by fixpoint (λ f, [apply @and_intro; f | assumption; f | id])
|
ff38a596c95f499b6d93ab9cb6e2d54a51b3904f | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/revert_err.lean | 981a83348baed569fa7a4b12dc254188b625d3f2 | [
"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 | 136 | lean | open tactic
example (a b : Prop) : true :=
by do to_expr ```(a ∧ b) >>= revert
example {α : Type} {a : α} : true :=
by revert a a
|
a3db70f655453408d43b98ebd2d1a5d9871cf031 | 0c1546a496eccfb56620165cad015f88d56190c5 | /library/init/meta/async_tactic.lean | 31f486d4d0b46b27411181074348ec2338ea96b3 | [
"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 | 1,952 | lean | prelude
import init.meta.tactic
import init.meta.interactive
namespace tactic
private meta def run_or_fail {α} (s : tactic_state) (tac : tactic α) : α :=
match tac s with
| (tactic_result.success a s) := a
| (tactic_result.exception .α fmt _ s') :=
undefined_core $ to_string $ fmt () ++ format.line ++ to_fmt s'
end... |
3256dd9f39d4335f5e9d14b74b6e611735cc24d6 | 037dba89703a79cd4a4aec5e959818147f97635d | /src/2022/functions/sheet1.lean | 10210e39c127c790db5ccb30a2b775dec1849652 | [] | no_license | ImperialCollegeLondon/M40001_lean | 3a6a09298da395ab51bc220a535035d45bbe919b | 62a76fa92654c855af2b2fc2bef8e60acd16ccec | refs/heads/master | 1,666,750,403,259 | 1,665,771,117,000 | 1,665,771,117,000 | 209,141,835 | 115 | 12 | null | 1,640,270,596,000 | 1,568,749,174,000 | Lean | UTF-8 | Lean | false | false | 3,506 | lean | /-
Copyright (c) 2022 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author : Kevin Buzzard
-/
import tactic -- imports all the Lean tactics
/-!
# Functions in Lean.
In this sheet we'll learn how to manipulate the concepts of
injectivity and surjectivity in ... |
89f5111649751ed8fc26aa2c420dcccd8f1256bb | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/data/nat/fib.lean | 0694d631ed87d1be964a812dc60f539848a69548 | [
"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 | 3,326 | lean | /-
Copyright (c) 2019 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import data.stream.basic
import tactic.norm_num
import tactic.monotonicity
/-!
# The Fibonacci Sequence
## Summary
Definition of the Fibonacci sequence `F₀ = 0,... |
4d58b3bd4c1f870be4be10eb575edeecea50d35f | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/section1.lean | 5f34e4f246c07b7f3ee983bb1f6435b790301ee4 | [
"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 | 212 | lean | open tactic
section
set_option pp.universes true
set_option pp.implicit true
variable {A : Type}
variables {a b : A}
variable H : a = b
variables H1 H2 : b = a
check H1
check H
check H2
end
|
2f798eac6bd2f96f1d1295a67a44f0a95d459850 | fbef61907e2e2afef7e1e91395505ed27448a945 | /LeanProtocPlugin/Helpers.lean | ebf061f22852a9d0101d84f411128924d1e9d629 | [
"MIT"
] | permissive | yatima-inc/Protoc.lean | 7edecca1f5b33909e6dfef1bcebcbbf9a322ca8c | 3ad7839ec911906e19984e5b60958ee9c866b7ec | refs/heads/master | 1,682,196,995,576 | 1,620,507,180,000 | 1,620,507,180,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,978 | lean | import AssertCmd
import Std.Data.RBTree
import Std.Data.RBMap
import Init.System.IO
instance : MonadLift (Except ε) (EIO ε) :=
⟨fun e => match e with | Except.ok r => pure r | Except.error e => fun s => EStateM.Result.error e s ⟩
def String.toCamelCase (s: String) (firstCap : Bool) : String := do
let mut newStrin... |
3846d4ebc24fa31c91e7b0bcf2f6bf9051f7ff02 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/ring_theory/localization.lean | a20cfa4ff763f7ab597601fdf29a7087bcd0c246 | [
"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 | 49,253 | 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 tactic.ring_exp
import ring_theory.ideal_operations
import group_theory.monoid_localization
im... |
75a56c3e787711de33a7ee6552865cfdf5b203e5 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/analysis/normed_space/multilinear.lean | 9b82b9a39dd3a2d603d3a3bcd71a84f0a1d288aa | [] | 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 | 66,806 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.analysis.normed_space.operator_norm
import Mathlib.topology.algebra.multilinear
impor... |
fc57dfae34fa5b177f9c2651903898a085870dec | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/interactive/complete_tactic.lean | c71884676b0241d9569febac1fd65d9e5648dc46 | [
"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 | 175 | lean | example := by assumption
--^ "command": "complete", "skip_completions": true
example := begin
--^ "command": "complete", "skip_completions": true
|
04ce2feae3523f77bddd4abfebd4ecf382a82484 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/algebraic_independent.lean | e6dbfbfd6aaaae83b9036c26a47886c94ac58464 | [
"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 | 21,998 | lean | /-
Copyright (c) 2021 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import ring_theory.adjoin.basic
import linear_algebra.linear_independent
import ring_theory.mv_polynomial.basic
import data.mv_polynomial.supported
import ring_theory.alg... |
f2f76eeaa67c45ab23f4c769b0e2693467a8776f | 36938939954e91f23dec66a02728db08a7acfcf9 | /lean/deps/typed_smt2/src/galois/smt2/cmd.lean | acf6ddf71f43fda92c1cc6584e2adeab46af8c10 | [
"Apache-2.0"
] | permissive | pnwamk/reopt-vcg | f8b56dd0279392a5e1c6aee721be8138e6b558d3 | c9f9f185fbefc25c36c4b506bbc85fd1a03c3b6d | refs/heads/master | 1,631,145,017,772 | 1,593,549,019,000 | 1,593,549,143,000 | 254,191,418 | 0 | 0 | null | 1,586,377,077,000 | 1,586,377,077,000 | null | UTF-8 | Lean | false | false | 1,285 | lean | import .basic
namespace smt2
/-- An SMT command -/
structure cmd :=
(expr : sexpr atom)
namespace cmd
open sort
/-- Write command to a handle. -/
protected
def write (c:cmd) (h:io.handle) : io punit := sexpr.write h (c.expr)
/-- Construct assert command. -/
protected
def assert (p:term Bool) : cmd := ⟨sexpr.app (r... |
21936329dedfc9e89ac8e4692d6cc26f450766d1 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/control/traversable/basic.lean | e11e66dba7c9bb85c9cfa4bb5c268092d42ddb08 | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 9,542 | 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 control.functor
/-!
# Traversable type class
Type classes for traversing collections. The concepts and laws are taken from
<http://hackage.haskell.org/package/base... |
e72973d0e56e430d612f9124de0b03138e223076 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/normed_space/hahn_banach/extension.lean | 74898d0c531cac01c2b561b36db4ab26d34ce40e | [
"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,818 | lean | /-
Copyright (c) 2020 Yury Kudryashov All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Heather Macbeth
-/
import analysis.convex.cone.basic
import analysis.normed_space.is_R_or_C
import analysis.normed_space.extend
/-!
# Extension Hahn-Banach theorem
I... |
ba968699b967c3b4298926ad6efca71746d01c9b | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/ring/ulift.lean | c16e7a9fcac81fb17dc370fd5f72de89fdb1901d | [
"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 | 5,177 | 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 algebra.group.ulift
import algebra.field.defs
import algebra.ring.equiv
/-!
# `ulift` instances for ring
This file defines instances for ring, semiring and r... |
49c84a0f507abc7f02aa5336d2b89a2c5d112dfb | 5412d79aa1dc0b521605c38bef9f0d4557b5a29d | /src/Lean/Server/FileWorker.lean | 186cbf59e48c4bf18246e07d07039217c9fe3f6e | [
"Apache-2.0"
] | permissive | smunix/lean4 | a450ec0927dc1c74816a1bf2818bf8600c9fc9bf | 3407202436c141e3243eafbecb4b8720599b970a | refs/heads/master | 1,676,334,875,188 | 1,610,128,510,000 | 1,610,128,521,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 21,177 | lean | /-
Copyright (c) 2020 Marc Huisinga. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Marc Huisinga, Wojciech Nawrocki
-/
import Init.System.IO
import Std.Data.RBMap
import Lean.Environment
import Lean.PrettyPrinter
import Lean.Data.Lsp
import Lean.Data.Json.FromToJso... |
cb1c3d137518b9875b4d4629783edf0c1190b795 | 94935fb4ab68d4ce640296d02911624a93282575 | /src/solutions/wednesday/morning/structures.lean | 3650dc12cf2f3fb04e0be7fd8bf1f4fe68352470 | [] | permissive | marius-leonhardt/lftcm2020 | 41c0d7fe3457c1cf3b72cbb1c312b48fc94b85d2 | a3eb53f18d9be9a5be748dfe8fe74d0d31a0c1f7 | refs/heads/master | 1,668,623,789,936 | 1,594,710,949,000 | 1,594,710,949,000 | 279,514,936 | 0 | 0 | MIT | 1,594,711,916,000 | 1,594,711,916,000 | null | UTF-8 | Lean | false | false | 11,761 | lean | import data.rat.basic
import algebra.group.prod
import tactic.basic
/-!
Lecture 1:
* Use one structure as a running example, probably `equiv` or `embedding`.
* Declaring a structure
* name, arguments, type, fields
* Using a structure
* Using projections (without and with the `open` command)
* projection notation... |
42d30a556e1d44f38b37ac8195dae361ac85e765 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/analysis/calculus/iterated_deriv.lean | 0697e0d563d291b6b79a4408dc99482a3f01c199 | [
"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 | 14,614 | 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.calculus.deriv
import analysis.calculus.times_cont_diff
/-!
# One-dimensional iterated derivatives
We define the `n`-th derivative of a functi... |
8e750e0e96ff3a5f83c06aa4ed83d81c1a2fffd6 | 1a61aba1b67cddccce19532a9596efe44be4285f | /hott/types/trunc.hlean | f35de985d9fb25c6bae871c96f10ae2d12c2435a | [
"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 | 9,917 | hlean | /-
Copyright (c) 2015 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
Properties of is_trunc and trunctype
-/
-- NOTE: the fact that (is_trunc n A) is a mere proposition is proved in .hprop_trunc
import types.pi types.eq types.equiv... |
149df414d17b25170b052ee483f3aaf1f5e831bc | c777c32c8e484e195053731103c5e52af26a25d1 | /src/ring_theory/perfection.lean | 61ace5ec6eb2258855e3286a4a4975bccd79db09 | [
"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 | 25,477 | 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.char_p.pi
import algebra.char_p.quotient
import algebra.char_p.subring
import algebra.ring.pi
import analysis.special_functions.pow
import field_theory.perfect_... |
705529d75bdc47b606f0728ae3a84715bf73d67e | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/shadow1.lean | c38fba1b77a25d309cdef6ef2afef4cb8fa544d1 | [
"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 | 480 | lean | variable a : nat
definition f : nat → nat
| (nat.succ a) := a
| nat.zero := nat.zero
example : f 3 = 2 :=
rfl
definition g : nat → nat
| a := a
example (a : nat) : g a = a :=
rfl
definition h (a : nat) : nat → nat
| a := a
example (a b : nat) : h a b = b :=
rfl
definition o : nat := zero
definition f2 : nat... |
d045ab3d0c4d03355a6ddd85e59ee3cf749e7535 | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/data/set/finite.lean | fa615080222604dc2cc8bede54cab27e438f6449 | [
"Apache-2.0"
] | permissive | khoek/mathlib | bc49a842910af13a3c372748310e86467d1dc766 | aa55f8b50354b3e11ba64792dcb06cccb2d8ee28 | refs/heads/master | 1,588,232,063,837 | 1,587,304,803,000 | 1,587,304,803,000 | 176,688,517 | 0 | 0 | Apache-2.0 | 1,553,070,585,000 | 1,553,070,585,000 | null | UTF-8 | Lean | false | false | 23,636 | 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
Finite sets.
-/
import logic.function
import data.nat.basic data.fintype.basic data.set.lattice data.set.function
import algebra.big_operators
open set... |
9e67e3a005504b53934ab0a824b3fef982059a15 | 02005f45e00c7ecf2c8ca5db60251bd1e9c860b5 | /src/data/padics/ring_homs.lean | 506b6d1be930a21af4529d4c8e5603ea9ee26996 | [
"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 | 24,645 | lean | /-
Copyright (c) 2020 Johan Commelin and Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin and Robert Y. Lewis
-/
import data.padics.padic_integers
/-!
# Relating `ℤ_[p]` to `zmod (p ^ n)`
In this file we establish connections between t... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.