Skip to content

cleaning import Lattice 1 #2602

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
MatthewDaggitt merged 4 commits into from
Feb 21, 2025
Merged

cleaning import Lattice 1 #2602

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
89cf3a0
Cleaning import Lattice 1
jmougeot Feb 20, 2025
4935071
Cleaning import Lattice 1
jmougeot Feb 20, 2025
9b31cce
Cleaning import Lattice 1
jmougeot Feb 20, 2025
9c16066
import cleaning
jmougeot Feb 20, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/Algebra/Lattice/Bundles/Raw.agda
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,7 +8,7 @@

module Algebra.Lattice.Bundles.Raw where

open import Algebra.Core
open import Algebra.Core using (Op₂)
open import Algebra.Bundles.Raw using (RawMagma)
open import Level using (suc; _⊔_)
open import Relation.Binary.Core using (Rel)
Expand Down
4 changes: 3 additions & 1 deletion src/Algebra/Lattice/Construct/NaturalChoice/MaxOp.agda
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,13 +8,15 @@
{-# OPTIONS --cubical-compatible --safe #-}

open import Algebra.Construct.NaturalChoice.Base
import Algebra.Lattice.Construct.NaturalChoice.MinOp as MinOp
using (MaxOperator; MaxOp⇒MinOp)
open import Relation.Binary.Bundles using (TotalPreorder)

module Algebra.Lattice.Construct.NaturalChoice.MaxOp
{a ℓ₁ ℓ₂} {O : TotalPreorder a ℓ₁ ℓ₂} (maxOp : MaxOperator O)
where

import Algebra.Lattice.Construct.NaturalChoice.MinOp as MinOp

private
module Min = MinOp (MaxOp⇒MinOp maxOp)

Expand Down
4 changes: 2 additions & 2 deletions src/Algebra/Lattice/Construct/NaturalChoice/MinMaxOp.agda
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,8 +6,7 @@

{-# OPTIONS --cubical-compatible --safe #-}

open import Algebra.Lattice.Bundles
open import Algebra.Construct.NaturalChoice.Base
open import Algebra.Construct.NaturalChoice.Base using (MinOperator; MaxOperator)
open import Relation.Binary.Bundles using (TotalPreorder)

module Algebra.Lattice.Construct.NaturalChoice.MinMaxOp
Expand All @@ -22,6 +21,7 @@ open MaxOperator maxOp

open import Algebra.Lattice.Structures _≈_
open import Algebra.Construct.NaturalChoice.MinMaxOp minOp maxOp
open import Algebra.Lattice.Bundles using (Lattice; DistributiveLattice)
open import Relation.Binary.Reasoning.Preorder preorder

------------------------------------------------------------------------
Expand Down
7 changes: 3 additions & 4 deletions src/Algebra/Lattice/Construct/NaturalChoice/MinOp.agda
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,9 +7,7 @@

{-# OPTIONS --cubical-compatible --safe #-}

open import Algebra.Bundles
open import Algebra.Lattice.Bundles
open import Algebra.Construct.NaturalChoice.Base
open import Algebra.Construct.NaturalChoice.Base using (MinOperator)
open import Relation.Binary.Bundles using (TotalPreorder)

module Algebra.Lattice.Construct.NaturalChoice.MinOp
Expand All @@ -18,8 +16,9 @@ module Algebra.Lattice.Construct.NaturalChoice.MinOp
open TotalPreorder O
open MinOperator minOp

open import Algebra.Lattice.Structures _≈_
open import Algebra.Construct.NaturalChoice.MinOp minOp
open import Algebra.Lattice.Bundles using (Semilattice)
open import Algebra.Lattice.Structures _≈_

------------------------------------------------------------------------
-- Structures
Expand Down