We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
powerset_finite
The prelude has
powerset_finite: JUDGEMENT powerset(A: finite_set[T]) HAS_TYPE finite_set[set[T]]
when it could be stronger.
powerset_finite2: JUDGEMENT powerset(A: finite_set[T]) HAS_TYPE finite_set[finite_set[T]]
with the proof
("" (skolem-typepred) (ground) (("1" (skolem-typepred) (expand "powerset") (lemma "finite_subset" ("s" "x!1" "A" "A!1")) (propax)) ("2" (expand "is_finite") (skolem-typepred) (inst 1 "exp2(card(A!1))" "powerset_natfun(A!1)") (expand "injective?") (lemma "powerset_natfun_inj[T]") (grind))))
Maybe keep both.
The text was updated successfully, but these errors were encountered:
I'm not entirely sure this is super-useful, but anyway, we can do a tiny bit better
powerset_finite3: JUDGEMENT powerset(B) HAS_TYPE non_empty_finite_set[finite_set[T]]
The proof (after having the previous one) is just the default ("" (judgement-tcc)).
("" (judgement-tcc))
Sorry, something went wrong.
No branches or pull requests
The prelude has
when it could be stronger.
with the proof
Maybe keep both.
The text was updated successfully, but these errors were encountered: