package coq
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Formal proof management system
Install
dune-project
Dependency
Authors
Maintainers
Sources
coq-8.15.2.tar.gz
sha256=13a67c0a4559ae22e9765c8fdb88957b16c2b335a2d5f47e4d6d9b4b8b299926
doc/coq-core.clib/CString/Pred/index.html
Module CString.PredSource
The type of sets.
add x s returns a set containing all elements of s, plus x. If x was already in s, then s is returned unchanged.
remove x s returns a set containing all elements of s, except x. If x was not in s, then s is returned unchanged.
equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.
Gives a finite representation of the predicate: if the boolean is false, then the predicate is given in extension. if it is true, then the complement is given
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>