theorem_id
int64
1
2.65k
source
stringclasses
8 values
item_id
stringlengths
1
132
title
stringlengths
1
95
tier
stringclasses
2 values
prover
stringclasses
10 values
content
stringlengths
44
290k
artifact
stringlengths
40
167
sha256
stringlengths
64
64
split
stringclasses
2 values
1
babel-formal
circle_average
circle_average
a
lean4
class AddMonoid (R : Type) where zero : R add : R → R → R add_zero : ∀ x, add x zero = x add_comm : ∀ x y, add x y = add y x add_assoc : ∀ x y z, add (add x y) z = add x (add y z) namespace CircleAverage variable {R : Type} [AddMonoid R] axiom integral : (R → R) → R axiom integral_ext :...
src_data/babel-formal/stmts/lean4/circle_average.lean
c53837889407069e16d1a60939fbf34b9d0f56199c2c6ff525f8f50b24b030bb
null
1
babel-formal
circle_average
circle_average
a
rocq
Class AddMonoid (R : Type) := { zero : R; add : R -> R -> R; add_zero : forall x, add x zero = x; add_comm : forall x y, add x y = add y x; add_assoc : forall x y z, add (add x y) z = add x (add y z) }. Section CircleAverage. Context {R : Type} {M : AddMonoid R}. Axiom integral : (R -...
src_data/babel-formal/stmts/rocq/circle_average.v
48f06b4449ff478ccae4ed017f3167b25fadb02978d343b51bfc4583898a1493
null
1
babel-formal
circle_average
circle_average
a
isabelle
theory circle_average imports Main begin locale circle_average_setup = fixes zero :: "'r" and add :: "'r \<Rightarrow> 'r \<Rightarrow> 'r" (infixl "+C" 65) and integral :: "('r \<Rightarrow> 'r) \<Rightarrow> 'r" assumes add_zero : "\<And>x. x +C zero = x" and add_comm : "\<...
src_data/babel-formal/stmts/isabelle/circle_average.thy
71e8b60287645f0722b299cd1f5a09e2ce4ba1698727532adf15877eddd8a0d9
null
1
babel-formal
circle_average
circle_average
a
hol-light
let is_add_monoid = new_definition `is_add_monoid (zero:A) (add:A->A->A) <=> (!x. add x zero = x) /\ (!x y. add x y = add y x) /\ (!x y z. add (add x y) z = add x (add y z))`;; let is_integral = new_definition `is_integral (integral:(A->A)->A) (add:A->A->A) (zero:A) <=> (!g h. (!t. g t = h ...
src_data/babel-formal/stmts/hol-light/circle_average.ml
9554fc3b628e83d21a6e8d72888abe1071f8a834648cde5ef8643d47c5ecdb30
null
1
babel-formal
circle_average
circle_average
a
acl2
;; Statement-only formalization of Babel-formal artifact circle_average: ;; circle maps and circle averages over an arbitrary commutative additive ;; monoid with an extensional, constant-preserving, additive, and ;; translation-invariant integral, asserting the source's seventeen ;; identities. This file contains no pr...
src_data/babel-formal/stmts/acl2/circle_average.lsp
dff60c791b77f7ca1282cc803d3a736d95155b8da5fbe92f73f1c96ee229fd11
null
1
babel-formal
circle_average
circle_average
a
agda
-- Statement-only formalization of the Babel-formal topic circle_average. This file contains no -- proof. module circle_average where open import Agda.Primitive using (Level) open import Agda.Builtin.Equality using (_≡_) record AddMonoid {ℓ : Level} (R : Set ℓ) : Set ℓ where field zero : R add :...
src_data/babel-formal/stmts/agda/circle_average.agda
68dfc53c6541aa0add39404aa1644c0a4cdfff6f8c1c10e75935b34526448f8b
null
1
babel-formal
circle_average
circle_average
a
hol4
(* Statement-only formalization of the Babel-formal topic circle_average. This file contains no proof. *) open HolKernel Parse boolLib; val is_add_monoid_def = new_definition ( "is_add_monoid_def", ``is_add_monoid (zero : 'a) (add : 'a -> 'a -> 'a) <=> (!x. add x zero = x) /\ (!x y. add x y = add ...
src_data/babel-formal/stmts/hol4/circle_average.sml
b22b292b54598ca0f3e9b45d6d723044a473e229e3739b68cd5c7f56b39c6da3
null
1
babel-formal
circle_average
circle_average
a
metamath
$( Statement-only formalization of the Babel-formal topic circle_average. This file contains no proof. $) $( Statement-only encoding of the circle-average theory. obj is the fixed abstract carrier R, and fun is the function sort R -> R. forallObj, forallFun, and lambda are object-language binders. The oper...
src_data/babel-formal/stmts/metamath/circle_average.mm
c80c441b3036aa169abd6cfb0201ed25331c9801a58bd6441218eaf6c95d4f90
null
1
babel-formal
circle_average
circle_average
a
mizar
:: Statement-only formalization of the Babel-formal topic circle_average. This file contains no :: proof. environ vocabularies FUNCT_1, FUNCT_2, RELAT_1, XBOOLE_0, ZFMISC_1, SUBSET_1, TARSKI, PARTFUN1, BINOP_1; notations TARSKI, XBOOLE_0, ZFMISC_1, SUBSET_1, RELAT_1, FUNCT_1, RELSET_1, PARTFUN1, FUNCT_2, B...
src_data/babel-formal/stmts/mizar/circle_average.miz
1e8f0f7c646d50043ba3f5f6780a5478b364811ba1e291a73987e424c69089fa
null
1
babel-formal
circle_average
circle_average
a
pvs
% Statement-only formalization of the Babel-formal topic circle_average. This file contains no % proof. circle_average[ R: TYPE+, zero: R, add: [R, R -> R], integral: [[R -> R] -> R] ]: THEORY BEGIN add_monoid: bool = (FORALL (x: R): add(x, zero) = x) AND (FORALL (x, y: R): add(x, y) = add(y, x)) ...
src_data/babel-formal/stmts/pvs/circle_average.pvs
a8eab1ac43b75071e10dc7b55d38b529f9d1a869ed8f994f172f988ae036ec17
null
2
babel-formal
comp_commute
comp_commute
a
lean4
universe u v w namespace CompCommute variable {α : Type u} {β : Type v} {γ : Type w} def comp {α β γ} (g : β → γ) (f : α → β) : α → γ := fun x => g (f x) def id {α} : α → α := fun x => x axiom comp_assoc : ∀ {α β γ δ} (h : γ → δ) (g : β → γ) (f : α → β), comp h (comp g f) = comp (comp h g) f axiom comp_id_l : ∀ {α...
src_data/babel-formal/stmts/lean4/comp_commute.lean
c00920a341aedd31dfd481ba90086dbb117b19c3ec74af00dc943603377e9c91
null
2
babel-formal
comp_commute
comp_commute
a
rocq
Section CompCommute. Universes u v w. Definition comp {α β γ : Type} (g : β -> γ) (f : α -> β) : α -> γ := fun x => g (f x). Definition id {α : Type} : α -> α := fun x => x. Class FunProps := { comp_assoc : forall {α β γ δ} (h : γ -> δ) (g : β -> γ) (f : α -> β), comp h (comp g f) = comp (comp h g) f; ...
src_data/babel-formal/stmts/rocq/comp_commute.v
1b5d3c79e575ebe4b41eae556c1b87c60d017ddb7912aef2705e88f72cac5630
null
2
babel-formal
comp_commute
comp_commute
a
isabelle
theory comp_commute imports Main begin definition myComp :: "('b \<Rightarrow> 'c) \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> ('a \<Rightarrow> 'c)" where "myComp g f \<equiv> \<lambda>x. g (f x)" definition myId :: "'a \<Rightarrow> 'a" where "myId \<equiv> \<lambda>x. x" lemma comp_assoc: "myComp ...
src_data/babel-formal/stmts/isabelle/comp_commute.thy
2e67f339d5713cde7b88279e1316815f0bf77ca80e90cbeb5bba3f56e328c89b
null
2
babel-formal
comp_commute
comp_commute
a
hol-light
let myComp = new_definition `myComp (g:B->C) (f:A->B) = (\x:A. g (f x))`;; let myId = new_definition `myId = (\x:A. x)`;; let comp_assoc = `!h g f. myComp h (myComp g f) = myComp (myComp h g) f`;; let comp_id_l = `!f:A->B. myComp myId f = f`;; let comp_id_r = `!f:A->B. myComp f myId = f`;; let commute = ...
src_data/babel-formal/stmts/hol-light/comp_commute.ml
78126c7e644ef2018ef447e54e138d867de30d8c5b641e705ba076262bf7e327
null
2
babel-formal
comp_commute
comp_commute
a
acl2
;; Statement-only formalization of Babel-formal artifact comp_commute: ;; composition and identity laws for arbitrary functions between arbitrary ;; carriers, together with basic properties of commuting endofunctions. This ;; file contains no proof. (in-package "ACL2") (set-inhibit-output-lst '(prove proof-tree event...
src_data/babel-formal/stmts/acl2/comp_commute.lsp
8e90313172070e9de723824b72a2c64b1f0c9989f226dee7e9ecb1957733da45
null
2
babel-formal
comp_commute
comp_commute
a
agda
-- Statement-only formalization of the Babel-formal topic comp_commute. This file contains no -- proof. module comp_commute where open import Agda.Primitive using (Level; Setω) open import Agda.Builtin.Equality using (_≡_) comp : ∀ {a b c : Level} {A : Set a} {B : Set b} {C : Set c} → (B → C) → (A → ...
src_data/babel-formal/stmts/agda/comp_commute.agda
12ad35d0322fb9e76c9299b42a45ec888bd036d0b4386607d54c6aa1a4a782b8
null
2
babel-formal
comp_commute
comp_commute
a
hol4
(* Statement-only formalization of the Babel-formal topic comp_commute. This file contains no proof. *) open HolKernel Parse boolLib; val cc_comp_def = new_definition ( "cc_comp_def", ``cc_comp (g : 'b -> 'c) (f : 'a -> 'b) = \x. g (f x)``); val cc_id_def = new_definition ( "cc_id_def", ``cc_id (x ...
src_data/babel-formal/stmts/hol4/comp_commute.sml
599cf5e3a6f7b884e5c9aaf75a3200250fe21de33c97c11f581f5664b6b055c3
null
2
babel-formal
comp_commute
comp_commute
a
metamath
$( Statement-only formalization of the Babel-formal topic comp_commute. This file contains no proof. $) $( A statement-only encoding of polymorphic function composition, identity, and commuting endomorphisms. $) $c type func wff |- ( ) -> => : = comp id commute <-> $. $v A B C D f g h f1 f2 g1 g2 ph ps $. t...
src_data/babel-formal/stmts/metamath/comp_commute.mm
3a547c54292c848506bf376aa593a5dc3e45c21d6d6dd41738e5f3ea79f5339d
null
2
babel-formal
comp_commute
comp_commute
a
mizar
:: Statement-only formalization of the Babel-formal topic comp_commute. This file contains no :: proof. environ vocabularies RELAT_1, FUNCT_1, FUNCT_2; notations XBOOLE_0, RELAT_1, FUNCT_1, FUNCT_2; constructors RELAT_1, FUNCT_1, FUNCT_2; registrations RELAT_1, FUNCT_1, FUNCT_2; begin ::$P- theorem for A,B...
src_data/babel-formal/stmts/mizar/comp_commute.miz
1e81aea8b3ad8b7d96c170dafa452a7f4fca961e79bba03e5a56dd7c29911ef6
null
2
babel-formal
comp_commute
comp_commute
a
pvs
% Statement-only formalization of the Babel-formal topic comp_commute. This file contains no % proof. comp_commute[A: TYPE+]: THEORY BEGIN myComp(g, f: [A -> A]): [A -> A] = LAMBDA (x: A): g(f(x)) myId(x: A): A = x comp_assoc: bool = FORALL (h, g, f: [A -> A]): myComp(h, myComp(g, f)) = myComp(my...
src_data/babel-formal/stmts/pvs/comp_commute.pvs
9df0c67c092646114d4fa194e31911ee5235394628932b99e7d0f43ad47c1c8b
null
3
babel-formal
galois
galois
a
lean4
class Field (F : Type) where zero_F : F one_F : F add_F : F → F → F mul_F : F → F → F opp_F : F → F inv_F : F → F add_comm : ∀ x y, add_F x y = add_F y x add_assoc : ∀ x y z, add_F (add_F x y) z = add_F x (add_F y z) add_zero : ∀ x, add_F x zero_F = x add_inv_l : ∀ ...
src_data/babel-formal/stmts/lean4/galois.lean
2e50a004a3b6ad8d275cbf661c3790d7d6d0f13e6bc040c01ba54df047fc5121
null
3
babel-formal
galois
galois
a
rocq
Class Field (F : Type) := { zero_F : F; one_F : F; add_F : F -> F -> F; mul_F : F -> F -> F; opp_F : F -> F; inv_F : F -> F; add_comm : forall x y, add_F x y = add_F y x; add_assoc : forall x y z, add_F (add_F x y) z = add_F x (add_F y z); add_zero : forall x, add_F x z...
src_data/babel-formal/stmts/rocq/galois.v
5152380ce58c0d786f549f2c5ad6e4beda88d5e89b5e68f6ac7185d444a86f40
null
3
babel-formal
galois
galois
a
isabelle
theory galois imports Main begin locale field_like = fixes zero_F one_F :: "'f" and add_F :: "'f \<Rightarrow> 'f \<Rightarrow> 'f" (infixl "+F" 65) and mul_F :: "'f \<Rightarrow> 'f \<Rightarrow> 'f" (infixl "*F" 70) and opp_F :: "'f \<Rightarrow> 'f" and inv_F :: "'f \<Rightarrow> 'f" ass...
src_data/babel-formal/stmts/isabelle/galois.thy
fdeeb688101b402a4c08e0fb4c54b4015b79b2ee317ac64baa98ce16ea874996
null
3
babel-formal
galois
galois
a
hol-light
let field_like = new_definition `field_like (zero_F:'a) (one_F:'a) (add_F:'a->'a->'a) (mul_F:'a->'a->'a) (opp_F:'a->'a) (inv_F:'a->'a) <=> (!x:'a y:'a. add_F x y = add_F y x) /\ (!x:'a y:'a z:'a. add_F (add_F x y) z = add_F x (add_F y z)) /\ (!x:'a. add_F x zero_F = x) /\ (!x:'a. add...
src_data/babel-formal/stmts/hol-light/galois.ml
3f18c4527a9beb3f309cf92fdf01a08608eb260fc6b8f5f27cd8e58112926230
null
3
babel-formal
galois
galois
a
acl2
;; Statement-only formalization of Babel-formal corpus artifact galois: ;; cancellation and inverse laws for arbitrary fields, and solvability ;; propagation through map-sensitive polynomial maps and splitting-field ;; towers over arbitrary types. This file contains no proof. (in-package "ACL2") (set-inhibit-output-l...
src_data/babel-formal/stmts/acl2/galois.lsp
0fef7e52972c648d16a00d8090cdfa547ca4b6fbd18b660678593b818f9767d9
null
3
babel-formal
galois
galois
a
agda
-- Statement-only formalization of the Babel-formal topic galois. This file contains no proof. module galois where open import Agda.Builtin.Equality using (_≡_) data ⊥ : Set where infix 4 _≢_ _≢_ : {A : Set} → A → A → Set x ≢ y = x ≡ y → ⊥ infixr 2 _∧_ record _∧_ (A B : Set) : Set where field left : A r...
src_data/babel-formal/stmts/agda/galois.agda
41a852fea2729ca3ed7c1b3b1708bd7e89afceb64cb7dcd70c796ab02ba5c0ca
null
3
babel-formal
galois
galois
a
hol4
(* Statement-only formalization of the Babel-formal artifact galois: field cancellation laws and solvability across polynomial maps and splitting-field towers. This file contains no proof. *) open HolKernel Parse boolLib; val _ = new_theory "hello"; val add_cancel_l = ``!(zerof : 'f) (onef : 'f) (addf ...
src_data/babel-formal/stmts/hol4/galois.sml
cb24f954ccb6ae122bac6462d4c79331202cb77fcd78dcb5f1555d508421afc1
null
3
babel-formal
galois
galois
a
metamath
$( Statement-only formalization of the Babel-formal galois artifact: field cancellation and inverses, and solvability of Galois groups along polynomial splitting-field towers. This file contains no proof. $) $( Statement-only translation of the Babel-formal galois artifact. The object language is many-sorte...
src_data/babel-formal/stmts/metamath/galois.mm
fb22038b497624f3751327c07842247e7b36b0153d5735348202613106f61012
null
3
babel-formal
galois
galois
a
mizar
:: Statement-only formalization of the Babel-formal artifact galois: field :: cancellation laws and solvability along polynomial and splitting-field maps. :: This file contains no proof. environ vocabularies TARSKI, XBOOLE_0, SUBSET_1, FUNCT_1, FUNCT_2, RELAT_1, ZFMISC_1, BINOP_1; notations TARSKI, XBOOLE_0, Z...
src_data/babel-formal/stmts/mizar/galois.miz
bce75648b2680356e872eb90c83b20b4bce86237a838a92769678d493da602c7
null
3
babel-formal
galois
galois
a
pvs
% Statement-only formalization of the Babel-formal artifact galois, concerning field % cancellation laws and solvability across Galois-theoretic polynomial towers. This file % contains no proof. galois_field[ FieldElem: TYPE, zero_F: FieldElem, one_F: FieldElem, add_F: [FieldElem, FieldElem -> FieldElem], mu...
src_data/babel-formal/stmts/pvs/galois.pvs
5b30e4963c5dbea6062b53905cd30741312395ac1367d6070782205309a7fde0
null
4
babel-formal
graph_paths
graph_paths
a
lean4
universe u namespace GraphPath variable {V : Type u} def Edge (V : Type u) := V → V → Prop inductive Path (E : Edge V) : V → V → Prop | nil : ∀ v, Path E v v | step : ∀ {u v w}, Path E u v → E v w → Path E u w variable {E : Edge V} theorem refl (v : V) : Path (E:=E) v v := Path.nil v theorem trans {u v w : V} ...
src_data/babel-formal/stmts/lean4/graph_paths.lean
48a84cc2bbab86c56e46364733c42c4b84082e90a3e06c9c21fd78d79ddb4407
null
4
babel-formal
graph_paths
graph_paths
a
rocq
Section Graph. Variable V : Type. Definition Edge := V -> V -> Prop. Inductive Path (E : Edge) : V -> V -> Prop := | Pnil : forall v, Path E v v | Pstep : forall u v w, Path E u v -> E v w -> Path E u w. Lemma path_refl (E : Edge) (v : V) : Path E v v. Proof. Admitted. Fixpoint append_right (E : Edge)...
src_data/babel-formal/stmts/rocq/graph_paths.v
d70bc5f745b2cdd5ecdc11ec29bdfe09ff71968f50dc20f981c357cb84d6ce54
null
4
babel-formal
graph_paths
graph_paths
a
isabelle
theory graph_paths imports Main begin inductive Path :: "('a \<Rightarrow> 'a \<Rightarrow> bool) \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> bool" for E :: "'a \<Rightarrow> 'a \<Rightarrow> bool" where Pnil: "Path E v v" | Pstep: "Path E u v \<Longrightarrow> E v w \<Longrightarrow> Path E u w" definitio...
src_data/babel-formal/stmts/isabelle/graph_paths.thy
7d1bcd97cd8c70242789814ab6421ba91fc98e64ec557420635c2dc767a273e7
null
4
babel-formal
graph_paths
graph_paths
a
hol-light
let path_RULES,path_INDUCT,path_CASES = new_inductive_definition `(!E:A->A->bool v. path E v v) /\ (!E:A->A->bool u v w. path E u v /\ E v w ==> path E u w)`;; let undirected = new_definition `undirected (E:A->A->bool) <=> !x y. E x y ==> E y x`;; let erev = new_definition `erev (E:A->A->bool) x y <=> E y x`...
src_data/babel-formal/stmts/hol-light/graph_paths.ml
03fbecc9c1a6f54eee7a4acd9b29b23c661c16b52f15eb4fa600d86e3e13c00b
null
4
babel-formal
graph_paths
graph_paths
a
acl2
;; Statement-only formalization of Babel-formal artifact graph_paths: ;; reflexive-transitive paths in arbitrary directed relations, path ;; concatenation, edge reversal, and reversal for undirected relations. This ;; file contains no proof. (in-package "ACL2") ;; CARRIER and EDGE are ACL2 function objects evaluated ...
src_data/babel-formal/stmts/acl2/graph_paths.lsp
20a09f78d292c599d8ad7daa07eb049454e61c2be1158df690e29268cf09a405
null
4
babel-formal
graph_paths
graph_paths
a
agda
-- Statement-only formalization of the Babel-formal topic graph_paths. This file contains no -- proof. module graph_paths where open import Agda.Primitive using (Level; lsuc) Edge : forall {l : Level} -> Set l -> Set (lsuc l) Edge {l} V = V -> V -> Set l data Path {l : Level} {V : Set l} (E : Edge V) : V -> V -> Se...
src_data/babel-formal/stmts/agda/graph_paths.agda
dd98175e52a85465f154ac0a25bd5f15ae8f8ae6116b1c4f55c392ace3b244db
null
4
babel-formal
graph_paths
graph_paths
a
hol4
(* Statement-only formalization of the Babel-formal topic graph_paths. This file contains no proof. *) open HolKernel Parse boolLib bossLib; val (path_rules, path_ind, path_cases) = Hol_reln ` (!E v. path (E : 'a -> 'a -> bool) v v) /\ (!E u v w. path (E : 'a -> 'a -> bool) u v /\ E v w ==> path E...
src_data/babel-formal/stmts/hol4/graph_paths.sml
99695d491125fd3d75c14332b52566adcda8464aff9426357b34e27cd65621d8
null
4
babel-formal
graph_paths
graph_paths
a
metamath
$( Statement-only formalization of the Babel-formal topic graph_paths. This file contains no proof. $) $( Statement-only encoding of finite directed paths on an arbitrary vertex sort. The relation sort represents Edge V. $) $c vertex relation wff |- ( ) -> /\ <-> A.v A.r Path Erev Undirected $. $v E R u v w...
src_data/babel-formal/stmts/metamath/graph_paths.mm
06e044339454a4194e4da91aab80ab112b95954452eb2e70960c2d040ed72a24
null
4
babel-formal
graph_paths
graph_paths
a
mizar
:: Statement-only formalization of the Babel-formal topic graph_paths. This file contains no :: proof. environ vocabularies TARSKI, XBOOLE_0, ZFMISC_1, SUBSET_1, RELAT_1, RELAT_2, REWRITE1; notations TARSKI, XBOOLE_0, ZFMISC_1, SUBSET_1, RELAT_1, RELSET_1, RELAT_2, REWRITE1; constructors RELAT_1, REL...
src_data/babel-formal/stmts/mizar/graph_paths.miz
1b2e97bca35c3ebf8e2478887f3eca38ddd3b64ac84bd4ed0e5e51eb8a95929f
null
4
babel-formal
graph_paths
graph_paths
a
pvs
% Statement-only formalization of the Babel-formal topic graph_paths. This file contains no % proof. graph_paths[V: TYPE]: THEORY BEGIN edge: TYPE = [V, V -> bool] path(E: edge, u, v: V): bool = FORALL (R: edge): ((FORALL (x: V): R(x, x)) AND (FORALL (x, y, z: V): R(x, y) AND E(y, z) I...
src_data/babel-formal/stmts/pvs/graph_paths.pvs
549b3e1dd441db652a543549a5d6b361220208733915ec531b9a244e19c11e99
null
5
babel-formal
group
group
a
lean4
class Group (G : Type) where inv : G → G one : G mul : G → G → G mul_assoc : ∀ a b c : G, mul a (mul b c) = mul (mul a b) c mul_one : ∀ a : G, mul a one = a one_mul : ∀ a : G, mul one a = a mul_inv_l : ∀ a : G, mul (inv a) a = one mul_inv_r : ∀ a : G, mul a (inv a) = one namespace Group infixl:70 ...
src_data/babel-formal/stmts/lean4/group.lean
28d9e2bf0e15f8b80571f6a08ab7b913a1b280bb997fca055d6b48b2eb5ee7cc
null
5
babel-formal
group
group
a
rocq
Class Group (G : Type) := { inv : G -> G; one : G; mul : G -> G -> G; mul_assoc : forall a b c, mul a (mul b c) = mul (mul a b) c; mul_one : forall a, mul a one = a; one_mul : forall a, mul one a = a; mul_inv_l : forall a, mul (inv a) a = one; mul_inv_r : forall a, mul a (inv a) = one }. Infix "*"...
src_data/babel-formal/stmts/rocq/group.v
68e5c68344e58b59cf1ca3ae7527617a0f96e88128f869408f94a1bceb18fedd
null
5
babel-formal
group
group
a
isabelle
theory group imports Main begin locale group = fixes mul :: "'a => 'a => 'a" (infixl "**" 70) and one :: "'a" and inv :: "'a => 'a" assumes mul_assoc : "a ** (b ** c) = (a ** b) ** c" and mul_one : "a ** one = a" and one_mul : "one ** a = a" and mul_inv_l : "inv a ** a = one" ...
src_data/babel-formal/stmts/isabelle/group.thy
1f4626be6f1eda1e9f29f59b837f47b2ea690b4b4750e2e6a2674ffb32da1e18
null
5
babel-formal
group
group
a
hol-light
let is_group = new_definition `is_group (mul:A->A->A) (e:A) (ginv:A->A) <=> (!a b c. mul a (mul b c) = mul (mul a b) c) /\ (!a. mul a e = a) /\ (!a. mul e a = a) /\ (!a. mul (ginv a) a = e) /\ (!a. mul a (ginv a) = e)`;; let INTRO_GROUP_HYPS = REWRITE_TAC[is_group] THEN REPEAT GEN_TAC THE...
src_data/babel-formal/stmts/hol-light/group.ml
b66c95fb43c3879bff271a584c4c9ce4c8fe3f610fa6ac814894d6d27f91d481
null
5
babel-formal
group
group
a
acl2
;; Statement-only formalization of Babel-formal artifact group: arbitrary ;; groups and group actions, elementary cancellation and inverse laws, and ;; orbit and stabilizer properties. This file contains no proof. (in-package "ACL2") (set-inhibit-output-lst '(prove proof-tree event summary)) ;; Conservative generic ...
src_data/babel-formal/stmts/acl2/group.lsp
b3bd3ce54cb1469f4383af9933fe61d6b74349fff30cc6ad3886272acaaa7f81
null
5
babel-formal
group
group
a
agda
-- Statement-only formalization of the Babel-formal topic group. This file contains no proof. module group where open import Agda.Primitive using (Level; _⊔_) open import Agda.Builtin.Equality using (_≡_) open import Agda.Builtin.Sigma using (Σ) infix 2 _↔_ record _↔_ {a b : Level} (A : Set a) (B : Set b) : Set (a ...
src_data/babel-formal/stmts/agda/group.agda
6cd6d11da5d7cd6d21ce65af63edec101b7aee2ae425426dacf610c4f9b89337
null
5
babel-formal
group
group
a
hol4
(* Statement-only formalization of the Babel-formal artifact group: group laws, commutative multiplication, group actions, orbits, and stabilizers. This file contains no proof. *) open HolKernel Parse boolLib; val babel_group_def = new_definition ( "babel_group_def", ``babel_group (mul : 'a -> 'a -> 'a) (e ...
src_data/babel-formal/stmts/hol4/group.sml
ead5e7a72d8264382c40900e5a52e1b1c886cb5720f131df782e23b4023fdc79
null
5
babel-formal
group
group
a
metamath
$( Statement-only formalization of the Babel-formal topic group. This file contains no proof. $) $( Statement-only encoding of groups, commutative groups, group actions, orbits, and stabilizers. The mathematical declarations and results are unproved $a assertions; this database contains no $p statements. $) ...
src_data/babel-formal/stmts/metamath/group.mm
18233c388cbf546e478cf687afffd951dfe064f4abb9b1b61547edea41371fb2
null
5
babel-formal
group
group
a
mizar
:: Statement-only formalization of the Babel-formal topic group. This file contains no proof. environ vocabularies TARSKI, XBOOLE_0, RELAT_1, FUNCT_1, SUBSET_1, BINOP_1, ORDINAL4, GROUP_1, GROUP_2, GROUP_3, GROUP_10, ALGSTR_0, STRUCT_0; notations TARSKI, XBOOLE_0, SUBSET_1, RELAT_1, FUNCT_1, RELSET_1, F...
src_data/babel-formal/stmts/mizar/group.miz
10a5c31207ffbb23ee56fa982348881580acf6fa209793ab7593a7cb857ce12d
null
5
babel-formal
group
group
a
pvs
% Statement-only formalization of the Babel-formal artifact group: group and commutative-group % laws, group actions, orbits, stabilizers, and their stated identities. This file contains no proof. group[ G: TYPE+, X: TYPE, inv: [G -> G], one: G, mul: [G, G -> G], act: [G, X -> X] ]: THEORY BEGIN group_la...
src_data/babel-formal/stmts/pvs/group.pvs
d4d36b2b3be71bd9584af04da960efee97c7d43ef7d4748ea494fb21a04619dd
null
6
babel-formal
ideals
ideals
a
lean4
class CRing (R : Type) where zero : R one : R add : R → R → R mul : R → R → R opp : R → R add_comm : ∀ x y, add x y = add y x add_assoc : ∀ x y z, add (add x y) z = add x (add y z) add_zero : ∀ x, add x zero = x add_opp : ∀ x, add x (opp x) = zero mul_comm : ∀ x y, mul x y = mul y x ...
src_data/babel-formal/stmts/lean4/ideals.lean
18a3ad8b51e783698bf4827fe64a3ddb9d5c7d23a32ef0281939e3bbbb3a7a7d
null
6
babel-formal
ideals
ideals
a
rocq
Require Import Coq.Init.Logic. Class CRing := { R : Type; zero : R; one : R; add : R -> R -> R; mul : R -> R -> R; opp : R -> R; add_comm : forall x y, add x y = add y x; add_assoc : forall x y z, add (add x y) z = add x (add y z); add_zero : forall x, add x zero = x; zero_add : fo...
src_data/babel-formal/stmts/rocq/ideals.v
288f69fc7cc86c3edd2aa97b76404143efe75113428e3d53d38178222012f606
null
6
babel-formal
ideals
ideals
a
isabelle
theory ideals imports Main begin locale cring = fixes zero :: "'r" and one :: "'r" and add :: "'r \<Rightarrow> 'r \<Rightarrow> 'r" (infixl "+R" 65) and mul :: "'r \<Rightarrow> 'r \<Rightarrow> 'r" (infixl "*R" 70) and opp :: "'r \<Rightarrow> 'r" assumes add_comm : "\<And>x y. x +R y = ...
src_data/babel-formal/stmts/isabelle/ideals.thy
da94ee4c1dda922a5713f463a5c7edcc5e7b889dd37e408fde4527ab30cc7bd9
null
6
babel-formal
ideals
ideals
a
hol-light
let cring = new_definition `cring (zero:'r) (oneR:'r) (add:'r->'r->'r) (mul:'r->'r->'r) (opp:'r->'r) <=> (!x y. add x y = add y x) /\ (!x y z. add (add x y) z = add x (add y z)) /\ (!x. add x zero = x) /\ (!x. add x (opp x) = zero) /\ (!x y. mul x y = mul y x) /\ (!x y z. mul (mul x y) z...
src_data/babel-formal/stmts/hol-light/ideals.ml
b28436f97d3306a62914f53c80320cc6dad5d205e95ed6ebe2415bf5fbe2719b
null
6
babel-formal
ideals
ideals
a
acl2
;; Statement-only formalization of Babel-formal artifact ideals: in an ;; arbitrary commutative ring, an arbitrarily indexed intersection of ideals ;; and the sum of two ideals are ideals. This file contains no proof. (in-package "ACL2") (set-inhibit-output-lst '(prove proof-tree event summary)) ;; These conservativ...
src_data/babel-formal/stmts/acl2/ideals.lsp
c0aae89f348d5546c2aefa3e6a415b1fcd14ec7d57447b9e7478eba27aab8458
null
6
babel-formal
ideals
ideals
a
agda
-- Statement-only formalization of the Babel-formal topic ideals. This file contains no proof. module ideals where open import Agda.Primitive using (Level; _⊔_) open import Agda.Builtin.Equality using (_≡_) open import Agda.Builtin.Sigma using (Σ) infixr 3 _∧_ record _∧_ {a b : Level} (A : Set a) (B : Set b) : Set ...
src_data/babel-formal/stmts/agda/ideals.agda
01462b1a767586471ccd0fbe55ca73006b881c8bef3434139f753c2fd24bac00
null
6
babel-formal
ideals
ideals
a
hol4
(* Statement-only formalization of the Babel-formal artifact ideals: arbitrary intersections and binary sums of ideals in a commutative ring are ideals. This file contains no proof. *) open HolKernel Parse boolLib; val _ = new_theory "hello"; val babel_cring_def = new_definition ( "babel_cring_def", ``babe...
src_data/babel-formal/stmts/hol4/ideals.sml
2cb3ed738704a2e5d67c86bc8e0bb0f87a108868caadb458a42df7abb752ceca
null
6
babel-formal
ideals
ideals
a
metamath
$( Statement-only formalization of the Babel-formal topic ideals. This file contains no proof. $) $( Statement-only encoding of commutative rings, ideals, intersections of indexed families of ideals, and sums of two ideals. $) $c evar ivar elt index pred family binop unop wff |- ( ) = /\ -> <-> A. E. A_i. ...
src_data/babel-formal/stmts/metamath/ideals.mm
54978640adc274722319e8ff7b4ed590437ae91553df11081d4fdcdafb0b0b4c
null
6
babel-formal
ideals
ideals
a
mizar
:: Statement-only formalization of the Babel-formal topic ideals. This file contains no proof. environ vocabularies ARYTM_3, FUNCT_1, RELAT_1, CARD_3, XBOOLE_0, TARSKI, XCMPLX_0, STRUCT_0, SUBSET_1, SUPINF_2, NAT_1, CARD_1, MESFUNC1, GROUP_1, ARYTM_1, FINSEQ_1, SETFAM_1, INT_2, QUOFIELD, BINOP_1, GROUP_4...
src_data/babel-formal/stmts/mizar/ideals.miz
5715d2723d124b227452ac9ae8e44eddca9ea6abf8c1f638e48862e3f4225b78
null
6
babel-formal
ideals
ideals
a
pvs
% Statement-only formalization of the Babel-formal topic ideals. This file contains no proof. ideals[ R: TYPE+, Index: TYPE, zero: R, one: R, add: [R, R -> R], mul: [R, R -> R], opp: [R -> R] ]: THEORY BEGIN cring: bool = (FORALL (x, y: R): add(x, y) = add(y, x)) AND (FORALL (x, y, z: R): ...
src_data/babel-formal/stmts/pvs/ideals.pvs
5762fc54c787e5f9201512746da273020ac429eedb5fa797f559bc465275fae8
null
7
babel-formal
inner_product
inner_product
a
lean4
namespace Linear class Field (R : Type) where zero : R one : R add : R → R → R mul : R → R → R opp : R → R add_comm : ∀ x y, add x y = add y x add_assoc : ∀ x y z, add (add x y) z = add x (add y z) add_zero : ∀ x, add x zero = x zero_add : ∀ x, add zero x = x add_opp ...
src_data/babel-formal/stmts/lean4/inner_product.lean
35e89b4d0ac23ec490077ba6861c2d5a10f2aa62a9b1897f741e9eb21e0c1d85
null
7
babel-formal
inner_product
inner_product
a
rocq
Class Field := { R0 : Type; zeroR : R0; oneR : R0; addR : R0 -> R0 -> R0; mulR : R0 -> R0 -> R0; oppR : R0 -> R0; addR_comm : forall x y, addR x y = addR y x; addR_assoc : forall x y z, addR (addR x y) z = addR x (addR y z); addR_zero : forall x, addR x zeroR = x; zeroR_add : forall x, ad...
src_data/babel-formal/stmts/rocq/inner_product.v
180df7010cb4167a7a84384400b272905558a77e36185f912d2077a3f738a4b4
null
7
babel-formal
inner_product
inner_product
a
isabelle
theory inner_product imports Main begin locale inner_product = fixes zero_R one_R :: "'r" and add_R :: "'r \<Rightarrow> 'r \<Rightarrow> 'r" (infixl "+R" 65) and mul_R :: "'r \<Rightarrow> 'r \<Rightarrow> 'r" (infixl "*R" 70) and opp_R :: "'r \<Rightarrow> 'r" and zeroV :: "'v" and addV ::...
src_data/babel-formal/stmts/isabelle/inner_product.thy
a0e2ad91e8f5d7b489ab7a47b12dd0c6a4dc84d5a24bc14015672784c68e450f
null
7
babel-formal
inner_product
inner_product
a
hol-light
let is_inner_context = new_definition `is_inner_context (zeroR:R) (oneR:R) (add:R->R->R) (mul:R->R->R) (opp:R->R) (addV:V->V->V) (oppV:V->V) (smul:R->V->V) (ip:V->V->R) <=> (!x y. add x y = add y x) /\ (!x y z. add (add x y) z = add x (add y z)) /\...
src_data/babel-formal/stmts/hol-light/inner_product.ml
5fc9e25424d30a908f100262e360354ab0bc0f0bd4f81c36b81c0d40e9024364
null
7
babel-formal
inner_product
inner_product
a
acl2
;; Statement-only formalization of Babel-formal artifact inner_product: six ;; negation, expansion, Pythagorean, and parallelogram identities for a ;; symmetric bilinear inner product over arbitrary scalar and vector carriers ;; satisfying the source's algebraic laws. This file contains no proof. (in-package "ACL2") ...
src_data/babel-formal/stmts/acl2/inner_product.lsp
3a8f1597164cdef7d0bb243a97d67df7ac2dcfd17e5d0bc6e1f3158a4010de40
null
7
babel-formal
inner_product
inner_product
a
agda
-- Statement-only formalization of the Babel-formal topic inner_product. This file contains no -- proof. module inner_product where open import Agda.Primitive using (Level; _⊔_) open import Agda.Builtin.Equality using (_≡_) record Field {ℓ : Level} (R : Set ℓ) : Set ℓ where field zero : R one : R add ...
src_data/babel-formal/stmts/agda/inner_product.agda
dcb6e73d05a6e16f227837b10a5cb36eadef21af9949a34168e9dfdcf4c6c51b
null
7
babel-formal
inner_product
inner_product
a
hol4
(* Statement-only formalization of the Babel-formal artifact inner_product: abstract vector spaces with a symmetric bilinear form and its sum, difference, Pythagoras, and parallelogram identities. This file contains no proof. *) open HolKernel Parse boolLib; val _ = new_theory "hello"; val inner_product_cont...
src_data/babel-formal/stmts/hol4/inner_product.sml
a6f1ab8316ded77ed3ea69d0a84e6c4c75177516efd3a52457ac60c9d21095ea
null
7
babel-formal
inner_product
inner_product
a
metamath
$( Statement-only formalization of the Babel-formal inner_product artifact: negation, sum, difference, orthogonality, and parallelogram identities for an abstract symmetric bilinear inner product. This file contains no proof. $) $( Statement-only encoding of an abstract scalar field, vector space, and symmet...
src_data/babel-formal/stmts/metamath/inner_product.mm
cd456580fed92fce1b0e2967ed39fb1ba6ce6d30533a320d4161034387fba03c
null
7
babel-formal
inner_product
inner_product
a
mizar
:: Statement-only formalization of the Babel-formal topic inner_product. This file contains no :: proof. environ vocabularies TARSKI, XBOOLE_0, SUBSET_1, FUNCT_1, FUNCT_2, RELAT_1, ZFMISC_1, BINOP_1; notations XBOOLE_0, ZFMISC_1, SUBSET_1, RELAT_1, FUNCT_1, FUNCT_2, BINOP_1; constructors ZFMISC_1, FUNCT_...
src_data/babel-formal/stmts/mizar/inner_product.miz
2775d997e45f47299bbe68812691417a51fc735198091f840f45a8ebc16b21d3
null
7
babel-formal
inner_product
inner_product
a
pvs
% Statement-only formalization of the Babel-formal topic inner_product. This file contains no % proof. inner_product[ R: TYPE+, V: TYPE+, zeroR: R, oneR: R, addR: [R, R -> R], mulR: [R, R -> R], oppR: [R -> R], zeroV: V, addV: [V, V -> V], oppV: [V -> V], smul: [R, V -> V], ip: [V, V -> R] ]: T...
src_data/babel-formal/stmts/pvs/inner_product.pvs
125795611686cca4022aec9f28344649c452d718ccae756a6511def39b452af2
null
8
babel-formal
integral_comp_neg_Iic
integral_comp_neg_Iic
a
lean4
class RField (R : Type) where zero : R one : R add : R → R → R opp : R → R mul : R → R → R le : R → R → Prop lt : R → R → Prop abs : R → R add_comm : ∀ x y, add x y = add y x add_assoc : ∀ x y z, add (add x y) z = add x (add y z) add_zero : ∀ x, add x zero =...
src_data/babel-formal/stmts/lean4/integral_comp_neg_Iic.lean
1d30acbeff7043606cab1f03bd089a24454ed0cfc377a547a9bf2ee0daa52dfb
null
8
babel-formal
integral_comp_neg_Iic
integral_comp_neg_Iic
a
rocq
Class RField (R : Type) := { zero : R; one : R; add : R -> R -> R; opp : R -> R; mul : R -> R -> R; le : R -> R -> Prop; lt : R -> R -> Prop; abs : R -> R; add_comm : forall x y, add x y = add y x; add_assoc : forall x y z, add (add x y) z = add x (add y z); add_...
src_data/babel-formal/stmts/rocq/integral_comp_neg_Iic.v
d9c93bdef213e8c501d73138498f5c5e95aade813c20a5a01d1ef0ca70c300f0
null
8
babel-formal
integral_comp_neg_Iic
integral_comp_neg_Iic
a
isabelle
theory integral_comp_neg_Iic imports Main begin locale integrals_setup = fixes zero one :: "'r" and add :: "'r \<Rightarrow> 'r \<Rightarrow> 'r" (infixl "+R" 65) and opp :: "'r \<Rightarrow> 'r" and mul :: "'r \<Rightarrow> 'r \<Rightarrow> 'r" (infixl "*R" 70) and leR ...
src_data/babel-formal/stmts/isabelle/integral_comp_neg_Iic.thy
3585c5aab2a8bb504a69eae5c48f3d1a2a0cd6244bff4353f765c47bcad23e8a
null
8
babel-formal
integral_comp_neg_Iic
integral_comp_neg_Iic
a
hol-light
let is_integral_context = new_definition `is_integral_context (zero:R) (oneR:R) (add:R->R->R) (opp:R->R) (mul:R->R->R) (le:R->R->bool) (lt:R->R->bool) (absR:R->R) (sigma:(R->bool)->(R->R)->R) <=> (!x:R y:R. add x y = add y x) /\ (!x:R y:R ...
src_data/babel-formal/stmts/hol-light/integral_comp_neg_Iic.ml
59b625e19349d53d0736bea1f83b6cf19028a0a3890804ca8f10f649b3a85e87
null
8
babel-formal
integral_comp_neg_Iic
integral_comp_neg_Iic
a
acl2
;; Statement-only formalization of the Babel-formal artifact ;; integral_comp_neg_Iic. The arbitrary source carrier, functions, and ;; predicates remain arbitrary here; no finite enumeration is used. (in-package "ACL2") (set-inhibit-output-lst '(prove proof-tree event summary)) ;; The token R-TYPE identifies an arbi...
src_data/babel-formal/stmts/acl2/integral_comp_neg_Iic.lsp
9153268d3746e45814f3a1836619802213c5d20094274e291e31d0a222c75024
null
8
babel-formal
integral_comp_neg_Iic
integral_comp_neg_Iic
a
agda
-- Statement-only formalization of the Babel-formal artifact integral_comp_neg_Iic: -- abstract ordered-field integral identities and negated interval preimages. -- This file contains no proof. module integral_comp_neg_Iic where open import Agda.Primitive using (Level; lsuc; _⊔_) open import Agda.Builtin.Equality usi...
src_data/babel-formal/stmts/agda/integral_comp_neg_Iic.agda
277a8b5855224501686efc10690ccb6e348cb7b98bb0bf46822ac292adb28ed7
null
8
babel-formal
integral_comp_neg_Iic
integral_comp_neg_Iic
a
hol4
(* Statement-only formalization of the Babel-formal topic integral_comp_neg_Iic. This file contains no proof. *) open HolKernel Parse boolLib; val _ = new_theory "hello"; val is_integral_context_def = new_definition ( "is_integral_context_def", ``is_integral_context (zero : 'r) (oneR : 'r) (add :...
src_data/babel-formal/stmts/hol4/integral_comp_neg_Iic.sml
a214f989788880dd56e03b17ae34e67018195d61774592140369ad390de13b13
null
8
babel-formal
integral_comp_neg_Iic
integral_comp_neg_Iic
a
metamath
$( Statement-only formalization of the Babel-formal topic integral_comp_neg_Iic. This file contains no proof. $) $( Statement-only encoding of an abstract ordered field, an abstract integral, interval domains, preimages, and the resulting integral identities. obj is the fixed arbitrary carrier R, fun is R -...
src_data/babel-formal/stmts/metamath/integral_comp_neg_Iic.mm
48473f6b14d773cf49480a3bb9982a749b141061dde0d7a252608ae9187f049d
null
8
babel-formal
integral_comp_neg_Iic
integral_comp_neg_Iic
a
mizar
:: Statement-only formalization of the Babel-formal topic integral_comp_neg_Iic. This file :: contains no proof. environ vocabularies FUNCT_1, FUNCT_2, RELAT_1, XBOOLE_0, ZFMISC_1, SUBSET_1, TARSKI, PARTFUN1, BINOP_1; notations TARSKI, XBOOLE_0, ZFMISC_1, SUBSET_1, RELAT_1, FUNCT_1, RELSET_1, PARTFUN1, FUN...
src_data/babel-formal/stmts/mizar/integral_comp_neg_Iic.miz
41d96abe73c77a570908d2a75dc2ec904aa1efd00f4a50e34c1b8eae3c692fe8
null
8
babel-formal
integral_comp_neg_Iic
integral_comp_neg_Iic
a
pvs
% Statement-only formalization of the Babel-formal artifact integral_comp_neg_Iic: % abstract ordered algebra, interval preimages under negation, and integral identities. % This file contains no proof. integral_comp_neg_Iic[ R: TYPE+, zero: R, one: R, add: [R, R -> R], opp: [R -> R], mul: [R, R -> R], le...
src_data/babel-formal/stmts/pvs/integral_comp_neg_Iic.pvs
56dbaa9670ebca81c08f0eaeb2eefb4b6869581e54ca8b5214fc8ece6ba3b309
null
9
babel-formal
lattice_like
lattice_like
a
lean4
universe u class LatticeLike (A : Type u) where le : A → A → Prop inf : A → A → A sup : A → A → A le_refl : ∀ x, le x x le_trans : ∀ {x y z}, le x y → le y z → le x z le_antisym : ∀ {x y}, le x y → le y x → x = y le_inf_left : ∀ a b, le (inf a b) a le_inf_right : ∀ a b, le (inf a b) b le_inf_...
src_data/babel-formal/stmts/lean4/lattice_like.lean
5583be5e7d2022496fe2cad522dfe44e3b2d89438cfb0b1bf8c625b5ec41f375
null
9
babel-formal
lattice_like
lattice_like
a
rocq
Class LatticeLike (A : Type) := { le : A -> A -> Prop; inf : A -> A -> A; sup : A -> A -> A; le_refl : forall x, le x x; le_trans : forall x y z, le x y -> le y z -> le x z; le_antisym : forall x y, le x y -> le y x -> x = y; le_inf_left : forall a b, le (inf a b) a; le_inf_right : forall a b, l...
src_data/babel-formal/stmts/rocq/lattice_like.v
cab91401a0d1ef22af911219abca73e840952b8989748549bdf555914b8f2269
null
9
babel-formal
lattice_like
lattice_like
a
isabelle
theory lattice_like imports Main begin locale lattice_like = fixes le :: "'a \<Rightarrow> 'a \<Rightarrow> bool" (infix "\<preceq>" 50) and inf :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" (infixl "\<sqinter>" 60) and sup :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" (infixl "\<squnion>" 65) assumes le_r...
src_data/babel-formal/stmts/isabelle/lattice_like.thy
c241953319e70a98007661a3f51e9183f5c960f224482a514d62d8829b301552
null
9
babel-formal
lattice_like
lattice_like
a
hol-light
let is_lattice_like = new_definition `is_lattice_like (le_rel:A->A->bool) (inf_op:A->A->A) (sup_op:A->A->A) <=> (!x. le_rel x x) /\ (!x y z. le_rel x y /\ le_rel y z ==> le_rel x z) /\ (!x y. le_rel x y /\ le_rel y x ==> x = y) /\ (!a b. le_rel (inf_op a b) a) /\ (!a b. le_rel (inf_op a b) b)...
src_data/babel-formal/stmts/hol-light/lattice_like.ml
28b713b170c73c16adbcb81d9f83ce126c24cc44fcea2adf45c604c85d72d9ff
null
9
babel-formal
lattice_like
lattice_like
a
acl2
;; Statement-only formalization of Babel-formal artifact lattice_like: on an ;; arbitrary carrier, a partial order with infimum and supremum operations ;; satisfying their universal properties has commutative and associative meet ;; and join and satisfies both absorption laws. This file contains no proof. (in-package ...
src_data/babel-formal/stmts/acl2/lattice_like.lsp
d5bee5123b72d3385c69881fb7890c7ca1f6ed9b5e53171dc1869a229568bb0c
null
9
babel-formal
lattice_like
lattice_like
a
agda
-- Statement-only formalization of the Babel-formal topic lattice_like. This file contains no -- proof. module lattice_like where open import Agda.Primitive using (Level; lsuc) open import Agda.Builtin.Equality using (_≡_) record LatticeLike {ℓ : Level} (A : Set ℓ) : Set (lsuc ℓ) where field le : A → A → Set ...
src_data/babel-formal/stmts/agda/lattice_like.agda
32a3f44a879a4f289d4938fba1ea16331325da5836f7f6489589d0c3f618dfea
null
9
babel-formal
lattice_like
lattice_like
a
hol4
(* Statement-only formalization of the Babel-formal artifact lattice_like: partial-order, meet, and join laws on the whole ambient type, together with commutativity, associativity, and absorption identities. This file contains no proof. *) open HolKernel Parse boolLib; val lattice_like_def = new_definition ( ...
src_data/babel-formal/stmts/hol4/lattice_like.sml
20c5f7f625ae50083813a07c041f5973eca4cf8ec1386fcc4e2bb5500d45d92c
null
9
babel-formal
lattice_like
lattice_like
a
metamath
$( Statement-only formalization of the Babel-formal topic lattice_like. This file contains no proof. $) $( Statement-only encoding of a lattice-like structure on one abstract carrier. LatticeLike packages a partial order together with binary meet and join operations satisfying their universal properties. T...
src_data/babel-formal/stmts/metamath/lattice_like.mm
0888dd7113f1ed12fd72624aac72aa998d67214233fb8d9972b537fcb127dc35
null
9
babel-formal
lattice_like
lattice_like
a
mizar
:: Statement-only formalization of the Babel-formal topic lattice_like. This file contains no :: proof. environ vocabularies TARSKI, XBOOLE_0, SUBSET_1, RELAT_1, ZFMISC_1, FUNCT_1, FUNCT_2, BINOP_1; notations TARSKI, XBOOLE_0, ZFMISC_1, SUBSET_1, RELAT_1, FUNCT_1, RELSET_1, FUNCT_2, BINOP_1; constructors...
src_data/babel-formal/stmts/mizar/lattice_like.miz
b34c3d55ff6ad3d76d8f3a70fae3d753eec16a47420d6f422bb326d193abee72
null
9
babel-formal
lattice_like
lattice_like
a
pvs
% Statement-only formalization of the Babel-formal topic lattice_like. This file contains no % proof. lattice_like[ A: TYPE, le_rel: [A, A -> bool], inf_op: [A, A -> A], sup_op: [A, A -> A] ]: THEORY BEGIN lattice_like_laws: bool = (FORALL (x: A): le_rel(x, x)) AND (FORALL (x, y, z: A): le_...
src_data/babel-formal/stmts/pvs/lattice_like.pvs
5ec2a0e8733eff2615ba3243a02a83abe4060a1c9dcf1524817c8e06e3a30e34
null
10
babel-formal
limits_uniqueness
limits_uniqueness
a
lean4
class AbsField (R : Type) where zero : R one : R add : R → R → R mul : R → R → R opp : R → R abs : R → R le : R → R → Prop lt : R → R → Prop NatAlt : Type NatAltle : NatAlt → NatAlt → Prop NatAltMax : NatAlt → NatAlt → NatAlt le_max_left : ∀ x y, NatAltle x (NatAltMax ...
src_data/babel-formal/stmts/lean4/limits_uniqueness.lean
e36faaa709a18d21bee4648a6ddec09c35768156cbf4bdaa3933fb0e2c5f2509
null
10
babel-formal
limits_uniqueness
limits_uniqueness
a
rocq
Class AbsField := { R0 : Type; zero : R0; one : R0; add : R0 -> R0 -> R0; mul : R0 -> R0 -> R0; opp : R0 -> R0; abs : R0 -> R0; leR : R0 -> R0 -> Prop; ltR : R0 -> R0 -> Prop; N0 : Type; Nle : N0 -> N0 -> Prop; Nmax : N0 -> N0 -> N0; Nle_max_l : forall x y, Nle x (Nma...
src_data/babel-formal/stmts/rocq/limits_uniqueness.v
9dae7cc0631964d433dbaabb892627348b9fea33061cfb437875a23fb2f3a72d
null
10
babel-formal
limits_uniqueness
limits_uniqueness
a
isabelle
theory limits_uniqueness imports Main begin locale abs_field = fixes zero :: "'r" and one :: "'r" and add :: "'r \<Rightarrow> 'r \<Rightarrow> 'r" (infixl "+R" 65) and mul :: "'r \<Rightarrow> 'r \<Rightarrow> 'r" (infixl "*R" 70) and opp :: "'r \<Rightarrow> 'r" and abs...
src_data/babel-formal/stmts/isabelle/limits_uniqueness.thy
5b8835a9bb47c51576ec41ae3b8db9b4098c0d95cecc86fe3459bf6ca1380251
null
10
babel-formal
limits_uniqueness
limits_uniqueness
a
hol-light
let limit = new_definition `limit zero lt absV le sub natLe u l <=> !eps. lt zero eps ==> ?N. !n. natLe N n ==> le (absV (sub (u n) l)) eps`;; let abs_sub_triangle = `!(absV:A->A) (le:A->A->bool) (add:A->A->A) (sub:A->A->A) (x:A) (y:A) (z:A). (!u v w. sub u w = add (sub u v) (sub v w)) /\ (...
src_data/babel-formal/stmts/hol-light/limits_uniqueness.ml
fe1118e666cc058cd1af6455fd818b1720fc76b3180dd42dd2e0bc54d008b2da
null
10
babel-formal
limits_uniqueness
limits_uniqueness
a
acl2
;; Statement-only formalization of Babel-formal artifact limits_uniqueness: ;; uniqueness of a sequence limit in an abstract absolute-valued ordered ;; structure with an arbitrary directed index type. This file contains no ;; proof. (in-package "ACL2") (set-inhibit-output-lst '(prove proof-tree event summary)) ;; Th...
src_data/babel-formal/stmts/acl2/limits_uniqueness.lsp
8ac02ee52caf9f7229252ba3a49888d860ebd4069af05d06a4b14876eef428fc
null
10
babel-formal
limits_uniqueness
limits_uniqueness
a
agda
-- Statement-only formalization of the Babel-formal topic limits_uniqueness. This file contains -- no proof. module limits_uniqueness where open import Agda.Builtin.Equality using (_≡_) open import Agda.Builtin.Sigma using (Σ) record AbsField (R N : Set) : Set₁ where field zero : R one : R add : R → ...
src_data/babel-formal/stmts/agda/limits_uniqueness.agda
d373937d945cfae84051e2c486ddd3ae49d77c9fc4683d27f2095ed1d6b92e92
null
10
babel-formal
limits_uniqueness
limits_uniqueness
a
hol4
(* Statement-only formalization of the Babel-formal artifact limits_uniqueness: uniqueness of a sequence limit in an abstract absolute-value setting. This file contains no proof. *) open HolKernel Parse boolLib; val _ = new_theory "hello"; val limits_abs_field_def = new_definition ( "limits_abs_field_def", ...
src_data/babel-formal/stmts/hol4/limits_uniqueness.sml
4d5c5ee382833219d08216ec868573e5aacf4905189bc05a06f662c4ca10453e
null
10
babel-formal
limits_uniqueness
limits_uniqueness
a
metamath
$( Statement-only formalization of the Babel-formal topic limits_uniqueness. This file contains no proof. $) $( Statement-only encoding of uniqueness of limits in the abstract structure used by the Lean and Rocq sources. ovar and ivar are binder-only variable sorts; obj and idx are the value and index ter...
src_data/babel-formal/stmts/metamath/limits_uniqueness.mm
b2354edaf6b8404a097ad6bd1a34299ccf87c00de8c623e1f868076d336e1b4d
null
10
babel-formal
limits_uniqueness
limits_uniqueness
a
mizar
:: Statement-only formalization of the Babel-formal topic limits_uniqueness. This file contains :: no proof. environ vocabularies TARSKI, XBOOLE_0, ZFMISC_1, SUBSET_1, RELAT_1, FUNCT_1, FUNCT_2, PARTFUN1, BINOP_1; notations TARSKI, XBOOLE_0, ZFMISC_1, SUBSET_1, RELAT_1, RELSET_1, PARTFUN1, FUNCT_1, FUNCT_2...
src_data/babel-formal/stmts/mizar/limits_uniqueness.miz
90269b0657fdcf05470fc6da7ec6d33d1387db0ba8e0b3f68104ab32bc3ccc64
null
10
babel-formal
limits_uniqueness
limits_uniqueness
a
pvs
% Statement-only formalization of the Babel-formal topic limits_uniqueness. This file contains % no proof. limits_uniqueness[ R: TYPE+, N: TYPE+, zeroR: R, oneR: R, addR: [R, R -> R], mulR: [R, R -> R], oppR: [R -> R], absV: [R -> R], leR: [R, R -> bool], ltR: [R, R -> bool], natLe: [N, N -> bool...
src_data/babel-formal/stmts/pvs/limits_uniqueness.pvs
3284730d530ce9a2fd3ef96f5882851312ef7eea1e6f213a24f21a3594e596cb
null