Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
S
stdpp
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Gregory Malecha
stdpp
Commits
bd0e6352
Commit
bd0e6352
authored
5 years ago
by
Robbert Krebbers
Browse files
Options
Downloads
Patches
Plain Diff
Add tactic `set_unfold in H`.
parent
ddd73df1
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
CHANGELOG.md
+1
-0
1 addition, 0 deletions
CHANGELOG.md
theories/sets.v
+8
-1
8 additions, 1 deletion
theories/sets.v
with
9 additions
and
1 deletion
CHANGELOG.md
+
1
−
0
View file @
bd0e6352
...
...
@@ -27,6 +27,7 @@ API-breaking change is listed.
Slight breaking change:
`destruct_and`
no longer handle
`False`
;
`destruct_or`
now handles
`False`
while
`destruct_and`
handles
`True`
,
as the respective units of disjunction and conjunction.
-
Add tactic
`set_unfold in H`
.
## std++ 1.2.1 (released 2019-08-29)
...
...
This diff is collapsed.
Click to expand it.
theories/sets.v
+
8
−
1
View file @
bd0e6352
...
...
@@ -304,7 +304,7 @@ Section set_unfold_list.
Qed
.
End
set_unfold_list
.
Ltac
set_unfold
:=
Tactic
Notation
"
set_unfold
"
:=
let
rec
unfold_hyps
:=
try
match
goal
with
|
H
:
?P
|
-
_
=>
...
...
@@ -317,6 +317,13 @@ Ltac set_unfold :=
end
in
apply
set_unfold_2
;
unfold_hyps
;
csimpl
in
*.
Tactic
Notation
"set_unfold"
"in"
ident
(
H
)
:=
let
P
:=
type
of
H
in
lazymatch
type
of
P
with
|
Prop
=>
apply
set_unfold_1
in
H
|
_
=>
fail
"hypothesis"
H
"is not a proposition"
end
.
(** Since [firstorder] already fails or loops on very small goals generated by
[set_solver], we use the [naive_solver] tactic as a substitute. *)
Tactic
Notation
"set_solver"
"by"
tactic3
(
tac
)
:=
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment