### remove a stale comment

parent bf6816e3
Pipeline #15499 passed with stage
in 8 minutes and 29 seconds
 ... @@ -85,10 +85,9 @@ instance, such as lists. *) ... @@ -85,10 +85,9 @@ instance, such as lists. *) Instance map_equiv `{∀ A, Lookup K A (M A), Equiv A} : Equiv (M A) | 20 := Instance map_equiv `{∀ A, Lookup K A (M A), Equiv A} : Equiv (M A) | 20 := λ m1 m2, ∀ i, m1 !! i ≡ m2 !! i. λ m1 m2, ∀ i, m1 !! i ≡ m2 !! i. (** The relation [intersection_forall R] on finite maps describes that the relation [R] holds for each pair in the intersection. *) Definition map_Forall `{Lookup K A M} (P : K → A → Prop) : M → Prop := Definition map_Forall `{Lookup K A M} (P : K → A → Prop) : M → Prop := λ m, ∀ i x, m !! i = Some x → P i x. λ m, ∀ i x, m !! i = Some x → P i x. Definition map_relation `{∀ A, Lookup K A (M A)} {A B} (R : A → B → Prop) Definition map_relation `{∀ A, Lookup K A (M A)} {A B} (R : A → B → Prop) (P : A → Prop) (Q : B → Prop) (m1 : M A) (m2 : M B) : Prop := ∀ i, (P : A → Prop) (Q : B → Prop) (m1 : M A) (m2 : M B) : Prop := ∀ i, option_relation R P Q (m1 !! i) (m2 !! i). option_relation R P Q (m1 !! i) (m2 !! i). ... ...
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!