Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
P
PROSA - Formally Proven Schedulability Analysis
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Environments
Terraform modules
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
Lasse Blaauwbroek
PROSA - Formally Proven Schedulability Analysis
Commits
2da5f091
Commit
2da5f091
authored
4 years ago
by
Björn Brandenburg
Browse files
Options
Downloads
Patches
Plain Diff
fix warnings in prosa.util.search_arg
parent
9bd265d8
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
util/search_arg.v
+4
-4
4 additions, 4 deletions
util/search_arg.v
with
4 additions
and
4 deletions
util/search_arg.v
+
4
−
4
View file @
2da5f091
...
@@ -170,7 +170,7 @@ Section ArgSearch.
...
@@ -170,7 +170,7 @@ Section ArgSearch.
destruct
(
P
(
f
n
))
eqn
:
Pfn
=>
//=.
destruct
(
P
(
f
n
))
eqn
:
Pfn
=>
//=.
-
rewrite
<-
REC
in
IND
.
-
rewrite
<-
REC
in
IND
.
destruct
(
R
(
f
n
)
(
f
q
))
eqn
:
REL
=>
some_x_is
;
destruct
(
R
(
f
n
)
(
f
q
))
eqn
:
REL
=>
some_x_is
;
move
=>
y
[
/
andP
[
a_le_y
y_lt_Sn
]
Pfy
]
;
move
=>
y
/
andP
[
a_le_y
y_lt_Sn
]
Pfy
;
injection
some_x_is
=>
x_is
;
rewrite
-
{}
x_is
//
;
injection
some_x_is
=>
x_is
;
rewrite
-
{}
x_is
//
;
move
:
y_lt_Sn
;
rewrite
ltnS
;
move
:
y_lt_Sn
;
rewrite
ltnS
;
rewrite
leq_eqVlt
=>
/
orP
[
/
eqP
EQ
|
y_lt_n
]
.
rewrite
leq_eqVlt
=>
/
orP
[
/
eqP
EQ
|
y_lt_n
]
.
...
@@ -185,13 +185,13 @@ Section ArgSearch.
...
@@ -185,13 +185,13 @@ Section ArgSearch.
+
move
:
(
IND
q
REC
y
)
=>
HOLDS
.
+
move
:
(
IND
q
REC
y
)
=>
HOLDS
.
apply
HOLDS
=>
//.
apply
HOLDS
=>
//.
by
apply
/
andP
;
split
.
by
apply
/
andP
;
split
.
-
move
=>
some_q_is
y
[
/
andP
[
a_le_y
y_lt_Sn
]
Pfy
]
.
-
move
=>
some_q_is
y
/
andP
[
a_le_y
y_lt_Sn
]
Pfy
.
move
:
y_lt_Sn
.
rewrite
ltnS
.
move
:
y_lt_Sn
.
rewrite
ltnS
.
rewrite
leq_eqVlt
=>
/
orP
[
/
eqP
EQ
|
y_lt_n
]
.
rewrite
leq_eqVlt
=>
/
orP
[
/
eqP
EQ
|
y_lt_n
]
.
+
exfalso
.
move
:
Pfn
=>
/
negP
Pfn
.
by
subst
.
+
exfalso
.
move
:
Pfn
=>
/
negP
Pfn
.
by
subst
.
+
apply
IND
=>
//.
by
apply
/
andP
;
split
.
+
apply
IND
=>
//.
by
apply
/
andP
;
split
.
-
move
=>
some_n_is
.
injection
some_n_is
=>
n_is
.
-
move
=>
some_n_is
.
injection
some_n_is
=>
n_is
.
move
=>
y
[
/
andP
[
a_le_y
y_lt_Sn
]
Pfy
]
.
move
=>
y
/
andP
[
a_le_y
y_lt_Sn
]
Pfy
.
move
:
y_lt_Sn
.
rewrite
ltnS
.
move
:
y_lt_Sn
.
rewrite
ltnS
.
rewrite
leq_eqVlt
=>
/
orP
[
/
eqP
EQ
|
y_lt_n
]
.
rewrite
leq_eqVlt
=>
/
orP
[
/
eqP
EQ
|
y_lt_n
]
.
+
by
rewrite
-
n_is
EQ
;
apply
(
R_reflexive
(
f
n
))
.
+
by
rewrite
-
n_is
EQ
;
apply
(
R_reflexive
(
f
n
))
.
...
@@ -235,4 +235,4 @@ Section ExMinn.
...
@@ -235,4 +235,4 @@ Section ExMinn.
by
move
:
MIN
;
rewrite
leqNgt
;
move
=>
/
negP
MIN
;
apply
:
MIN
.
by
move
:
MIN
;
rewrite
leqNgt
;
move
=>
/
negP
MIN
;
apply
:
MIN
.
Qed
.
Qed
.
End
ExMinn
.
End
ExMinn
.
\ No newline at end of file
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