Loogle!
Result
Found 3357 declarations mentioning Fact. Of these, only the first 200 are shown.
- Fact π Mathlib.Basic.Logic.Basic
(p : Prop) : Prop - Fact.elim π Mathlib.Basic.Logic.Basic
{p : Prop} (h : Fact p) : p - Fact.mk π Mathlib.Basic.Logic.Basic
{p : Prop} (out : p) : Fact p - Fact.out π Mathlib.Basic.Logic.Basic
{p : Prop} [self : Fact p] : p - fact_iff π Mathlib.Basic.Logic.Basic
{p : Prop} : Fact p β p - instDecidableFact π Mathlib.Basic.Logic.Basic
{p : Prop} [Decidable p] : Decidable (Fact p) - ZeroLEOneClass.factZeroLeOne π Mathlib.Algebra.Order.ZeroLEOne
{Ξ± : Type u_1} [Zero Ξ±] [One Ξ±] [LE Ξ±] [ZeroLEOneClass Ξ±] : Fact (0 β€ 1) - ZeroLEOneClass.factZeroLtOne π Mathlib.Algebra.Order.ZeroLEOne
{Ξ± : Type u_1} [Zero Ξ±] [One Ξ±] [PartialOrder Ξ±] [ZeroLEOneClass Ξ±] [NeZero 1] : Fact (0 < 1) - NeZero.of_gt' π Mathlib.Algebra.Order.IsBotOne
{Ξ± : Type u_1} {a : Ξ±} [Zero Ξ±] [Preorder Ξ±] [IsBotZeroClass Ξ±] [One Ξ±] [Fact (1 < a)] : NeZero a - Set.Icc.instBoundedOrderElemOfFactLe π Mathlib.Order.LatticeIntervals
{Ξ± : Type u_1} {a b : Ξ±} [Preorder Ξ±] [Fact (a β€ b)] : BoundedOrder β(Set.Icc a b) - Set.Icc.instOrderBotElemOfFactLe π Mathlib.Order.LatticeIntervals
{Ξ± : Type u_1} {a b : Ξ±} [Preorder Ξ±] [Fact (a β€ b)] : OrderBot β(Set.Icc a b) - Set.Icc.instOrderTopElemOfFactLe π Mathlib.Order.LatticeIntervals
{Ξ± : Type u_1} {a b : Ξ±} [Preorder Ξ±] [Fact (b β€ a)] : OrderTop β(Set.Icc b a) - Set.Ico.orderBot π Mathlib.Order.LatticeIntervals
{Ξ± : Type u_1} [PartialOrder Ξ±] {a b : Ξ±} [Fact (a < b)] : OrderBot β(Set.Ico a b) - Set.Ioc.orderTop π Mathlib.Order.LatticeIntervals
{Ξ± : Type u_1} [PartialOrder Ξ±] {a b : Ξ±} [Fact (b < a)] : OrderTop β(Set.Ioc b a) - Set.Icc.coe_bot π Mathlib.Order.LatticeIntervals
{Ξ± : Type u_1} [Preorder Ξ±] (a b : Ξ±) [Fact (a β€ b)] : ββ₯ = a - Set.Icc.coe_top π Mathlib.Order.LatticeIntervals
{Ξ± : Type u_1} [Preorder Ξ±] (a b : Ξ±) [Fact (b β€ a)] : ββ€ = a - Set.Ico.coe_bot π Mathlib.Order.LatticeIntervals
{Ξ± : Type u_1} [PartialOrder Ξ±] (a b : Ξ±) [Fact (a < b)] : ββ₯ = a - Set.Ioc.coe_top π Mathlib.Order.LatticeIntervals
{Ξ± : Type u_1} [PartialOrder Ξ±] (a b : Ξ±) [Fact (b < a)] : ββ€ = a - Set.Ico.disjoint_iff π Mathlib.Order.LatticeIntervals
{Ξ± : Type u_1} [SemilatticeInf Ξ±] {a b : Ξ±} [Fact (a < b)] {x y : β(Set.Ico a b)} : Disjoint x y β βx β βy = a - Set.Ioc.codisjoint_iff π Mathlib.Order.LatticeIntervals
{Ξ± : Type u_1} [SemilatticeSup Ξ±] {a b : Ξ±} [Fact (b < a)] {x y : β(Set.Ioc b a)} : Codisjoint x y β βx β βy = a - Set.Icc.codisjoint_iff π Mathlib.Order.LatticeIntervals
{Ξ± : Type u_1} {a b : Ξ±} [SemilatticeSup Ξ±] [Fact (b β€ a)] {x y : β(Set.Icc b a)} : Codisjoint x y β βx β βy = a - Set.Icc.disjoint_iff π Mathlib.Order.LatticeIntervals
{Ξ± : Type u_1} {a b : Ξ±} [SemilatticeInf Ξ±] [Fact (a β€ b)] {x y : β(Set.Icc a b)} : Disjoint x y β βx β βy = a - Set.Icc.isCompl_iff π Mathlib.Order.LatticeIntervals
{Ξ± : Type u_1} {a b : Ξ±} [Lattice Ξ±] [Fact (a β€ b)] {x y : β(Set.Icc a b)} : IsCompl x y β βx β βy = a β§ βx β βy = b - Set.Icc.completeLattice π Mathlib.Order.CompleteLatticeIntervals
{Ξ± : Type u_2} [ConditionallyCompleteLattice Ξ±] {a b : Ξ±} [Fact (a β€ b)] : CompleteLattice β(Set.Icc a b) - instCompleteLinearOrderElemIccOfFactLe π Mathlib.Order.CompleteLatticeIntervals
{Ξ± : Type u_2} [ConditionallyCompleteLinearOrder Ξ±] {a b : Ξ±} [Fact (a β€ b)] : CompleteLinearOrder β(Set.Icc a b) - Set.Icc.coe_iInf π Mathlib.Order.CompleteLatticeIntervals
{ΞΉ : Sort u_1} {Ξ± : Type u_2} [ConditionallyCompleteLattice Ξ±] {a b : Ξ±} (h : a β€ b) [Nonempty ΞΉ] {S : ΞΉ β β(Set.Icc a b)} : have this := β―; β(iInf S) = β¨ i, β(S i) - Set.Icc.coe_iSup π Mathlib.Order.CompleteLatticeIntervals
{ΞΉ : Sort u_1} {Ξ± : Type u_2} [ConditionallyCompleteLattice Ξ±] {a b : Ξ±} (h : a β€ b) [Nonempty ΞΉ] {S : ΞΉ β β(Set.Icc a b)} : have this := β―; β(iSup S) = β¨ i, β(S i) - Set.Icc.coe_sInf π Mathlib.Order.CompleteLatticeIntervals
{Ξ± : Type u_2} [ConditionallyCompleteLattice Ξ±] {a b : Ξ±} (h : a β€ b) {S : Set β(Set.Icc a b)} (hS : S.Nonempty) : have this := β―; β(sInf S) = sInf (Subtype.val '' S) - Set.Icc.coe_sSup π Mathlib.Order.CompleteLatticeIntervals
{Ξ± : Type u_2} [ConditionallyCompleteLattice Ξ±] {a b : Ξ±} (h : a β€ b) {S : Set β(Set.Icc a b)} (hS : S.Nonempty) : have this := β―; β(sSup S) = sSup (Subtype.val '' S) - IsModularLattice.complementedLattice_Icc π Mathlib.Order.ModularLattice
{Ξ± : Type u_1} [Lattice Ξ±] [IsModularLattice Ξ±] {a b : Ξ±} [BoundedOrder Ξ±] [ComplementedLattice Ξ±] [Fact (a β€ b)] : ComplementedLattice β(Set.Icc a b) - Cardinal.fact_isRegular_aleph0 π Mathlib.SetTheory.Cardinal.Regular
: Fact Cardinal.aleph0.IsRegular - FiniteDimensional.of_fact_finrank_eq_two π Mathlib.LinearAlgebra.FiniteDimensional.Defs
{K : Type u} {V : Type v} [DivisionRing K] [AddCommGroup V] [Module K V] [Fact (Module.finrank K V = 2)] : FiniteDimensional K V - FiniteDimensional.of_fact_finrank_eq_succ π Mathlib.LinearAlgebra.FiniteDimensional.Defs
{K : Type u} {V : Type v} [DivisionRing K] [AddCommGroup V] [Module K V] (n : β) [hn : Fact (Module.finrank K V = n + 1)] : FiniteDimensional K V - Nat.fact_prime_three π Mathlib.Data.Nat.Prime.Defs
: Fact (Nat.Prime 3) - Nat.fact_prime_two π Mathlib.Data.Nat.Prime.Defs
: Fact (Nat.Prime 2) - Nat.Prime.one_lt' π Mathlib.Data.Nat.Prime.Defs
(p : β) [hp : Fact (Nat.Prime p)] : Fact (1 < p) - expChar_prime π Mathlib.Algebra.CharP.Defs
(R : Type u_1) [AddMonoidWithOne R] (p : β) [CharP R p] [Fact (Nat.Prime p)] : ExpChar R p - CharP.char_is_prime_of_pos π Mathlib.Algebra.CharP.Defs
(R : Type u_1) [NonAssocSemiring R] [NoZeroDivisors R] [Nontrivial R] (p : β) [NeZero p] [CharP R p] : Fact (Nat.Prime p) - CharP.exists' π Mathlib.Algebra.CharP.Defs
(R : Type u_2) [NonAssocRing R] [NoZeroDivisors R] [Nontrivial R] : CharZero R β¨ β p, Fact (Nat.Prime p) β§ CharP R p - CharP.neg_one_ne_one π Mathlib.Algebra.CharP.Defs
(R : Type u_1) [AddGroupWithOne R] (p : β) [CharP R p] [Fact (2 < p)] : -1 β 1 - Function.minimalPeriod_eq_prime π Mathlib.Dynamics.PeriodicPts.Lemmas
{Ξ± : Type u_1} {f : Ξ± β Ξ±} {x : Ξ±} {p : β} [hp : Fact (Nat.Prime p)] (hper : Function.IsPeriodicPt f p x) (hfix : Β¬Function.IsFixedPt f x) : Function.minimalPeriod f x = p - Function.minimalPeriod_eq_prime_iff π Mathlib.Dynamics.PeriodicPts.Lemmas
{Ξ± : Type u_1} {f : Ξ± β Ξ±} {x : Ξ±} {p : β} [hp : Fact (Nat.Prime p)] : Function.minimalPeriod f x = p β Function.IsPeriodicPt f p x β§ Β¬Function.IsFixedPt f x - Function.minimalPeriod_eq_prime_pow π Mathlib.Dynamics.PeriodicPts.Lemmas
{Ξ± : Type u_1} {f : Ξ± β Ξ±} {x : Ξ±} {p k : β} [hp : Fact (Nat.Prime p)] (hk : Β¬Function.IsPeriodicPt f (p ^ k) x) (hk1 : Function.IsPeriodicPt f (p ^ (k + 1)) x) : Function.minimalPeriod f x = p ^ (k + 1) - addOrderOf_eq_prime π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddMonoid G] {x : G} {p : β} [hp : Fact (Nat.Prime p)] (hg : p β’ x = 0) (hg1 : x β 0) : addOrderOf x = p - orderOf_eq_prime π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {p : β} [hp : Fact (Nat.Prime p)] (hg : x ^ p = 1) (hg1 : x β 1) : orderOf x = p - addOrderOf_eq_prime_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddMonoid G] {x : G} {p : β} [hp : Fact (Nat.Prime p)] : addOrderOf x = p β p β’ x = 0 β§ x β 0 - orderOf_eq_prime_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {p : β} [hp : Fact (Nat.Prime p)] : orderOf x = p β x ^ p = 1 β§ x β 1 - exists_addOrderOf_eq_prime_pow_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddMonoid G] {x : G} {p : β} [hp : Fact (Nat.Prime p)] : (β k, addOrderOf x = p ^ k) β β m, p ^ m β’ x = 0 - exists_orderOf_eq_prime_pow_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {p : β} [hp : Fact (Nat.Prime p)] : (β k, orderOf x = p ^ k) β β m, x ^ p ^ m = 1 - charP_of_prime_pow_injective π Mathlib.GroupTheory.OrderOfElement
(R : Type u_6) [Ring R] [Fintype R] (p n : β) [hp : Fact (Nat.Prime p)] (hn : Fintype.card R = p ^ n) (hR : β i β€ n, βp ^ i = 0 β i = n) : CharP R (p ^ n) - addOrderOf_eq_prime_pow π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddMonoid G] {x : G} {n p : β} [hp : Fact (Nat.Prime p)] (hnot : Β¬p ^ n β’ x = 0) (hfin : p ^ (n + 1) β’ x = 0) : addOrderOf x = p ^ (n + 1) - orderOf_eq_prime_pow π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {n p : β} [hp : Fact (Nat.Prime p)] (hnot : Β¬x ^ p ^ n = 1) (hfin : x ^ p ^ (n + 1) = 1) : orderOf x = p ^ (n + 1) - ZMod.nontrivial π Mathlib.Data.ZMod.Basic
(n : β) [Fact (1 < n)] : Nontrivial (ZMod n) - ZMod.val_one π Mathlib.Data.ZMod.Basic
(n : β) [Fact (1 < n)] : ZMod.val 1 = 1 - ZMod.val_pow_le π Mathlib.Data.ZMod.Basic
{m n : β} [Fact (1 < n)] {a : ZMod n} : (a ^ m).val β€ a.val ^ m - ZMod.neg_one_ne_one π Mathlib.Data.ZMod.Basic
{n : β} [Fact (2 < n)] : -1 β 1 - ZMod.val_pow π Mathlib.Data.ZMod.Basic
{m n : β} {a : ZMod n} [ilt : Fact (1 < n)] (h : a.val ^ m < n) : (a ^ m).val = a.val ^ m - padicValNat_def π Mathlib.NumberTheory.Padics.PadicVal.Defs
{p : β} [hp : Fact (Nat.Prime p)] {n : β} (hn : n β 0) : padicValNat p n = multiplicity p n - padicValNat_eq_emultiplicity π Mathlib.NumberTheory.Padics.PadicVal.Defs
{p : β} [hp : Fact (Nat.Prime p)] {n : β} (hn : n β 0) : β(padicValNat p n) = emultiplicity p n - padicValNat.maxPowDiv_eq_emultiplicity π Mathlib.NumberTheory.Padics.PadicVal.Defs
{p : β} [hp : Fact (Nat.Prime p)] {n : β} (hn : n β 0) : β(padicValNat p n) = emultiplicity p n - neg_one_pow_char π Mathlib.Algebra.CharP.Lemmas
(R : Type u_1) [Ring R] (p : β) [hp : Fact (Nat.Prime p)] [CharP R p] : (-1) ^ p = -1 - add_pow_char_of_commute π Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [Semiring R] {x y : R} (p : β) [hp : Fact (Nat.Prime p)] [CharP R p] (h : Commute x y) : (x + y) ^ p = x ^ p + y ^ p - neg_one_pow_char_pow π Mathlib.Algebra.CharP.Lemmas
(R : Type u_1) [Ring R] (p n : β) [hp : Fact (Nat.Prime p)] [CharP R p] : (-1) ^ p ^ n = -1 - add_pow_char π Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [CommSemiring R] (x y : R) (p : β) [hp : Fact (Nat.Prime p)] [CharP R p] : (x + y) ^ p = x ^ p + y ^ p - sub_pow_char_of_commute π Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [Ring R] {x y : R} (p : β) [hp : Fact (Nat.Prime p)] [CharP R p] (h : Commute x y) : (x - y) ^ p = x ^ p - y ^ p - sub_pow_char π Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [CommRing R] (x y : R) {p : β} [hp : Fact (Nat.Prime p)] [CharP R p] : (x - y) ^ p = x ^ p - y ^ p - add_pow_char_pow_of_commute π Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [Semiring R] {x y : R} (p n : β) [hp : Fact (Nat.Prime p)] [CharP R p] (h : Commute x y) : (x + y) ^ p ^ n = x ^ p ^ n + y ^ p ^ n - add_pow_char_pow π Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [CommSemiring R] (x y : R) (p n : β) [hp : Fact (Nat.Prime p)] [CharP R p] : (x + y) ^ p ^ n = x ^ p ^ n + y ^ p ^ n - sub_pow_char_pow_of_commute π Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [Ring R] {x y : R} (p n : β) [hp : Fact (Nat.Prime p)] [CharP R p] (h : Commute x y) : (x - y) ^ p ^ n = x ^ p ^ n - y ^ p ^ n - sub_pow_char_pow π Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [CommRing R] (x y : R) (n : β) {p : β} [hp : Fact (Nat.Prime p)] [CharP R p] : (x - y) ^ p ^ n = x ^ p ^ n - y ^ p ^ n - add_pow_eq_mul_pow_add_pow_div_char_of_commute π Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [Semiring R] {x y : R} (p n : β) [hp : Fact (Nat.Prime p)] [CharP R p] (h : Commute x y) : (x + y) ^ n = (x + y) ^ (n % p) * (x ^ p + y ^ p) ^ (n / p) - add_pow_eq_mul_pow_add_pow_div_char π Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [CommSemiring R] (x y : R) (p n : β) [hp : Fact (Nat.Prime p)] [CharP R p] : (x + y) ^ n = (x + y) ^ (n % p) * (x ^ p + y ^ p) ^ (n / p) - sub_pow_eq_mul_pow_sub_pow_div_char_of_commute π Mathlib.Algebra.CharP.Lemmas
(R : Type u_1) [Ring R] {x y : R} (p n : β) [hp : Fact (Nat.Prime p)] [CharP R p] (h : Commute x y) : (x - y) ^ n = (x - y) ^ (n % p) * (x ^ p - y ^ p) ^ (n / p) - sub_pow_eq_mul_pow_sub_pow_div_char π Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [CommRing R] (x y : R) (n : β) {p : β} [hp : Fact (Nat.Prime p)] [CharP R p] : (x - y) ^ n = (x - y) ^ (n % p) * (x ^ p - y ^ p) ^ (n / p) - isAddCyclic_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [AddGroup Ξ±] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card Ξ± = p) : IsAddCyclic Ξ± - isCyclic_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [Group Ξ±] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card Ξ± = p) : IsCyclic Ξ± - isAddCyclic_of_card_dvd_prime π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [AddGroup Ξ±] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card Ξ± β£ p) : IsAddCyclic Ξ± - isCyclic_of_card_dvd_prime π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [Group Ξ±] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card Ξ± β£ p) : IsCyclic Ξ± - AddSubgroup.eq_bot_or_eq_top_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [AddGroup G] (H : AddSubgroup G) [hp : Fact (Nat.Prime (Nat.card G))] : H = β₯ β¨ H = β€ - Subgroup.eq_bot_or_eq_top_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [Group G] (H : Subgroup G) [hp : Fact (Nat.Prime (Nat.card G))] : H = β₯ β¨ H = β€ - zmultiples_eq_top_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [AddGroup G] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card G = p) {g : G} (hg : g β 0) : AddSubgroup.zmultiples g = β€ - zpowers_eq_top_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [Group G] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card G = p) {g : G} (hg : g β 1) : Subgroup.zpowers g = β€ - mem_zmultiples_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [AddGroup G] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card G = p) {g g' : G} (hg : g β 0) : g' β AddSubgroup.zmultiples g - mem_zpowers_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [Group G] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card G = p) {g g' : G} (hg : g β 1) : g' β Subgroup.zpowers g - multiples_eq_top_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [AddGroup G] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card G = p) {g : G} (hg : g β 0) : AddSubmonoid.multiples g = β€ - powers_eq_top_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [Group G] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card G = p) {g : G} (hg : g β 1) : Submonoid.powers g = β€ - mem_multiples_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [AddGroup G] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card G = p) {g g' : G} (hg : g β 0) : g' β AddSubmonoid.multiples g - mem_powers_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [Group G] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card G = p) {g g' : G} (hg : g β 1) : g' β Submonoid.powers g - exists_prime_addOrderOf_dvd_card' π Mathlib.GroupTheory.Perm.Cycle.Type
{G : Type u_3} [AddGroup G] [Finite G] (p : β) [hp : Fact (Nat.Prime p)] (hdvd : p β£ Nat.card G) : β x, addOrderOf x = p - exists_prime_orderOf_dvd_card' π Mathlib.GroupTheory.Perm.Cycle.Type
{G : Type u_3} [Group G] [Finite G] (p : β) [hp : Fact (Nat.Prime p)] (hdvd : p β£ Nat.card G) : β x, orderOf x = p - exists_prime_addOrderOf_dvd_card π Mathlib.GroupTheory.Perm.Cycle.Type
{G : Type u_3} [AddGroup G] [Fintype G] (p : β) [Fact (Nat.Prime p)] (hdvd : p β£ Fintype.card G) : β x, addOrderOf x = p - exists_prime_orderOf_dvd_card π Mathlib.GroupTheory.Perm.Cycle.Type
{G : Type u_3} [Group G] [Fintype G] (p : β) [hp : Fact (Nat.Prime p)] (hdvd : p β£ Fintype.card G) : β x, orderOf x = p - Equiv.Perm.cycleType_of_pow_prime_eq_one π Mathlib.GroupTheory.Perm.Cycle.Type
{Ξ± : Type u_1} [Fintype Ξ±] [DecidableEq Ξ±] {Ο : Equiv.Perm Ξ±} {p : β} [Fact (Nat.Prime p)] (hΟ : Ο ^ p = 1) : Ο.cycleType = Multiset.replicate Ο.cycleType.card p - Equiv.Perm.pow_prime_eq_one_iff π Mathlib.GroupTheory.Perm.Cycle.Type
{Ξ± : Type u_1} [Fintype Ξ±] [DecidableEq Ξ±] {Ο : Equiv.Perm Ξ±} {p : β} [hp : Fact (Nat.Prime p)] : Ο ^ p = 1 β β c β Ο.cycleType, c = p - Equiv.Perm.card_compl_support_modEq π Mathlib.GroupTheory.Perm.Cycle.Type
{Ξ± : Type u_1} [Fintype Ξ±] [DecidableEq Ξ±] {p n : β} [hp : Fact (Nat.Prime p)] {Ο : Equiv.Perm Ξ±} (hΟ : Ο ^ p ^ n = 1) : Ο.supportαΆ.card β‘ Fintype.card Ξ± [MOD p] - Equiv.Perm.exists_fixed_point_of_prime π Mathlib.GroupTheory.Perm.Cycle.Type
{Ξ± : Type u_1} [Fintype Ξ±] {p n : β} [hp : Fact (Nat.Prime p)] (hΞ± : Β¬p β£ Fintype.card Ξ±) {Ο : Equiv.Perm Ξ±} (hΟ : Ο ^ p ^ n = 1) : β a, Ο a = a - Equiv.Perm.card_fixedPoints_modEq π Mathlib.GroupTheory.Perm.Cycle.Type
{Ξ± : Type u_1} [Fintype Ξ±] [DecidableEq Ξ±] {f : Function.End Ξ±} {p n : β} [hp : Fact (Nat.Prime p)] (hf : f ^ p ^ n = 1) : Fintype.card Ξ± β‘ Fintype.card β(Function.fixedPoints f) [MOD p] - Equiv.Perm.exists_fixed_point_of_prime' π Mathlib.GroupTheory.Perm.Cycle.Type
{Ξ± : Type u_1} [Fintype Ξ±] {p n : β} [hp : Fact (Nat.Prime p)] (hΞ± : p β£ Fintype.card Ξ±) {Ο : Equiv.Perm Ξ±} (hΟ : Ο ^ p ^ n = 1) {a : Ξ±} (ha : Ο a = a) : β b, Ο b = b β§ b β a - Module.Baer.ExtensionOfMaxAdjoin.ideal π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] (y : N) : Ideal R - Module.Baer.supExtensionOfMaxSingleton π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] (y : N) : Submodule R N - Module.Baer.extensionOfMax π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] : Module.Baer.ExtensionOf i f - Module.Baer.ExtensionOf.inhabited π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] : Inhabited (Module.Baer.ExtensionOf i f) - Module.Baer.extensionOfMaxAdjoin π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] (h : Module.Baer R Q) (y : N) : Module.Baer.ExtensionOf i f - Module.Baer.ExtensionOfMaxAdjoin.extendIdealTo π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] (h : Module.Baer R Q) (y : N) : R ββ[R] Q - Module.Baer.ExtensionOfMaxAdjoin.snd π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) {f : M ββ[R] Q} [Fact (Function.Injective βi)] {y : N} (x : β₯(Module.Baer.supExtensionOfMaxSingleton i f y)) : R - Module.Baer.ExtensionOfMaxAdjoin.extensionToFun π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] (h : Module.Baer R Q) {y : N} : β₯(Module.Baer.supExtensionOfMaxSingleton i f y) β Q - Module.Baer.extensionOfMax_to_submodule_eq_top π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] (h : Module.Baer R Q) : (Module.Baer.extensionOfMax i f).domain = β€ - Module.Baer.extensionOfMax_le π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] (h : Module.Baer R Q) {y : N} : Module.Baer.extensionOfMax i f β€ Module.Baer.extensionOfMaxAdjoin i f h y - Module.Baer.extensionOfMax_is_max π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] (a : Module.Baer.ExtensionOf i f) : Module.Baer.extensionOfMax i f β€ a β a = Module.Baer.extensionOfMax i f - Module.Baer.ExtensionOfMaxAdjoin.idealTo π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] (y : N) : β₯(Module.Baer.ExtensionOfMaxAdjoin.ideal i f y) ββ[R] Q - Module.Baer.ExtensionOfMaxAdjoin.fst π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) {f : M ββ[R] Q} [Fact (Function.Injective βi)] {y : N} (x : β₯(Module.Baer.supExtensionOfMaxSingleton i f y)) : β₯(Module.Baer.extensionOfMax i f).domain - Module.Baer.ExtensionOfMaxAdjoin.extendIdealTo_wd' π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] (h : Module.Baer R Q) {y : N} (r : R) (eq1 : r β’ y = 0) : (Module.Baer.ExtensionOfMaxAdjoin.extendIdealTo i f h y) r = 0 - Module.Baer.ExtensionOfMaxAdjoin.eqn π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) {f : M ββ[R] Q} [Fact (Function.Injective βi)] {y : N} (x : β₯(Module.Baer.supExtensionOfMaxSingleton i f y)) : βx = β(Module.Baer.ExtensionOfMaxAdjoin.fst i x) + Module.Baer.ExtensionOfMaxAdjoin.snd i x β’ y - Module.Baer.ExtensionOfMaxAdjoin.extendIdealTo_wd π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] (h : Module.Baer R Q) {y : N} (r r' : R) (eq1 : r β’ y = r' β’ y) : (Module.Baer.ExtensionOfMaxAdjoin.extendIdealTo i f h y) r = (Module.Baer.ExtensionOfMaxAdjoin.extendIdealTo i f h y) r' - Module.Baer.ExtensionOfMaxAdjoin.extendIdealTo_eq π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] (h : Module.Baer R Q) {y : N} (r : R) (hr : r β’ y β (Module.Baer.extensionOfMax i f).domain) : (Module.Baer.ExtensionOfMaxAdjoin.extendIdealTo i f h y) r = β(Module.Baer.extensionOfMax i f).toLinearPMap β¨r β’ y, hrβ© - Module.Baer.ExtensionOfMaxAdjoin.extensionToFun_wd π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] (h : Module.Baer R Q) {y : N} (x : β₯(Module.Baer.supExtensionOfMaxSingleton i f y)) (a : β₯(Module.Baer.extensionOfMax i f).domain) (r : R) (eq1 : βx = βa + r β’ y) : Module.Baer.ExtensionOfMaxAdjoin.extensionToFun i f h x = β(Module.Baer.extensionOfMax i f).toLinearPMap a + (Module.Baer.ExtensionOfMaxAdjoin.extendIdealTo i f h y) r - Module.Baer.ExtensionOfMaxAdjoin.extendIdealTo_is_extension π Mathlib.Algebra.Module.Injective
{R : Type u} [Ring R] {Q : Type v} [AddCommGroup Q] [Module R Q] {M : Type u_1} {N : Type u_2} [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (i : M ββ[R] N) (f : M ββ[R] Q) [Fact (Function.Injective βi)] (h : Module.Baer R Q) (y : N) (x : R) (mem : x β Module.Baer.ExtensionOfMaxAdjoin.ideal i f y) : (Module.Baer.ExtensionOfMaxAdjoin.extendIdealTo i f h y) x = (Module.Baer.ExtensionOfMaxAdjoin.idealTo i f y) β¨x, memβ© - QuotientAddGroup.circularOrder π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} [hp' : Fact (0 < p)] : CircularOrder (Ξ± β§Έ AddSubgroup.zmultiples p) - QuotientAddGroup.circularPreorder π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} [hp' : Fact (0 < p)] : CircularPreorder (Ξ± β§Έ AddSubgroup.zmultiples p) - QuotientAddGroup.instBtwQuotientAddSubgroupZmultiples π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} [hp' : Fact (0 < p)] : Btw (Ξ± β§Έ AddSubgroup.zmultiples p) - QuotientAddGroup.btw_coe_iff π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} [hp' : Fact (0 < p)] {xβ xβ xβ : Ξ±} : btw βxβ βxβ βxβ β toIcoMod β― xβ xβ β€ toIocMod β― xβ xβ - QuotientAddGroup.btw_coe_iff' π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} [hp' : Fact (0 < p)] {xβ xβ xβ : Ξ±} : btw βxβ βxβ βxβ β toIcoMod β― 0 (xβ - xβ) β€ toIocMod β― 0 (xβ - xβ) - AddCircle.liftIco π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] (f : π β B) : AddCircle p β B - AddCircle.liftIoc π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] (f : π β B) : AddCircle p β B - AddCircle.equivIco π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] : AddCircle p β β(Set.Ico a (a + p)) - AddCircle.equivIoc π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] : AddCircle p β β(Set.Ioc a (a + p)) - AddCircle.liftIco_comp_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] [Archimedean π] {Ξ± : Type u_3} {Ξ² : Type u_4} {f : π β Ξ±} {g : Ξ± β Ξ²} {a : π} {x : AddCircle p} : AddCircle.liftIco p a (g β f) x = g (AddCircle.liftIco p a f x) - AddCircle.liftIoc_comp_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] [Archimedean π] {Ξ± : Type u_3} {Ξ² : Type u_4} {f : π β Ξ±} {g : Ξ± β Ξ²} {a : π} {x : AddCircle p} : AddCircle.liftIoc p a (g β f) x = g (AddCircle.liftIoc p a f x) - AddCircle.equivIccQuot π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] (p a : π) [hp : Fact (0 < p)] [Archimedean π] : AddCircle p β Quot (AddCircle.EndpointIdent p a) - AddCircle.liftIoc_eq_liftIco_of_ne π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {f : π β B} {x : AddCircle p} (x_ne_a : x β βa) : AddCircle.liftIoc p a f x = AddCircle.liftIco p a f x - AddCircle.EndpointIdent π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] (p a : π) [hp : Fact (0 < p)] : β(Set.Icc a (a + p)) β β(Set.Icc a (a + p)) β Prop - AddCircle.liftIoc_eq_liftIco π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p a : π} [hp : Fact (0 < p)] [Archimedean π] {f : π β B} (hf : f a = f (a + p)) : AddCircle.liftIoc p a f = AddCircle.liftIco p a f - AddCircle.eq_coe_Ico π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] [Archimedean π] (a : AddCircle p) : β b β Set.Ico 0 p, βb = a - AddCircle.eq_coe_Ioc π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] [Archimedean π] (a : AddCircle p) : β b β Set.Ioc 0 p, βb = a - AddCircle.liftIco_coe_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {f : π β B} {x : π} (hx : x β Set.Ico a (a + p)) : AddCircle.liftIco p a f βx = f x - AddCircle.liftIoc_coe_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {f : π β B} {x : π} (hx : x β Set.Ioc a (a + p)) : AddCircle.liftIoc p a f βx = f x - AddCircle.liftIco_zero_coe_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p : π} [hp : Fact (0 < p)] [Archimedean π] {f : π β B} {x : π} (hx : x β Set.Ico 0 p) : AddCircle.liftIco p 0 f βx = f x - AddCircle.liftIoc_zero_coe_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p : π} [hp : Fact (0 < p)] [Archimedean π] {f : π β B} {x : π} (hx : x β Set.Ioc 0 p) : AddCircle.liftIoc p 0 f βx = f x - AddCircle.Ico_ext π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] [Archimedean π] {Ξ± : Type u_3} {f g : AddCircle p β Ξ±} (a : π) (h : β x β Set.Ico a (a + p), f βx = g βx) : f = g - AddCircle.Ioc_ext π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] [Archimedean π] {Ξ± : Type u_3} {f g : AddCircle p β Ξ±} (a : π) (h : β x β Set.Ioc a (a + p), f βx = g βx) : f = g - AddCircle.openPartialHomeomorphCoe π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] [OrderTopology π] [DiscreteTopology β₯(AddSubgroup.zmultiples p)] : OpenPartialHomeomorph π (AddCircle p) - AddCircle.coe_image_Icc_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] : QuotientAddGroup.mk '' Set.Icc a (a + p) = Set.univ - AddCircle.coe_image_Ico_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] : QuotientAddGroup.mk '' Set.Ico a (a + p) = Set.univ - AddCircle.coe_image_Ioc_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] : QuotientAddGroup.mk '' Set.Ioc a (a + p) = Set.univ - AddCircle.liftIco_continuous π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p a : π} [hp : Fact (0 < p)] [Archimedean π] [TopologicalSpace π] [OrderTopology π] [TopologicalSpace B] {f : π β B} (hf : f a = f (a + p)) (hc : ContinuousOn f (Set.Icc a (a + p))) : Continuous (AddCircle.liftIco p a f) - AddCircle.liftIoc_continuous π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p a : π} [hp : Fact (0 < p)] [Archimedean π] [TopologicalSpace π] [OrderTopology π] [TopologicalSpace B] {f : π β B} (hf : f a = f (a + p)) (hc : ContinuousOn f (Set.Icc a (a + p))) : Continuous (AddCircle.liftIoc p a f) - AddCircle.card_addOrderOf_eq_totient π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p : π) [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {n : β} : Nat.card { u // addOrderOf u = n } = n.totient - AddCircle.liftIco_zero_continuous π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p : π} [hp : Fact (0 < p)] [Archimedean π] [TopologicalSpace π] [OrderTopology π] [TopologicalSpace B] {f : π β B} (hf : f 0 = f p) (hc : ContinuousOn f (Set.Icc 0 p)) : Continuous (AddCircle.liftIco p 0 f) - AddCircle.liftIoc_zero_continuous π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p : π} [hp : Fact (0 < p)] [Archimedean π] [TopologicalSpace π] [OrderTopology π] [TopologicalSpace B] {f : π β B} (hf : f 0 = f p) (hc : ContinuousOn f (Set.Icc 0 p)) : Continuous (AddCircle.liftIoc p 0 f) - AddCircle.coe_eq_coe_iff_of_mem_Ico π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {x y : π} (hx : x β Set.Ico a (a + p)) (hy : y β Set.Ico a (a + p)) : βx = βy β x = y - AddCircle.coe_eq_coe_iff_of_mem_Ioc π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {x y : π} (hx : x β Set.Ioc a (a + p)) (hy : y β Set.Ioc a (a + p)) : βx = βy β x = y - AddCircle.openPartialHomeomorphCoe_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] [OrderTopology π] [DiscreteTopology β₯(AddSubgroup.zmultiples p)] (aβ : π) : β(AddCircle.openPartialHomeomorphCoe p a) aβ = βaβ - AddCircle.setAddOrderOfEquiv π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p : π) [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {n : β} (hn : 0 < n) : β{u | addOrderOf u = n} β β{m | m < n β§ m.gcd n = 1} - AddCircle.homeoIccQuot π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] (p a : π) [hp : Fact (0 < p)] [Archimedean π] [TopologicalSpace π] [OrderTopology π] : AddCircle p ββ Quot (AddCircle.EndpointIdent p a) - AddCircle.openPartialHomeomorphCoe_source π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] [OrderTopology π] [DiscreteTopology β₯(AddSubgroup.zmultiples p)] : (AddCircle.openPartialHomeomorphCoe p a).source = Set.Ioo a (a + p) - AddCircle.openPartialHomeomorphCoe_target π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] [OrderTopology π] [DiscreteTopology β₯(AddSubgroup.zmultiples p)] : (AddCircle.openPartialHomeomorphCoe p a).target = {βa}αΆ - AddCircle.instDivisibleByInt π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p : π) [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] [FloorRing π] : DivisibleBy (AddCircle p) β€ - AddCircle.not_isOfFinAddOrder_iff_forall_rat_ne_div π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {a : π} : Β¬IsOfFinAddOrder βa β β (q : β), βq β a / p - AddCircle.addOrderOf_coe_rat π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {q : β} : addOrderOf β(βq * p) = q.den - AddCircle.isOfFinAddOrder_iff_exists_rat_eq_div π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {a : π} : IsOfFinAddOrder βa β β q, βq = a / p - AddCircle.addOrderOf_eq_pos_iff π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {u : AddCircle p} {n : β} (h : 0 < n) : addOrderOf u = n β β m < n, m.gcd n = 1 β§ β(βm / βn * p) = u - AddCircle.addOrderOf_period_div π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {n : β} (h : 0 < n) : addOrderOf β(p / βn) = n - AddCircle.coe_eq_zero_iff_of_mem_Ico π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] (ha : a β Set.Ico 0 p) : βa = 0 β a = 0 - AddCircle.addOrderOf_div_of_gcd_eq_one' π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {m : β€} {n : β} (hn : 0 < n) (h : m.natAbs.gcd n = 1) : addOrderOf β(βm / βn * p) = n - AddCircle.addOrderOf_div_of_gcd_eq_one π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {m n : β} (hn : 0 < n) (h : m.gcd n = 1) : addOrderOf β(βm / βn * p) = n - AddCircle.gcd_mul_addOrderOf_div_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p : π) [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {n : β} (m : β) (hn : 0 < n) : m.gcd n * addOrderOf β(βm / βn * p) = n - AddCircle.coe_equivIco π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {y : AddCircle p} : ββ((AddCircle.equivIco p a) y) = y - AddCircle.coe_equivIoc π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {y : AddCircle p} : ββ((AddCircle.equivIoc p a) y) = y - AddCircle.equivIco_coe_of_mem π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {y : π} (hy : y β Set.Ico a (a + p)) : β((AddCircle.equivIco p a) βy) = y - AddCircle.equivIoc_coe_of_mem π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {y : π} (hy : y β Set.Ioc a (a + p)) : β((AddCircle.equivIoc p a) βy) = y - AddCircle.equivIco_coe_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {x : π} (hx : x β Set.Ico a (a + p)) : (AddCircle.equivIco p a) βx = β¨x, hxβ© - AddCircle.equivIoc_coe_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {x : π} (hx : x β Set.Ioc a (a + p)) : (AddCircle.equivIoc p a) βx = β¨x, hxβ© - AddCircle.continuousAt_equivIco π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] [OrderTopology π] {x : AddCircle p} (hx : x β βa) : ContinuousAt (β(AddCircle.equivIco p a)) x - AddCircle.continuousAt_equivIoc π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] [OrderTopology π] {x : AddCircle p} (hx : x β βa) : ContinuousAt (β(AddCircle.equivIoc p a)) x - AddCircle.nsmul_eq_zero_iff π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {u : AddCircle p} {n : β} (h : 0 < n) : n β’ u = 0 β β m < n, β(βm / βn * p) = u - AddCircle.continuous_equivIco_symm π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] : Continuous β(AddCircle.equivIco p a).symm - AddCircle.continuous_equivIoc_symm π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] : Continuous β(AddCircle.equivIoc p a).symm - AddCircle.openPartialHomeomorphCoe_symm_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] [OrderTopology π] [DiscreteTopology β₯(AddSubgroup.zmultiples p)] (x : AddCircle p) : β(AddCircle.openPartialHomeomorphCoe p a).symm x = β((AddCircle.equivIco p a) x) - AddCircle.liftIco_eq_lift_Icc π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p a : π} [hp : Fact (0 < p)] [Archimedean π] {f : π β B} (h : f a = f (a + p)) : AddCircle.liftIco p a f = Quot.lift ((Set.Icc a (a + p)).domRestrict f) β― β β(AddCircle.equivIccQuot p a) - AddCircle.liftIoc_eq_lift_Icc π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p a : π} [hp : Fact (0 < p)] [Archimedean π] {f : π β B} (h : f a = f (a + p)) : AddCircle.liftIoc p a f = Quot.lift ((Set.Icc a (a + p)).domRestrict f) β― β β(AddCircle.equivIccQuot p a) - AddCircle.exists_gcd_eq_one_of_isOfFinAddOrder π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {u : AddCircle p} (h : IsOfFinAddOrder u) : β m, m.gcd (addOrderOf u) = 1 β§ m < addOrderOf u β§ β(βm / β(addOrderOf u) * p) = u - AddCircle.EndpointIdent.mk π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p a : π} [hp : Fact (0 < p)] : AddCircle.EndpointIdent p a β¨a, β―β© β¨a + p, β―β© - AddCircle.equivIccQuot_comp_mk_eq_toIcoMod π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] (p a : π) [hp : Fact (0 < p)] [Archimedean π] : β(AddCircle.equivIccQuot p a) β Quotient.mk'' = fun x => Quot.mk (AddCircle.EndpointIdent p a) β¨toIcoMod β― a x, β―β© - AddCircle.equivIccQuot_comp_mk_eq_toIocMod π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] (p a : π) [hp : Fact (0 < p)] [Archimedean π] : β(AddCircle.equivIccQuot p a) β Quotient.mk'' = fun x => Quot.mk (AddCircle.EndpointIdent p a) β¨toIocMod β― a x, β―β© - AddCircle.coe_equivIco_mk_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p : π) [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] [FloorRing π] (x : π) : β((AddCircle.equivIco p 0) βx) = Int.fract (x / p) * p - AddCircle.equivAddCircle_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p q : π) [LinearOrder π] [IsOrderedAddMonoid π] [Archimedean π] [hp : Fact (0 < p)] (hq : q β 0) : β(AddCircle.equivAddCircle p q β― hq) = fun x => β(β((AddCircle.equivIco p 0) x) * (pβ»ΒΉ * q)) - isSimpleAddGroup_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic
{Ξ± : Type u_1} [AddGroup Ξ±] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card Ξ± = p) : IsSimpleAddGroup Ξ± - isSimpleGroup_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic
{Ξ± : Type u_1} [Group Ξ±] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card Ξ± = p) : IsSimpleGroup Ξ± - ZMod.instIsSimpleAddGroup π Mathlib.GroupTheory.SpecificGroups.Cyclic
{p : β} [hp : Fact (Nat.Prime p)] : IsSimpleAddGroup (ZMod p) - addEquivOfPrimeCardEq π Mathlib.GroupTheory.SpecificGroups.Cyclic
{G : Type u_2} {G' : Type u_3} {p : β} [AddGroup G] [AddGroup G'] [Fact (Nat.Prime p)] (hG : Nat.card G = p) (hH : Nat.card G' = p) : G β+ G' - mulEquivOfPrimeCardEq π Mathlib.GroupTheory.SpecificGroups.Cyclic
{G : Type u_2} {G' : Type u_3} {p : β} [Group G] [Group G'] [Fact (Nat.Prime p)] (hG : Nat.card G = p) (hH : Nat.card G' = p) : G β* G' - IsPGroup.powEquiv' π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] (hG : IsPGroup p G) [hp : Fact (Nat.Prime p)] {n : β} (hn : Β¬p β£ n) : G β G - IsPGroup.card_eq_or_dvd π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] (hG : IsPGroup p G) [hp : Fact (Nat.Prime p)] : Nat.card G = 1 β¨ p β£ Nat.card G - IsPGroup.commGroupOfCardEqPrimeSq π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] [Fact (Nat.Prime p)] (hG : Nat.card G = p ^ 2) : CommGroup G - IsPGroup.exists_card_eq π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] [Fact (Nat.Prime p)] [Finite G] : IsPGroup p G β β n, Nat.card G = p ^ n - IsPGroup.iff_card π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] [Fact (Nat.Prime p)] [Finite G] : IsPGroup p G β β n, Nat.card G = p ^ n - IsPGroup.center_nontrivial π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] (hG : IsPGroup p G) [hp : Fact (Nat.Prime p)] [Nontrivial G] [Finite G] : Nontrivial β₯(Subgroup.center G) - IsPGroup.card_modEq_card_fixedPoints π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] (hG : IsPGroup p G) [hp : Fact (Nat.Prime p)] (Ξ± : Type u_2) [MulAction G Ξ±] [Finite Ξ±] : Nat.card Ξ± β‘ Nat.card β(MulAction.fixedPoints G Ξ±) [MOD p] - IsPGroup.nonempty_fixed_point_of_prime_not_dvd_card π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] (hG : IsPGroup p G) [hp : Fact (Nat.Prime p)] (Ξ± : Type u_3) [MulAction G Ξ±] (hpΞ± : Β¬p β£ Nat.card Ξ±) : (MulAction.fixedPoints G Ξ±).Nonempty - IsPGroup.exists_exponent_eq_pow π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] [Finite G] [Fact (Nat.Prime p)] : IsPGroup p G β β n, Monoid.exponent G = p ^ n
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
πReal.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
π"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
π_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
πReal.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
π(?a -> ?b) -> List ?a -> List ?b
πList ?a -> (?a -> ?b) -> List ?bBy main conclusion:
π|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allβandβ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
π|- _ < _ β tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
β’ (_ : Type _)finds all definitions which provide data whileβ’ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
π Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ β _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c