Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
E
examples
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
Iris
examples
Merge requests
!18
Some [positive] was sometimes used for [loc], which is now abstract.
Code
Review changes
Check out branch
Download
Patches
Plain diff
Merged
Some [positive] was sometimes used for [loc], which is now abstract.
lepigre/examples:fix
into
master
Overview
5
Commits
1
Pipelines
0
Changes
3
Merged
Rodolphe Lepigre
requested to merge
lepigre/examples:fix
into
master
5 years ago
Overview
5
Commits
1
Pipelines
0
Changes
3
Expand
0
0
Merge request reports
Compare
master
version 1
da3f9fa7
5 years ago
master (base)
and
latest version
latest version
5ec0e1f5
1 commit,
5 years ago
version 1
da3f9fa7
1 commit,
5 years ago
3 files
+
4
−
4
Inline
Compare changes
Side-by-side
Inline
Show whitespace changes
Show one file at a time
Files
3
Search (e.g. *.vue) (Ctrl+P)
theories/spanning_tree/mon.v
+
2
−
2
Options
@@ -751,7 +751,7 @@ Proof.
by
rewrite
get_left_singleton
get_right_singleton
/
get_left
/
get_right
Hu
.
Qed
.
Lemma
mark_strict_subgraph
(
g
:
graph
loc
)
(
G
:
Gmon
)
x
v
:
✓
((
x
[
↦
]
v
)
⋅
G
)
→
x
∈
dom
(
gset
positive
)
g
→
✓
((
x
[
↦
]
v
)
⋅
G
)
→
x
∈
dom
(
gset
loc
)
g
→
of_graph
g
G
!!
x
=
Some
(
false
,
v
)
→
strict_subgraph
g
(
Gmon_graph
G
)
→
strict_subgraph
g
(
Gmon_graph
((
x
[
↦
]
v
)
⋅
G
))
.
Proof
.
@@ -760,7 +760,7 @@ Proof.
inversion
1
;
auto
using
strict_sub_children_refl
.
Qed
.
Lemma
update_strict_subgraph
(
g
:
graph
loc
)
(
G
:
Gmon
)
x
v
w
:
✓
((
x
[
↦
]
v
)
⋅
G
)
→
x
∈
dom
(
gset
positive
)
g
→
✓
((
x
[
↦
]
v
)
⋅
G
)
→
x
∈
dom
(
gset
loc
)
g
→
strict_subgraph
g
(
Gmon_graph
((
x
[
↦
]
w
)
⋅
G
))
→
strict_sub_children
w
v
→
strict_subgraph
g
(
Gmon_graph
((
x
[
↦
]
v
)
⋅
G
))
.
Loading