lean4-htt/tests/lean/run/270.lean
Kyle Miller 0db6daa8f1
feat: actual implementation for #5283 (#5512)
I did a bad git rebase before merging #5283, which reverted it to an
earlier version. This PR has the actual implementation of RFC #5397.
2024-09-29 01:22:12 +00:00

37 lines
1.1 KiB
Text
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

class CommAddSemigroup (α : Type u) extends Add α where
addComm : {a b : α} → a + b = b + a
addAssoc : {a b c : α} → a + b + c = a + (b + c)
open CommAddSemigroup
theorem addComm3 [CommAddSemigroup α] {a b c : α} : a + b + c = a + c + b := by {
have h : b + c = c + b := addComm;
have h' := congrArg (a + ·) h;
simp at h';
rw [←addAssoc] at h';
rw [←addAssoc (a := a)] at h';
exact h';
}
theorem addComm4 [CommAddSemigroup α] {a b c : α} : a + b + c = a + c + b := by {
rw [addAssoc, addAssoc];
rw [addComm (a := b)];
}
theorem addComm5 [CommAddSemigroup α] {a b c : α} : a + b + c = a + c + b := by {
have h : b + c = c + b := addComm;
have h' := congrArg (a + ·) h;
simp at h';
rw [←addAssoc] at h';
rw [←addAssoc (a := a)] at h';
exact h';
}
theorem addComm6 [CommAddSemigroup α] {a b c : α} : a + b + c = a + c + b := by {
have h : b + c = c + b := addComm;
have h' := congrArg (a + ·) h;
simp at h';
rw [←addAssoc] at h';
rw [←addAssoc] at h';
exact h';
}