Skip to content
Snippets Groups Projects
Select Git revision
  • rodolphe/gen_coqproject
  • master default protected
  • rodolphe/dune-rocq
  • msammler/monad_without_universe_constraints
  • robbert/new_stuff
  • robbert/set_fold_delete
  • robbert/rel_decision
  • robbert/map_fold_foldr
  • robbert/map_Forall_Exist
  • robbert/map_disjoint_difference
  • ci/refactor_staging
  • robbert/cancel_inj_surj
  • ralf/make_simple_intropattern
  • ralf/lookup_insert
  • ralf/multiset-solver
  • ralf/empty-opaque
  • ralf/listZ
  • ralf/hint-mode-plus
  • ci-release protected
  • ci/msammler/more_feed
  • coq-stdpp-1.12.0 protected
  • coq-stdpp-1.11.0 protected
  • coq-stdpp-1.10.0 protected
  • coq-stdpp-1.9.0 protected
  • coq-stdpp-1.8.0 protected
  • coq-stdpp-1.7.0 protected
  • coq-stdpp-1.6.0 protected
  • coq-stdpp-1.5.0 protected
  • coq-stdpp-1.4.0 protected
  • coq-stdpp-1.3.0 protected
  • coq-stdpp-1.2.1 protected
  • coq-stdpp-1.2.0 protected
  • coq-stdpp-1.1.0 protected
  • coq-stdpp-1.0.0 protected
34 results
Compare
user avatar
Prove more equivalences for closure operators on relations.
Robbert Krebbers authored 
As part of this: turn `rtc_nsteps` and `rtc_bsteps` into `:left_right_arrow:`s.

The `_list` lemmas were proposed by @jules and he provided an initial proof specific to `rtc`.
40a0487a
History
user avatar 40a0487a
History
Name Last commit Last update