Loogle!
Result
Found 147 declarations mentioning PosNum.
- PosNum ๐ Mathlib.Data.Num.Basic
: Type - PosNum.one ๐ Mathlib.Data.Num.Basic
: PosNum - instDecidableEqPosNum ๐ Mathlib.Data.Num.Basic
: DecidableEq PosNum - instInhabitedPosNum ๐ Mathlib.Data.Num.Basic
: Inhabited PosNum - instOnePosNum ๐ Mathlib.Data.Num.Basic
: One PosNum - instReprPosNum ๐ Mathlib.Data.Num.Basic
: Repr PosNum - Num.pos ๐ Mathlib.Data.Num.Basic
: PosNum โ Num - Num.succ' ๐ Mathlib.Data.Num.Basic
: Num โ PosNum - PosNum.bit0 ๐ Mathlib.Data.Num.Basic
: PosNum โ PosNum - PosNum.bit1 ๐ Mathlib.Data.Num.Basic
: PosNum โ PosNum - PosNum.instAdd ๐ Mathlib.Data.Num.Basic
: Add PosNum - PosNum.instLE ๐ Mathlib.Data.Num.Basic
: LE PosNum - PosNum.instLT ๐ Mathlib.Data.Num.Basic
: LT PosNum - PosNum.instMul ๐ Mathlib.Data.Num.Basic
: Mul PosNum - PosNum.instSub ๐ Mathlib.Data.Num.Basic
: Sub PosNum - PosNum.isOne ๐ Mathlib.Data.Num.Basic
: PosNum โ Bool - PosNum.natSize ๐ Mathlib.Data.Num.Basic
: PosNum โ โ - PosNum.ofNat ๐ Mathlib.Data.Num.Basic
(n : โ) : PosNum - PosNum.ofNatSucc ๐ Mathlib.Data.Num.Basic
: โ โ PosNum - PosNum.ofZNum ๐ Mathlib.Data.Num.Basic
: ZNum โ PosNum - PosNum.pred ๐ Mathlib.Data.Num.Basic
(a : PosNum) : PosNum - PosNum.pred' ๐ Mathlib.Data.Num.Basic
: PosNum โ Num - PosNum.size ๐ Mathlib.Data.Num.Basic
: PosNum โ PosNum - PosNum.succ ๐ Mathlib.Data.Num.Basic
: PosNum โ PosNum - ZNum.neg ๐ Mathlib.Data.Num.Basic
: PosNum โ ZNum - ZNum.pos ๐ Mathlib.Data.Num.Basic
: PosNum โ ZNum - PosNum.add ๐ Mathlib.Data.Num.Basic
: PosNum โ PosNum โ PosNum - PosNum.bit ๐ Mathlib.Data.Num.Basic
(b : Bool) : PosNum โ PosNum - PosNum.cmp ๐ Mathlib.Data.Num.Basic
: PosNum โ PosNum โ Ordering - PosNum.decidableLE ๐ Mathlib.Data.Num.Basic
: DecidableLE PosNum - PosNum.decidableLT ๐ Mathlib.Data.Num.Basic
: DecidableLT PosNum - PosNum.div' ๐ Mathlib.Data.Num.Basic
(n d : PosNum) : Num - PosNum.mod' ๐ Mathlib.Data.Num.Basic
(n d : PosNum) : Num - PosNum.mul ๐ Mathlib.Data.Num.Basic
(a : PosNum) : PosNum โ PosNum - PosNum.ofZNum' ๐ Mathlib.Data.Num.Basic
: ZNum โ Option PosNum - PosNum.sub ๐ Mathlib.Data.Num.Basic
(a b : PosNum) : PosNum - PosNum.sub' ๐ Mathlib.Data.Num.Basic
: PosNum โ PosNum โ ZNum - PosNum.divMod ๐ Mathlib.Data.Num.Basic
(d : PosNum) : PosNum โ Num ร Num - PosNum.divModAux ๐ Mathlib.Data.Num.Basic
(d : PosNum) (q r : Num) : Num ร Num - castPosNum ๐ Mathlib.Data.Num.Basic
{ฮฑ : Type u_1} [One ฮฑ] [Add ฮฑ] : PosNum โ ฮฑ - instDecidableEqPosNum.decEq ๐ Mathlib.Data.Num.Basic
(xโ xโยน : PosNum) : Decidable (xโ = xโยน) - posNumCoe ๐ Mathlib.Data.Num.Basic
{ฮฑ : Type u_1} [One ฮฑ] [Add ฮฑ] : CoeHTCT PosNum ฮฑ - PosNum.instOfNatHAddNatOfNat ๐ Mathlib.Data.Num.Basic
{n : โ} : OfNat PosNum (n + 1) - PosNum.instOrOp ๐ Mathlib.Data.Num.Bitwise
: OrOp PosNum - PosNum.land ๐ Mathlib.Data.Num.Bitwise
: PosNum โ PosNum โ Num - PosNum.ldiff ๐ Mathlib.Data.Num.Bitwise
: PosNum โ PosNum โ Num - PosNum.lor ๐ Mathlib.Data.Num.Bitwise
: PosNum โ PosNum โ PosNum - PosNum.lxor ๐ Mathlib.Data.Num.Bitwise
: PosNum โ PosNum โ Num - PosNum.shiftl ๐ Mathlib.Data.Num.Bitwise
: PosNum โ โ โ PosNum - PosNum.shiftr ๐ Mathlib.Data.Num.Bitwise
: PosNum โ โ โ Num - PosNum.testBit ๐ Mathlib.Data.Num.Bitwise
: PosNum โ โ โ Bool - PosNum.instHAndNum ๐ Mathlib.Data.Num.Bitwise
: HAnd PosNum PosNum Num - PosNum.instHShiftLeftNat ๐ Mathlib.Data.Num.Bitwise
: HShiftLeft PosNum โ PosNum - PosNum.instHShiftRightNatNum ๐ Mathlib.Data.Num.Bitwise
: HShiftRight PosNum โ Num - PosNum.instHXorNum ๐ Mathlib.Data.Num.Bitwise
: HXor PosNum PosNum Num - PosNum.oneBits ๐ Mathlib.Data.Num.Bitwise
: PosNum โ โ โ List โ - PosNum.land_eq_and ๐ Mathlib.Data.Num.Bitwise
(p q : PosNum) : p.land q = p &&& q - PosNum.lxor_eq_xor ๐ Mathlib.Data.Num.Bitwise
(p q : PosNum) : p.lxor q = p ^^^ q - PosNum.shiftl_eq_shiftLeft ๐ Mathlib.Data.Num.Bitwise
(p : PosNum) (n : โ) : p.shiftl n = p <<< n - PosNum.shiftr_eq_shiftRight ๐ Mathlib.Data.Num.Bitwise
(p : PosNum) (n : โ) : p.shiftr n = p >>> n - PosNum.lor_eq_or ๐ Mathlib.Data.Num.Bitwise
(p q : PosNum) : p.lor q = p ||| q - PosNum.shiftl_succ_eq_bit0_shiftl ๐ Mathlib.Data.Num.Bitwise
(p : PosNum) (n : โ) : p <<< n.succ = (p <<< n).bit0 - PosNum.addCommSemigroup ๐ Mathlib.Data.Num.Lemmas
: AddCommSemigroup PosNum - PosNum.commMonoid ๐ Mathlib.Data.Num.Lemmas
: CommMonoid PosNum - PosNum.distrib ๐ Mathlib.Data.Num.Lemmas
: Distrib PosNum - PosNum.dvd ๐ Mathlib.Data.Num.Lemmas
: Dvd PosNum - PosNum.linearOrder ๐ Mathlib.Data.Num.Lemmas
: LinearOrder PosNum - PosNum.succ'_pred' ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : n.pred'.succ' = n - PosNum.cast_to_num ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : โn = Num.pos n - PosNum.cmp_swap ๐ Mathlib.Data.Num.Lemmas
(m n : PosNum) : (m.cmp n).swap = n.cmp m - PosNum.natSize_pos ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : 0 < n.natSize - PosNum.natSize_to_nat ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : n.natSize = (โn).size - PosNum.of_to_nat' ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : Num.ofNat' โn = Num.pos n - PosNum.size_eq_natSize ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : โn.size = n.natSize - PosNum.cmp_eq ๐ Mathlib.Data.Num.Lemmas
(m n : PosNum) : m.cmp n = Ordering.eq โ m = n - PosNum.bit0_of_bit0 ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : n + n = n.bit0 - PosNum.le_iff_cmp ๐ Mathlib.Data.Num.Lemmas
{m n : PosNum} : m โค n โ m.cmp n โ Ordering.gt - PosNum.lt_iff_cmp ๐ Mathlib.Data.Num.Lemmas
{m n : PosNum} : m < n โ m.cmp n = Ordering.lt - PosNum.one_sub' ๐ Mathlib.Data.Num.Lemmas
(a : PosNum) : PosNum.sub' 1 a = a.pred'.toZNumNeg - PosNum.sub'_one ๐ Mathlib.Data.Num.Lemmas
(a : PosNum) : a.sub' 1 = a.pred'.toZNum - PosNum.to_nat_pos ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : 0 < โn - PosNum.of_to_nat ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : โโn = Num.pos n - PosNum.size_to_nat ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : โn.size = (โn).size - PosNum.bit_to_nat ๐ Mathlib.Data.Num.Lemmas
(b : Bool) (n : PosNum) : โ(PosNum.bit b n) = Nat.bit b โn - PosNum.pred'_to_nat ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : โn.pred' = (โn).pred - PosNum.add_one ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : n + 1 = n.succ - PosNum.one_add ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : 1 + n = n.succ - PosNum.to_nat_inj ๐ Mathlib.Data.Num.Lemmas
{m n : PosNum} : โm = โn โ m = n - PosNum.dvd_to_nat ๐ Mathlib.Data.Num.Lemmas
{m n : PosNum} : โm โฃ โn โ m โฃ n - PosNum.le_to_nat ๐ Mathlib.Data.Num.Lemmas
{m n : PosNum} : โm โค โn โ m โค n - PosNum.lt_to_nat ๐ Mathlib.Data.Num.Lemmas
{m n : PosNum} : โm < โn โ m < n - Num.cast_pos ๐ Mathlib.Data.Num.Lemmas
{ฮฑ : Type u_1} [Zero ฮฑ] [One ฮฑ] [Add ฮฑ] (n : PosNum) : โ(Num.pos n) = โn - PosNum.to_nat_to_int ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : โโn = โn - PosNum.cast_one ๐ Mathlib.Data.Num.Lemmas
{ฮฑ : Type u_1} [One ฮฑ] [Add ฮฑ] : โ1 = 1 - PosNum.add_succ ๐ Mathlib.Data.Num.Lemmas
(m n : PosNum) : m + n.succ = (m + n).succ - PosNum.pred_to_nat ๐ Mathlib.Data.Num.Lemmas
{n : PosNum} (h : 1 < n) : โn.pred = (โn).pred - PosNum.succ_to_nat ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : โn.succ = โn + 1 - PosNum.bit1_of_bit1 ๐ Mathlib.Data.Num.Lemmas
(n : PosNum) : n + n + 1 = n.bit1 - PosNum.cast_to_nat ๐ Mathlib.Data.Num.Lemmas
{ฮฑ : Type u_1} [AddMonoidWithOne ฮฑ] (n : PosNum) : โโn = โn - PosNum.cmp_to_nat_lemma ๐ Mathlib.Data.Num.Lemmas
{m n : PosNum} : โm < โn โ โm.bit1 < โn.bit0 - PosNum.cast_bit0 ๐ Mathlib.Data.Num.Lemmas
{ฮฑ : Type u_1} [One ฮฑ] [Add ฮฑ] (n : PosNum) : โn.bit0 = โn + โn - PosNum.add_to_nat ๐ Mathlib.Data.Num.Lemmas
(m n : PosNum) : โ(m + n) = โm + โn - PosNum.mul_to_nat ๐ Mathlib.Data.Num.Lemmas
(m n : PosNum) : โ(m * n) = โm * โn - PosNum.cmp_to_nat ๐ Mathlib.Data.Num.Lemmas
(m n : PosNum) : Ordering.casesOn (m.cmp n) (โm < โn) (m = n) (โn < โm) - PosNum.cast_to_int ๐ Mathlib.Data.Num.Lemmas
{ฮฑ : Type u_1} [AddGroupWithOne ฮฑ] (n : PosNum) : โโn = โn - PosNum.cast_inj ๐ Mathlib.Data.Num.Lemmas
{ฮฑ : Type u_1} [AddMonoidWithOne ฮฑ] [CharZero ฮฑ] {m n : PosNum} : โm = โn โ m = n - PosNum.cast_bit1 ๐ Mathlib.Data.Num.Lemmas
{ฮฑ : Type u_1} [One ฮฑ] [Add ฮฑ] (n : PosNum) : โn.bit1 = โn + โn + 1 - PosNum.cast_pos ๐ Mathlib.Data.Num.Lemmas
{ฮฑ : Type u_1} [Semiring ฮฑ] [PartialOrder ฮฑ] [IsStrictOrderedRing ฮฑ] (n : PosNum) : 0 < โn - PosNum.one_le_cast ๐ Mathlib.Data.Num.Lemmas
{ฮฑ : Type u_1} [Semiring ฮฑ] [PartialOrder ฮฑ] [IsStrictOrderedRing ฮฑ] (n : PosNum) : 1 โค โn - PosNum.cast_succ ๐ Mathlib.Data.Num.Lemmas
{ฮฑ : Type u_1} [AddMonoidWithOne ฮฑ] (n : PosNum) : โn.succ = โn + 1 - PosNum.cast_lt ๐ Mathlib.Data.Num.Lemmas
{ฮฑ : Type u_1} [Semiring ฮฑ] [PartialOrder ฮฑ] [IsStrictOrderedRing ฮฑ] {m n : PosNum} : โm < โn โ m < n - PosNum.cast_add ๐ Mathlib.Data.Num.Lemmas
{ฮฑ : Type u_1} [AddMonoidWithOne ฮฑ] (m n : PosNum) : โ(m + n) = โm + โn - PosNum.cast_le ๐ Mathlib.Data.Num.Lemmas
{ฮฑ : Type u_1} [Semiring ฮฑ] [LinearOrder ฮฑ] [IsStrictOrderedRing ฮฑ] {m n : PosNum} : โm โค โn โ m โค n - PosNum.cast_mul ๐ Mathlib.Data.Num.Lemmas
{ฮฑ : Type u_1} [NonAssocSemiring ฮฑ] (m n : PosNum) : โ(m * n) = โm * โn - Num.castNum_eq_bitwise ๐ Mathlib.Data.Num.Lemmas
{f : Num โ Num โ Num} {g : Bool โ Bool โ Bool} (p : PosNum โ PosNum โ Num) (gff : g false false = false) (f00 : f 0 0 = 0) (f0n : โ (n : PosNum), f 0 (Num.pos n) = bif g false true then Num.pos n else 0) (fn0 : โ (n : PosNum), f (Num.pos n) 0 = bif g true false then Num.pos n else 0) (fnn : โ (m n : PosNum), f (Num.pos m) (Num.pos n) = p m n) (p11 : p 1 1 = bif g true true then 1 else 0) (p1b : โ (b : Bool) (n : PosNum), p 1 (PosNum.bit b n) = Num.bit (g true b) (bif g false true then Num.pos n else 0)) (pb1 : โ (a : Bool) (m : PosNum), p (PosNum.bit a m) 1 = Num.bit (g a true) (bif g true false then Num.pos m else 0)) (pbb : โ (a b : Bool) (m n : PosNum), p (PosNum.bit a m) (PosNum.bit b n) = Num.bit (g a b) (p m n)) (m n : Num) : โ(f m n) = Nat.bitwise g โm โn - Computability.decodePosNum ๐ Mathlib.Computability.Encoding
: List Bool โ PosNum - Computability.encodePosNum ๐ Mathlib.Computability.Encoding
: PosNum โ List Bool - Computability.decode_encodePosNum ๐ Mathlib.Computability.Encoding
(n : PosNum) : Computability.decodePosNum (Computability.encodePosNum n) = n - Computability.encodePosNum_nonempty ๐ Mathlib.Computability.Encoding
(n : PosNum) : Computability.encodePosNum n โ [] - Turing.PartrecToTM2.trPosNum ๐ Mathlib.Computability.TuringMachine.ToPartrec
: PosNum โ List Turing.PartrecToTM2.ฮ' - Turing.PartrecToTM2.trPosNum_natEnd ๐ Mathlib.Computability.TuringMachine.ToPartrec
(n : PosNum) (x : Turing.PartrecToTM2.ฮ') : x โ Turing.PartrecToTM2.trPosNum n โ Turing.PartrecToTM2.natEnd x = false - PosNum.cast_to_znum ๐ Mathlib.Data.Num.ZNum
(n : PosNum) : โn = ZNum.pos n - PosNum.decidableDvd ๐ Mathlib.Data.Num.ZNum
: DecidableRel fun x1 x2 => x1 โฃ x2 - ZNum.zneg_neg ๐ Mathlib.Data.Num.ZNum
(n : PosNum) : -ZNum.neg n = ZNum.pos n - ZNum.zneg_pos ๐ Mathlib.Data.Num.ZNum
(n : PosNum) : -ZNum.pos n = ZNum.neg n - ZNum.cast_pos ๐ Mathlib.Data.Num.ZNum
{ฮฑ : Type u_1} [Zero ฮฑ] [One ฮฑ] [Add ฮฑ] [Neg ฮฑ] (n : PosNum) : โ(ZNum.pos n) = โn - ZNum.cast_neg ๐ Mathlib.Data.Num.ZNum
{ฮฑ : Type u_1} [Zero ฮฑ] [One ฮฑ] [Add ฮฑ] [Neg ฮฑ] (n : PosNum) : โ(ZNum.neg n) = -โn - PosNum.to_nat_eq_succ_pred ๐ Mathlib.Data.Num.ZNum
(n : PosNum) : โn = โn.pred' + 1 - PosNum.div'_to_nat ๐ Mathlib.Data.Num.ZNum
(n d : PosNum) : โ(n.div' d) = โn / โd - PosNum.mod'_to_nat ๐ Mathlib.Data.Num.ZNum
(n d : PosNum) : โ(n.mod' d) = โn % โd - PosNum.to_int_eq_succ_pred ๐ Mathlib.Data.Num.ZNum
(n : PosNum) : โn = โโn.pred' + 1 - PosNum.divMod_to_nat ๐ Mathlib.Data.Num.ZNum
(d n : PosNum) : โn / โd = โ(d.divMod n).1 โง โn % โd = โ(d.divMod n).2 - PosNum.cast_sub' ๐ Mathlib.Data.Num.ZNum
{ฮฑ : Type u_1} [AddGroupWithOne ฮฑ] (m n : PosNum) : โ(m.sub' n) = โm - โn - PosNum.divMod_to_nat_aux ๐ Mathlib.Data.Num.ZNum
{n d : PosNum} {q r : Num} (hโ : โr + โd * (โq + โq) = โn) (hโ : โr < 2 * โd) : โ(d.divModAux q r).2 + โd * โ(d.divModAux q r).1 = โn โง โ(d.divModAux q r).2 < โd - Num.minFac ๐ Mathlib.Data.Num.Prime
: Num โ PosNum - PosNum.Prime ๐ Mathlib.Data.Num.Prime
(n : PosNum) : Prop - PosNum.minFac ๐ Mathlib.Data.Num.Prime
: PosNum โ PosNum - PosNum.decidablePrime ๐ Mathlib.Data.Num.Prime
: DecidablePred PosNum.Prime - PosNum.minFacAux ๐ Mathlib.Data.Num.Prime
(n : PosNum) : โ โ PosNum โ PosNum - PosNum.minFac_to_nat ๐ Mathlib.Data.Num.Prime
(n : PosNum) : โn.minFac = (โn).minFac - PosNum.minFacAux_to_nat ๐ Mathlib.Data.Num.Prime
{fuel : โ} {n k : PosNum} (h : (โn).sqrt < fuel + โk.bit1) : โ(n.minFacAux fuel k) = (โn).minFacAux โk.bit1 - BinaryTree.get ๐ Mathlib.Data.Tree.Get
{ฮฑ : Type u_1} : PosNum โ BinaryTree ฮฑ โ Option ฮฑ - BinaryTree.getOrElse ๐ Mathlib.Data.Tree.Get
{ฮฑ : Type u_1} (n : PosNum) (t : BinaryTree ฮฑ) (v : ฮฑ) : ฮฑ - Tree.get ๐ Mathlib.Data.Tree.Get
{ฮฑ : Type u_1} (n : PosNum) (t : Tree ฮฑ) : Option ฮฑ - Tree.getOrElse ๐ Mathlib.Data.Tree.Get
{ฮฑ : Type u_1} (n : PosNum) (t : Tree ฮฑ) (v : ฮฑ) : ฮฑ - BinaryTree.indexOf ๐ Mathlib.Data.Tree.Get
{ฮฑ : Type u_1} (lt : ฮฑ โ ฮฑ โ Prop) [DecidableRel lt] (x : ฮฑ) : BinaryTree ฮฑ โ Option PosNum - Tree.indexOf ๐ Mathlib.Data.Tree.Get
{ฮฑ : Type u_1} (lt : ฮฑ โ ฮฑ โ Prop) [DecidableRel lt] (x : ฮฑ) : Tree ฮฑ โ Option PosNum
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 69fae59