Function_compl:
Remove useless lemmas. Function_sub: Make some arguments implicit, others explicit. Add def same_funS. Add and prove same_funS_{refl,sym,trans}, RgS{,_gen}_ext, funS_ext, injS_ext, surjS_ext, surjS_RgS_equiv, canS_ext{_l,_r,}, canS_{injS,surjS}, injS_canS_sym, bijS_ext, bijS_RgS, bijS_canS_uniq_{l,r}, bijS_canS_sym, bijS_canS_bijS. Rename surjS_equiv -> surjS_RgS_gen_equiv, surjS_equiv_alt -> surjS_RgS_equiv_alt. Finite_family, MonoidComp, Sub_struct, Finite_dim: Propagate new API (from Function_sub).
Showing
- FEM/Algebra/Finite_dim.v 1 addition, 1 deletionFEM/Algebra/Finite_dim.v
- FEM/Algebra/Finite_family.v 1 addition, 2 deletionsFEM/Algebra/Finite_family.v
- FEM/Algebra/MonoidComp.v 2 additions, 2 deletionsFEM/Algebra/MonoidComp.v
- FEM/Algebra/Sub_struct.v 1 addition, 1 deletionFEM/Algebra/Sub_struct.v
- FEM/Compl/Function_compl.v 1 addition, 9 deletionsFEM/Compl/Function_compl.v
- FEM/Compl/Function_sub.v 422 additions, 76 deletionsFEM/Compl/Function_sub.v
Loading
Please register or sign in to comment