Skip to content

GitLab

  • Menu
Projects Groups Snippets
  • Help
    • Help
    • Support
    • Community forum
    • Submit feedback
    • Contribute to GitLab
  • Sign in / Register
  • S stdpp
  • Project information
    • Project information
    • Activity
    • Labels
    • Members
  • Repository
    • Repository
    • Files
    • Commits
    • Branches
    • Tags
    • Contributors
    • Graph
    • Compare
  • Issues 69
    • Issues 69
    • List
    • Boards
    • Service Desk
    • Milestones
  • Merge requests 8
    • Merge requests 8
  • CI/CD
    • CI/CD
    • Pipelines
    • Jobs
    • Schedules
  • Deployments
    • Deployments
    • Releases
  • Analytics
    • Analytics
    • Value stream
    • CI/CD
    • Repository
  • Wiki
    • Wiki
  • Activity
  • Graph
  • Create a new issue
  • Jobs
  • Commits
  • Issue Boards
Collapse sidebar
  • Iris
  • stdpp
  • Merge requests
  • !278

Prove more equivalences for closure operators on relations.

  • Review changes

  • Download
  • Email patches
  • Plain diff
Merged Robbert Krebbers requested to merge robbert/relations_alt into master Jun 10, 2021
  • Overview 14
  • Commits 3
  • Pipelines 7
  • Changes 2

Add and extend equivalences between closure operators:

  • Add ↔ lemmas that relate rtc, tc, nsteps, and bsteps.
  • Rename → lemmas rtc_nsteps → rtc_nsteps_1, nsteps_rtc → rtc_nsteps_2, rtc_bsteps → rtc_bsteps_1, and bsteps_rtc → rtc_bsteps_2.
  • Add lemmas that relate rtc, tc, nsteps, and bsteps to path representations as lists.

The _list lemmas were proposed by @jules and he provided an initial proof specific to rtc.

Edited Jun 16, 2021 by Robbert Krebbers
Assignee
Assign to
Reviewer
Request review from
Time tracking
Source branch: robbert/relations_alt