rename [New/Only/Disabled][Tactic/Lemma/Definition]
This commit is contained in:
@@ -58,8 +58,8 @@ show that $f(x) = x^2 + 2x + 1$.
|
||||
unfold f
|
||||
ring
|
||||
|
||||
NewTactics «let»
|
||||
OnlyTactics «let» intro unfold ring
|
||||
NewTactic «let»
|
||||
OnlyTactic «let» intro unfold ring
|
||||
|
||||
HiddenHint : ∀ x, f x = x ^ 2 + 2 * x + 1 =>
|
||||
"Fang zuerst wie immer mit `intro x` an."
|
||||
|
||||
@@ -19,4 +19,4 @@ Statement
|
||||
(U T V : Type _) (f : U → V) (g : V → T) (x : U) : (g ∘ f) x = g (f x) := by
|
||||
simp only [Function.comp_apply]
|
||||
|
||||
NewLemmas Function.comp_apply
|
||||
NewLemma Function.comp_apply
|
||||
|
||||
@@ -57,9 +57,9 @@ Statement ""
|
||||
unfold f
|
||||
ring
|
||||
|
||||
NewTactics funext by_cases simp_rw linarith
|
||||
NewTactic funext by_cases simp_rw linarith
|
||||
|
||||
NewLemmas not_le if_pos if_neg
|
||||
NewLemma not_le if_pos if_neg
|
||||
|
||||
|
||||
Hint : f ∘ g = g ∘ f =>
|
||||
|
||||
@@ -29,8 +29,8 @@ Statement "" : Injective (fun (n : ℤ) ↦ n^3 + (n + 3)) := by
|
||||
intro a b
|
||||
simp
|
||||
|
||||
NewDefinitions Injective
|
||||
NewLemmas StrictMono.injective StrictMono.add Odd.strictMono_pow
|
||||
NewDefinition Injective
|
||||
NewLemma StrictMono.injective StrictMono.add Odd.strictMono_pow
|
||||
|
||||
|
||||
Hint : Injective fun (n : ℤ) => n ^ 3 + (n + 3) =>
|
||||
|
||||
@@ -22,7 +22,7 @@ Statement "" : Injective (fun (n : ℤ) ↦ n + 3) := by
|
||||
intro a b
|
||||
simp
|
||||
|
||||
NewDefinitions Injective
|
||||
NewDefinition Injective
|
||||
|
||||
Hint : Injective (fun (n : ℤ) ↦ n + 3) =>
|
||||
"**Robo**: `Injective` ist als `∀ \{a b : U}, f a = f b → a = b`
|
||||
|
||||
Reference in New Issue
Block a user