summaryrefslogtreecommitdiff
path: root/Nominal/Instances/Basic.lean
diff options
context:
space:
mode:
Diffstat (limited to 'Nominal/Instances/Basic.lean')
-rw-r--r--Nominal/Instances/Basic.lean22
1 files changed, 11 insertions, 11 deletions
diff --git a/Nominal/Instances/Basic.lean b/Nominal/Instances/Basic.lean
index 2ebe9b1..d41e87f 100644
--- a/Nominal/Instances/Basic.lean
+++ b/Nominal/Instances/Basic.lean
@@ -140,11 +140,11 @@ instance : NominalSet ๐”ธ (X ร— Y) where
lemma supp_comm {x : X} {y : Y} : NominalSet.supp ๐”ธ (x, y) = NominalSet.supp ๐”ธ (y, x) := by
simp; apply Set.union_comm
-lemma fst_equivariant : Equivariant ๐”ธ (Prod.fst : X ร— Y โ†’ X) := by
- simp [Equivariant]
+lemma fst_equivariant : Function.Equivariant ๐”ธ (Prod.fst : X ร— Y โ†’ X) := by
+ simp [Function.Equivariant]
-lemma snd_equivariant : Equivariant ๐”ธ (Prod.snd : X ร— Y โ†’ Y) := by
- simp [Equivariant]
+lemma snd_equivariant : Function.Equivariant ๐”ธ (Prod.snd : X ร— Y โ†’ Y) := by
+ simp [Function.Equivariant]
end Prod
@@ -212,11 +212,11 @@ instance : NominalSet ๐”ธ (X โŠ• Y) where
@[simp] lemma fresh_inr {a : ๐”ธ} {y : Y} : a # (.inr y : X โŠ• Y) โ†” a # y := by
simp [NominalSet.IsFresh]
-lemma inl_equivariant : Equivariant ๐”ธ (Sum.inl : X โ†’ X โŠ• Y) := by
- simp [Equivariant]
+lemma inl_equivariant : Function.Equivariant ๐”ธ (Sum.inl : X โ†’ X โŠ• Y) := by
+ simp [Function.Equivariant]
-lemma inr_equivariant : Equivariant ๐”ธ (Sum.inr : Y โ†’ X โŠ• Y) := by
- simp [Equivariant]
+lemma inr_equivariant : Function.Equivariant ๐”ธ (Sum.inr : Y โ†’ X โŠ• Y) := by
+ simp [Function.Equivariant]
end Sum
@@ -251,8 +251,8 @@ instance : PermSet ๐”ธ (Quotient setoid.toSetoid) where
apply Quotient.ind
simp [mul_smul]
-lemma mk_equivariant : Equivariant ๐”ธ (Quotient.mk setoid.toSetoid) := by
- simp [Equivariant]
+lemma mk_equivariant : Function.Equivariant ๐”ธ (Quotient.mk setoid.toSetoid) := by
+ simp [Function.Equivariant]
variable {X : Type} [NominalSet ๐”ธ X] {setoid : EquivariantSetoid ๐”ธ X}
@@ -265,7 +265,7 @@ lemma supp {x : X} : NominalSet.supp ๐”ธ (Quotient.mk setoid.toSetoid x) = {a |
ยท intro ha x' hx'
rw [โ† Quotient.sound hx'] at ha
have hsub : NominalSet.supp ๐”ธ (Quotient.mk setoid.toSetoid x') โІ NominalSet.supp ๐”ธ x' :=
- Equivariant.supp_subset ๐”ธ (mk_equivariant ๐”ธ)
+ Function.Equivariant.supp_subset ๐”ธ (mk_equivariant ๐”ธ)
exact hsub ha
ยท contrapose; intro ha
simp only [Set.mem_setOf_eq, Classical.not_imp, not_forall]