HyperCactus0 commited on
Commit
cc163cf
·
verified ·
1 Parent(s): d60e29d

Record 27 verified HPC batch manifests

Browse files
manifests/batches/mathlib/001666.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001667.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001668.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001669.json ADDED
@@ -0,0 +1,416 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "format": "leangpt-parquet-v2",
3
+ "batch": "mathlib/001669",
4
+ "batch_fingerprint": "6afee01fd96af815fa32557e1850cb9ea95db64dc640021c6e3aa6e0a975ba24",
5
+ "evidence": {
6
+ "batch_fingerprint": "6afee01fd96af815fa32557e1850cb9ea95db64dc640021c6e3aa6e0a975ba24",
7
+ "batch_outcome": "all_inputs_failed_with_evidence",
8
+ "contamination_matches": [],
9
+ "failures": [
10
+ {
11
+ "error": "no internal trace for tactic 'refine Fintype.one_lt_card_iff_nontrivial.1 ?_'",
12
+ "full_name": "Finset.univ_of_card_le_three",
13
+ "id": "Finset.univ_of_card_le_three",
14
+ "reason": "import_failure",
15
+ "selection": {
16
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
17
+ "end": [
18
+ 54,
19
+ 33
20
+ ],
21
+ "file_path": "Mathlib/RingTheory/Fintype.lean",
22
+ "full_name": "Finset.univ_of_card_le_three",
23
+ "start": [
24
+ 28,
25
+ 1
26
+ ],
27
+ "traced_tactics": [
28
+ {
29
+ "annotated_tactic": [
30
+ "\"refine (<a>eq_of_subset_of_card_le<\\/a> (<a>subset_univ<\\/a> _) ?_).<a>symm<\\/a>\"",
31
+ "[{\"full_name\":\"Finset.eq_of_subset_of_card_le\",\"def_path\":\"Mathlib\\/Data\\/Finset\\/Card.lean\",\"def_pos\":[316,9],\"def_end_pos\":[316,32]},{\"full_name\":\"Finset.subset_univ\",\"def_path\":\"Mathlib\\/Data\\/Fintype\\/Basic.lean\",\"def_pos\":[128,9],\"def_end_pos\":[128,20]},{\"full_name\":\"Eq.symm\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[323,9],\"def_end_pos\":[323,16]}]"
32
+ ],
33
+ "state_after": "R : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh : Fintype.card R \u2264 3\n\u22a2 univ.card \u2264 {0, 1, -1}.card",
34
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh : Fintype.card R \u2264 3\n\u22a2 univ = {0, 1, -1}",
35
+ "tactic": "refine (eq_of_subset_of_card_le (subset_univ _) ?_).symm"
36
+ },
37
+ {
38
+ "annotated_tactic": [
39
+ "\"rcases <a>lt_or_eq_of_le<\\/a> h with h | h\"",
40
+ "[{\"full_name\":\"lt_or_eq_of_le\",\"def_path\":\"Mathlib\\/Init\\/Order\\/Defs.lean\",\"def_pos\":[230,9],\"def_end_pos\":[230,23]}]"
41
+ ],
42
+ "state_after": "case inl\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R < 3\n\u22a2 univ.card \u2264 {0, 1, -1}.card\n\ncase inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\n\u22a2 univ.card \u2264 {0, 1, -1}.card",
43
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh : Fintype.card R \u2264 3\n\u22a2 univ.card \u2264 {0, 1, -1}.card",
44
+ "tactic": "rcases lt_or_eq_of_le h with h | h"
45
+ },
46
+ {
47
+ "annotated_tactic": [
48
+ "\"apply <a>card_le_card<\\/a>\"",
49
+ "[{\"full_name\":\"Finset.card_le_card\",\"def_path\":\"Mathlib\\/Data\\/Finset\\/Card.lean\",\"def_pos\":[64,9],\"def_end_pos\":[64,21]}]"
50
+ ],
51
+ "state_after": "case inl.a\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R < 3\n\u22a2 univ \u2286 {0, 1, -1}",
52
+ "state_before": "case inl\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R < 3\n\u22a2 univ.card \u2264 {0, 1, -1}.card",
53
+ "tactic": "apply card_le_card"
54
+ },
55
+ {
56
+ "annotated_tactic": [
57
+ "\"rw [<a>Finset.univ_of_card_le_two<\\/a> (<a>Nat.lt_succ_iff<\\/a>.1 h)]\"",
58
+ "[{\"full_name\":\"Finset.univ_of_card_le_two\",\"def_path\":\"Mathlib\\/RingTheory\\/Fintype.lean\",\"def_pos\":[20,7],\"def_end_pos\":[20,33]},{\"full_name\":\"Nat.lt_succ_iff\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Data\\/Nat\\/Basic.lean\",\"def_pos\":[573,19],\"def_end_pos\":[573,30]}]"
59
+ ],
60
+ "state_after": "case inl.a\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R < 3\n\u22a2 {0, 1} \u2286 {0, 1, -1}",
61
+ "state_before": "case inl.a\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R < 3\n\u22a2 univ \u2286 {0, 1, -1}",
62
+ "tactic": "rw [Finset.univ_of_card_le_two (Nat.lt_succ_iff.1 h)]"
63
+ },
64
+ {
65
+ "annotated_tactic": [
66
+ "\"intro a ha\"",
67
+ "[]"
68
+ ],
69
+ "state_after": "case inl.a\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R < 3\na : R\nha : a \u2208 {0, 1}\n\u22a2 a \u2208 {0, 1, -1}",
70
+ "state_before": "case inl.a\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R < 3\n\u22a2 {0, 1} \u2286 {0, 1, -1}",
71
+ "tactic": "intro a ha"
72
+ },
73
+ {
74
+ "annotated_tactic": [
75
+ "\"simp only [<a>mem_insert<\\/a>, <a>mem_singleton<\\/a>] at ha\"",
76
+ "[{\"full_name\":\"Finset.mem_insert\",\"def_path\":\"Mathlib\\/Data\\/Finset\\/Basic.lean\",\"def_pos\":[1113,9],\"def_end_pos\":[1113,19]},{\"full_name\":\"Finset.mem_singleton\",\"def_path\":\"Mathlib\\/Data\\/Finset\\/Basic.lean\",\"def_pos\":[680,9],\"def_end_pos\":[680,22]}]"
77
+ ],
78
+ "state_after": "case inl.a\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R < 3\na : R\nha : a = 0 \u2228 a = 1\n\u22a2 a \u2208 {0, 1, -1}",
79
+ "state_before": "case inl.a\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R < 3\na : R\nha : a \u2208 {0, 1}\n\u22a2 a \u2208 {0, 1, -1}",
80
+ "tactic": "simp only [mem_insert, mem_singleton] at ha"
81
+ },
82
+ {
83
+ "annotated_tactic": [
84
+ "\"rcases ha with rfl | rfl <;> simp\"",
85
+ "[]"
86
+ ],
87
+ "state_after": "no goals",
88
+ "state_before": "case inl.a\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R < 3\na : R\nha : a = 0 \u2228 a = 1\n\u22a2 a \u2208 {0, 1, -1}",
89
+ "tactic": "rcases ha with rfl | rfl <;> simp"
90
+ },
91
+ {
92
+ "annotated_tactic": [
93
+ "\"have : <a>Nontrivial<\\/a> R := by\\n refine <a>Fintype.one_lt_card_iff_nontrivial<\\/a>.1 ?_\\n rw [h]\\n norm_num\"",
94
+ "[{\"full_name\":\"Nontrivial\",\"def_path\":\"Mathlib\\/Logic\\/Nontrivial\\/Defs.lean\",\"def_pos\":[31,7],\"def_end_pos\":[31,17]},{\"full_name\":\"Fintype.one_lt_card_iff_nontrivial\",\"def_path\":\"Mathlib\\/Data\\/Fintype\\/Card.lean\",\"def_pos\":[594,9],\"def_end_pos\":[594,35]}]"
95
+ ],
96
+ "state_after": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\n\u22a2 univ.card \u2264 {0, 1, -1}.card",
97
+ "state_before": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\n\u22a2 univ.card \u2264 {0, 1, -1}.card",
98
+ "tactic": "have : Nontrivial R := by\n refine Fintype.one_lt_card_iff_nontrivial.1 ?_\n rw [h]\n norm_num"
99
+ },
100
+ {
101
+ "annotated_tactic": [
102
+ "\"rw [<a>card_univ<\\/a>, h, <a>card_insert_of_not_mem<\\/a>, <a>card_insert_of_not_mem<\\/a>, <a>card_singleton<\\/a>]\"",
103
+ "[{\"full_name\":\"Finset.card_univ\",\"def_path\":\"Mathlib\\/Data\\/Fintype\\/Card.lean\",\"def_pos\":[250,9],\"def_end_pos\":[250,25]},{\"full_name\":\"Finset.card_insert_of_not_mem\",\"def_path\":\"Mathlib\\/Data\\/Finset\\/Card.lean\",\"def_pos\":[108,9],\"def_end_pos\":[108,31]},{\"full_name\":\"Finset.card_insert_of_not_mem\",\"def_path\":\"Mathlib\\/Data\\/Finset\\/Card.lean\",\"def_pos\":[108,9],\"def_end_pos\":[108,31]},{\"full_name\":\"Finset.card_singleton\",\"def_path\":\"Mathlib\\/Data\\/Finset\\/Card.lean\",\"def_pos\":[88,9],\"def_end_pos\":[88,23]}]"
104
+ ],
105
+ "state_after": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\n\u22a2 1 \u2209 {-1}\n\ncase inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\n\u22a2 0 \u2209 {1, -1}",
106
+ "state_before": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\n\u22a2 univ.card \u2264 {0, 1, -1}.card",
107
+ "tactic": "rw [card_univ, h, card_insert_of_not_mem, card_insert_of_not_mem, card_singleton]"
108
+ },
109
+ {
110
+ "annotated_tactic": [
111
+ "\"refine <a>Fintype.one_lt_card_iff_nontrivial<\\/a>.1 ?_\"",
112
+ "[{\"full_name\":\"Fintype.one_lt_card_iff_nontrivial\",\"def_path\":\"Mathlib\\/Data\\/Fintype\\/Card.lean\",\"def_pos\":[594,9],\"def_end_pos\":[594,35]}]"
113
+ ],
114
+ "state_after": "R : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\n\u22a2 1 < Fintype.card R",
115
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\n\u22a2 Nontrivial R",
116
+ "tactic": "refine Fintype.one_lt_card_iff_nontrivial.1 ?_"
117
+ },
118
+ {
119
+ "annotated_tactic": [
120
+ "\"rw [h]\"",
121
+ "[]"
122
+ ],
123
+ "state_after": "R : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\n\u22a2 1 < 3",
124
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\n\u22a2 1 < Fintype.card R",
125
+ "tactic": "rw [h]"
126
+ },
127
+ {
128
+ "annotated_tactic": [
129
+ "\"norm_num\"",
130
+ "[]"
131
+ ],
132
+ "state_after": "no goals",
133
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\n\u22a2 1 < 3",
134
+ "tactic": "norm_num"
135
+ },
136
+ {
137
+ "annotated_tactic": [
138
+ "\"rw [<a>mem_singleton<\\/a>]\"",
139
+ "[{\"full_name\":\"Finset.mem_singleton\",\"def_path\":\"Mathlib\\/Data\\/Finset\\/Basic.lean\",\"def_pos\":[680,9],\"def_end_pos\":[680,22]}]"
140
+ ],
141
+ "state_after": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\n\u22a2 \u00ac1 = -1",
142
+ "state_before": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\n\u22a2 1 \u2209 {-1}",
143
+ "tactic": "rw [mem_singleton]"
144
+ },
145
+ {
146
+ "annotated_tactic": [
147
+ "\"intro H\"",
148
+ "[]"
149
+ ],
150
+ "state_after": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\nH : 1 = -1\n\u22a2 False",
151
+ "state_before": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\n\u22a2 \u00ac1 = -1",
152
+ "tactic": "intro H"
153
+ },
154
+ {
155
+ "annotated_tactic": [
156
+ "\"rw [\\u2190 <a>add_eq_zero_iff_eq_neg<\\/a>, <a>one_add_one_eq_two<\\/a>] at H\"",
157
+ "[{\"full_name\":\"add_eq_zero_iff_eq_neg\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Basic.lean\",\"def_pos\":[919,3],\"def_end_pos\":[919,14]},{\"full_name\":\"one_add_one_eq_two\",\"def_path\":\"Mathlib\\/Data\\/Nat\\/Cast\\/Defs.lean\",\"def_pos\":[231,9],\"def_end_pos\":[231,27]}]"
158
+ ],
159
+ "state_after": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\nH : 2 = 0\n\u22a2 False",
160
+ "state_before": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\nH : 1 = -1\n\u22a2 False",
161
+ "tactic": "rw [\u2190 add_eq_zero_iff_eq_neg, one_add_one_eq_two] at H"
162
+ },
163
+ {
164
+ "annotated_tactic": [
165
+ "\"apply_fun (<a>ringEquivOfPrime<\\/a> R <a>Nat.prime_three<\\/a> h).<a>symm<\\/a> at H\"",
166
+ "[{\"full_name\":\"ZMod.ringEquivOfPrime\",\"def_path\":\"Mathlib\\/Data\\/ZMod\\/Basic.lean\",\"def_pos\":[498,19],\"def_end_pos\":[498,35]},{\"full_name\":\"Nat.prime_three\",\"def_path\":\"Mathlib\\/Data\\/Nat\\/Prime.lean\",\"def_pos\":[173,9],\"def_end_pos\":[173,20]},{\"full_name\":\"RingEquiv.symm\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Equiv.lean\",\"def_pos\":[265,15],\"def_end_pos\":[265,19]}]"
167
+ ],
168
+ "state_after": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\nH : (ringEquivOfPrime R Nat.prime_three h).symm 2 = (ringEquivOfPrime R Nat.prime_three h).symm 0\n\u22a2 False",
169
+ "state_before": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\nH : 2 = 0\n\u22a2 False",
170
+ "tactic": "apply_fun (ringEquivOfPrime R Nat.prime_three h).symm at H"
171
+ },
172
+ {
173
+ "annotated_tactic": [
174
+ "\"simp only [<a>map_ofNat<\\/a>, <a>map_zero<\\/a>] at H\"",
175
+ "[{\"full_name\":\"map_ofNat\",\"def_path\":\"Mathlib\\/Data\\/Nat\\/Cast\\/Basic.lean\",\"def_pos\":[190,9],\"def_end_pos\":[190,18]},{\"full_name\":\"map_zero\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Hom\\/Defs.lean\",\"def_pos\":[203,3],\"def_end_pos\":[203,14]}]"
176
+ ],
177
+ "state_after": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\nH : 2 = 0\n\u22a2 False",
178
+ "state_before": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\nH : (ringEquivOfPrime R Nat.prime_three h).symm 2 = (ringEquivOfPrime R Nat.prime_three h).symm 0\n\u22a2 False",
179
+ "tactic": "simp only [map_ofNat, map_zero] at H"
180
+ },
181
+ {
182
+ "annotated_tactic": [
183
+ "\"replace H : ((2 : \\u2115) : <a>ZMod<\\/a> 3) = 0 := H\"",
184
+ "[{\"full_name\":\"ZMod\",\"def_path\":\"Mathlib\\/Data\\/ZMod\\/Defs.lean\",\"def_pos\":[95,5],\"def_end_pos\":[95,9]}]"
185
+ ],
186
+ "state_after": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\nH : \u21912 = 0\n\u22a2 False",
187
+ "state_before": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\nH : 2 = 0\n\u22a2 False",
188
+ "tactic": "replace H : ((2 : \u2115) : ZMod 3) = 0 := H"
189
+ },
190
+ {
191
+ "annotated_tactic": [
192
+ "\"rw [<a>natCast_zmod_eq_zero_iff_dvd<\\/a>] at H\"",
193
+ "[{\"full_name\":\"ZMod.natCast_zmod_eq_zero_iff_dvd\",\"def_path\":\"Mathlib\\/Data\\/ZMod\\/Basic.lean\",\"def_pos\":[609,9],\"def_end_pos\":[609,37]}]"
194
+ ],
195
+ "state_after": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\nH : 3 \u2223 2\n\u22a2 False",
196
+ "state_before": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\nH : \u21912 = 0\n\u22a2 False",
197
+ "tactic": "rw [natCast_zmod_eq_zero_iff_dvd] at H"
198
+ },
199
+ {
200
+ "annotated_tactic": [
201
+ "\"norm_num at H\"",
202
+ "[]"
203
+ ],
204
+ "state_after": "no goals",
205
+ "state_before": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\nH : 3 \u2223 2\n\u22a2 False",
206
+ "tactic": "norm_num at H"
207
+ },
208
+ {
209
+ "annotated_tactic": [
210
+ "\"intro h\"",
211
+ "[]"
212
+ ],
213
+ "state_after": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d\u00b9 : Fintype.card R \u2264 3\nh\u271d : Fintype.card R = 3\nthis : Nontrivial R\nh : 0 \u2208 {1, -1}\n\u22a2 False",
214
+ "state_before": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d : Fintype.card R \u2264 3\nh : Fintype.card R = 3\nthis : Nontrivial R\n\u22a2 0 \u2209 {1, -1}",
215
+ "tactic": "intro h"
216
+ },
217
+ {
218
+ "annotated_tactic": [
219
+ "\"simp only [<a>mem_insert<\\/a>, <a>mem_singleton<\\/a>, <a>zero_eq_neg<\\/a>] at h\"",
220
+ "[{\"full_name\":\"Finset.mem_insert\",\"def_path\":\"Mathlib\\/Data\\/Finset\\/Basic.lean\",\"def_pos\":[1113,9],\"def_end_pos\":[1113,19]},{\"full_name\":\"Finset.mem_singleton\",\"def_path\":\"Mathlib\\/Data\\/Finset\\/Basic.lean\",\"def_pos\":[680,9],\"def_end_pos\":[680,22]},{\"full_name\":\"zero_eq_neg\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Basic.lean\",\"def_pos\":[640,3],\"def_end_pos\":[640,14]}]"
221
+ ],
222
+ "state_after": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d\u00b9 : Fintype.card R \u2264 3\nh\u271d : Fintype.card R = 3\nthis : Nontrivial R\nh : 0 = 1 \u2228 1 = 0\n\u22a2 False",
223
+ "state_before": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d\u00b9 : Fintype.card R \u2264 3\nh\u271d : Fintype.card R = 3\nthis : Nontrivial R\nh : 0 \u2208 {1, -1}\n\u22a2 False",
224
+ "tactic": "simp only [mem_insert, mem_singleton, zero_eq_neg] at h"
225
+ },
226
+ {
227
+ "annotated_tactic": [
228
+ "\"rcases h with (h | h)\"",
229
+ "[]"
230
+ ],
231
+ "state_after": "case inr.inl\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d\u00b9 : Fintype.card R \u2264 3\nh\u271d : Fintype.card R = 3\nthis : Nontrivial R\nh : 0 = 1\n\u22a2 False\n\ncase inr.inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d\u00b9 : Fintype.card R \u2264 3\nh\u271d : Fintype.card R = 3\nthis : Nontrivial R\nh : 1 = 0\n\u22a2 False",
232
+ "state_before": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d\u00b9 : Fintype.card R \u2264 3\nh\u271d : Fintype.card R = 3\nthis : Nontrivial R\nh : 0 = 1 \u2228 1 = 0\n\u22a2 False",
233
+ "tactic": "rcases h with (h | h)"
234
+ },
235
+ {
236
+ "annotated_tactic": [
237
+ "\"exact <a>zero_ne_one<\\/a> h\"",
238
+ "[{\"full_name\":\"zero_ne_one\",\"def_path\":\"Mathlib\\/Algebra\\/NeZero.lean\",\"def_pos\":[55,15],\"def_end_pos\":[55,26]}]"
239
+ ],
240
+ "state_after": "no goals",
241
+ "state_before": "case inr.inl\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d\u00b9 : Fintype.card R \u2264 3\nh\u271d : Fintype.card R = 3\nthis : Nontrivial R\nh : 0 = 1\n\u22a2 False",
242
+ "tactic": "exact zero_ne_one h"
243
+ },
244
+ {
245
+ "annotated_tactic": [
246
+ "\"exact <a>zero_ne_one<\\/a> h.symm\"",
247
+ "[{\"full_name\":\"zero_ne_one\",\"def_path\":\"Mathlib\\/Algebra\\/NeZero.lean\",\"def_pos\":[55,15],\"def_end_pos\":[55,26]}]"
248
+ ],
249
+ "state_after": "no goals",
250
+ "state_before": "case inr.inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh\u271d\u00b9 : Fintype.card R \u2264 3\nh\u271d : Fintype.card R = 3\nthis : Nontrivial R\nh : 1 = 0\n\u22a2 False",
251
+ "tactic": "exact zero_ne_one h.symm"
252
+ }
253
+ ],
254
+ "url": "https://github.com/leanprover-community/mathlib4"
255
+ },
256
+ "source_file": "Mathlib/RingTheory/Fintype.lean"
257
+ },
258
+ {
259
+ "error": "no internal trace for tactic 'simp [Subsingleton.elim a 0]'",
260
+ "full_name": "Finset.univ_of_card_le_two",
261
+ "id": "Finset.univ_of_card_le_two",
262
+ "reason": "import_failure",
263
+ "selection": {
264
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
265
+ "end": [
266
+ 26,
267
+ 9
268
+ ],
269
+ "file_path": "Mathlib/RingTheory/Fintype.lean",
270
+ "full_name": "Finset.univ_of_card_le_two",
271
+ "start": [
272
+ 20,
273
+ 1
274
+ ],
275
+ "traced_tactics": [
276
+ {
277
+ "annotated_tactic": [
278
+ "\"rcases <a>subsingleton_or_nontrivial<\\/a> R\"",
279
+ "[{\"full_name\":\"subsingleton_or_nontrivial\",\"def_path\":\"Mathlib\\/Logic\\/Nontrivial\\/Defs.lean\",\"def_pos\":[99,9],\"def_end_pos\":[99,35]}]"
280
+ ],
281
+ "state_after": "case inl\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh : Fintype.card R \u2264 2\nh\u271d : Subsingleton R\n\u22a2 univ = {0, 1}\n\ncase inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh : Fintype.card R \u2264 2\nh\u271d : Nontrivial R\n\u22a2 univ = {0, 1}",
282
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh : Fintype.card R \u2264 2\n\u22a2 univ = {0, 1}",
283
+ "tactic": "rcases subsingleton_or_nontrivial R"
284
+ },
285
+ {
286
+ "annotated_tactic": [
287
+ "\"exact <a>le_antisymm<\\/a> (fun a _ \\u21a6 by simp [<a>Subsingleton.elim<\\/a> a 0]) (<a>Finset.subset_univ<\\/a> _)\"",
288
+ "[{\"full_name\":\"le_antisymm\",\"def_path\":\"Mathlib\\/Init\\/Order\\/Defs.lean\",\"def_pos\":[188,9],\"def_end_pos\":[188,20]},{\"full_name\":\"Subsingleton.elim\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Core.lean\",\"def_pos\":[1015,19],\"def_end_pos\":[1015,36]},{\"full_name\":\"Finset.subset_univ\",\"def_path\":\"Mathlib\\/Data\\/Fintype\\/Basic.lean\",\"def_pos\":[128,9],\"def_end_pos\":[128,20]}]"
289
+ ],
290
+ "state_after": "no goals",
291
+ "state_before": "case inl\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh : Fintype.card R \u2264 2\nh\u271d : Subsingleton R\n\u22a2 univ = {0, 1}",
292
+ "tactic": "exact le_antisymm (fun a _ \u21a6 by simp [Subsingleton.elim a 0]) (Finset.subset_univ _)"
293
+ },
294
+ {
295
+ "annotated_tactic": [
296
+ "\"simp [<a>Subsingleton.elim<\\/a> a 0]\"",
297
+ "[{\"full_name\":\"Subsingleton.elim\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Core.lean\",\"def_pos\":[1015,19],\"def_end_pos\":[1015,36]}]"
298
+ ],
299
+ "state_after": "no goals",
300
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh : Fintype.card R \u2264 2\nh\u271d : Subsingleton R\na : R\nx\u271d : a \u2208 univ\n\u22a2 a \u2208 {0, 1}",
301
+ "tactic": "simp [Subsingleton.elim a 0]"
302
+ },
303
+ {
304
+ "annotated_tactic": [
305
+ "\"refine (<a>eq_of_subset_of_card_le<\\/a> (<a>subset_univ<\\/a> _) ?_).<a>symm<\\/a>\"",
306
+ "[{\"full_name\":\"Finset.eq_of_subset_of_card_le\",\"def_path\":\"Mathlib\\/Data\\/Finset\\/Card.lean\",\"def_pos\":[316,9],\"def_end_pos\":[316,32]},{\"full_name\":\"Finset.subset_univ\",\"def_path\":\"Mathlib\\/Data\\/Fintype\\/Basic.lean\",\"def_pos\":[128,9],\"def_end_pos\":[128,20]},{\"full_name\":\"Eq.symm\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[323,9],\"def_end_pos\":[323,16]}]"
307
+ ],
308
+ "state_after": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh : Fintype.card R \u2264 2\nh\u271d : Nontrivial R\n\u22a2 univ.card \u2264 {0, 1}.card",
309
+ "state_before": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh : Fintype.card R \u2264 2\nh\u271d : Nontrivial R\n\u22a2 univ = {0, 1}",
310
+ "tactic": "refine (eq_of_subset_of_card_le (subset_univ _) ?_).symm"
311
+ },
312
+ {
313
+ "annotated_tactic": [
314
+ "\"convert h\"",
315
+ "[]"
316
+ ],
317
+ "state_after": "case h.e'_4\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh : Fintype.card R \u2264 2\nh\u271d : Nontrivial R\n\u22a2 {0, 1}.card = 2",
318
+ "state_before": "case inr\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh : Fintype.card R \u2264 2\nh\u271d : Nontrivial R\n\u22a2 univ.card \u2264 {0, 1}.card",
319
+ "tactic": "convert h"
320
+ },
321
+ {
322
+ "annotated_tactic": [
323
+ "\"simp\"",
324
+ "[]"
325
+ ],
326
+ "state_after": "no goals",
327
+ "state_before": "case h.e'_4\nR : Type u_1\ninst\u271d\u00b2 : Ring R\ninst\u271d\u00b9 : Fintype R\ninst\u271d : DecidableEq R\nh : Fintype.card R \u2264 2\nh\u271d : Nontrivial R\n\u22a2 {0, 1}.card = 2",
328
+ "tactic": "simp"
329
+ }
330
+ ],
331
+ "url": "https://github.com/leanprover-community/mathlib4"
332
+ },
333
+ "source_file": "Mathlib/RingTheory/Fintype.lean"
334
+ },
335
+ {
336
+ "error": "theorem has no selected tactic transitions",
337
+ "full_name": "card_units_lt",
338
+ "id": "card_units_lt",
339
+ "reason": "import_failure",
340
+ "selection": {
341
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
342
+ "end": [
343
+ 60,
344
+ 78
345
+ ],
346
+ "file_path": "Mathlib/RingTheory/Fintype.lean",
347
+ "full_name": "card_units_lt",
348
+ "start": [
349
+ 58,
350
+ 1
351
+ ],
352
+ "traced_tactics": [],
353
+ "url": "https://github.com/leanprover-community/mathlib4"
354
+ },
355
+ "source_file": "Mathlib/RingTheory/Fintype.lean"
356
+ },
357
+ {
358
+ "error": "theorem has no selected tactic transitions",
359
+ "full_name": "Algebra.Flat.comp",
360
+ "id": "Algebra.Flat.comp",
361
+ "reason": "import_failure",
362
+ "selection": {
363
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
364
+ "end": [
365
+ 46,
366
+ 32
367
+ ],
368
+ "file_path": "Mathlib/RingTheory/Flat/Algebra.lean",
369
+ "full_name": "Algebra.Flat.comp",
370
+ "start": [
371
+ 44,
372
+ 1
373
+ ],
374
+ "traced_tactics": [],
375
+ "url": "https://github.com/leanprover-community/mathlib4"
376
+ },
377
+ "source_file": "Mathlib/RingTheory/Flat/Algebra.lean"
378
+ },
379
+ {
380
+ "error": "theorem has no selected tactic transitions",
381
+ "full_name": "Algebra.Flat.isBaseChange",
382
+ "id": "Algebra.Flat.isBaseChange",
383
+ "reason": "import_failure",
384
+ "selection": {
385
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
386
+ "end": [
387
+ 58,
388
+ 50
389
+ ],
390
+ "file_path": "Mathlib/RingTheory/Flat/Algebra.lean",
391
+ "full_name": "Algebra.Flat.isBaseChange",
392
+ "start": [
393
+ 55,
394
+ 1
395
+ ],
396
+ "traced_tactics": [],
397
+ "url": "https://github.com/leanprover-community/mathlib4"
398
+ },
399
+ "source_file": "Mathlib/RingTheory/Flat/Algebra.lean"
400
+ }
401
+ ],
402
+ "input_proofs": 5,
403
+ "input_units": 2,
404
+ "proofs": 0,
405
+ "published_proofs": 0,
406
+ "published_transitions": 0,
407
+ "replay_failures": [],
408
+ "transitions": 0,
409
+ "validation_failures": [],
410
+ "validation_rejected_proofs": 0,
411
+ "zero_transition_proofs": 0
412
+ },
413
+ "shards": [],
414
+ "proof_ids": [],
415
+ "proof_keys": []
416
+ }
manifests/batches/mathlib/001671.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001672.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001673.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001674.json ADDED
@@ -0,0 +1,1140 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "format": "leangpt-parquet-v2",
3
+ "batch": "mathlib/001674",
4
+ "batch_fingerprint": "ef0940214b7085745919a498536ce6ccd99af2292ecddca8357c9e1f01a77b1a",
5
+ "evidence": {
6
+ "batch_fingerprint": "ef0940214b7085745919a498536ce6ccd99af2292ecddca8357c9e1f01a77b1a",
7
+ "contamination_matches": [],
8
+ "failures": [
9
+ {
10
+ "full_name": "Algebra.Generators.Cotangent.ext",
11
+ "id": "Algebra.Generators.Cotangent.ext",
12
+ "reason": "missing_trace",
13
+ "selection": {
14
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
15
+ "end": [
16
+ 361,
17
+ 73
18
+ ],
19
+ "file_path": "Mathlib/RingTheory/Generators.lean",
20
+ "full_name": "Algebra.Generators.Cotangent.ext",
21
+ "start": [
22
+ 360,
23
+ 1
24
+ ],
25
+ "traced_tactics": [],
26
+ "url": "https://github.com/leanprover-community/mathlib4"
27
+ },
28
+ "source_file": "Mathlib/RingTheory/Generators.lean"
29
+ },
30
+ {
31
+ "full_name": "Algebra.Generators.Cotangent.map_mk",
32
+ "id": "Algebra.Generators.Cotangent.map_mk",
33
+ "reason": "missing_trace",
34
+ "selection": {
35
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
36
+ "end": [
37
+ 465,
38
+ 6
39
+ ],
40
+ "file_path": "Mathlib/RingTheory/Generators.lean",
41
+ "full_name": "Algebra.Generators.Cotangent.map_mk",
42
+ "start": [
43
+ 461,
44
+ 1
45
+ ],
46
+ "traced_tactics": [
47
+ {
48
+ "annotated_tactic": [
49
+ "\"simpa [-<a>map_aeval<\\/a>] using <a>RingHom.congr_arg<\\/a> (<a>algebraMap<\\/a> S S') x.2\"",
50
+ "[{\"full_name\":\"MvPolynomial.map_aeval\",\"def_path\":\"Mathlib\\/Algebra\\/MvPolynomial\\/Basic.lean\",\"def_pos\":[1566,9],\"def_end_pos\":[1566,18]},{\"full_name\":\"RingHom.congr_arg\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Hom\\/Defs.lean\",\"def_pos\":[515,9],\"def_end_pos\":[515,18]},{\"full_name\":\"algebraMap\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Defs.lean\",\"def_pos\":[110,5],\"def_end_pos\":[110,15]}]"
51
+ ],
52
+ "state_after": "no goals",
53
+ "state_before": "R : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type ?u.821397\nS' : Type ?u.821400\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.823831\nS'' : Type ?u.823834\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nf : P.Hom P'\nx : \u21a5P.ker\n\u22a2 f.toAlgHom \u2191x \u2208 P'.ker",
54
+ "tactic": "simpa [-map_aeval] using RingHom.congr_arg (algebraMap S S') x.2"
55
+ }
56
+ ],
57
+ "url": "https://github.com/leanprover-community/mathlib4"
58
+ },
59
+ "source_file": "Mathlib/RingTheory/Generators.lean"
60
+ },
61
+ {
62
+ "full_name": "Algebra.Generators.Cotangent.mk_surjective",
63
+ "id": "Algebra.Generators.Cotangent.mk_surjective",
64
+ "reason": "missing_trace",
65
+ "selection": {
66
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
67
+ "end": [
68
+ 439,
69
+ 51
70
+ ],
71
+ "file_path": "Mathlib/RingTheory/Generators.lean",
72
+ "full_name": "Algebra.Generators.Cotangent.mk_surjective",
73
+ "start": [
74
+ 438,
75
+ 1
76
+ ],
77
+ "traced_tactics": [],
78
+ "url": "https://github.com/leanprover-community/mathlib4"
79
+ },
80
+ "source_file": "Mathlib/RingTheory/Generators.lean"
81
+ },
82
+ {
83
+ "full_name": "Algebra.Generators.Cotangent.of_add",
84
+ "id": "Algebra.Generators.Cotangent.of_add",
85
+ "reason": "missing_trace",
86
+ "selection": {
87
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
88
+ "end": [
89
+ 369,
90
+ 55
91
+ ],
92
+ "file_path": "Mathlib/RingTheory/Generators.lean",
93
+ "full_name": "Algebra.Generators.Cotangent.of_add",
94
+ "start": [
95
+ 369,
96
+ 1
97
+ ],
98
+ "traced_tactics": [],
99
+ "url": "https://github.com/leanprover-community/mathlib4"
100
+ },
101
+ "source_file": "Mathlib/RingTheory/Generators.lean"
102
+ },
103
+ {
104
+ "full_name": "Algebra.Generators.Cotangent.of_val",
105
+ "id": "Algebra.Generators.Cotangent.of_val",
106
+ "reason": "missing_trace",
107
+ "selection": {
108
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
109
+ "end": [
110
+ 371,
111
+ 43
112
+ ],
113
+ "file_path": "Mathlib/RingTheory/Generators.lean",
114
+ "full_name": "Algebra.Generators.Cotangent.of_val",
115
+ "start": [
116
+ 371,
117
+ 1
118
+ ],
119
+ "traced_tactics": [],
120
+ "url": "https://github.com/leanprover-community/mathlib4"
121
+ },
122
+ "source_file": "Mathlib/RingTheory/Generators.lean"
123
+ },
124
+ {
125
+ "full_name": "Algebra.Generators.Cotangent.of_zero",
126
+ "id": "Algebra.Generators.Cotangent.of_zero",
127
+ "reason": "missing_trace",
128
+ "selection": {
129
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
130
+ "end": [
131
+ 370,
132
+ 56
133
+ ],
134
+ "file_path": "Mathlib/RingTheory/Generators.lean",
135
+ "full_name": "Algebra.Generators.Cotangent.of_zero",
136
+ "start": [
137
+ 370,
138
+ 1
139
+ ],
140
+ "traced_tactics": [],
141
+ "url": "https://github.com/leanprover-community/mathlib4"
142
+ },
143
+ "source_file": "Mathlib/RingTheory/Generators.lean"
144
+ },
145
+ {
146
+ "full_name": "Algebra.Generators.Cotangent.smul_eq_zero_of_mem",
147
+ "id": "Algebra.Generators.Cotangent.smul_eq_zero_of_mem",
148
+ "reason": "missing_trace",
149
+ "selection": {
150
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
151
+ "end": [
152
+ 380,
153
+ 33
154
+ ],
155
+ "file_path": "Mathlib/RingTheory/Generators.lean",
156
+ "full_name": "Algebra.Generators.Cotangent.smul_eq_zero_of_mem",
157
+ "start": [
158
+ 376,
159
+ 1
160
+ ],
161
+ "traced_tactics": [
162
+ {
163
+ "annotated_tactic": [
164
+ "\"obtain \\u27e8x, rfl\\u27e9 := <a>Ideal.toCotangent_surjective<\\/a> _ m\"",
165
+ "[{\"full_name\":\"Ideal.toCotangent_surjective\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Cotangent.lean\",\"def_pos\":[82,9],\"def_end_pos\":[82,31]}]"
166
+ ],
167
+ "state_after": "case intro\nR : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type ?u.531997\nS' : Type ?u.532000\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.534431\nS'' : Type ?u.534434\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\np : P.Ring\nhp : p \u2208 P.ker\nx : \u21a5P.ker\n\u22a2 p \u2022 P.ker.toCotangent x = 0",
168
+ "state_before": "R : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type ?u.531997\nS' : Type ?u.532000\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.534431\nS'' : Type ?u.534434\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\np : P.Ring\nhp : p \u2208 P.ker\nm : P.ker.Cotangent\n\u22a2 p \u2022 m = 0",
169
+ "tactic": "obtain \u27e8x, rfl\u27e9 := Ideal.toCotangent_surjective _ m"
170
+ },
171
+ {
172
+ "annotated_tactic": [
173
+ "\"rw [\\u2190 <a>map_smul<\\/a>, <a>Ideal.toCotangent_eq_zero<\\/a>, <a>Submodule.coe_smul<\\/a>, <a>smul_eq_mul<\\/a>, <a>pow_two<\\/a>]\"",
174
+ "[{\"full_name\":\"map_smul\",\"def_path\":\"Mathlib\\/GroupTheory\\/GroupAction\\/Hom.lean\",\"def_pos\":[111,9],\"def_end_pos\":[111,17]},{\"full_name\":\"Ideal.toCotangent_eq_zero\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Cotangent.lean\",\"def_pos\":[79,9],\"def_end_pos\":[79,28]},{\"full_name\":\"Submodule.coe_smul\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Submodule\\/Basic.lean\",\"def_pos\":[304,9],\"def_end_pos\":[304,17]},{\"full_name\":\"smul_eq_mul\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Action\\/Defs.lean\",\"def_pos\":[89,7],\"def_end_pos\":[89,18]},{\"full_name\":\"pow_two\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Defs.lean\",\"def_pos\":[679,32],\"def_end_pos\":[679,39]}]"
175
+ ],
176
+ "state_after": "case intro\nR : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type ?u.531997\nS' : Type ?u.532000\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.534431\nS'' : Type ?u.534434\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\np : P.Ring\nhp : p \u2208 P.ker\nx : \u21a5P.ker\n\u22a2 p * \u2191x \u2208 P.ker * P.ker",
177
+ "state_before": "case intro\nR : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type ?u.531997\nS' : Type ?u.532000\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.534431\nS'' : Type ?u.534434\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\np : P.Ring\nhp : p \u2208 P.ker\nx : \u21a5P.ker\n\u22a2 p \u2022 P.ker.toCotangent x = 0",
178
+ "tactic": "rw [\u2190 map_smul, Ideal.toCotangent_eq_zero, Submodule.coe_smul, smul_eq_mul, pow_two]"
179
+ },
180
+ {
181
+ "annotated_tactic": [
182
+ "\"exact <a>Ideal.mul_mem_mul<\\/a> hp x.2\"",
183
+ "[{\"full_name\":\"Ideal.mul_mem_mul\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Operations.lean\",\"def_pos\":[434,9],\"def_end_pos\":[434,20]}]"
184
+ ],
185
+ "state_after": "no goals",
186
+ "state_before": "case intro\nR : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type ?u.531997\nS' : Type ?u.532000\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.534431\nS'' : Type ?u.534434\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\np : P.Ring\nhp : p \u2208 P.ker\nx : \u21a5P.ker\n\u22a2 p * \u2191x \u2208 P.ker * P.ker",
187
+ "tactic": "exact Ideal.mul_mem_mul hp x.2"
188
+ }
189
+ ],
190
+ "url": "https://github.com/leanprover-community/mathlib4"
191
+ },
192
+ "source_file": "Mathlib/RingTheory/Generators.lean"
193
+ },
194
+ {
195
+ "full_name": "Algebra.Generators.Cotangent.val_add",
196
+ "id": "Algebra.Generators.Cotangent.val_add",
197
+ "reason": "missing_trace",
198
+ "selection": {
199
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
200
+ "end": [
201
+ 367,
202
+ 59
203
+ ],
204
+ "file_path": "Mathlib/RingTheory/Generators.lean",
205
+ "full_name": "Algebra.Generators.Cotangent.val_add",
206
+ "start": [
207
+ 367,
208
+ 1
209
+ ],
210
+ "traced_tactics": [],
211
+ "url": "https://github.com/leanprover-community/mathlib4"
212
+ },
213
+ "source_file": "Mathlib/RingTheory/Generators.lean"
214
+ },
215
+ {
216
+ "full_name": "Algebra.Generators.Cotangent.val_mk",
217
+ "id": "Algebra.Generators.Cotangent.val_mk",
218
+ "reason": "missing_trace",
219
+ "selection": {
220
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
221
+ "end": [
222
+ 436,
223
+ 79
224
+ ],
225
+ "file_path": "Mathlib/RingTheory/Generators.lean",
226
+ "full_name": "Algebra.Generators.Cotangent.val_mk",
227
+ "start": [
228
+ 435,
229
+ 1
230
+ ],
231
+ "traced_tactics": [],
232
+ "url": "https://github.com/leanprover-community/mathlib4"
233
+ },
234
+ "source_file": "Mathlib/RingTheory/Generators.lean"
235
+ },
236
+ {
237
+ "full_name": "Algebra.Generators.Cotangent.val_of",
238
+ "id": "Algebra.Generators.Cotangent.val_of",
239
+ "reason": "missing_trace",
240
+ "selection": {
241
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
242
+ "end": [
243
+ 372,
244
+ 45
245
+ ],
246
+ "file_path": "Mathlib/RingTheory/Generators.lean",
247
+ "full_name": "Algebra.Generators.Cotangent.val_of",
248
+ "start": [
249
+ 372,
250
+ 1
251
+ ],
252
+ "traced_tactics": [],
253
+ "url": "https://github.com/leanprover-community/mathlib4"
254
+ },
255
+ "source_file": "Mathlib/RingTheory/Generators.lean"
256
+ },
257
+ {
258
+ "full_name": "Algebra.Generators.Cotangent.val_smul",
259
+ "id": "Algebra.Generators.Cotangent.val_smul",
260
+ "reason": "missing_trace",
261
+ "selection": {
262
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
263
+ "end": [
264
+ 418,
265
+ 88
266
+ ],
267
+ "file_path": "Mathlib/RingTheory/Generators.lean",
268
+ "full_name": "Algebra.Generators.Cotangent.val_smul",
269
+ "start": [
270
+ 417,
271
+ 1
272
+ ],
273
+ "traced_tactics": [],
274
+ "url": "https://github.com/leanprover-community/mathlib4"
275
+ },
276
+ "source_file": "Mathlib/RingTheory/Generators.lean"
277
+ },
278
+ {
279
+ "full_name": "Algebra.Generators.Cotangent.val_smul'",
280
+ "id": "Algebra.Generators.Cotangent.val_smul'",
281
+ "reason": "missing_trace",
282
+ "selection": {
283
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
284
+ "end": [
285
+ 423,
286
+ 52
287
+ ],
288
+ "file_path": "Mathlib/RingTheory/Generators.lean",
289
+ "full_name": "Algebra.Generators.Cotangent.val_smul'",
290
+ "start": [
291
+ 420,
292
+ 1
293
+ ],
294
+ "traced_tactics": [
295
+ {
296
+ "annotated_tactic": [
297
+ "\"rw [<a>val_smul'''<\\/a>, \\u2190 <a>sub_eq_zero<\\/a>, \\u2190 <a>sub_smul<\\/a>]\"",
298
+ "[{\"full_name\":\"Algebra.Generators.Cotangent.val_smul'''\",\"def_path\":\"Mathlib\\/RingTheory\\/Generators.lean\",\"def_pos\":[414,7],\"def_end_pos\":[414,28]},{\"full_name\":\"sub_eq_zero\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Basic.lean\",\"def_pos\":[1070,3],\"def_end_pos\":[1070,14]},{\"full_name\":\"sub_smul\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Defs.lean\",\"def_pos\":[274,9],\"def_end_pos\":[274,17]}]"
299
+ ],
300
+ "state_after": "R : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type ?u.640532\nS' : Type ?u.640535\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.642966\nS'' : Type ?u.642969\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nr : P.Ring\nx : P.Cotangent\n\u22a2 (P.\u03c3 ((algebraMap P.Ring S) r) - r) \u2022 x.val = 0",
301
+ "state_before": "R : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type ?u.640532\nS' : Type ?u.640535\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.642966\nS'' : Type ?u.642969\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nr : P.Ring\nx : P.Cotangent\n\u22a2 (r \u2022 x).val = r \u2022 x.val",
302
+ "tactic": "rw [val_smul''', \u2190 sub_eq_zero, \u2190 sub_smul]"
303
+ },
304
+ {
305
+ "annotated_tactic": [
306
+ "\"exact <a>Cotangent.smul_eq_zero_of_mem<\\/a> _ (by simp) _\"",
307
+ "[{\"full_name\":\"Algebra.Generators.Cotangent.smul_eq_zero_of_mem\",\"def_path\":\"Mathlib\\/RingTheory\\/Generators.lean\",\"def_pos\":[376,7],\"def_end_pos\":[376,36]}]"
308
+ ],
309
+ "state_after": "no goals",
310
+ "state_before": "R : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type ?u.640532\nS' : Type ?u.640535\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.642966\nS'' : Type ?u.642969\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nr : P.Ring\nx : P.Cotangent\n\u22a2 (P.\u03c3 ((algebraMap P.Ring S) r) - r) \u2022 x.val = 0",
311
+ "tactic": "exact Cotangent.smul_eq_zero_of_mem _ (by simp) _"
312
+ },
313
+ {
314
+ "annotated_tactic": [
315
+ "\"simp\"",
316
+ "[]"
317
+ ],
318
+ "state_after": "no goals",
319
+ "state_before": "R : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type ?u.640532\nS' : Type ?u.640535\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.642966\nS'' : Type ?u.642969\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nr : P.Ring\nx : P.Cotangent\n\u22a2 P.\u03c3 ((algebraMap P.Ring S) r) - r \u2208 P.ker",
320
+ "tactic": "simp"
321
+ }
322
+ ],
323
+ "url": "https://github.com/leanprover-community/mathlib4"
324
+ },
325
+ "source_file": "Mathlib/RingTheory/Generators.lean"
326
+ },
327
+ {
328
+ "full_name": "Algebra.Generators.Cotangent.val_smul''",
329
+ "id": "Algebra.Generators.Cotangent.val_smul''",
330
+ "reason": "missing_trace",
331
+ "selection": {
332
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
333
+ "end": [
334
+ 427,
335
+ 60
336
+ ],
337
+ "file_path": "Mathlib/RingTheory/Generators.lean",
338
+ "full_name": "Algebra.Generators.Cotangent.val_smul''",
339
+ "start": [
340
+ 425,
341
+ 1
342
+ ],
343
+ "traced_tactics": [
344
+ {
345
+ "annotated_tactic": [
346
+ "\"rw [\\u2190 <a>algebraMap_smul<\\/a> P.Ring, <a>val_smul'<\\/a>, <a>algebraMap_smul<\\/a>]\"",
347
+ "[{\"full_name\":\"algebraMap_smul\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Basic.lean\",\"def_pos\":[408,9],\"def_end_pos\":[408,24]},{\"full_name\":\"Algebra.Generators.Cotangent.val_smul'\",\"def_path\":\"Mathlib\\/RingTheory\\/Generators.lean\",\"def_pos\":[421,7],\"def_end_pos\":[421,26]},{\"full_name\":\"algebraMap_smul\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Basic.lean\",\"def_pos\":[408,9],\"def_end_pos\":[408,24]}]"
348
+ ],
349
+ "state_after": "no goals",
350
+ "state_before": "R : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type ?u.659527\nS' : Type ?u.659530\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.661961\nS'' : Type ?u.661964\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nr : R\nx : P.Cotangent\n\u22a2 (r \u2022 x).val = r \u2022 x.val",
351
+ "tactic": "rw [\u2190 algebraMap_smul P.Ring, val_smul', algebraMap_smul]"
352
+ }
353
+ ],
354
+ "url": "https://github.com/leanprover-community/mathlib4"
355
+ },
356
+ "source_file": "Mathlib/RingTheory/Generators.lean"
357
+ },
358
+ {
359
+ "full_name": "Algebra.Generators.Cotangent.val_smul'''",
360
+ "id": "Algebra.Generators.Cotangent.val_smul'''",
361
+ "reason": "missing_trace",
362
+ "selection": {
363
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
364
+ "end": [
365
+ 415,
366
+ 57
367
+ ],
368
+ "file_path": "Mathlib/RingTheory/Generators.lean",
369
+ "full_name": "Algebra.Generators.Cotangent.val_smul'''",
370
+ "start": [
371
+ 414,
372
+ 1
373
+ ],
374
+ "traced_tactics": [],
375
+ "url": "https://github.com/leanprover-community/mathlib4"
376
+ },
377
+ "source_file": "Mathlib/RingTheory/Generators.lean"
378
+ },
379
+ {
380
+ "full_name": "Algebra.Generators.Cotangent.val_zero",
381
+ "id": "Algebra.Generators.Cotangent.val_zero",
382
+ "reason": "missing_trace",
383
+ "selection": {
384
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
385
+ "end": [
386
+ 368,
387
+ 58
388
+ ],
389
+ "file_path": "Mathlib/RingTheory/Generators.lean",
390
+ "full_name": "Algebra.Generators.Cotangent.val_zero",
391
+ "start": [
392
+ 368,
393
+ 1
394
+ ],
395
+ "traced_tactics": [],
396
+ "url": "https://github.com/leanprover-community/mathlib4"
397
+ },
398
+ "source_file": "Mathlib/RingTheory/Generators.lean"
399
+ },
400
+ {
401
+ "full_name": "Algebra.Generators.Hom.algebraMap_toAlgHom",
402
+ "id": "Algebra.Generators.Hom.algebraMap_toAlgHom",
403
+ "reason": "missing_trace",
404
+ "selection": {
405
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
406
+ "end": [
407
+ 256,
408
+ 22
409
+ ],
410
+ "file_path": "Mathlib/RingTheory/Generators.lean",
411
+ "full_name": "Algebra.Generators.Hom.algebraMap_toAlgHom",
412
+ "start": [
413
+ 248,
414
+ 1
415
+ ],
416
+ "traced_tactics": [
417
+ {
418
+ "annotated_tactic": [
419
+ "\"suffices ((<a>MvPolynomial.aeval<\\/a> P'.val).<a>restrictScalars<\\/a> R).<a>comp<\\/a> f.toAlgHom =\\n (<a>IsScalarTower.toAlgHom<\\/a> R S S').<a>comp<\\/a> (<a>MvPolynomial.aeval<\\/a> P.val) from\\n <a>DFunLike.congr_fun<\\/a> this x\"",
420
+ "[{\"full_name\":\"MvPolynomial.aeval\",\"def_path\":\"Mathlib\\/Algebra\\/MvPolynomial\\/Basic.lean\",\"def_pos\":[1521,5],\"def_end_pos\":[1521,10]},{\"full_name\":\"AlgHom.restrictScalars\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Tower.lean\",\"def_pos\":[205,5],\"def_end_pos\":[205,20]},{\"full_name\":\"AlgHom.comp\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Hom.lean\",\"def_pos\":[314,5],\"def_end_pos\":[314,9]},{\"full_name\":\"IsScalarTower.toAlgHom\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Tower.lean\",\"def_pos\":[143,5],\"def_end_pos\":[143,13]},{\"full_name\":\"AlgHom.comp\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Hom.lean\",\"def_pos\":[314,5],\"def_end_pos\":[314,9]},{\"full_name\":\"MvPolynomial.aeval\",\"def_path\":\"Mathlib\\/Algebra\\/MvPolynomial\\/Basic.lean\",\"def_pos\":[1521,5],\"def_end_pos\":[1521,10]},{\"full_name\":\"DFunLike.congr_fun\",\"def_path\":\"Mathlib\\/Data\\/FunLike\\/Basic.lean\",\"def_pos\":[209,19],\"def_end_pos\":[209,28]}]"
421
+ ],
422
+ "state_after": "R : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type u_1\nS' : Type u_2\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.198286\nS'' : Type ?u.198289\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nf : P.Hom P'\nx : P.Ring\n\u22a2 (AlgHom.restrictScalars R (aeval P'.val)).comp f.toAlgHom = (IsScalarTower.toAlgHom R S S').comp (aeval P.val)",
423
+ "state_before": "R : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type u_1\nS' : Type u_2\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.198286\nS'' : Type ?u.198289\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nf : P.Hom P'\nx : P.Ring\n\u22a2 (aeval P'.val) (f.toAlgHom x) = (algebraMap S S') ((aeval P.val) x)",
424
+ "tactic": "suffices ((MvPolynomial.aeval P'.val).restrictScalars R).comp f.toAlgHom =\n (IsScalarTower.toAlgHom R S S').comp (MvPolynomial.aeval P.val) from\n DFunLike.congr_fun this x"
425
+ },
426
+ {
427
+ "annotated_tactic": [
428
+ "\"apply <a>MvPolynomial.algHom_ext<\\/a>\"",
429
+ "[{\"full_name\":\"MvPolynomial.algHom_ext\",\"def_path\":\"Mathlib\\/Algebra\\/MvPolynomial\\/Basic.lean\",\"def_pos\":[501,9],\"def_end_pos\":[501,19]}]"
430
+ ],
431
+ "state_after": "case hf\nR : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type u_1\nS' : Type u_2\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.198286\nS'' : Type ?u.198289\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nf : P.Hom P'\nx : P.Ring\n\u22a2 \u2200 (i : P.vars),\n ((AlgHom.restrictScalars R (aeval P'.val)).comp f.toAlgHom) (X i) =\n ((IsScalarTower.toAlgHom R S S').comp (aeval P.val)) (X i)",
432
+ "state_before": "R : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type u_1\nS' : Type u_2\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.198286\nS'' : Type ?u.198289\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nf : P.Hom P'\nx : P.Ring\n\u22a2 (AlgHom.restrictScalars R (aeval P'.val)).comp f.toAlgHom = (IsScalarTower.toAlgHom R S S').comp (aeval P.val)",
433
+ "tactic": "apply MvPolynomial.algHom_ext"
434
+ },
435
+ {
436
+ "annotated_tactic": [
437
+ "\"intro i\"",
438
+ "[]"
439
+ ],
440
+ "state_after": "case hf\nR : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type u_1\nS' : Type u_2\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.198286\nS'' : Type ?u.198289\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nf : P.Hom P'\nx : P.Ring\ni : P.vars\n\u22a2 ((AlgHom.restrictScalars R (aeval P'.val)).comp f.toAlgHom) (X i) =\n ((IsScalarTower.toAlgHom R S S').comp (aeval P.val)) (X i)",
441
+ "state_before": "case hf\nR : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type u_1\nS' : Type u_2\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.198286\nS'' : Type ?u.198289\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nf : P.Hom P'\nx : P.Ring\n\u22a2 \u2200 (i : P.vars),\n ((AlgHom.restrictScalars R (aeval P'.val)).comp f.toAlgHom) (X i) =\n ((IsScalarTower.toAlgHom R S S').comp (aeval P.val)) (X i)",
442
+ "tactic": "intro i"
443
+ },
444
+ {
445
+ "annotated_tactic": [
446
+ "\"simp [<a>Hom.toAlgHom<\\/a>]\"",
447
+ "[{\"full_name\":\"Algebra.Generators.Hom.toAlgHom\",\"def_path\":\"Mathlib\\/RingTheory\\/Generators.lean\",\"def_pos\":[246,5],\"def_end_pos\":[246,17]}]"
448
+ ],
449
+ "state_after": "no goals",
450
+ "state_before": "case hf\nR : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type u_1\nS' : Type u_2\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.198286\nS'' : Type ?u.198289\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nf : P.Hom P'\nx : P.Ring\ni : P.vars\n\u22a2 ((AlgHom.restrictScalars R (aeval P'.val)).comp f.toAlgHom) (X i) =\n ((IsScalarTower.toAlgHom R S S').comp (aeval P.val)) (X i)",
451
+ "tactic": "simp [Hom.toAlgHom]"
452
+ }
453
+ ],
454
+ "url": "https://github.com/leanprover-community/mathlib4"
455
+ },
456
+ "source_file": "Mathlib/RingTheory/Generators.lean"
457
+ },
458
+ {
459
+ "full_name": "Algebra.Generators.Hom.comp_id",
460
+ "id": "Algebra.Generators.Hom.comp_id",
461
+ "reason": "missing_trace",
462
+ "selection": {
463
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
464
+ "end": [
465
+ 304,
466
+ 73
467
+ ],
468
+ "file_path": "Mathlib/RingTheory/Generators.lean",
469
+ "full_name": "Algebra.Generators.Hom.comp_id",
470
+ "start": [
471
+ 303,
472
+ 1
473
+ ],
474
+ "traced_tactics": [
475
+ {
476
+ "annotated_tactic": [
477
+ "\"ext\"",
478
+ "[]"
479
+ ],
480
+ "state_after": "case val.h.a\nR : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type u_1\nS' : Type u_2\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.327088\nS'' : Type ?u.327091\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nf : P.Hom P'\nx\u271d : P.vars\nm\u271d : P'.vars \u2192\u2080 \u2115\n\u22a2 coeff m\u271d ((f.comp (Hom.id P)).val x\u271d) = coeff m\u271d (f.val x\u271d)",
481
+ "state_before": "R : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type u_1\nS' : Type u_2\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.327088\nS'' : Type ?u.327091\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nf : P.Hom P'\n\u22a2 f.comp (Hom.id P) = f",
482
+ "tactic": "ext"
483
+ },
484
+ {
485
+ "annotated_tactic": [
486
+ "\"simp\"",
487
+ "[]"
488
+ ],
489
+ "state_after": "no goals",
490
+ "state_before": "case val.h.a\nR : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type u_1\nS' : Type u_2\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.327088\nS'' : Type ?u.327091\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nf : P.Hom P'\nx\u271d : P.vars\nm\u271d : P'.vars \u2192\u2080 \u2115\n\u22a2 coeff m\u271d ((f.comp (Hom.id P)).val x\u271d) = coeff m\u271d (f.val x\u271d)",
491
+ "tactic": "simp"
492
+ }
493
+ ],
494
+ "url": "https://github.com/leanprover-community/mathlib4"
495
+ },
496
+ "source_file": "Mathlib/RingTheory/Generators.lean"
497
+ },
498
+ {
499
+ "full_name": "Algebra.Generators.Hom.id_comp",
500
+ "id": "Algebra.Generators.Hom.id_comp",
501
+ "reason": "missing_trace",
502
+ "selection": {
503
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
504
+ "end": [
505
+ 307,
506
+ 97
507
+ ],
508
+ "file_path": "Mathlib/RingTheory/Generators.lean",
509
+ "full_name": "Algebra.Generators.Hom.id_comp",
510
+ "start": [
511
+ 306,
512
+ 1
513
+ ],
514
+ "traced_tactics": [
515
+ {
516
+ "annotated_tactic": [
517
+ "\"ext\"",
518
+ "[]"
519
+ ],
520
+ "state_after": "case val.h.a\nR : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type u_1\nS' : Type u_2\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.338019\nS'' : Type ?u.338022\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nf : P.Hom P'\nx\u271d : P.vars\nm\u271d : P'.vars \u2192\u2080 \u2115\n\u22a2 coeff m\u271d (((Hom.id P').comp f).val x\u271d) = coeff m\u271d (f.val x\u271d)",
521
+ "state_before": "R : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type u_1\nS' : Type u_2\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.338019\nS'' : Type ?u.338022\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nf : P.Hom P'\n\u22a2 (Hom.id P').comp f = f",
522
+ "tactic": "ext"
523
+ },
524
+ {
525
+ "annotated_tactic": [
526
+ "\"simp [<a>Hom.id<\\/a>, <a>aeval_X_left<\\/a>]\"",
527
+ "[{\"full_name\":\"Algebra.Generators.Hom.id\",\"def_path\":\"Mathlib\\/RingTheory\\/Generators.lean\",\"def_pos\":[287,29],\"def_end_pos\":[287,35]},{\"full_name\":\"MvPolynomial.aeval_X_left\",\"def_path\":\"Mathlib\\/Algebra\\/MvPolynomial\\/Basic.lean\",\"def_pos\":[1551,9],\"def_end_pos\":[1551,21]}]"
528
+ ],
529
+ "state_after": "no goals",
530
+ "state_before": "case val.h.a\nR : Type u\nS : Type v\ninst\u271d\u00b2\u2075 : CommRing R\ninst\u271d\u00b2\u2074 : CommRing S\ninst\u271d\u00b2\u00b3 : Algebra R S\nP : Generators R S\nR' : Type u_1\nS' : Type u_2\ninst\u271d\u00b2\u00b2 : CommRing R'\ninst\u271d\u00b2\u00b9 : CommRing S'\ninst\u271d\u00b2\u2070 : Algebra R' S'\nP' : Generators R' S'\ninst\u271d\u00b9\u2079 : Algebra R R'\ninst\u271d\u00b9\u2078 : Algebra S S'\ninst\u271d\u00b9\u2077 : Algebra R S'\ninst\u271d\u00b9\u2076 : IsScalarTower R R' S'\ninst\u271d\u00b9\u2075 : IsScalarTower R S S'\nR'' : Type ?u.338019\nS'' : Type ?u.338022\ninst\u271d\u00b9\u2074 : CommRing R''\ninst\u271d\u00b9\u00b3 : CommRing S''\ninst\u271d\u00b9\u00b2 : Algebra R'' S''\nP'' : Generators R'' S''\ninst\u271d\u00b9\u00b9 : Algebra R R''\ninst\u271d\u00b9\u2070 : Algebra S S''\ninst\u271d\u2079 : Algebra R S''\ninst\u271d\u2078 : IsScalarTower R R'' S''\ninst\u271d\u2077 : IsScalarTower R S S''\ninst\u271d\u2076 : Algebra R' R''\ninst\u271d\u2075 : Algebra S' S''\ninst\u271d\u2074 : Algebra R' S''\ninst\u271d\u00b3 : IsScalarTower R' R'' S''\ninst\u271d\u00b2 : IsScalarTower R' S' S''\ninst\u271d\u00b9 : IsScalarTower R' R'' R''\ninst\u271d : IsScalarTower S S' S''\nf : P.Hom P'\nx\u271d : P.vars\nm\u271d : P'.vars \u2192\u2080 \u2115\n\u22a2 coeff m\u271d (((Hom.id P').comp f).val x\u271d) = coeff m\u271d (f.val x\u271d)",
531
+ "tactic": "simp [Hom.id, aeval_X_left]"
532
+ }
533
+ ],
534
+ "url": "https://github.com/leanprover-community/mathlib4"
535
+ },
536
+ "source_file": "Mathlib/RingTheory/Generators.lean"
537
+ },
538
+ {
539
+ "full_name": "Algebra.Generators.Hom.toAlgHom_C",
540
+ "id": "Algebra.Generators.Hom.toAlgHom_C",
541
+ "reason": "missing_trace",
542
+ "selection": {
543
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
544
+ "end": [
545
+ 263,
546
+ 31
547
+ ],
548
+ "file_path": "Mathlib/RingTheory/Generators.lean",
549
+ "full_name": "Algebra.Generators.Hom.toAlgHom_C",
550
+ "start": [
551
+ 262,
552
+ 1
553
+ ],
554
+ "traced_tactics": [],
555
+ "url": "https://github.com/leanprover-community/mathlib4"
556
+ },
557
+ "source_file": "Mathlib/RingTheory/Generators.lean"
558
+ },
559
+ {
560
+ "full_name": "Algebra.Generators.Hom.toAlgHom_X",
561
+ "id": "Algebra.Generators.Hom.toAlgHom_X",
562
+ "reason": "missing_trace",
563
+ "selection": {
564
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
565
+ "end": [
566
+ 260,
567
+ 31
568
+ ],
569
+ "file_path": "Mathlib/RingTheory/Generators.lean",
570
+ "full_name": "Algebra.Generators.Hom.toAlgHom_X",
571
+ "start": [
572
+ 258,
573
+ 1
574
+ ],
575
+ "traced_tactics": [],
576
+ "url": "https://github.com/leanprover-community/mathlib4"
577
+ },
578
+ "source_file": "Mathlib/RingTheory/Generators.lean"
579
+ },
580
+ {
581
+ "full_name": "Algebra.Generators.aeval_val_\u03c3",
582
+ "id": "Algebra.Generators.aeval_val_\u03c3",
583
+ "reason": "missing_trace",
584
+ "selection": {
585
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
586
+ "end": [
587
+ 70,
588
+ 68
589
+ ],
590
+ "file_path": "Mathlib/RingTheory/Generators.lean",
591
+ "full_name": "Algebra.Generators.aeval_val_\u03c3",
592
+ "start": [
593
+ 69,
594
+ 1
595
+ ],
596
+ "traced_tactics": [],
597
+ "url": "https://github.com/leanprover-community/mathlib4"
598
+ },
599
+ "source_file": "Mathlib/RingTheory/Generators.lean"
600
+ },
601
+ {
602
+ "full_name": "Algebra.Generators.algebraMap_apply",
603
+ "id": "Algebra.Generators.algebraMap_apply",
604
+ "reason": "missing_trace",
605
+ "selection": {
606
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
607
+ "end": [
608
+ 81,
609
+ 83
610
+ ],
611
+ "file_path": "Mathlib/RingTheory/Generators.lean",
612
+ "full_name": "Algebra.Generators.algebraMap_apply",
613
+ "start": [
614
+ 80,
615
+ 1
616
+ ],
617
+ "traced_tactics": [],
618
+ "url": "https://github.com/leanprover-community/mathlib4"
619
+ },
620
+ "source_file": "Mathlib/RingTheory/Generators.lean"
621
+ },
622
+ {
623
+ "full_name": "Algebra.Generators.algebraMap_eq",
624
+ "id": "Algebra.Generators.algebraMap_eq",
625
+ "reason": "missing_trace",
626
+ "selection": {
627
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
628
+ "end": [
629
+ 78,
630
+ 75
631
+ ],
632
+ "file_path": "Mathlib/RingTheory/Generators.lean",
633
+ "full_name": "Algebra.Generators.algebraMap_eq",
634
+ "start": [
635
+ 78,
636
+ 1
637
+ ],
638
+ "traced_tactics": [],
639
+ "url": "https://github.com/leanprover-community/mathlib4"
640
+ },
641
+ "source_file": "Mathlib/RingTheory/Generators.lean"
642
+ },
643
+ {
644
+ "full_name": "Algebra.Generators.algebraMap_surjective",
645
+ "id": "Algebra.Generators.algebraMap_surjective",
646
+ "reason": "missing_trace",
647
+ "selection": {
648
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
649
+ "end": [
650
+ 91,
651
+ 98
652
+ ],
653
+ "file_path": "Mathlib/RingTheory/Generators.lean",
654
+ "full_name": "Algebra.Generators.algebraMap_surjective",
655
+ "start": [
656
+ 91,
657
+ 1
658
+ ],
659
+ "traced_tactics": [],
660
+ "url": "https://github.com/leanprover-community/mathlib4"
661
+ },
662
+ "source_file": "Mathlib/RingTheory/Generators.lean"
663
+ },
664
+ {
665
+ "full_name": "Algebra.Generators.ker_eq_ker_aeval_val",
666
+ "id": "Algebra.Generators.ker_eq_ker_aeval_val",
667
+ "reason": "missing_trace",
668
+ "selection": {
669
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
670
+ "end": [
671
+ 342,
672
+ 6
673
+ ],
674
+ "file_path": "Mathlib/RingTheory/Generators.lean",
675
+ "full_name": "Algebra.Generators.ker_eq_ker_aeval_val",
676
+ "start": [
677
+ 341,
678
+ 1
679
+ ],
680
+ "traced_tactics": [],
681
+ "url": "https://github.com/leanprover-community/mathlib4"
682
+ },
683
+ "source_file": "Mathlib/RingTheory/Generators.lean"
684
+ },
685
+ {
686
+ "full_name": "Algebra.Generators.\u03c3_injective",
687
+ "id": "Algebra.Generators.\u03c3_injective",
688
+ "reason": "missing_trace",
689
+ "selection": {
690
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
691
+ "end": [
692
+ 89,
693
+ 47
694
+ ],
695
+ "file_path": "Mathlib/RingTheory/Generators.lean",
696
+ "full_name": "Algebra.Generators.\u03c3_injective",
697
+ "start": [
698
+ 87,
699
+ 1
700
+ ],
701
+ "traced_tactics": [
702
+ {
703
+ "annotated_tactic": [
704
+ "\"intro x y e\"",
705
+ "[]"
706
+ ],
707
+ "state_after": "R : Type u\nS : Type v\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : CommRing S\ninst\u271d : Algebra R S\nP : Generators R S\nx y : S\ne : P.\u03c3 x = P.\u03c3 y\n\u22a2 x = y",
708
+ "state_before": "R : Type u\nS : Type v\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : CommRing S\ninst\u271d : Algebra R S\nP : Generators R S\n\u22a2 Function.Injective P.\u03c3",
709
+ "tactic": "intro x y e"
710
+ },
711
+ {
712
+ "annotated_tactic": [
713
+ "\"rw [\\u2190 P.aeval_val_\\u03c3 x, \\u2190 P.aeval_val_\\u03c3 y, e]\"",
714
+ "[]"
715
+ ],
716
+ "state_after": "no goals",
717
+ "state_before": "R : Type u\nS : Type v\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : CommRing S\ninst\u271d : Algebra R S\nP : Generators R S\nx y : S\ne : P.\u03c3 x = P.\u03c3 y\n\u22a2 x = y",
718
+ "tactic": "rw [\u2190 P.aeval_val_\u03c3 x, \u2190 P.aeval_val_\u03c3 y, e]"
719
+ }
720
+ ],
721
+ "url": "https://github.com/leanprover-community/mathlib4"
722
+ },
723
+ "source_file": "Mathlib/RingTheory/Generators.lean"
724
+ },
725
+ {
726
+ "full_name": "Algebra.Generators.\u03c3_smul",
727
+ "id": "Algebra.Generators.\u03c3_smul",
728
+ "reason": "missing_trace",
729
+ "selection": {
730
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
731
+ "end": [
732
+ 85,
733
+ 55
734
+ ],
735
+ "file_path": "Mathlib/RingTheory/Generators.lean",
736
+ "full_name": "Algebra.Generators.\u03c3_smul",
737
+ "start": [
738
+ 83,
739
+ 1
740
+ ],
741
+ "traced_tactics": [
742
+ {
743
+ "annotated_tactic": [
744
+ "\"rw [<a>Algebra.smul_def<\\/a>, <a>algebraMap_apply<\\/a>, <a>aeval_val_\\u03c3<\\/a>]\"",
745
+ "[{\"full_name\":\"Algebra.smul_def\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Defs.lean\",\"def_pos\":[326,9],\"def_end_pos\":[326,17]},{\"full_name\":\"Algebra.Generators.algebraMap_apply\",\"def_path\":\"Mathlib\\/RingTheory\\/Generators.lean\",\"def_pos\":[81,7],\"def_end_pos\":[81,23]},{\"full_name\":\"Algebra.Generators.aeval_val_\\u03c3\",\"def_path\":\"Mathlib\\/RingTheory\\/Generators.lean\",\"def_pos\":[70,7],\"def_end_pos\":[70,18]}]"
746
+ ],
747
+ "state_after": "no goals",
748
+ "state_before": "R : Type u\nS : Type v\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : CommRing S\ninst\u271d : Algebra R S\nP : Generators R S\nx y : S\n\u22a2 P.\u03c3 x \u2022 y = x * y",
749
+ "tactic": "rw [Algebra.smul_def, algebraMap_apply, aeval_val_\u03c3]"
750
+ }
751
+ ],
752
+ "url": "https://github.com/leanprover-community/mathlib4"
753
+ },
754
+ "source_file": "Mathlib/RingTheory/Generators.lean"
755
+ },
756
+ {
757
+ "error": "theorem has no selected tactic transitions",
758
+ "full_name": "DirectSum.decomposeAlgEquiv_apply",
759
+ "id": "DirectSum.decomposeAlgEquiv_apply",
760
+ "reason": "import_failure",
761
+ "selection": {
762
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
763
+ "end": [
764
+ 208,
765
+ 49
766
+ ],
767
+ "file_path": "Mathlib/RingTheory/GradedAlgebra/Basic.lean",
768
+ "full_name": "DirectSum.decomposeAlgEquiv_apply",
769
+ "start": [
770
+ 206,
771
+ 1
772
+ ],
773
+ "traced_tactics": [],
774
+ "url": "https://github.com/leanprover-community/mathlib4"
775
+ },
776
+ "source_file": "Mathlib/RingTheory/GradedAlgebra/Basic.lean"
777
+ },
778
+ {
779
+ "error": "theorem has no selected tactic transitions",
780
+ "full_name": "DirectSum.decomposeAlgEquiv_symm_apply",
781
+ "id": "DirectSum.decomposeAlgEquiv_symm_apply",
782
+ "reason": "import_failure",
783
+ "selection": {
784
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
785
+ "end": [
786
+ 212,
787
+ 63
788
+ ],
789
+ "file_path": "Mathlib/RingTheory/GradedAlgebra/Basic.lean",
790
+ "full_name": "DirectSum.decomposeAlgEquiv_symm_apply",
791
+ "start": [
792
+ 210,
793
+ 1
794
+ ],
795
+ "traced_tactics": [],
796
+ "url": "https://github.com/leanprover-community/mathlib4"
797
+ },
798
+ "source_file": "Mathlib/RingTheory/GradedAlgebra/Basic.lean"
799
+ },
800
+ {
801
+ "error": "theorem has no selected tactic transitions",
802
+ "full_name": "DirectSum.decompose_algebraMap",
803
+ "id": "DirectSum.decompose_algebraMap",
804
+ "reason": "import_failure",
805
+ "selection": {
806
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
807
+ "end": [
808
+ 217,
809
+ 35
810
+ ],
811
+ "file_path": "Mathlib/RingTheory/GradedAlgebra/Basic.lean",
812
+ "full_name": "DirectSum.decompose_algebraMap",
813
+ "start": [
814
+ 214,
815
+ 1
816
+ ],
817
+ "traced_tactics": [],
818
+ "url": "https://github.com/leanprover-community/mathlib4"
819
+ },
820
+ "source_file": "Mathlib/RingTheory/GradedAlgebra/Basic.lean"
821
+ },
822
+ {
823
+ "error": "theorem has no selected tactic transitions",
824
+ "full_name": "DirectSum.decompose_mul",
825
+ "id": "DirectSum.decompose_mul",
826
+ "reason": "import_failure",
827
+ "selection": {
828
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
829
+ "end": [
830
+ 91,
831
+ 37
832
+ ],
833
+ "file_path": "Mathlib/RingTheory/GradedAlgebra/Basic.lean",
834
+ "full_name": "DirectSum.decompose_mul",
835
+ "start": [
836
+ 90,
837
+ 1
838
+ ],
839
+ "traced_tactics": [],
840
+ "url": "https://github.com/leanprover-community/mathlib4"
841
+ },
842
+ "source_file": "Mathlib/RingTheory/GradedAlgebra/Basic.lean"
843
+ },
844
+ {
845
+ "error": "theorem has no selected tactic transitions",
846
+ "full_name": "DirectSum.decompose_mul_add_left",
847
+ "id": "DirectSum.decompose_mul_add_left",
848
+ "reason": "import_failure",
849
+ "selection": {
850
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
851
+ "end": [
852
+ 151,
853
+ 57
854
+ ],
855
+ "file_path": "Mathlib/RingTheory/GradedAlgebra/Basic.lean",
856
+ "full_name": "DirectSum.decompose_mul_add_left",
857
+ "start": [
858
+ 148,
859
+ 1
860
+ ],
861
+ "traced_tactics": [],
862
+ "url": "https://github.com/leanprover-community/mathlib4"
863
+ },
864
+ "source_file": "Mathlib/RingTheory/GradedAlgebra/Basic.lean"
865
+ },
866
+ {
867
+ "error": "theorem has no selected tactic transitions",
868
+ "full_name": "DirectSum.decompose_mul_add_right",
869
+ "id": "DirectSum.decompose_mul_add_right",
870
+ "reason": "import_failure",
871
+ "selection": {
872
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
873
+ "end": [
874
+ 157,
875
+ 58
876
+ ],
877
+ "file_path": "Mathlib/RingTheory/GradedAlgebra/Basic.lean",
878
+ "full_name": "DirectSum.decompose_mul_add_right",
879
+ "start": [
880
+ 154,
881
+ 1
882
+ ],
883
+ "traced_tactics": [],
884
+ "url": "https://github.com/leanprover-community/mathlib4"
885
+ },
886
+ "source_file": "Mathlib/RingTheory/GradedAlgebra/Basic.lean"
887
+ },
888
+ {
889
+ "error": "theorem has no selected tactic transitions",
890
+ "full_name": "DirectSum.decompose_one",
891
+ "id": "DirectSum.decompose_one",
892
+ "reason": "import_failure",
893
+ "selection": {
894
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
895
+ "end": [
896
+ 81,
897
+ 33
898
+ ],
899
+ "file_path": "Mathlib/RingTheory/GradedAlgebra/Basic.lean",
900
+ "full_name": "DirectSum.decompose_one",
901
+ "start": [
902
+ 80,
903
+ 1
904
+ ],
905
+ "traced_tactics": [],
906
+ "url": "https://github.com/leanprover-community/mathlib4"
907
+ },
908
+ "source_file": "Mathlib/RingTheory/GradedAlgebra/Basic.lean"
909
+ },
910
+ {
911
+ "error": "theorem has no selected tactic transitions",
912
+ "full_name": "DirectSum.decompose_symm_algebraMap",
913
+ "id": "DirectSum.decompose_symm_algebraMap",
914
+ "reason": "import_failure",
915
+ "selection": {
916
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
917
+ "end": [
918
+ 222,
919
+ 40
920
+ ],
921
+ "file_path": "Mathlib/RingTheory/GradedAlgebra/Basic.lean",
922
+ "full_name": "DirectSum.decompose_symm_algebraMap",
923
+ "start": [
924
+ 219,
925
+ 1
926
+ ],
927
+ "traced_tactics": [],
928
+ "url": "https://github.com/leanprover-community/mathlib4"
929
+ },
930
+ "source_file": "Mathlib/RingTheory/GradedAlgebra/Basic.lean"
931
+ },
932
+ {
933
+ "error": "theorem has no selected tactic transitions",
934
+ "full_name": "DirectSum.decompose_symm_mul",
935
+ "id": "DirectSum.decompose_symm_mul",
936
+ "reason": "import_failure",
937
+ "selection": {
938
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
939
+ "end": [
940
+ 97,
941
+ 42
942
+ ],
943
+ "file_path": "Mathlib/RingTheory/GradedAlgebra/Basic.lean",
944
+ "full_name": "DirectSum.decompose_symm_mul",
945
+ "start": [
946
+ 95,
947
+ 1
948
+ ],
949
+ "traced_tactics": [],
950
+ "url": "https://github.com/leanprover-community/mathlib4"
951
+ },
952
+ "source_file": "Mathlib/RingTheory/GradedAlgebra/Basic.lean"
953
+ },
954
+ {
955
+ "error": "theorem has no selected tactic transitions",
956
+ "full_name": "DirectSum.decompose_symm_one",
957
+ "id": "DirectSum.decompose_symm_one",
958
+ "reason": "import_failure",
959
+ "selection": {
960
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
961
+ "end": [
962
+ 86,
963
+ 38
964
+ ],
965
+ "file_path": "Mathlib/RingTheory/GradedAlgebra/Basic.lean",
966
+ "full_name": "DirectSum.decompose_symm_one",
967
+ "start": [
968
+ 85,
969
+ 1
970
+ ],
971
+ "traced_tactics": [],
972
+ "url": "https://github.com/leanprover-community/mathlib4"
973
+ },
974
+ "source_file": "Mathlib/RingTheory/GradedAlgebra/Basic.lean"
975
+ },
976
+ {
977
+ "error": "theorem has no selected tactic transitions",
978
+ "full_name": "GradedAlgebra.mem_support_iff",
979
+ "id": "GradedAlgebra.mem_support_iff",
980
+ "reason": "import_failure",
981
+ "selection": {
982
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
983
+ "end": [
984
+ 246,
985
+ 64
986
+ ],
987
+ "file_path": "Mathlib/RingTheory/GradedAlgebra/Basic.lean",
988
+ "full_name": "GradedAlgebra.mem_support_iff",
989
+ "start": [
990
+ 244,
991
+ 1
992
+ ],
993
+ "traced_tactics": [],
994
+ "url": "https://github.com/leanprover-community/mathlib4"
995
+ },
996
+ "source_file": "Mathlib/RingTheory/GradedAlgebra/Basic.lean"
997
+ },
998
+ {
999
+ "error": "theorem has no selected tactic transitions",
1000
+ "full_name": "GradedAlgebra.proj_apply",
1001
+ "id": "GradedAlgebra.proj_apply",
1002
+ "reason": "import_failure",
1003
+ "selection": {
1004
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
1005
+ "end": [
1006
+ 236,
1007
+ 6
1008
+ ],
1009
+ "file_path": "Mathlib/RingTheory/GradedAlgebra/Basic.lean",
1010
+ "full_name": "GradedAlgebra.proj_apply",
1011
+ "start": [
1012
+ 234,
1013
+ 1
1014
+ ],
1015
+ "traced_tactics": [],
1016
+ "url": "https://github.com/leanprover-community/mathlib4"
1017
+ },
1018
+ "source_file": "Mathlib/RingTheory/GradedAlgebra/Basic.lean"
1019
+ },
1020
+ {
1021
+ "error": "theorem has no selected tactic transitions",
1022
+ "full_name": "GradedRing.coe_projZeroRingHom'_apply",
1023
+ "id": "GradedRing.coe_projZeroRingHom'_apply",
1024
+ "reason": "import_failure",
1025
+ "selection": {
1026
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
1027
+ "end": [
1028
+ 309,
1029
+ 82
1030
+ ],
1031
+ "file_path": "Mathlib/RingTheory/GradedAlgebra/Basic.lean",
1032
+ "full_name": "GradedRing.coe_projZeroRingHom'_apply",
1033
+ "start": [
1034
+ 308,
1035
+ 1
1036
+ ],
1037
+ "traced_tactics": [],
1038
+ "url": "https://github.com/leanprover-community/mathlib4"
1039
+ },
1040
+ "source_file": "Mathlib/RingTheory/GradedAlgebra/Basic.lean"
1041
+ },
1042
+ {
1043
+ "error": "theorem has no selected tactic transitions",
1044
+ "full_name": "GradedRing.projZeroRingHom'_surjective",
1045
+ "id": "GradedRing.projZeroRingHom'_surjective",
1046
+ "reason": "import_failure",
1047
+ "selection": {
1048
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
1049
+ "end": [
1050
+ 318,
1051
+ 77
1052
+ ],
1053
+ "file_path": "Mathlib/RingTheory/GradedAlgebra/Basic.lean",
1054
+ "full_name": "GradedRing.projZeroRingHom'_surjective",
1055
+ "start": [
1056
+ 315,
1057
+ 1
1058
+ ],
1059
+ "traced_tactics": [],
1060
+ "url": "https://github.com/leanprover-community/mathlib4"
1061
+ },
1062
+ "source_file": "Mathlib/RingTheory/GradedAlgebra/Basic.lean"
1063
+ },
1064
+ {
1065
+ "error": "theorem has no selected tactic transitions",
1066
+ "full_name": "GradedRing.proj_apply",
1067
+ "id": "GradedRing.proj_apply",
1068
+ "reason": "import_failure",
1069
+ "selection": {
1070
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
1071
+ "end": [
1072
+ 112,
1073
+ 6
1074
+ ],
1075
+ "file_path": "Mathlib/RingTheory/GradedAlgebra/Basic.lean",
1076
+ "full_name": "GradedRing.proj_apply",
1077
+ "start": [
1078
+ 110,
1079
+ 1
1080
+ ],
1081
+ "traced_tactics": [],
1082
+ "url": "https://github.com/leanprover-community/mathlib4"
1083
+ },
1084
+ "source_file": "Mathlib/RingTheory/GradedAlgebra/Basic.lean"
1085
+ }
1086
+ ],
1087
+ "input_proofs": 53,
1088
+ "input_units": 2,
1089
+ "proofs": 11,
1090
+ "published_proofs": 11,
1091
+ "published_transitions": 20,
1092
+ "replay_failures": [],
1093
+ "transitions": 20,
1094
+ "validation_failures": [],
1095
+ "validation_rejected_proofs": 0,
1096
+ "zero_transition_proofs": 0
1097
+ },
1098
+ "shards": [
1099
+ {
1100
+ "path": "data/train/mathlib-001674-0000-dd5ff6151b6c87de.parquet",
1101
+ "sha256": "dd5ff6151b6c87de6a89db45348e2b6d44b3b7a45caa0f28b7e16a7c5d168d65",
1102
+ "bytes": 113798,
1103
+ "rows": 18,
1104
+ "revision": "d60e29d6cee3c6b2c6967d9f9c90939917c38808"
1105
+ },
1106
+ {
1107
+ "path": "data/internal_test/mathlib-001674-0000-0bdf471a2593db27.parquet",
1108
+ "sha256": "0bdf471a2593db27c7b7cea095f342bdc9b305c884da985f31880960fdd05a54",
1109
+ "bytes": 73730,
1110
+ "rows": 2,
1111
+ "revision": "d60e29d6cee3c6b2c6967d9f9c90939917c38808"
1112
+ }
1113
+ ],
1114
+ "proof_ids": [
1115
+ "mathlib:DirectSum.coe_decompose_mul_add_of_left_mem",
1116
+ "mathlib:DirectSum.coe_decompose_mul_add_of_right_mem",
1117
+ "mathlib:DirectSum.coe_decompose_mul_of_left_mem",
1118
+ "mathlib:DirectSum.coe_decompose_mul_of_left_mem_of_le",
1119
+ "mathlib:DirectSum.coe_decompose_mul_of_left_mem_of_not_le",
1120
+ "mathlib:DirectSum.coe_decompose_mul_of_right_mem",
1121
+ "mathlib:DirectSum.coe_decompose_mul_of_right_mem_of_le",
1122
+ "mathlib:DirectSum.coe_decompose_mul_of_right_mem_of_not_le",
1123
+ "mathlib:GradedAlgebra.proj_recompose",
1124
+ "mathlib:GradedRing.projZeroRingHom'_apply_coe",
1125
+ "mathlib:GradedRing.proj_recompose"
1126
+ ],
1127
+ "proof_keys": [
1128
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/GradedAlgebra/Basic.lean\",null,null,\"DirectSum.coe_decompose_mul_add_of_left_mem\"]",
1129
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/GradedAlgebra/Basic.lean\",null,null,\"DirectSum.coe_decompose_mul_add_of_right_mem\"]",
1130
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/GradedAlgebra/Basic.lean\",null,null,\"DirectSum.coe_decompose_mul_of_left_mem\"]",
1131
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/GradedAlgebra/Basic.lean\",null,null,\"DirectSum.coe_decompose_mul_of_left_mem_of_le\"]",
1132
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/GradedAlgebra/Basic.lean\",null,null,\"DirectSum.coe_decompose_mul_of_left_mem_of_not_le\"]",
1133
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/GradedAlgebra/Basic.lean\",null,null,\"DirectSum.coe_decompose_mul_of_right_mem\"]",
1134
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/GradedAlgebra/Basic.lean\",null,null,\"DirectSum.coe_decompose_mul_of_right_mem_of_le\"]",
1135
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/GradedAlgebra/Basic.lean\",null,null,\"DirectSum.coe_decompose_mul_of_right_mem_of_not_le\"]",
1136
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/GradedAlgebra/Basic.lean\",null,null,\"GradedAlgebra.proj_recompose\"]",
1137
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/GradedAlgebra/Basic.lean\",null,null,\"GradedRing.projZeroRingHom'_apply_coe\"]",
1138
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/GradedAlgebra/Basic.lean\",null,null,\"GradedRing.proj_recompose\"]"
1139
+ ]
1140
+ }
manifests/batches/mathlib/001675.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001676.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001677.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001678.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001679.json ADDED
@@ -0,0 +1,506 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "format": "leangpt-parquet-v2",
3
+ "batch": "mathlib/001679",
4
+ "batch_fingerprint": "5c362919bd1a6331794e2a20c058c88f17f94c4e6927a098b43a58586db59448",
5
+ "evidence": {
6
+ "batch_fingerprint": "5c362919bd1a6331794e2a20c058c88f17f94c4e6927a098b43a58586db59448",
7
+ "batch_outcome": "all_inputs_failed_with_evidence",
8
+ "contamination_matches": [],
9
+ "failures": [
10
+ {
11
+ "error": "no internal trace for tactic 'intro H'",
12
+ "full_name": "HenselianLocalRing.TFAE",
13
+ "id": "HenselianLocalRing.TFAE",
14
+ "reason": "import_failure",
15
+ "selection": {
16
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
17
+ "end": [
18
+ 155,
19
+ 14
20
+ ],
21
+ "file_path": "Mathlib/RingTheory/Henselian.lean",
22
+ "full_name": "HenselianLocalRing.TFAE",
23
+ "start": [
24
+ 121,
25
+ 1
26
+ ],
27
+ "traced_tactics": [
28
+ {
29
+ "annotated_tactic": [
30
+ "\"tfae_have 3 \\u2192 2\"",
31
+ "[]"
32
+ ],
33
+ "state_after": "case tfae_3_to_2\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\n\u22a2 (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\n\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\n\u22a2 [HenselianLocalRing R,\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080,\n \u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080].TFAE",
34
+ "state_before": "R : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\n\u22a2 [HenselianLocalRing R,\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080,\n \u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080].TFAE",
35
+ "tactic": "tfae_have 3 \u2192 2"
36
+ },
37
+ {
38
+ "annotated_tactic": [
39
+ "\"tfae_have 2 \\u2192 1\"",
40
+ "[]"
41
+ ],
42
+ "state_after": "case tfae_2_to_1\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\n\u22a2 (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\n\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\n\u22a2 [HenselianLocalRing R,\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080,\n \u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080].TFAE",
43
+ "state_before": "R : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\n\u22a2 [HenselianLocalRing R,\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080,\n \u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080].TFAE",
44
+ "tactic": "tfae_have 2 \u2192 1"
45
+ },
46
+ {
47
+ "annotated_tactic": [
48
+ "\"tfae_have 1 \\u2192 3\"",
49
+ "[]"
50
+ ],
51
+ "state_after": "case tfae_1_to_3\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\n\u22a2 HenselianLocalRing R \u2192\n \u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080\n\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\ntfae_1_to_3 :\n HenselianLocalRing R \u2192\n \u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080\n\u22a2 [HenselianLocalRing R,\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080,\n \u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080].TFAE",
52
+ "state_before": "R : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\n\u22a2 [HenselianLocalRing R,\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080,\n \u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080].TFAE",
53
+ "tactic": "tfae_have 1 \u2192 3"
54
+ },
55
+ {
56
+ "annotated_tactic": [
57
+ "\"tfae_finish\"",
58
+ "[]"
59
+ ],
60
+ "state_after": "no goals",
61
+ "state_before": "R : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\ntfae_1_to_3 :\n HenselianLocalRing R \u2192\n \u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080\n\u22a2 [HenselianLocalRing R,\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080,\n \u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080].TFAE",
62
+ "tactic": "tfae_finish"
63
+ },
64
+ {
65
+ "annotated_tactic": [
66
+ "\"intro H\"",
67
+ "[]"
68
+ ],
69
+ "state_after": "case tfae_3_to_2\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\nH :\n \u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]), f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080\n\u22a2 \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080",
70
+ "state_before": "case tfae_3_to_2\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\n\u22a2 (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080",
71
+ "tactic": "intro H"
72
+ },
73
+ {
74
+ "annotated_tactic": [
75
+ "\"exact H (<a>residue<\\/a> R) <a>Ideal.Quotient.mk_surjective<\\/a>\"",
76
+ "[{\"full_name\":\"LocalRing.residue\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/LocalRing.lean\",\"def_pos\":[368,5],\"def_end_pos\":[368,12]},{\"full_name\":\"Ideal.Quotient.mk_surjective\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[159,9],\"def_end_pos\":[159,22]}]"
77
+ ],
78
+ "state_after": "no goals",
79
+ "state_before": "case tfae_3_to_2\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\nH :\n \u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]), f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080\n\u22a2 \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080",
80
+ "tactic": "exact H (residue R) Ideal.Quotient.mk_surjective"
81
+ },
82
+ {
83
+ "annotated_tactic": [
84
+ "\"intro H\"",
85
+ "[]"
86
+ ],
87
+ "state_after": "case tfae_2_to_1\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nH :\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\n\u22a2 HenselianLocalRing R",
88
+ "state_before": "case tfae_2_to_1\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\n\u22a2 (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R",
89
+ "tactic": "intro H"
90
+ },
91
+ {
92
+ "annotated_tactic": [
93
+ "\"constructor\"",
94
+ "[]"
95
+ ],
96
+ "state_after": "case tfae_2_to_1.is_henselian\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nH :\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\n\u22a2 \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : R),\n Polynomial.eval a\u2080 f \u2208 maximalIdeal R \u2192\n IsUnit (Polynomial.eval a\u2080 (derivative f)) \u2192 \u2203 a, f.IsRoot a \u2227 a - a\u2080 \u2208 maximalIdeal R",
97
+ "state_before": "case tfae_2_to_1\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nH :\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\n\u22a2 HenselianLocalRing R",
98
+ "tactic": "constructor"
99
+ },
100
+ {
101
+ "annotated_tactic": [
102
+ "\"intro f hf a\\u2080 h\\u2081 h\\u2082\"",
103
+ "[]"
104
+ ],
105
+ "state_after": "case tfae_2_to_1.is_henselian\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nH :\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2081 : Polynomial.eval a\u2080 f \u2208 maximalIdeal R\nh\u2082 : IsUnit (Polynomial.eval a\u2080 (derivative f))\n\u22a2 \u2203 a, f.IsRoot a \u2227 a - a\u2080 \u2208 maximalIdeal R",
106
+ "state_before": "case tfae_2_to_1.is_henselian\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nH :\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\n\u22a2 \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : R),\n Polynomial.eval a\u2080 f \u2208 maximalIdeal R \u2192\n IsUnit (Polynomial.eval a\u2080 (derivative f)) \u2192 \u2203 a, f.IsRoot a \u2227 a - a\u2080 \u2208 maximalIdeal R",
107
+ "tactic": "intro f hf a\u2080 h\u2081 h\u2082"
108
+ },
109
+ {
110
+ "annotated_tactic": [
111
+ "\"specialize H f hf (<a>residue<\\/a> R a\\u2080)\"",
112
+ "[{\"full_name\":\"LocalRing.residue\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/LocalRing.lean\",\"def_pos\":[368,5],\"def_end_pos\":[368,12]}]"
113
+ ],
114
+ "state_after": "case tfae_2_to_1.is_henselian\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2081 : Polynomial.eval a\u2080 f \u2208 maximalIdeal R\nh\u2082 : IsUnit (Polynomial.eval a\u2080 (derivative f))\nH :\n (aeval ((residue R) a\u2080)) f = 0 \u2192\n (aeval ((residue R) a\u2080)) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = (residue R) a\u2080\n\u22a2 \u2203 a, f.IsRoot a \u2227 a - a\u2080 \u2208 maximalIdeal R",
115
+ "state_before": "case tfae_2_to_1.is_henselian\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nH :\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2081 : Polynomial.eval a\u2080 f \u2208 maximalIdeal R\nh\u2082 : IsUnit (Polynomial.eval a\u2080 (derivative f))\n\u22a2 \u2203 a, f.IsRoot a \u2227 a - a\u2080 \u2208 maximalIdeal R",
116
+ "tactic": "specialize H f hf (residue R a\u2080)"
117
+ },
118
+ {
119
+ "annotated_tactic": [
120
+ "\"have aux := <a>flip<\\/a> mem_nonunits_iff.mp h\\u2082\"",
121
+ "[{\"full_name\":\"flip\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Core.lean\",\"def_pos\":[30,15],\"def_end_pos\":[30,19]}]"
122
+ ],
123
+ "state_after": "case tfae_2_to_1.is_henselian\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2081 : Polynomial.eval a\u2080 f \u2208 maximalIdeal R\nh\u2082 : IsUnit (Polynomial.eval a\u2080 (derivative f))\nH :\n (aeval ((residue R) a\u2080)) f = 0 \u2192\n (aeval ((residue R) a\u2080)) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = (residue R) a\u2080\naux : Polynomial.eval a\u2080 (derivative f) \u2208 nonunits R \u2192 False\n\u22a2 \u2203 a, f.IsRoot a \u2227 a - a\u2080 \u2208 maximalIdeal R",
124
+ "state_before": "case tfae_2_to_1.is_henselian\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2081 : Polynomial.eval a\u2080 f \u2208 maximalIdeal R\nh\u2082 : IsUnit (Polynomial.eval a\u2080 (derivative f))\nH :\n (aeval ((residue R) a\u2080)) f = 0 \u2192\n (aeval ((residue R) a\u2080)) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = (residue R) a\u2080\n\u22a2 \u2203 a, f.IsRoot a \u2227 a - a\u2080 \u2208 maximalIdeal R",
125
+ "tactic": "have aux := flip mem_nonunits_iff.mp h\u2082"
126
+ },
127
+ {
128
+ "annotated_tactic": [
129
+ "\"simp only [<a>aeval_def<\\/a>, <a>ResidueField.algebraMap_eq<\\/a>, <a>eval\\u2082_at_apply<\\/a>, \\u2190\\n <a>Ideal.Quotient.eq_zero_iff_mem<\\/a>, \\u2190 <a>LocalRing.mem_maximalIdeal<\\/a>] at H h\\u2081 aux\"",
130
+ "[{\"full_name\":\"Polynomial.aeval_def\",\"def_path\":\"Mathlib\\/Algebra\\/Polynomial\\/AlgebraMap.lean\",\"def_pos\":[199,9],\"def_end_pos\":[199,18]},{\"full_name\":\"LocalRing.ResidueField.algebraMap_eq\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/LocalRing.lean\",\"def_pos\":[376,9],\"def_end_pos\":[376,35]},{\"full_name\":\"Polynomial.eval\\u2082_at_apply\",\"def_path\":\"Mathlib\\/Algebra\\/Polynomial\\/Eval.lean\",\"def_pos\":[330,9],\"def_end_pos\":[330,23]},{\"full_name\":\"Ideal.Quotient.eq_zero_iff_mem\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[125,9],\"def_end_pos\":[125,24]},{\"full_name\":\"LocalRing.mem_maximalIdeal\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/LocalRing.lean\",\"def_pos\":[142,9],\"def_end_pos\":[142,25]}]"
131
+ ],
132
+ "state_after": "case tfae_2_to_1.is_henselian\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2082 : IsUnit (Polynomial.eval a\u2080 (derivative f))\nH :\n (residue R) (Polynomial.eval a\u2080 f) = 0 \u2192\n (residue R) (Polynomial.eval a\u2080 (derivative f)) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = (residue R) a\u2080\nh\u2081 : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 f) = 0\naux : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 (derivative f)) = 0 \u2192 False\n\u22a2 \u2203 a, f.IsRoot a \u2227 a - a\u2080 \u2208 maximalIdeal R",
133
+ "state_before": "case tfae_2_to_1.is_henselian\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2081 : Polynomial.eval a\u2080 f \u2208 maximalIdeal R\nh\u2082 : IsUnit (Polynomial.eval a\u2080 (derivative f))\nH :\n (aeval ((residue R) a\u2080)) f = 0 \u2192\n (aeval ((residue R) a\u2080)) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = (residue R) a\u2080\naux : Polynomial.eval a\u2080 (derivative f) \u2208 nonunits R \u2192 False\n\u22a2 \u2203 a, f.IsRoot a \u2227 a - a\u2080 \u2208 maximalIdeal R",
134
+ "tactic": "simp only [aeval_def, ResidueField.algebraMap_eq, eval\u2082_at_apply, \u2190\n Ideal.Quotient.eq_zero_iff_mem, \u2190 LocalRing.mem_maximalIdeal] at H h\u2081 aux"
135
+ },
136
+ {
137
+ "annotated_tactic": [
138
+ "\"obtain \\u27e8a, ha\\u2081, ha\\u2082\\u27e9 := H h\\u2081 aux\"",
139
+ "[]"
140
+ ],
141
+ "state_after": "case tfae_2_to_1.is_henselian.intro.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2082 : IsUnit (Polynomial.eval a\u2080 (derivative f))\nH :\n (residue R) (Polynomial.eval a\u2080 f) = 0 \u2192\n (residue R) (Polynomial.eval a\u2080 (derivative f)) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = (residue R) a\u2080\nh\u2081 : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 f) = 0\naux : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 (derivative f)) = 0 \u2192 False\na : R\nha\u2081 : f.IsRoot a\nha\u2082 : (residue R) a = (residue R) a\u2080\n\u22a2 \u2203 a, f.IsRoot a \u2227 a - a\u2080 \u2208 maximalIdeal R",
142
+ "state_before": "case tfae_2_to_1.is_henselian\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2082 : IsUnit (Polynomial.eval a\u2080 (derivative f))\nH :\n (residue R) (Polynomial.eval a\u2080 f) = 0 \u2192\n (residue R) (Polynomial.eval a\u2080 (derivative f)) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = (residue R) a\u2080\nh\u2081 : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 f) = 0\naux : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 (derivative f)) = 0 \u2192 False\n\u22a2 \u2203 a, f.IsRoot a \u2227 a - a\u2080 \u2208 maximalIdeal R",
143
+ "tactic": "obtain \u27e8a, ha\u2081, ha\u2082\u27e9 := H h\u2081 aux"
144
+ },
145
+ {
146
+ "annotated_tactic": [
147
+ "\"refine \\u27e8a, ha\\u2081, ?_\\u27e9\"",
148
+ "[]"
149
+ ],
150
+ "state_after": "case tfae_2_to_1.is_henselian.intro.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2082 : IsUnit (Polynomial.eval a\u2080 (derivative f))\nH :\n (residue R) (Polynomial.eval a\u2080 f) = 0 \u2192\n (residue R) (Polynomial.eval a\u2080 (derivative f)) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = (residue R) a\u2080\nh\u2081 : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 f) = 0\naux : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 (derivative f)) = 0 \u2192 False\na : R\nha\u2081 : f.IsRoot a\nha\u2082 : (residue R) a = (residue R) a\u2080\n\u22a2 a - a\u2080 \u2208 maximalIdeal R",
151
+ "state_before": "case tfae_2_to_1.is_henselian.intro.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2082 : IsUnit (Polynomial.eval a\u2080 (derivative f))\nH :\n (residue R) (Polynomial.eval a\u2080 f) = 0 \u2192\n (residue R) (Polynomial.eval a\u2080 (derivative f)) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = (residue R) a\u2080\nh\u2081 : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 f) = 0\naux : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 (derivative f)) = 0 \u2192 False\na : R\nha\u2081 : f.IsRoot a\nha\u2082 : (residue R) a = (residue R) a\u2080\n\u22a2 \u2203 a, f.IsRoot a \u2227 a - a\u2080 \u2208 maximalIdeal R",
152
+ "tactic": "refine \u27e8a, ha\u2081, ?_\u27e9"
153
+ },
154
+ {
155
+ "annotated_tactic": [
156
+ "\"rw [\\u2190 <a>Ideal.Quotient.eq_zero_iff_mem<\\/a>]\"",
157
+ "[{\"full_name\":\"Ideal.Quotient.eq_zero_iff_mem\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[125,9],\"def_end_pos\":[125,24]}]"
158
+ ],
159
+ "state_after": "case tfae_2_to_1.is_henselian.intro.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2082 : IsUnit (Polynomial.eval a\u2080 (derivative f))\nH :\n (residue R) (Polynomial.eval a\u2080 f) = 0 \u2192\n (residue R) (Polynomial.eval a\u2080 (derivative f)) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = (residue R) a\u2080\nh\u2081 : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 f) = 0\naux : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 (derivative f)) = 0 \u2192 False\na : R\nha\u2081 : f.IsRoot a\nha\u2082 : (residue R) a = (residue R) a\u2080\n\u22a2 (Ideal.Quotient.mk (maximalIdeal R)) (a - a\u2080) = 0",
160
+ "state_before": "case tfae_2_to_1.is_henselian.intro.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2082 : IsUnit (Polynomial.eval a\u2080 (derivative f))\nH :\n (residue R) (Polynomial.eval a\u2080 f) = 0 \u2192\n (residue R) (Polynomial.eval a\u2080 (derivative f)) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = (residue R) a\u2080\nh\u2081 : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 f) = 0\naux : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 (derivative f)) = 0 \u2192 False\na : R\nha\u2081 : f.IsRoot a\nha\u2082 : (residue R) a = (residue R) a\u2080\n\u22a2 a - a\u2080 \u2208 maximalIdeal R",
161
+ "tactic": "rw [\u2190 Ideal.Quotient.eq_zero_iff_mem]"
162
+ },
163
+ {
164
+ "annotated_tactic": [
165
+ "\"rwa [\\u2190 <a>sub_eq_zero<\\/a>, \\u2190 <a>RingHom.map_sub<\\/a>] at ha\\u2082\"",
166
+ "[{\"full_name\":\"sub_eq_zero\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Basic.lean\",\"def_pos\":[1070,3],\"def_end_pos\":[1070,14]},{\"full_name\":\"RingHom.map_sub\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Hom\\/Defs.lean\",\"def_pos\":[612,19],\"def_end_pos\":[612,26]}]"
167
+ ],
168
+ "state_after": "no goals",
169
+ "state_before": "case tfae_2_to_1.is_henselian.intro.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2082 : IsUnit (Polynomial.eval a\u2080 (derivative f))\nH :\n (residue R) (Polynomial.eval a\u2080 f) = 0 \u2192\n (residue R) (Polynomial.eval a\u2080 (derivative f)) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = (residue R) a\u2080\nh\u2081 : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 f) = 0\naux : (Ideal.Quotient.mk (maximalIdeal R)) (Polynomial.eval a\u2080 (derivative f)) = 0 \u2192 False\na : R\nha\u2081 : f.IsRoot a\nha\u2082 : (residue R) a = (residue R) a\u2080\n\u22a2 (Ideal.Quotient.mk (maximalIdeal R)) (a - a\u2080) = 0",
170
+ "tactic": "rwa [\u2190 sub_eq_zero, \u2190 RingHom.map_sub] at ha\u2082"
171
+ },
172
+ {
173
+ "annotated_tactic": [
174
+ "\"intro hR K _K \\u03c6 h\\u03c6 f hf a\\u2080 h\\u2081 h\\u2082\"",
175
+ "[]"
176
+ ],
177
+ "state_after": "case tfae_1_to_3\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\nhR : HenselianLocalRing R\nK : Type u\n_K : Field K\n\u03c6 : R \u2192+* K\nh\u03c6 : Surjective \u21d1\u03c6\nf : R[X]\nhf : f.Monic\na\u2080 : K\nh\u2081 : eval\u2082 \u03c6 a\u2080 f = 0\nh\u2082 : eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0\n\u22a2 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080",
178
+ "state_before": "case tfae_1_to_3\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\n\u22a2 HenselianLocalRing R \u2192\n \u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080",
179
+ "tactic": "intro hR K _K \u03c6 h\u03c6 f hf a\u2080 h\u2081 h\u2082"
180
+ },
181
+ {
182
+ "annotated_tactic": [
183
+ "\"obtain \\u27e8a\\u2080, rfl\\u27e9 := h\\u03c6 a\\u2080\"",
184
+ "[]"
185
+ ],
186
+ "state_after": "case tfae_1_to_3.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\nhR : HenselianLocalRing R\nK : Type u\n_K : Field K\n\u03c6 : R \u2192+* K\nh\u03c6 : Surjective \u21d1\u03c6\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2081 : eval\u2082 \u03c6 (\u03c6 a\u2080) f = 0\nh\u2082 : eval\u2082 \u03c6 (\u03c6 a\u2080) (derivative f) \u2260 0\n\u22a2 \u2203 a, f.IsRoot a \u2227 \u03c6 a = \u03c6 a\u2080",
187
+ "state_before": "case tfae_1_to_3\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\nhR : HenselianLocalRing R\nK : Type u\n_K : Field K\n\u03c6 : R \u2192+* K\nh\u03c6 : Surjective \u21d1\u03c6\nf : R[X]\nhf : f.Monic\na\u2080 : K\nh\u2081 : eval\u2082 \u03c6 a\u2080 f = 0\nh\u2082 : eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0\n\u22a2 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080",
188
+ "tactic": "obtain \u27e8a\u2080, rfl\u27e9 := h\u03c6 a\u2080"
189
+ },
190
+ {
191
+ "annotated_tactic": [
192
+ "\"have H := <a>HenselianLocalRing.is_henselian<\\/a> f hf a\\u2080\"",
193
+ "[{\"full_name\":\"HenselianLocalRing.is_henselian\",\"def_path\":\"Mathlib\\/RingTheory\\/Henselian.lean\",\"def_pos\":[109,3],\"def_end_pos\":[109,15]}]"
194
+ ],
195
+ "state_after": "case tfae_1_to_3.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\nhR : HenselianLocalRing R\nK : Type u\n_K : Field K\n\u03c6 : R \u2192+* K\nh\u03c6 : Surjective \u21d1\u03c6\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2081 : eval\u2082 \u03c6 (\u03c6 a\u2080) f = 0\nh\u2082 : eval\u2082 \u03c6 (\u03c6 a\u2080) (derivative f) \u2260 0\nH :\n Polynomial.eval a\u2080 f \u2208 maximalIdeal R \u2192\n IsUnit (Polynomial.eval a\u2080 (derivative f)) \u2192 \u2203 a, f.IsRoot a \u2227 a - a\u2080 \u2208 maximalIdeal R\n\u22a2 \u2203 a, f.IsRoot a \u2227 \u03c6 a = \u03c6 a\u2080",
196
+ "state_before": "case tfae_1_to_3.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\nhR : HenselianLocalRing R\nK : Type u\n_K : Field K\n\u03c6 : R \u2192+* K\nh\u03c6 : Surjective \u21d1\u03c6\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2081 : eval\u2082 \u03c6 (\u03c6 a\u2080) f = 0\nh\u2082 : eval\u2082 \u03c6 (\u03c6 a\u2080) (derivative f) \u2260 0\n\u22a2 \u2203 a, f.IsRoot a \u2227 \u03c6 a = \u03c6 a\u2080",
197
+ "tactic": "have H := HenselianLocalRing.is_henselian f hf a\u2080"
198
+ },
199
+ {
200
+ "annotated_tactic": [
201
+ "\"simp only [\\u2190 <a>ker_eq_maximalIdeal<\\/a> \\u03c6 h\\u03c6, <a>eval\\u2082_at_apply<\\/a>, <a>RingHom.mem_ker<\\/a> \\u03c6] at H h\\u2081 h\\u2082\"",
202
+ "[{\"full_name\":\"LocalRing.ker_eq_maximalIdeal\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/LocalRing.lean\",\"def_pos\":[502,9],\"def_end_pos\":[502,28]},{\"full_name\":\"Polynomial.eval\\u2082_at_apply\",\"def_path\":\"Mathlib\\/Algebra\\/Polynomial\\/Eval.lean\",\"def_pos\":[330,9],\"def_end_pos\":[330,23]},{\"full_name\":\"RingHom.mem_ker\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Maps.lean\",\"def_pos\":[605,9],\"def_end_pos\":[605,16]}]"
203
+ ],
204
+ "state_after": "case tfae_1_to_3.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\nhR : HenselianLocalRing R\nK : Type u\n_K : Field K\n\u03c6 : R \u2192+* K\nh\u03c6 : Surjective \u21d1\u03c6\nf : R[X]\nhf : f.Monic\na\u2080 : R\nH : \u03c6 (Polynomial.eval a\u2080 f) = 0 \u2192 IsUnit (Polynomial.eval a\u2080 (derivative f)) \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 (a - a\u2080) = 0\nh\u2081 : \u03c6 (Polynomial.eval a\u2080 f) = 0\nh\u2082 : \u03c6 (Polynomial.eval a\u2080 (derivative f)) \u2260 0\n\u22a2 \u2203 a, f.IsRoot a \u2227 \u03c6 a = \u03c6 a\u2080",
205
+ "state_before": "case tfae_1_to_3.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\nhR : HenselianLocalRing R\nK : Type u\n_K : Field K\n\u03c6 : R \u2192+* K\nh\u03c6 : Surjective \u21d1\u03c6\nf : R[X]\nhf : f.Monic\na\u2080 : R\nh\u2081 : eval\u2082 \u03c6 (\u03c6 a\u2080) f = 0\nh\u2082 : eval\u2082 \u03c6 (\u03c6 a\u2080) (derivative f) \u2260 0\nH :\n Polynomial.eval a\u2080 f \u2208 maximalIdeal R \u2192\n IsUnit (Polynomial.eval a\u2080 (derivative f)) \u2192 \u2203 a, f.IsRoot a \u2227 a - a\u2080 \u2208 maximalIdeal R\n\u22a2 \u2203 a, f.IsRoot a \u2227 \u03c6 a = \u03c6 a\u2080",
206
+ "tactic": "simp only [\u2190 ker_eq_maximalIdeal \u03c6 h\u03c6, eval\u2082_at_apply, RingHom.mem_ker \u03c6] at H h\u2081 h\u2082"
207
+ },
208
+ {
209
+ "annotated_tactic": [
210
+ "\"obtain \\u27e8a, ha\\u2081, ha\\u2082\\u27e9 := H h\\u2081 (by\\n contrapose! h\\u2082\\n rwa [\\u2190 <a>mem_nonunits_iff<\\/a>, \\u2190 <a>LocalRing.mem_maximalIdeal<\\/a>, \\u2190 <a>LocalRing.ker_eq_maximalIdeal<\\/a> \\u03c6 h\\u03c6,\\n <a>RingHom.mem_ker<\\/a>] at h\\u2082)\"",
211
+ "[{\"full_name\":\"mem_nonunits_iff\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Basic.lean\",\"def_pos\":[897,9],\"def_end_pos\":[897,25]},{\"full_name\":\"LocalRing.mem_maximalIdeal\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/LocalRing.lean\",\"def_pos\":[142,9],\"def_end_pos\":[142,25]},{\"full_name\":\"LocalRing.ker_eq_maximalIdeal\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/LocalRing.lean\",\"def_pos\":[502,9],\"def_end_pos\":[502,28]},{\"full_name\":\"RingHom.mem_ker\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Maps.lean\",\"def_pos\":[605,9],\"def_end_pos\":[605,16]}]"
212
+ ],
213
+ "state_after": "case tfae_1_to_3.intro.intro.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\nhR : HenselianLocalRing R\nK : Type u\n_K : Field K\n\u03c6 : R \u2192+* K\nh\u03c6 : Surjective \u21d1\u03c6\nf : R[X]\nhf : f.Monic\na\u2080 : R\nH : \u03c6 (Polynomial.eval a\u2080 f) = 0 \u2192 IsUnit (Polynomial.eval a\u2080 (derivative f)) \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 (a - a\u2080) = 0\nh\u2081 : \u03c6 (Polynomial.eval a\u2080 f) = 0\nh\u2082 : \u03c6 (Polynomial.eval a\u2080 (derivative f)) \u2260 0\na : R\nha\u2081 : f.IsRoot a\nha\u2082 : \u03c6 (a - a\u2080) = 0\n\u22a2 \u2203 a, f.IsRoot a \u2227 \u03c6 a = \u03c6 a\u2080",
214
+ "state_before": "case tfae_1_to_3.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\nhR : HenselianLocalRing R\nK : Type u\n_K : Field K\n\u03c6 : R \u2192+* K\nh\u03c6 : Surjective \u21d1\u03c6\nf : R[X]\nhf : f.Monic\na\u2080 : R\nH : \u03c6 (Polynomial.eval a\u2080 f) = 0 \u2192 IsUnit (Polynomial.eval a\u2080 (derivative f)) \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 (a - a\u2080) = 0\nh\u2081 : \u03c6 (Polynomial.eval a\u2080 f) = 0\nh\u2082 : \u03c6 (Polynomial.eval a\u2080 (derivative f)) \u2260 0\n\u22a2 \u2203 a, f.IsRoot a \u2227 \u03c6 a = \u03c6 a\u2080",
215
+ "tactic": "obtain \u27e8a, ha\u2081, ha\u2082\u27e9 := H h\u2081 (by\n contrapose! h\u2082\n rwa [\u2190 mem_nonunits_iff, \u2190 LocalRing.mem_maximalIdeal, \u2190 LocalRing.ker_eq_maximalIdeal \u03c6 h\u03c6,\n RingHom.mem_ker] at h\u2082)"
216
+ },
217
+ {
218
+ "annotated_tactic": [
219
+ "\"refine \\u27e8a, ha\\u2081, ?_\\u27e9\"",
220
+ "[]"
221
+ ],
222
+ "state_after": "case tfae_1_to_3.intro.intro.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\nhR : HenselianLocalRing R\nK : Type u\n_K : Field K\n\u03c6 : R \u2192+* K\nh\u03c6 : Surjective \u21d1\u03c6\nf : R[X]\nhf : f.Monic\na\u2080 : R\nH : \u03c6 (Polynomial.eval a\u2080 f) = 0 \u2192 IsUnit (Polynomial.eval a\u2080 (derivative f)) \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 (a - a\u2080) = 0\nh\u2081 : \u03c6 (Polynomial.eval a\u2080 f) = 0\nh\u2082 : \u03c6 (Polynomial.eval a\u2080 (derivative f)) \u2260 0\na : R\nha\u2081 : f.IsRoot a\nha\u2082 : \u03c6 (a - a\u2080) = 0\n\u22a2 \u03c6 a = \u03c6 a\u2080",
223
+ "state_before": "case tfae_1_to_3.intro.intro.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\nhR : HenselianLocalRing R\nK : Type u\n_K : Field K\n\u03c6 : R \u2192+* K\nh\u03c6 : Surjective \u21d1\u03c6\nf : R[X]\nhf : f.Monic\na\u2080 : R\nH : \u03c6 (Polynomial.eval a\u2080 f) = 0 \u2192 IsUnit (Polynomial.eval a\u2080 (derivative f)) \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 (a - a\u2080) = 0\nh\u2081 : \u03c6 (Polynomial.eval a\u2080 f) = 0\nh\u2082 : \u03c6 (Polynomial.eval a\u2080 (derivative f)) \u2260 0\na : R\nha\u2081 : f.IsRoot a\nha\u2082 : \u03c6 (a - a\u2080) = 0\n\u22a2 \u2203 a, f.IsRoot a \u2227 \u03c6 a = \u03c6 a\u2080",
224
+ "tactic": "refine \u27e8a, ha\u2081, ?_\u27e9"
225
+ },
226
+ {
227
+ "annotated_tactic": [
228
+ "\"rwa [\\u03c6.map_sub, <a>sub_eq_zero<\\/a>] at ha\\u2082\"",
229
+ "[{\"full_name\":\"sub_eq_zero\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Basic.lean\",\"def_pos\":[1070,3],\"def_end_pos\":[1070,14]}]"
230
+ ],
231
+ "state_after": "no goals",
232
+ "state_before": "case tfae_1_to_3.intro.intro.intro\nR : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\nhR : HenselianLocalRing R\nK : Type u\n_K : Field K\n\u03c6 : R \u2192+* K\nh\u03c6 : Surjective \u21d1\u03c6\nf : R[X]\nhf : f.Monic\na\u2080 : R\nH : \u03c6 (Polynomial.eval a\u2080 f) = 0 \u2192 IsUnit (Polynomial.eval a\u2080 (derivative f)) \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 (a - a\u2080) = 0\nh\u2081 : \u03c6 (Polynomial.eval a\u2080 f) = 0\nh\u2082 : \u03c6 (Polynomial.eval a\u2080 (derivative f)) \u2260 0\na : R\nha\u2081 : f.IsRoot a\nha\u2082 : \u03c6 (a - a\u2080) = 0\n\u22a2 \u03c6 a = \u03c6 a\u2080",
233
+ "tactic": "rwa [\u03c6.map_sub, sub_eq_zero] at ha\u2082"
234
+ },
235
+ {
236
+ "annotated_tactic": [
237
+ "\"contrapose! h\\u2082\"",
238
+ "[]"
239
+ ],
240
+ "state_after": "R : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\nhR : HenselianLocalRing R\nK : Type u\n_K : Field K\n\u03c6 : R \u2192+* K\nh\u03c6 : Surjective \u21d1\u03c6\nf : R[X]\nhf : f.Monic\na\u2080 : R\nH : \u03c6 (Polynomial.eval a\u2080 f) = 0 \u2192 IsUnit (Polynomial.eval a\u2080 (derivative f)) \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 (a - a\u2080) = 0\nh\u2081 : \u03c6 (Polynomial.eval a\u2080 f) = 0\nh\u2082 : \u00acIsUnit (Polynomial.eval a\u2080 (derivative f))\n\u22a2 \u03c6 (Polynomial.eval a\u2080 (derivative f)) = 0",
241
+ "state_before": "R : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\nhR : HenselianLocalRing R\nK : Type u\n_K : Field K\n\u03c6 : R \u2192+* K\nh\u03c6 : Surjective \u21d1\u03c6\nf : R[X]\nhf : f.Monic\na\u2080 : R\nH : \u03c6 (Polynomial.eval a\u2080 f) = 0 \u2192 IsUnit (Polynomial.eval a\u2080 (derivative f)) \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 (a - a\u2080) = 0\nh\u2081 : \u03c6 (Polynomial.eval a\u2080 f) = 0\nh\u2082 : \u03c6 (Polynomial.eval a\u2080 (derivative f)) \u2260 0\n\u22a2 IsUnit (Polynomial.eval a\u2080 (derivative f))",
242
+ "tactic": "contrapose! h\u2082"
243
+ },
244
+ {
245
+ "annotated_tactic": [
246
+ "\"rwa [\\u2190 <a>mem_nonunits_iff<\\/a>, \\u2190 <a>LocalRing.mem_maximalIdeal<\\/a>, \\u2190 <a>LocalRing.ker_eq_maximalIdeal<\\/a> \\u03c6 h\\u03c6,\\n <a>RingHom.mem_ker<\\/a>] at h\\u2082\"",
247
+ "[{\"full_name\":\"mem_nonunits_iff\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Basic.lean\",\"def_pos\":[897,9],\"def_end_pos\":[897,25]},{\"full_name\":\"LocalRing.mem_maximalIdeal\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/LocalRing.lean\",\"def_pos\":[142,9],\"def_end_pos\":[142,25]},{\"full_name\":\"LocalRing.ker_eq_maximalIdeal\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/LocalRing.lean\",\"def_pos\":[502,9],\"def_end_pos\":[502,28]},{\"full_name\":\"RingHom.mem_ker\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Maps.lean\",\"def_pos\":[605,9],\"def_end_pos\":[605,16]}]"
248
+ ],
249
+ "state_after": "no goals",
250
+ "state_before": "R : Type u\ninst\u271d\u00b9 : CommRing R\ninst\u271d : LocalRing R\ntfae_3_to_2 :\n (\u2200 {K : Type u} [inst : Field K] (\u03c6 : R \u2192+* K),\n Surjective \u21d1\u03c6 \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192 \u2200 (a\u2080 : K), eval\u2082 \u03c6 a\u2080 f = 0 \u2192 eval\u2082 \u03c6 a\u2080 (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 a = a\u2080) \u2192\n \u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R), (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080\ntfae_2_to_1 :\n (\u2200 (f : R[X]),\n f.Monic \u2192\n \u2200 (a\u2080 : ResidueField R),\n (aeval a\u2080) f = 0 \u2192 (aeval a\u2080) (derivative f) \u2260 0 \u2192 \u2203 a, f.IsRoot a \u2227 (residue R) a = a\u2080) \u2192\n HenselianLocalRing R\nhR : HenselianLocalRing R\nK : Type u\n_K : Field K\n\u03c6 : R \u2192+* K\nh\u03c6 : Surjective \u21d1\u03c6\nf : R[X]\nhf : f.Monic\na\u2080 : R\nH : \u03c6 (Polynomial.eval a\u2080 f) = 0 \u2192 IsUnit (Polynomial.eval a\u2080 (derivative f)) \u2192 \u2203 a, f.IsRoot a \u2227 \u03c6 (a - a\u2080) = 0\nh\u2081 : \u03c6 (Polynomial.eval a\u2080 f) = 0\nh\u2082 : \u00acIsUnit (Polynomial.eval a\u2080 (derivative f))\n\u22a2 \u03c6 (Polynomial.eval a\u2080 (derivative f)) = 0",
251
+ "tactic": "rwa [\u2190 mem_nonunits_iff, \u2190 LocalRing.mem_maximalIdeal, \u2190 LocalRing.ker_eq_maximalIdeal \u03c6 h\u03c6,\n RingHom.mem_ker] at h\u2082"
252
+ }
253
+ ],
254
+ "url": "https://github.com/leanprover-community/mathlib4"
255
+ },
256
+ "source_file": "Mathlib/RingTheory/Henselian.lean"
257
+ },
258
+ {
259
+ "error": "no internal trace for tactic 'rw [isUnit_iff_exists_inv] at *'",
260
+ "full_name": "isLocalRingHom_of_le_jacobson_bot",
261
+ "id": "isLocalRingHom_of_le_jacobson_bot",
262
+ "reason": "import_failure",
263
+ "selection": {
264
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
265
+ "end": [
266
+ 82,
267
+ 13
268
+ ],
269
+ "file_path": "Mathlib/RingTheory/Henselian.lean",
270
+ "full_name": "isLocalRingHom_of_le_jacobson_bot",
271
+ "start": [
272
+ 65,
273
+ 1
274
+ ],
275
+ "traced_tactics": [
276
+ {
277
+ "annotated_tactic": [
278
+ "\"constructor\"",
279
+ "[]"
280
+ ],
281
+ "state_after": "case map_nonunit\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I \u2264 \u22a5.jacobson\n\u22a2 \u2200 (a : R), IsUnit ((Ideal.Quotient.mk I) a) \u2192 IsUnit a",
282
+ "state_before": "R : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I \u2264 \u22a5.jacobson\n\u22a2 IsLocalRingHom (Ideal.Quotient.mk I)",
283
+ "tactic": "constructor"
284
+ },
285
+ {
286
+ "annotated_tactic": [
287
+ "\"intro a h\"",
288
+ "[]"
289
+ ],
290
+ "state_after": "case map_nonunit\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\n\u22a2 IsUnit a",
291
+ "state_before": "case map_nonunit\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I \u2264 \u22a5.jacobson\n\u22a2 \u2200 (a : R), IsUnit ((Ideal.Quotient.mk I) a) \u2192 IsUnit a",
292
+ "tactic": "intro a h"
293
+ },
294
+ {
295
+ "annotated_tactic": [
296
+ "\"have : <a>IsUnit<\\/a> (<a>Ideal.Quotient.mk<\\/a> (<a>Ideal.jacobson<\\/a> \\u22a5) a) := by\\n rw [<a>isUnit_iff_exists_inv<\\/a>] at *\\n obtain \\u27e8b, hb\\u27e9 := h\\n obtain \\u27e8b, rfl\\u27e9 := <a>Ideal.Quotient.mk_surjective<\\/a> b\\n use <a>Ideal.Quotient.mk<\\/a> _ b\\n rw [\\u2190 (<a>Ideal.Quotient.mk<\\/a> _).<a>map_one<\\/a>, \\u2190 (<a>Ideal.Quotient.mk<\\/a> _).<a>map_mul<\\/a>, <a>Ideal.Quotient.eq<\\/a>] at hb \\u22a2\\n exact h hb\"",
297
+ "[{\"full_name\":\"IsUnit\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[653,5],\"def_end_pos\":[653,11]},{\"full_name\":\"Ideal.Quotient.mk\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[92,5],\"def_end_pos\":[92,7]},{\"full_name\":\"Ideal.jacobson\",\"def_path\":\"Mathlib\\/RingTheory\\/JacobsonIdeal.lean\",\"def_pos\":[61,5],\"def_end_pos\":[61,13]},{\"full_name\":\"isUnit_iff_exists_inv\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[748,9],\"def_end_pos\":[748,30]},{\"full_name\":\"Ideal.Quotient.mk_surjective\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[159,9],\"def_end_pos\":[159,22]},{\"full_name\":\"Ideal.Quotient.mk\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[92,5],\"def_end_pos\":[92,7]},{\"full_name\":\"Ideal.Quotient.mk\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[92,5],\"def_end_pos\":[92,7]},{\"full_name\":\"RingHom.map_one\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Hom\\/Defs.lean\",\"def_pos\":[551,19],\"def_end_pos\":[551,26]},{\"full_name\":\"Ideal.Quotient.mk\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[92,5],\"def_end_pos\":[92,7]},{\"full_name\":\"RingHom.map_mul\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Hom\\/Defs.lean\",\"def_pos\":[561,19],\"def_end_pos\":[561,26]},{\"full_name\":\"Ideal.Quotient.eq\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[117,19],\"def_end_pos\":[117,21]}]"
298
+ ],
299
+ "state_after": "case map_nonunit\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\nthis : IsUnit ((Ideal.Quotient.mk \u22a5.jacobson) a)\n\u22a2 IsUnit a",
300
+ "state_before": "case map_nonunit\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\n\u22a2 IsUnit a",
301
+ "tactic": "have : IsUnit (Ideal.Quotient.mk (Ideal.jacobson \u22a5) a) := by\n rw [isUnit_iff_exists_inv] at *\n obtain \u27e8b, hb\u27e9 := h\n obtain \u27e8b, rfl\u27e9 := Ideal.Quotient.mk_surjective b\n use Ideal.Quotient.mk _ b\n rw [\u2190 (Ideal.Quotient.mk _).map_one, \u2190 (Ideal.Quotient.mk _).map_mul, Ideal.Quotient.eq] at hb \u22a2\n exact h hb"
302
+ },
303
+ {
304
+ "annotated_tactic": [
305
+ "\"obtain \\u27e8\\u27e8x, y, h1, h2\\u27e9, rfl : x = _\\u27e9 := this\"",
306
+ "[]"
307
+ ],
308
+ "state_after": "case map_nonunit.intro.mk\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\ny : R \u29f8 \u22a5.jacobson\nh1 : (Ideal.Quotient.mk \u22a5.jacobson) a * y = 1\nh2 : y * (Ideal.Quotient.mk \u22a5.jacobson) a = 1\n\u22a2 IsUnit a",
309
+ "state_before": "case map_nonunit\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\nthis : IsUnit ((Ideal.Quotient.mk \u22a5.jacobson) a)\n\u22a2 IsUnit a",
310
+ "tactic": "obtain \u27e8\u27e8x, y, h1, h2\u27e9, rfl : x = _\u27e9 := this"
311
+ },
312
+ {
313
+ "annotated_tactic": [
314
+ "\"obtain \\u27e8y, rfl\\u27e9 := <a>Ideal.Quotient.mk_surjective<\\/a> y\"",
315
+ "[{\"full_name\":\"Ideal.Quotient.mk_surjective\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[159,9],\"def_end_pos\":[159,22]}]"
316
+ ],
317
+ "state_after": "case map_nonunit.intro.mk.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\ny : R\nh1 : (Ideal.Quotient.mk \u22a5.jacobson) a * (Ideal.Quotient.mk \u22a5.jacobson) y = 1\nh2 : (Ideal.Quotient.mk \u22a5.jacobson) y * (Ideal.Quotient.mk \u22a5.jacobson) a = 1\n\u22a2 IsUnit a",
318
+ "state_before": "case map_nonunit.intro.mk\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\ny : R \u29f8 \u22a5.jacobson\nh1 : (Ideal.Quotient.mk \u22a5.jacobson) a * y = 1\nh2 : y * (Ideal.Quotient.mk \u22a5.jacobson) a = 1\n\u22a2 IsUnit a",
319
+ "tactic": "obtain \u27e8y, rfl\u27e9 := Ideal.Quotient.mk_surjective y"
320
+ },
321
+ {
322
+ "annotated_tactic": [
323
+ "\"rw [\\u2190 (<a>Ideal.Quotient.mk<\\/a> _).<a>map_mul<\\/a>, \\u2190 (<a>Ideal.Quotient.mk<\\/a> _).<a>map_one<\\/a>, <a>Ideal.Quotient.eq<\\/a>,\\n <a>Ideal.mem_jacobson_bot<\\/a>] at h1 h2\"",
324
+ "[{\"full_name\":\"Ideal.Quotient.mk\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[92,5],\"def_end_pos\":[92,7]},{\"full_name\":\"RingHom.map_mul\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Hom\\/Defs.lean\",\"def_pos\":[561,19],\"def_end_pos\":[561,26]},{\"full_name\":\"Ideal.Quotient.mk\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[92,5],\"def_end_pos\":[92,7]},{\"full_name\":\"RingHom.map_one\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Hom\\/Defs.lean\",\"def_pos\":[551,19],\"def_end_pos\":[551,26]},{\"full_name\":\"Ideal.Quotient.eq\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[117,19],\"def_end_pos\":[117,21]},{\"full_name\":\"Ideal.mem_jacobson_bot\",\"def_path\":\"Mathlib\\/RingTheory\\/JacobsonIdeal.lean\",\"def_pos\":[258,9],\"def_end_pos\":[258,25]}]"
325
+ ],
326
+ "state_after": "case map_nonunit.intro.mk.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\ny : R\nh1 : \u2200 (y_1 : R), IsUnit ((a * y - 1) * y_1 + 1)\nh2 : \u2200 (y_1 : R), IsUnit ((y * a - 1) * y_1 + 1)\n\u22a2 IsUnit a",
327
+ "state_before": "case map_nonunit.intro.mk.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\ny : R\nh1 : (Ideal.Quotient.mk \u22a5.jacobson) a * (Ideal.Quotient.mk \u22a5.jacobson) y = 1\nh2 : (Ideal.Quotient.mk \u22a5.jacobson) y * (Ideal.Quotient.mk \u22a5.jacobson) a = 1\n\u22a2 IsUnit a",
328
+ "tactic": "rw [\u2190 (Ideal.Quotient.mk _).map_mul, \u2190 (Ideal.Quotient.mk _).map_one, Ideal.Quotient.eq,\n Ideal.mem_jacobson_bot] at h1 h2"
329
+ },
330
+ {
331
+ "annotated_tactic": [
332
+ "\"specialize h1 1\"",
333
+ "[]"
334
+ ],
335
+ "state_after": "case map_nonunit.intro.mk.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\ny : R\nh2 : \u2200 (y_1 : R), IsUnit ((y * a - 1) * y_1 + 1)\nh1 : IsUnit ((a * y - 1) * 1 + 1)\n\u22a2 IsUnit a",
336
+ "state_before": "case map_nonunit.intro.mk.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\ny : R\nh1 : \u2200 (y_1 : R), IsUnit ((a * y - 1) * y_1 + 1)\nh2 : \u2200 (y_1 : R), IsUnit ((y * a - 1) * y_1 + 1)\n\u22a2 IsUnit a",
337
+ "tactic": "specialize h1 1"
338
+ },
339
+ {
340
+ "annotated_tactic": [
341
+ "\"simp? at h1 says simp only [<a>mul_one<\\/a>, <a>sub_add_cancel<\\/a>, <a>IsUnit.mul_iff<\\/a>] at h1\"",
342
+ "[{\"full_name\":\"mul_one\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Defs.lean\",\"def_pos\":[483,9],\"def_end_pos\":[483,16]},{\"full_name\":\"sub_add_cancel\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Basic.lean\",\"def_pos\":[997,3],\"def_end_pos\":[997,14]},{\"full_name\":\"IsUnit.mul_iff\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[800,9],\"def_end_pos\":[800,16]}]"
343
+ ],
344
+ "state_after": "case map_nonunit.intro.mk.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\ny : R\nh2 : \u2200 (y_1 : R), IsUnit ((y * a - 1) * y_1 + 1)\nh1 : IsUnit a \u2227 IsUnit y\n\u22a2 IsUnit a",
345
+ "state_before": "case map_nonunit.intro.mk.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\ny : R\nh2 : \u2200 (y_1 : R), IsUnit ((y * a - 1) * y_1 + 1)\nh1 : IsUnit ((a * y - 1) * 1 + 1)\n\u22a2 IsUnit a",
346
+ "tactic": "simp? at h1 says simp only [mul_one, sub_add_cancel, IsUnit.mul_iff] at h1"
347
+ },
348
+ {
349
+ "annotated_tactic": [
350
+ "\"exact h1.1\"",
351
+ "[]"
352
+ ],
353
+ "state_after": "no goals",
354
+ "state_before": "case map_nonunit.intro.mk.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\ny : R\nh2 : \u2200 (y_1 : R), IsUnit ((y * a - 1) * y_1 + 1)\nh1 : IsUnit a \u2227 IsUnit y\n\u22a2 IsUnit a",
355
+ "tactic": "exact h1.1"
356
+ },
357
+ {
358
+ "annotated_tactic": [
359
+ "\"rw [<a>isUnit_iff_exists_inv<\\/a>] at *\"",
360
+ "[{\"full_name\":\"isUnit_iff_exists_inv\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[748,9],\"def_end_pos\":[748,30]}]"
361
+ ],
362
+ "state_after": "R : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : \u2203 b, (Ideal.Quotient.mk I) a * b = 1\n\u22a2 \u2203 b, (Ideal.Quotient.mk \u22a5.jacobson) a * b = 1",
363
+ "state_before": "R : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\n\u22a2 IsUnit ((Ideal.Quotient.mk \u22a5.jacobson) a)",
364
+ "tactic": "rw [isUnit_iff_exists_inv] at *"
365
+ },
366
+ {
367
+ "annotated_tactic": [
368
+ "\"obtain \\u27e8b, hb\\u27e9 := h\"",
369
+ "[]"
370
+ ],
371
+ "state_after": "case intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I \u2264 \u22a5.jacobson\na : R\nb : R \u29f8 I\nhb : (Ideal.Quotient.mk I) a * b = 1\n\u22a2 \u2203 b, (Ideal.Quotient.mk \u22a5.jacobson) a * b = 1",
372
+ "state_before": "R : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : \u2203 b, (Ideal.Quotient.mk I) a * b = 1\n\u22a2 \u2203 b, (Ideal.Quotient.mk \u22a5.jacobson) a * b = 1",
373
+ "tactic": "obtain \u27e8b, hb\u27e9 := h"
374
+ },
375
+ {
376
+ "annotated_tactic": [
377
+ "\"obtain \\u27e8b, rfl\\u27e9 := <a>Ideal.Quotient.mk_surjective<\\/a> b\"",
378
+ "[{\"full_name\":\"Ideal.Quotient.mk_surjective\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[159,9],\"def_end_pos\":[159,22]}]"
379
+ ],
380
+ "state_after": "case intro.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I \u2264 \u22a5.jacobson\na b : R\nhb : (Ideal.Quotient.mk I) a * (Ideal.Quotient.mk I) b = 1\n\u22a2 \u2203 b, (Ideal.Quotient.mk \u22a5.jacobson) a * b = 1",
381
+ "state_before": "case intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I \u2264 \u22a5.jacobson\na : R\nb : R \u29f8 I\nhb : (Ideal.Quotient.mk I) a * b = 1\n\u22a2 \u2203 b, (Ideal.Quotient.mk \u22a5.jacobson) a * b = 1",
382
+ "tactic": "obtain \u27e8b, rfl\u27e9 := Ideal.Quotient.mk_surjective b"
383
+ },
384
+ {
385
+ "annotated_tactic": [
386
+ "\"use <a>Ideal.Quotient.mk<\\/a> _ b\"",
387
+ "[{\"full_name\":\"Ideal.Quotient.mk\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[92,5],\"def_end_pos\":[92,7]}]"
388
+ ],
389
+ "state_after": "case h\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I \u2264 \u22a5.jacobson\na b : R\nhb : (Ideal.Quotient.mk I) a * (Ideal.Quotient.mk I) b = 1\n\u22a2 (Ideal.Quotient.mk \u22a5.jacobson) a * (Ideal.Quotient.mk \u22a5.jacobson) b = 1",
390
+ "state_before": "case intro.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I \u2264 \u22a5.jacobson\na b : R\nhb : (Ideal.Quotient.mk I) a * (Ideal.Quotient.mk I) b = 1\n\u22a2 \u2203 b, (Ideal.Quotient.mk \u22a5.jacobson) a * b = 1",
391
+ "tactic": "use Ideal.Quotient.mk _ b"
392
+ },
393
+ {
394
+ "annotated_tactic": [
395
+ "\"rw [\\u2190 (<a>Ideal.Quotient.mk<\\/a> _).<a>map_one<\\/a>, \\u2190 (<a>Ideal.Quotient.mk<\\/a> _).<a>map_mul<\\/a>, <a>Ideal.Quotient.eq<\\/a>] at hb \\u22a2\"",
396
+ "[{\"full_name\":\"Ideal.Quotient.mk\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[92,5],\"def_end_pos\":[92,7]},{\"full_name\":\"RingHom.map_one\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Hom\\/Defs.lean\",\"def_pos\":[551,19],\"def_end_pos\":[551,26]},{\"full_name\":\"Ideal.Quotient.mk\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[92,5],\"def_end_pos\":[92,7]},{\"full_name\":\"RingHom.map_mul\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Hom\\/Defs.lean\",\"def_pos\":[561,19],\"def_end_pos\":[561,26]},{\"full_name\":\"Ideal.Quotient.eq\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[117,19],\"def_end_pos\":[117,21]}]"
397
+ ],
398
+ "state_after": "case h\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I \u2264 \u22a5.jacobson\na b : R\nhb : a * b - 1 \u2208 I\n\u22a2 a * b - 1 \u2208 \u22a5.jacobson",
399
+ "state_before": "case h\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I \u2264 \u22a5.jacobson\na b : R\nhb : (Ideal.Quotient.mk I) a * (Ideal.Quotient.mk I) b = 1\n\u22a2 (Ideal.Quotient.mk \u22a5.jacobson) a * (Ideal.Quotient.mk \u22a5.jacobson) b = 1",
400
+ "tactic": "rw [\u2190 (Ideal.Quotient.mk _).map_one, \u2190 (Ideal.Quotient.mk _).map_mul, Ideal.Quotient.eq] at hb \u22a2"
401
+ },
402
+ {
403
+ "annotated_tactic": [
404
+ "\"exact h hb\"",
405
+ "[]"
406
+ ],
407
+ "state_after": "no goals",
408
+ "state_before": "case h\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I \u2264 \u22a5.jacobson\na b : R\nhb : a * b - 1 \u2208 I\n\u22a2 a * b - 1 \u2208 \u22a5.jacobson",
409
+ "tactic": "exact h hb"
410
+ },
411
+ {
412
+ "annotated_tactic": [
413
+ "\"simp only [<a>mul_one<\\/a>, <a>sub_add_cancel<\\/a>, <a>IsUnit.mul_iff<\\/a>] at h1\"",
414
+ "[{\"full_name\":\"mul_one\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Defs.lean\",\"def_pos\":[483,9],\"def_end_pos\":[483,16]},{\"full_name\":\"sub_add_cancel\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Basic.lean\",\"def_pos\":[997,3],\"def_end_pos\":[997,14]},{\"full_name\":\"IsUnit.mul_iff\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[800,9],\"def_end_pos\":[800,16]}]"
415
+ ],
416
+ "state_after": "case map_nonunit.intro.mk.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\ny : R\nh2 : \u2200 (y_1 : R), IsUnit ((y * a - 1) * y_1 + 1)\nh1 : IsUnit a \u2227 IsUnit y\n\u22a2 IsUnit a",
417
+ "state_before": "case map_nonunit.intro.mk.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh\u271d : I \u2264 \u22a5.jacobson\na : R\nh : IsUnit ((Ideal.Quotient.mk I) a)\ny : R\nh2 : \u2200 (y_1 : R), IsUnit ((y * a - 1) * y_1 + 1)\nh1 : IsUnit ((a * y - 1) * 1 + 1)\n\u22a2 IsUnit a",
418
+ "tactic": "simp only [mul_one, sub_add_cancel, IsUnit.mul_iff] at h1"
419
+ }
420
+ ],
421
+ "url": "https://github.com/leanprover-community/mathlib4"
422
+ },
423
+ "source_file": "Mathlib/RingTheory/Henselian.lean"
424
+ },
425
+ {
426
+ "error": "theorem has no selected tactic transitions",
427
+ "full_name": "CommSemiring.antipode_eq_id",
428
+ "id": "CommSemiring.antipode_eq_id",
429
+ "reason": "import_failure",
430
+ "selection": {
431
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
432
+ "end": [
433
+ 90,
434
+ 65
435
+ ],
436
+ "file_path": "Mathlib/RingTheory/HopfAlgebra.lean",
437
+ "full_name": "CommSemiring.antipode_eq_id",
438
+ "start": [
439
+ 90,
440
+ 1
441
+ ],
442
+ "traced_tactics": [],
443
+ "url": "https://github.com/leanprover-community/mathlib4"
444
+ },
445
+ "source_file": "Mathlib/RingTheory/HopfAlgebra.lean"
446
+ },
447
+ {
448
+ "error": "theorem has no selected tactic transitions",
449
+ "full_name": "HopfAlgebra.mul_antipode_lTensor_comul_apply",
450
+ "id": "HopfAlgebra.mul_antipode_lTensor_comul_apply",
451
+ "reason": "import_failure",
452
+ "selection": {
453
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
454
+ "end": [
455
+ 71,
456
+ 51
457
+ ],
458
+ "file_path": "Mathlib/RingTheory/HopfAlgebra.lean",
459
+ "full_name": "HopfAlgebra.mul_antipode_lTensor_comul_apply",
460
+ "start": [
461
+ 68,
462
+ 1
463
+ ],
464
+ "traced_tactics": [],
465
+ "url": "https://github.com/leanprover-community/mathlib4"
466
+ },
467
+ "source_file": "Mathlib/RingTheory/HopfAlgebra.lean"
468
+ },
469
+ {
470
+ "error": "theorem has no selected tactic transitions",
471
+ "full_name": "HopfAlgebra.mul_antipode_rTensor_comul_apply",
472
+ "id": "HopfAlgebra.mul_antipode_rTensor_comul_apply",
473
+ "reason": "import_failure",
474
+ "selection": {
475
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
476
+ "end": [
477
+ 65,
478
+ 51
479
+ ],
480
+ "file_path": "Mathlib/RingTheory/HopfAlgebra.lean",
481
+ "full_name": "HopfAlgebra.mul_antipode_rTensor_comul_apply",
482
+ "start": [
483
+ 62,
484
+ 1
485
+ ],
486
+ "traced_tactics": [],
487
+ "url": "https://github.com/leanprover-community/mathlib4"
488
+ },
489
+ "source_file": "Mathlib/RingTheory/HopfAlgebra.lean"
490
+ }
491
+ ],
492
+ "input_proofs": 5,
493
+ "input_units": 2,
494
+ "proofs": 0,
495
+ "published_proofs": 0,
496
+ "published_transitions": 0,
497
+ "replay_failures": [],
498
+ "transitions": 0,
499
+ "validation_failures": [],
500
+ "validation_rejected_proofs": 0,
501
+ "zero_transition_proofs": 0
502
+ },
503
+ "shards": [],
504
+ "proof_ids": [],
505
+ "proof_keys": []
506
+ }
manifests/batches/mathlib/001680.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001681.json ADDED
@@ -0,0 +1,234 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "format": "leangpt-parquet-v2",
3
+ "batch": "mathlib/001681",
4
+ "batch_fingerprint": "2223b8e940e309db3fe7d0ba3b65fb396729a48128a0f5209fee1e0558730762",
5
+ "evidence": {
6
+ "batch_fingerprint": "2223b8e940e309db3fe7d0ba3b65fb396729a48128a0f5209fee1e0558730762",
7
+ "contamination_matches": [],
8
+ "failures": [
9
+ {
10
+ "error": "theorem has no selected tactic transitions",
11
+ "full_name": "Basis.mem_ideal_iff",
12
+ "id": "Basis.mem_ideal_iff",
13
+ "reason": "import_failure",
14
+ "selection": {
15
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
16
+ "end": [
17
+ 57,
18
+ 84
19
+ ],
20
+ "file_path": "Mathlib/RingTheory/Ideal/Basis.lean",
21
+ "full_name": "Basis.mem_ideal_iff",
22
+ "start": [
23
+ 55,
24
+ 1
25
+ ],
26
+ "traced_tactics": [],
27
+ "url": "https://github.com/leanprover-community/mathlib4"
28
+ },
29
+ "source_file": "Mathlib/RingTheory/Ideal/Basis.lean"
30
+ },
31
+ {
32
+ "error": "theorem has no selected tactic transitions",
33
+ "full_name": "Basis.mem_ideal_iff'",
34
+ "id": "Basis.mem_ideal_iff'",
35
+ "reason": "import_failure",
36
+ "selection": {
37
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
38
+ "end": [
39
+ 64,
40
+ 85
41
+ ],
42
+ "file_path": "Mathlib/RingTheory/Ideal/Basis.lean",
43
+ "full_name": "Basis.mem_ideal_iff'",
44
+ "start": [
45
+ 62,
46
+ 1
47
+ ],
48
+ "traced_tactics": [],
49
+ "url": "https://github.com/leanprover-community/mathlib4"
50
+ },
51
+ "source_file": "Mathlib/RingTheory/Ideal/Basis.lean"
52
+ },
53
+ {
54
+ "error": "theorem has no selected tactic transitions",
55
+ "full_name": "Submodule.colon_mono",
56
+ "id": "Submodule.colon_mono",
57
+ "reason": "import_failure",
58
+ "selection": {
59
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
60
+ "end": [
61
+ 49,
62
+ 64
63
+ ],
64
+ "file_path": "Mathlib/RingTheory/Ideal/Colon.lean",
65
+ "full_name": "Submodule.colon_mono",
66
+ "start": [
67
+ 48,
68
+ 1
69
+ ],
70
+ "traced_tactics": [],
71
+ "url": "https://github.com/leanprover-community/mathlib4"
72
+ },
73
+ "source_file": "Mathlib/RingTheory/Ideal/Colon.lean"
74
+ },
75
+ {
76
+ "error": "theorem has no selected tactic transitions",
77
+ "full_name": "Submodule.iInf_colon_iSup",
78
+ "id": "Submodule.iInf_colon_iSup",
79
+ "reason": "import_failure",
80
+ "selection": {
81
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
82
+ "end": [
83
+ 63,
84
+ 21
85
+ ],
86
+ "file_path": "Mathlib/RingTheory/Ideal/Colon.lean",
87
+ "full_name": "Submodule.iInf_colon_iSup",
88
+ "start": [
89
+ 52,
90
+ 1
91
+ ],
92
+ "traced_tactics": [],
93
+ "url": "https://github.com/leanprover-community/mathlib4"
94
+ },
95
+ "source_file": "Mathlib/RingTheory/Ideal/Colon.lean"
96
+ },
97
+ {
98
+ "error": "theorem has no selected tactic transitions",
99
+ "full_name": "Submodule.mem_colon",
100
+ "id": "Submodule.mem_colon",
101
+ "reason": "import_failure",
102
+ "selection": {
103
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
104
+ "end": [
105
+ 32,
106
+ 76
107
+ ],
108
+ "file_path": "Mathlib/RingTheory/Ideal/Colon.lean",
109
+ "full_name": "Submodule.mem_colon",
110
+ "start": [
111
+ 29,
112
+ 1
113
+ ],
114
+ "traced_tactics": [],
115
+ "url": "https://github.com/leanprover-community/mathlib4"
116
+ },
117
+ "source_file": "Mathlib/RingTheory/Ideal/Colon.lean"
118
+ },
119
+ {
120
+ "error": "theorem has no selected tactic transitions",
121
+ "full_name": "Submodule.mem_colon'",
122
+ "id": "Submodule.mem_colon'",
123
+ "reason": "import_failure",
124
+ "selection": {
125
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
126
+ "end": [
127
+ 36,
128
+ 12
129
+ ],
130
+ "file_path": "Mathlib/RingTheory/Ideal/Colon.lean",
131
+ "full_name": "Submodule.mem_colon'",
132
+ "start": [
133
+ 35,
134
+ 1
135
+ ],
136
+ "traced_tactics": [],
137
+ "url": "https://github.com/leanprover-community/mathlib4"
138
+ },
139
+ "source_file": "Mathlib/RingTheory/Ideal/Colon.lean"
140
+ }
141
+ ],
142
+ "input_proofs": 14,
143
+ "input_units": 2,
144
+ "proofs": 8,
145
+ "published_proofs": 7,
146
+ "published_transitions": 8,
147
+ "replay_failures": [],
148
+ "transitions": 11,
149
+ "validation_failures": [
150
+ {
151
+ "errors": [
152
+ "internal transition boundary mismatch"
153
+ ],
154
+ "file_path": "Mathlib/RingTheory/Ideal/Colon.lean",
155
+ "proof_id": "mathlib:Submodule.mem_colon_singleton",
156
+ "provenance": {
157
+ "selection": {
158
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
159
+ "end": [
160
+ 72,
161
+ 99
162
+ ],
163
+ "file_path": "Mathlib/RingTheory/Ideal/Colon.lean",
164
+ "full_name": "Submodule.mem_colon_singleton",
165
+ "start": [
166
+ 67,
167
+ 1
168
+ ],
169
+ "traced_tactics": [
170
+ {
171
+ "annotated_tactic": [
172
+ "\"simp [<a>Submodule.mem_colon<\\/a>, <a>Submodule.mem_span_singleton<\\/a>]\"",
173
+ "[{\"full_name\":\"Submodule.mem_colon\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Colon.lean\",\"def_pos\":[29,9],\"def_end_pos\":[29,18]},{\"full_name\":\"Submodule.mem_span_singleton\",\"def_path\":\"Mathlib\\/LinearAlgebra\\/Span.lean\",\"def_pos\":[486,9],\"def_end_pos\":[486,27]}]"
174
+ ],
175
+ "state_after": "no goals",
176
+ "state_before": "R : Type u_1\nM : Type u_2\nM' : Type u_3\nF : Type u_4\nG : Type u_5\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : AddCommGroup M\ninst\u271d : Module R M\nN\u271d N\u2081 N\u2082 P P\u2081 P\u2082 N : Submodule R M\nx : M\nr : R\n\u22a2 r \u2208 N.colon (span R {x}) \u2194 \u2200 (a : R), r \u2022 a \u2022 x \u2208 N",
177
+ "tactic": "simp [Submodule.mem_colon, Submodule.mem_span_singleton]"
178
+ },
179
+ {
180
+ "annotated_tactic": [
181
+ "\"simp_rw [fun (a : R) \\u21a6 <a>smul_comm<\\/a> r a x]\"",
182
+ "[{\"full_name\":\"SMulCommClass.smul_comm\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Action\\/Defs.lean\",\"def_pos\":[183,3],\"def_end_pos\":[183,12]}]"
183
+ ],
184
+ "state_after": "R : Type u_1\nM : Type u_2\nM' : Type u_3\nF : Type u_4\nG : Type u_5\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : AddCommGroup M\ninst\u271d : Module R M\nN\u271d N\u2081 N\u2082 P P\u2081 P\u2082 N : Submodule R M\nx : M\nr : R\n\u22a2 (\u2200 (a : R), a \u2022 r \u2022 x \u2208 N) \u2194 r \u2022 x \u2208 N",
185
+ "state_before": "R : Type u_1\nM : Type u_2\nM' : Type u_3\nF : Type u_4\nG : Type u_5\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : AddCommGroup M\ninst\u271d : Module R M\nN\u271d N\u2081 N\u2082 P P\u2081 P\u2082 N : Submodule R M\nx : M\nr : R\n\u22a2 (\u2200 (a : R), r \u2022 a \u2022 x \u2208 N) \u2194 r \u2022 x \u2208 N",
186
+ "tactic": "simp_rw [fun (a : R) \u21a6 smul_comm r a x]"
187
+ },
188
+ {
189
+ "annotated_tactic": [
190
+ "\"exact <a>SetLike.forall_smul_mem_iff<\\/a>\"",
191
+ "[{\"full_name\":\"SetLike.forall_smul_mem_iff\",\"def_path\":\"Mathlib\\/GroupTheory\\/GroupAction\\/SubMulAction.lean\",\"def_pos\":[133,9],\"def_end_pos\":[133,28]}]"
192
+ ],
193
+ "state_after": "no goals",
194
+ "state_before": "R : Type u_1\nM : Type u_2\nM' : Type u_3\nF : Type u_4\nG : Type u_5\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : AddCommGroup M\ninst\u271d : Module R M\nN\u271d N\u2081 N\u2082 P P\u2081 P\u2082 N : Submodule R M\nx : M\nr : R\n\u22a2 (\u2200 (a : R), a \u2022 r \u2022 x \u2208 N) \u2194 r \u2022 x \u2208 N",
195
+ "tactic": "exact SetLike.forall_smul_mem_iff"
196
+ }
197
+ ],
198
+ "url": "https://github.com/leanprover-community/mathlib4"
199
+ }
200
+ },
201
+ "theorem_name": "Submodule.mem_colon_singleton"
202
+ }
203
+ ],
204
+ "validation_rejected_proofs": 1,
205
+ "zero_transition_proofs": 0
206
+ },
207
+ "shards": [
208
+ {
209
+ "path": "data/train/mathlib-001681-0000-9ff1ee65ff0bc2a7.parquet",
210
+ "sha256": "9ff1ee65ff0bc2a7976ef5e4ad5e257e3626a2b67939390fc31b80b7289a9a98",
211
+ "bytes": 76896,
212
+ "rows": 8,
213
+ "revision": "d60e29d6cee3c6b2c6967d9f9c90939917c38808"
214
+ }
215
+ ],
216
+ "proof_ids": [
217
+ "mathlib:Ideal.annihilator_quotient",
218
+ "mathlib:Ideal.basisSpanSingleton_apply",
219
+ "mathlib:Ideal.constr_basisSpanSingleton",
220
+ "mathlib:Ideal.mem_colon_singleton",
221
+ "mathlib:Submodule.annihilator_quotient",
222
+ "mathlib:Submodule.colon_bot",
223
+ "mathlib:Submodule.colon_top"
224
+ ],
225
+ "proof_keys": [
226
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/Basis.lean\",null,null,\"Ideal.basisSpanSingleton_apply\"]",
227
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/Basis.lean\",null,null,\"Ideal.constr_basisSpanSingleton\"]",
228
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/Colon.lean\",null,null,\"Ideal.annihilator_quotient\"]",
229
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/Colon.lean\",null,null,\"Ideal.mem_colon_singleton\"]",
230
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/Colon.lean\",null,null,\"Submodule.annihilator_quotient\"]",
231
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/Colon.lean\",null,null,\"Submodule.colon_bot\"]",
232
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/Colon.lean\",null,null,\"Submodule.colon_top\"]"
233
+ ]
234
+ }
manifests/batches/mathlib/001682.json ADDED
@@ -0,0 +1,920 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "format": "leangpt-parquet-v2",
3
+ "batch": "mathlib/001682",
4
+ "batch_fingerprint": "77c6402d5764e6ed82de634fdf966fdef96a0f57575c4e7730373052d880cbbd",
5
+ "evidence": {
6
+ "batch_fingerprint": "77c6402d5764e6ed82de634fdf966fdef96a0f57575c4e7730373052d880cbbd",
7
+ "contamination_matches": [],
8
+ "failures": [
9
+ {
10
+ "error": "theorem has no selected tactic transitions",
11
+ "full_name": "Ideal.cotangentEquivIdeal_apply",
12
+ "id": "Ideal.cotangentEquivIdeal_apply",
13
+ "reason": "import_failure",
14
+ "selection": {
15
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
16
+ "end": [
17
+ 158,
18
+ 70
19
+ ],
20
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
21
+ "full_name": "Ideal.cotangentEquivIdeal_apply",
22
+ "start": [
23
+ 157,
24
+ 1
25
+ ],
26
+ "traced_tactics": [],
27
+ "url": "https://github.com/leanprover-community/mathlib4"
28
+ },
29
+ "source_file": "Mathlib/RingTheory/Ideal/Cotangent.lean"
30
+ },
31
+ {
32
+ "error": "theorem has no selected tactic transitions",
33
+ "full_name": "Ideal.mapCotangent_toCotangent",
34
+ "id": "Ideal.mapCotangent_toCotangent",
35
+ "reason": "import_failure",
36
+ "selection": {
37
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
38
+ "end": [
39
+ 215,
40
+ 101
41
+ ],
42
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
43
+ "full_name": "Ideal.mapCotangent_toCotangent",
44
+ "start": [
45
+ 212,
46
+ 1
47
+ ],
48
+ "traced_tactics": [],
49
+ "url": "https://github.com/leanprover-community/mathlib4"
50
+ },
51
+ "source_file": "Mathlib/RingTheory/Ideal/Cotangent.lean"
52
+ },
53
+ {
54
+ "error": "theorem has no selected tactic transitions",
55
+ "full_name": "Ideal.toCotangent_eq_zero",
56
+ "id": "Ideal.toCotangent_eq_zero",
57
+ "reason": "import_failure",
58
+ "selection": {
59
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
60
+ "end": [
61
+ 79,
62
+ 101
63
+ ],
64
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
65
+ "full_name": "Ideal.toCotangent_eq_zero",
66
+ "start": [
67
+ 79,
68
+ 1
69
+ ],
70
+ "traced_tactics": [],
71
+ "url": "https://github.com/leanprover-community/mathlib4"
72
+ },
73
+ "source_file": "Mathlib/RingTheory/Ideal/Cotangent.lean"
74
+ },
75
+ {
76
+ "error": "theorem has no selected tactic transitions",
77
+ "full_name": "Ideal.toCotangent_range",
78
+ "id": "Ideal.toCotangent_range",
79
+ "reason": "import_failure",
80
+ "selection": {
81
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
82
+ "end": [
83
+ 85,
84
+ 87
85
+ ],
86
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
87
+ "full_name": "Ideal.toCotangent_range",
88
+ "start": [
89
+ 85,
90
+ 1
91
+ ],
92
+ "traced_tactics": [],
93
+ "url": "https://github.com/leanprover-community/mathlib4"
94
+ },
95
+ "source_file": "Mathlib/RingTheory/Ideal/Cotangent.lean"
96
+ },
97
+ {
98
+ "error": "theorem has no selected tactic transitions",
99
+ "full_name": "Ideal.toCotangent_surjective",
100
+ "id": "Ideal.toCotangent_surjective",
101
+ "reason": "import_failure",
102
+ "selection": {
103
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
104
+ "end": [
105
+ 82,
106
+ 97
107
+ ],
108
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
109
+ "full_name": "Ideal.toCotangent_surjective",
110
+ "start": [
111
+ 82,
112
+ 1
113
+ ],
114
+ "traced_tactics": [],
115
+ "url": "https://github.com/leanprover-community/mathlib4"
116
+ },
117
+ "source_file": "Mathlib/RingTheory/Ideal/Cotangent.lean"
118
+ },
119
+ {
120
+ "error": "theorem has no selected tactic transitions",
121
+ "full_name": "Ideal.toCotangent_to_quotient_square",
122
+ "id": "Ideal.toCotangent_to_quotient_square",
123
+ "reason": "import_failure",
124
+ "selection": {
125
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
126
+ "end": [
127
+ 114,
128
+ 73
129
+ ],
130
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
131
+ "full_name": "Ideal.toCotangent_to_quotient_square",
132
+ "start": [
133
+ 113,
134
+ 1
135
+ ],
136
+ "traced_tactics": [],
137
+ "url": "https://github.com/leanprover-community/mathlib4"
138
+ },
139
+ "source_file": "Mathlib/RingTheory/Ideal/Cotangent.lean"
140
+ },
141
+ {
142
+ "error": "theorem has no selected tactic transitions",
143
+ "full_name": "Ideal.to_quotient_square_comp_toCotangent",
144
+ "id": "Ideal.to_quotient_square_comp_toCotangent",
145
+ "reason": "import_failure",
146
+ "selection": {
147
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
148
+ "end": [
149
+ 109,
150
+ 29
151
+ ],
152
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
153
+ "full_name": "Ideal.to_quotient_square_comp_toCotangent",
154
+ "start": [
155
+ 107,
156
+ 1
157
+ ],
158
+ "traced_tactics": [],
159
+ "url": "https://github.com/leanprover-community/mathlib4"
160
+ },
161
+ "source_file": "Mathlib/RingTheory/Ideal/Cotangent.lean"
162
+ },
163
+ {
164
+ "error": "no internal trace for tactic 'rintro rfl'",
165
+ "full_name": "LocalRing.CotangentSpace.map_eq_top_iff",
166
+ "id": "LocalRing.CotangentSpace.map_eq_top_iff",
167
+ "reason": "import_failure",
168
+ "selection": {
169
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
170
+ "end": [
171
+ 251,
172
+ 98
173
+ ],
174
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
175
+ "full_name": "LocalRing.CotangentSpace.map_eq_top_iff",
176
+ "start": [
177
+ 243,
178
+ 1
179
+ ],
180
+ "traced_tactics": [
181
+ {
182
+ "annotated_tactic": [
183
+ "\"refine \\u27e8fun H \\u21a6 eq_top_iff.mpr ?_, by rintro rfl; simp [<a>Ideal.toCotangent_range<\\/a>]\\u27e9\"",
184
+ "[{\"full_name\":\"Ideal.toCotangent_range\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Cotangent.lean\",\"def_pos\":[85,9],\"def_end_pos\":[85,26]}]"
185
+ ],
186
+ "state_after": "R : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\nM : Submodule R \u21a5(maximalIdeal R)\nH : Submodule.map (maximalIdeal R).toCotangent M = \u22a4\n\u22a2 \u22a4 \u2264 M",
187
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\nM : Submodule R \u21a5(maximalIdeal R)\n\u22a2 Submodule.map (maximalIdeal R).toCotangent M = \u22a4 \u2194 M = \u22a4",
188
+ "tactic": "refine \u27e8fun H \u21a6 eq_top_iff.mpr ?_, by rintro rfl; simp [Ideal.toCotangent_range]\u27e9"
189
+ },
190
+ {
191
+ "annotated_tactic": [
192
+ "\"refine (<a>Submodule.map_le_map_iff_of_injective<\\/a> (<a>Submodule.injective_subtype<\\/a> _) _ _).<a>mp<\\/a> ?_\"",
193
+ "[{\"full_name\":\"Submodule.map_le_map_iff_of_injective\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Submodule\\/Map.lean\",\"def_pos\":[379,9],\"def_end_pos\":[379,36]},{\"full_name\":\"Submodule.injective_subtype\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Submodule\\/LinearMap.lean\",\"def_pos\":[88,9],\"def_end_pos\":[88,26]},{\"full_name\":\"Iff.mp\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Core.lean\",\"def_pos\":[118,3],\"def_end_pos\":[118,5]}]"
194
+ ],
195
+ "state_after": "R : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\nM : Submodule R \u21a5(maximalIdeal R)\nH : Submodule.map (maximalIdeal R).toCotangent M = \u22a4\n\u22a2 Submodule.map (Submodule.subtype (maximalIdeal R)) \u22a4 \u2264 Submodule.map (Submodule.subtype (maximalIdeal R)) M",
196
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\nM : Submodule R \u21a5(maximalIdeal R)\nH : Submodule.map (maximalIdeal R).toCotangent M = \u22a4\n\u22a2 \u22a4 \u2264 M",
197
+ "tactic": "refine (Submodule.map_le_map_iff_of_injective (Submodule.injective_subtype _) _ _).mp ?_"
198
+ },
199
+ {
200
+ "annotated_tactic": [
201
+ "\"rw [<a>Submodule.map_top<\\/a>, <a>Submodule.range_subtype<\\/a>]\"",
202
+ "[{\"full_name\":\"Submodule.map_top\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Submodule\\/Range.lean\",\"def_pos\":[290,9],\"def_end_pos\":[290,16]},{\"full_name\":\"Submodule.range_subtype\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Submodule\\/Range.lean\",\"def_pos\":[294,9],\"def_end_pos\":[294,22]}]"
203
+ ],
204
+ "state_after": "R : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\nM : Submodule R \u21a5(maximalIdeal R)\nH : Submodule.map (maximalIdeal R).toCotangent M = \u22a4\n\u22a2 maximalIdeal R \u2264 Submodule.map (Submodule.subtype (maximalIdeal R)) M",
205
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\nM : Submodule R \u21a5(maximalIdeal R)\nH : Submodule.map (maximalIdeal R).toCotangent M = \u22a4\n\u22a2 Submodule.map (Submodule.subtype (maximalIdeal R)) \u22a4 \u2264 Submodule.map (Submodule.subtype (maximalIdeal R)) M",
206
+ "tactic": "rw [Submodule.map_top, Submodule.range_subtype]"
207
+ },
208
+ {
209
+ "annotated_tactic": [
210
+ "\"apply <a>Submodule.le_of_le_smul_of_le_jacobson_bot<\\/a> (<a>IsNoetherian.noetherian<\\/a> _)\\n (<a>LocalRing.jacobson_eq_maximalIdeal<\\/a> _ <a>bot_ne_top<\\/a>).<a>ge<\\/a>\"",
211
+ "[{\"full_name\":\"Submodule.le_of_le_smul_of_le_jacobson_bot\",\"def_path\":\"Mathlib\\/RingTheory\\/Nakayama.lean\",\"def_pos\":[137,9],\"def_end_pos\":[137,41]},{\"full_name\":\"IsNoetherian.noetherian\",\"def_path\":\"Mathlib\\/RingTheory\\/Noetherian.lean\",\"def_pos\":[63,3],\"def_end_pos\":[63,13]},{\"full_name\":\"LocalRing.jacobson_eq_maximalIdeal\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/LocalRing.lean\",\"def_pos\":[195,9],\"def_end_pos\":[195,33]},{\"full_name\":\"bot_ne_top\",\"def_path\":\"Mathlib\\/Order\\/BoundedOrder.lean\",\"def_pos\":[879,9],\"def_end_pos\":[879,19]},{\"full_name\":\"Eq.ge\",\"def_path\":\"Mathlib\\/Order\\/Basic.lean\",\"def_pos\":[218,19],\"def_end_pos\":[218,21]}]"
212
+ ],
213
+ "state_after": "R : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\nM : Submodule R \u21a5(maximalIdeal R)\nH : Submodule.map (maximalIdeal R).toCotangent M = \u22a4\n\u22a2 maximalIdeal R \u2264 Submodule.map (Submodule.subtype (maximalIdeal R)) M \u2294 maximalIdeal R \u2022 maximalIdeal R",
214
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\nM : Submodule R \u21a5(maximalIdeal R)\nH : Submodule.map (maximalIdeal R).toCotangent M = \u22a4\n\u22a2 maximalIdeal R \u2264 Submodule.map (Submodule.subtype (maximalIdeal R)) M",
215
+ "tactic": "apply Submodule.le_of_le_smul_of_le_jacobson_bot (IsNoetherian.noetherian _)\n (LocalRing.jacobson_eq_maximalIdeal _ bot_ne_top).ge"
216
+ },
217
+ {
218
+ "annotated_tactic": [
219
+ "\"rw [<a>smul_eq_mul<\\/a>, \\u2190 <a>pow_two<\\/a>, \\u2190 <a>Ideal.map_toCotangent_ker<\\/a>, \\u2190 <a>Submodule.map_sup<\\/a>,\\n \\u2190 <a>Submodule.comap_map_eq<\\/a>, H, <a>Submodule.comap_top<\\/a>, <a>Submodule.map_top<\\/a>, <a>Submodule.range_subtype<\\/a>]\"",
220
+ "[{\"full_name\":\"smul_eq_mul\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Action\\/Defs.lean\",\"def_pos\":[89,7],\"def_end_pos\":[89,18]},{\"full_name\":\"pow_two\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Defs.lean\",\"def_pos\":[679,32],\"def_end_pos\":[679,39]},{\"full_name\":\"Ideal.map_toCotangent_ker\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Cotangent.lean\",\"def_pos\":[63,9],\"def_end_pos\":[63,28]},{\"full_name\":\"Submodule.map_sup\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Submodule\\/Map.lean\",\"def_pos\":[239,9],\"def_end_pos\":[239,16]},{\"full_name\":\"Submodule.comap_map_eq\",\"def_path\":\"Mathlib\\/LinearAlgebra\\/Span.lean\",\"def_pos\":[917,9],\"def_end_pos\":[917,21]},{\"full_name\":\"Submodule.comap_top\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Submodule\\/Map.lean\",\"def_pos\":[252,9],\"def_end_pos\":[252,18]},{\"full_name\":\"Submodule.map_top\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Submodule\\/Range.lean\",\"def_pos\":[290,9],\"def_end_pos\":[290,16]},{\"full_name\":\"Submodule.range_subtype\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Submodule\\/Range.lean\",\"def_pos\":[294,9],\"def_end_pos\":[294,22]}]"
221
+ ],
222
+ "state_after": "no goals",
223
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\nM : Submodule R \u21a5(maximalIdeal R)\nH : Submodule.map (maximalIdeal R).toCotangent M = \u22a4\n\u22a2 maximalIdeal R \u2264 Submodule.map (Submodule.subtype (maximalIdeal R)) M \u2294 maximalIdeal R \u2022 maximalIdeal R",
224
+ "tactic": "rw [smul_eq_mul, \u2190 pow_two, \u2190 Ideal.map_toCotangent_ker, \u2190 Submodule.map_sup,\n \u2190 Submodule.comap_map_eq, H, Submodule.comap_top, Submodule.map_top, Submodule.range_subtype]"
225
+ },
226
+ {
227
+ "annotated_tactic": [
228
+ "\"rintro rfl\"",
229
+ "[]"
230
+ ],
231
+ "state_after": "R : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\n\u22a2 Submodule.map (maximalIdeal R).toCotangent \u22a4 = \u22a4",
232
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\nM : Submodule R \u21a5(maximalIdeal R)\n\u22a2 M = \u22a4 \u2192 Submodule.map (maximalIdeal R).toCotangent M = \u22a4",
233
+ "tactic": "rintro rfl"
234
+ },
235
+ {
236
+ "annotated_tactic": [
237
+ "\"simp [<a>Ideal.toCotangent_range<\\/a>]\"",
238
+ "[{\"full_name\":\"Ideal.toCotangent_range\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Cotangent.lean\",\"def_pos\":[85,9],\"def_end_pos\":[85,26]}]"
239
+ ],
240
+ "state_after": "no goals",
241
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\n\u22a2 Submodule.map (maximalIdeal R).toCotangent \u22a4 = \u22a4",
242
+ "tactic": "simp [Ideal.toCotangent_range]"
243
+ }
244
+ ],
245
+ "url": "https://github.com/leanprover-community/mathlib4"
246
+ },
247
+ "source_file": "Mathlib/RingTheory/Ideal/Cotangent.lean"
248
+ },
249
+ {
250
+ "error": "no internal trace for tactic 'rw [smul_eq_mul]'",
251
+ "full_name": "Ideal.isIdempotentElem_iff_of_fg",
252
+ "id": "Ideal.isIdempotentElem_iff_of_fg",
253
+ "reason": "import_failure",
254
+ "selection": {
255
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
256
+ "end": [
257
+ 35,
258
+ 76
259
+ ],
260
+ "file_path": "Mathlib/RingTheory/Ideal/IdempotentFG.lean",
261
+ "full_name": "Ideal.isIdempotentElem_iff_of_fg",
262
+ "start": [
263
+ 20,
264
+ 1
265
+ ],
266
+ "traced_tactics": [
267
+ {
268
+ "annotated_tactic": [
269
+ "\"constructor\"",
270
+ "[]"
271
+ ],
272
+ "state_after": "case mp\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\n\u22a2 IsIdempotentElem I \u2192 \u2203 e, IsIdempotentElem e \u2227 I = Submodule.span R {e}\n\ncase mpr\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\n\u22a2 (\u2203 e, IsIdempotentElem e \u2227 I = Submodule.span R {e}) \u2192 IsIdempotentElem I",
273
+ "state_before": "R : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\n\u22a2 IsIdempotentElem I \u2194 \u2203 e, IsIdempotentElem e \u2227 I = Submodule.span R {e}",
274
+ "tactic": "constructor"
275
+ },
276
+ {
277
+ "annotated_tactic": [
278
+ "\"intro e\"",
279
+ "[]"
280
+ ],
281
+ "state_after": "case mp\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\ne : IsIdempotentElem I\n\u22a2 \u2203 e, IsIdempotentElem e \u2227 I = Submodule.span R {e}",
282
+ "state_before": "case mp\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\n\u22a2 IsIdempotentElem I \u2192 \u2203 e, IsIdempotentElem e \u2227 I = Submodule.span R {e}",
283
+ "tactic": "intro e"
284
+ },
285
+ {
286
+ "annotated_tactic": [
287
+ "\"obtain \\u27e8r, hr, hr'\\u27e9 :=\\n <a>Submodule.exists_mem_and_smul_eq_self_of_fg_of_le_smul<\\/a> I I h\\n (by\\n rw [<a>smul_eq_mul<\\/a>]\\n exact e.ge)\"",
288
+ "[{\"full_name\":\"Submodule.exists_mem_and_smul_eq_self_of_fg_of_le_smul\",\"def_path\":\"Mathlib\\/RingTheory\\/Finiteness.lean\",\"def_pos\":[137,9],\"def_end_pos\":[137,53]},{\"full_name\":\"smul_eq_mul\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Action\\/Defs.lean\",\"def_pos\":[89,7],\"def_end_pos\":[89,18]}]"
289
+ ],
290
+ "state_after": "case mp.intro.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\ne : IsIdempotentElem I\nr : R\nhr : r \u2208 I\nhr' : \u2200 n \u2208 I, r \u2022 n = n\n\u22a2 \u2203 e, IsIdempotentElem e \u2227 I = Submodule.span R {e}",
291
+ "state_before": "case mp\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\ne : IsIdempotentElem I\n\u22a2 \u2203 e, IsIdempotentElem e \u2227 I = Submodule.span R {e}",
292
+ "tactic": "obtain \u27e8r, hr, hr'\u27e9 :=\n Submodule.exists_mem_and_smul_eq_self_of_fg_of_le_smul I I h\n (by\n rw [smul_eq_mul]\n exact e.ge)"
293
+ },
294
+ {
295
+ "annotated_tactic": [
296
+ "\"simp_rw [<a>smul_eq_mul<\\/a>] at hr'\"",
297
+ "[{\"full_name\":\"smul_eq_mul\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Action\\/Defs.lean\",\"def_pos\":[89,7],\"def_end_pos\":[89,18]}]"
298
+ ],
299
+ "state_after": "case mp.intro.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\ne : IsIdempotentElem I\nr : R\nhr : r \u2208 I\nhr' : \u2200 n \u2208 I, r * n = n\n\u22a2 \u2203 e, IsIdempotentElem e \u2227 I = Submodule.span R {e}",
300
+ "state_before": "case mp.intro.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\ne : IsIdempotentElem I\nr : R\nhr : r \u2208 I\nhr' : \u2200 n \u2208 I, r \u2022 n = n\n\u22a2 \u2203 e, IsIdempotentElem e \u2227 I = Submodule.span R {e}",
301
+ "tactic": "simp_rw [smul_eq_mul] at hr'"
302
+ },
303
+ {
304
+ "annotated_tactic": [
305
+ "\"refine \\u27e8r, hr' r hr, <a>antisymm<\\/a> ?_ ((<a>Submodule.span_singleton_le_iff_mem<\\/a> _ _).<a>mpr<\\/a> hr)\\u27e9\"",
306
+ "[{\"full_name\":\"antisymm\",\"def_path\":\"Mathlib\\/Init\\/Algebra\\/Classes.lean\",\"def_pos\":[307,9],\"def_end_pos\":[307,17]},{\"full_name\":\"Submodule.span_singleton_le_iff_mem\",\"def_path\":\"Mathlib\\/LinearAlgebra\\/Span.lean\",\"def_pos\":[624,9],\"def_end_pos\":[624,34]},{\"full_name\":\"Iff.mpr\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Core.lean\",\"def_pos\":[120,3],\"def_end_pos\":[120,6]}]"
307
+ ],
308
+ "state_after": "case mp.intro.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\ne : IsIdempotentElem I\nr : R\nhr : r \u2208 I\nhr' : \u2200 n \u2208 I, r * n = n\n\u22a2 I \u2264 Submodule.span R {r}",
309
+ "state_before": "case mp.intro.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\ne : IsIdempotentElem I\nr : R\nhr : r \u2208 I\nhr' : \u2200 n \u2208 I, r * n = n\n\u22a2 \u2203 e, IsIdempotentElem e \u2227 I = Submodule.span R {e}",
310
+ "tactic": "refine \u27e8r, hr' r hr, antisymm ?_ ((Submodule.span_singleton_le_iff_mem _ _).mpr hr)\u27e9"
311
+ },
312
+ {
313
+ "annotated_tactic": [
314
+ "\"intro x hx\"",
315
+ "[]"
316
+ ],
317
+ "state_after": "case mp.intro.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\ne : IsIdempotentElem I\nr : R\nhr : r \u2208 I\nhr' : \u2200 n \u2208 I, r * n = n\nx : R\nhx : x \u2208 I\n\u22a2 x \u2208 Submodule.span R {r}",
318
+ "state_before": "case mp.intro.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\ne : IsIdempotentElem I\nr : R\nhr : r \u2208 I\nhr' : \u2200 n \u2208 I, r * n = n\n\u22a2 I \u2264 Submodule.span R {r}",
319
+ "tactic": "intro x hx"
320
+ },
321
+ {
322
+ "annotated_tactic": [
323
+ "\"rw [\\u2190 hr' x hx]\"",
324
+ "[]"
325
+ ],
326
+ "state_after": "case mp.intro.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\ne : IsIdempotentElem I\nr : R\nhr : r \u2208 I\nhr' : \u2200 n \u2208 I, r * n = n\nx : R\nhx : x \u2208 I\n\u22a2 r * x \u2208 Submodule.span R {r}",
327
+ "state_before": "case mp.intro.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\ne : IsIdempotentElem I\nr : R\nhr : r \u2208 I\nhr' : \u2200 n \u2208 I, r * n = n\nx : R\nhx : x \u2208 I\n\u22a2 x \u2208 Submodule.span R {r}",
328
+ "tactic": "rw [\u2190 hr' x hx]"
329
+ },
330
+ {
331
+ "annotated_tactic": [
332
+ "\"exact Ideal.mem_span_singleton'.mpr \\u27e8_, <a>mul_comm<\\/a> _ _\\u27e9\"",
333
+ "[{\"full_name\":\"mul_comm\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Defs.lean\",\"def_pos\":[332,9],\"def_end_pos\":[332,17]}]"
334
+ ],
335
+ "state_after": "no goals",
336
+ "state_before": "case mp.intro.intro\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\ne : IsIdempotentElem I\nr : R\nhr : r \u2208 I\nhr' : \u2200 n \u2208 I, r * n = n\nx : R\nhx : x \u2208 I\n\u22a2 r * x \u2208 Submodule.span R {r}",
337
+ "tactic": "exact Ideal.mem_span_singleton'.mpr \u27e8_, mul_comm _ _\u27e9"
338
+ },
339
+ {
340
+ "annotated_tactic": [
341
+ "\"rw [<a>smul_eq_mul<\\/a>]\"",
342
+ "[{\"full_name\":\"smul_eq_mul\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Action\\/Defs.lean\",\"def_pos\":[89,7],\"def_end_pos\":[89,18]}]"
343
+ ],
344
+ "state_after": "R : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\ne : IsIdempotentElem I\n\u22a2 I \u2264 I * I",
345
+ "state_before": "R : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\ne : IsIdempotentElem I\n\u22a2 I \u2264 I \u2022 I",
346
+ "tactic": "rw [smul_eq_mul]"
347
+ },
348
+ {
349
+ "annotated_tactic": [
350
+ "\"exact e.ge\"",
351
+ "[]"
352
+ ],
353
+ "state_after": "no goals",
354
+ "state_before": "R : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\ne : IsIdempotentElem I\n\u22a2 I \u2264 I * I",
355
+ "tactic": "exact e.ge"
356
+ },
357
+ {
358
+ "annotated_tactic": [
359
+ "\"rintro \\u27e8e, he, rfl\\u27e9\"",
360
+ "[]"
361
+ ],
362
+ "state_after": "case mpr.intro.intro\nR : Type u_1\ninst\u271d : CommRing R\ne : R\nhe : IsIdempotentElem e\nh : FG (Submodule.span R {e})\n\u22a2 IsIdempotentElem (Submodule.span R {e})",
363
+ "state_before": "case mpr\nR : Type u_1\ninst\u271d : CommRing R\nI : Ideal R\nh : I.FG\n\u22a2 (\u2203 e, IsIdempotentElem e \u2227 I = Submodule.span R {e}) \u2192 IsIdempotentElem I",
364
+ "tactic": "rintro \u27e8e, he, rfl\u27e9"
365
+ },
366
+ {
367
+ "annotated_tactic": [
368
+ "\"simp [<a>IsIdempotentElem<\\/a>, <a>Ideal.span_singleton_mul_span_singleton<\\/a>, he.eq]\"",
369
+ "[{\"full_name\":\"IsIdempotentElem\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Idempotents.lean\",\"def_pos\":[39,5],\"def_end_pos\":[39,21]},{\"full_name\":\"Ideal.span_singleton_mul_span_singleton\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Operations.lean\",\"def_pos\":[514,9],\"def_end_pos\":[514,42]}]"
370
+ ],
371
+ "state_after": "no goals",
372
+ "state_before": "case mpr.intro.intro\nR : Type u_1\ninst\u271d : CommRing R\ne : R\nhe : IsIdempotentElem e\nh : FG (Submodule.span R {e})\n\u22a2 IsIdempotentElem (Submodule.span R {e})",
373
+ "tactic": "simp [IsIdempotentElem, Ideal.span_singleton_mul_span_singleton, he.eq]"
374
+ }
375
+ ],
376
+ "url": "https://github.com/leanprover-community/mathlib4"
377
+ },
378
+ "source_file": "Mathlib/RingTheory/Ideal/IdempotentFG.lean"
379
+ }
380
+ ],
381
+ "input_proofs": 22,
382
+ "input_units": 2,
383
+ "proofs": 13,
384
+ "published_proofs": 7,
385
+ "published_transitions": 16,
386
+ "replay_failures": [],
387
+ "transitions": 52,
388
+ "validation_failures": [
389
+ {
390
+ "errors": [
391
+ "internal transition boundary mismatch",
392
+ "internal transition boundary mismatch"
393
+ ],
394
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
395
+ "proof_id": "mathlib:AlgHom.ker_kerSquareLift",
396
+ "provenance": {
397
+ "selection": {
398
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
399
+ "end": [
400
+ 187,
401
+ 36
402
+ ],
403
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
404
+ "full_name": "AlgHom.ker_kerSquareLift",
405
+ "start": [
406
+ 183,
407
+ 1
408
+ ],
409
+ "traced_tactics": [
410
+ {
411
+ "annotated_tactic": [
412
+ "\"apply <a>le_antisymm<\\/a>\"",
413
+ "[{\"full_name\":\"le_antisymm\",\"def_path\":\"Mathlib\\/Init\\/Order\\/Defs.lean\",\"def_pos\":[188,9],\"def_end_pos\":[188,20]}]"
414
+ ],
415
+ "state_after": "case a\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u00b9\u2070 : CommRing R\ninst\u271d\u2079 : CommSemiring S\ninst\u271d\u2078 : Algebra S R\ninst\u271d\u2077 : CommSemiring S'\ninst\u271d\u2076 : Algebra S' R\ninst\u271d\u2075 : Algebra S S'\ninst\u271d\u2074 : IsScalarTower S S' R\nI : Ideal R\nA : Type u_1\nB : Type u_2\ninst\u271d\u00b3 : CommRing A\ninst\u271d\u00b2 : CommRing B\ninst\u271d\u00b9 : Algebra R A\ninst\u271d : Algebra R B\nf : A \u2192\u2090[R] B\n\u22a2 RingHom.ker f.kerSquareLift.toRingHom \u2264 (RingHom.ker f.toRingHom).cotangentIdeal\n\ncase a\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u00b9\u2070 : CommRing R\ninst\u271d\u2079 : CommSemiring S\ninst\u271d\u2078 : Algebra S R\ninst\u271d\u2077 : CommSemiring S'\ninst\u271d\u2076 : Algebra S' R\ninst\u271d\u2075 : Algebra S S'\ninst\u271d\u2074 : IsScalarTower S S' R\nI : Ideal R\nA : Type u_1\nB : Type u_2\ninst\u271d\u00b3 : CommRing A\ninst\u271d\u00b2 : CommRing B\ninst\u271d\u00b9 : Algebra R A\ninst\u271d : Algebra R B\nf : A \u2192\u2090[R] B\n\u22a2 (RingHom.ker f.toRingHom).cotangentIdeal \u2264 RingHom.ker f.kerSquareLift.toRingHom",
416
+ "state_before": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u00b9\u2070 : CommRing R\ninst\u271d\u2079 : CommSemiring S\ninst\u271d\u2078 : Algebra S R\ninst\u271d\u2077 : CommSemiring S'\ninst\u271d\u2076 : Algebra S' R\ninst\u271d\u2075 : Algebra S S'\ninst\u271d\u2074 : IsScalarTower S S' R\nI : Ideal R\nA : Type u_1\nB : Type u_2\ninst\u271d\u00b3 : CommRing A\ninst\u271d\u00b2 : CommRing B\ninst\u271d\u00b9 : Algebra R A\ninst\u271d : Algebra R B\nf : A \u2192\u2090[R] B\n\u22a2 RingHom.ker f.kerSquareLift.toRingHom = (RingHom.ker f.toRingHom).cotangentIdeal",
417
+ "tactic": "apply le_antisymm"
418
+ },
419
+ {
420
+ "annotated_tactic": [
421
+ "\"intro x hx\"",
422
+ "[]"
423
+ ],
424
+ "state_after": "case a\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u00b9\u2070 : CommRing R\ninst\u271d\u2079 : CommSemiring S\ninst\u271d\u2078 : Algebra S R\ninst\u271d\u2077 : CommSemiring S'\ninst\u271d\u2076 : Algebra S' R\ninst\u271d\u2075 : Algebra S S'\ninst\u271d\u2074 : IsScalarTower S S' R\nI : Ideal R\nA : Type u_1\nB : Type u_2\ninst\u271d\u00b3 : CommRing A\ninst\u271d\u00b2 : CommRing B\ninst\u271d\u00b9 : Algebra R A\ninst\u271d : Algebra R B\nf : A \u2192\u2090[R] B\nx : A \u29f8 RingHom.ker f.toRingHom ^ 2\nhx : x \u2208 RingHom.ker f.kerSquareLift.toRingHom\n\u22a2 x \u2208 (RingHom.ker f.toRingHom).cotangentIdeal",
425
+ "state_before": "case a\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u00b9\u2070 : CommRing R\ninst\u271d\u2079 : CommSemiring S\ninst\u271d\u2078 : Algebra S R\ninst\u271d\u2077 : CommSemiring S'\ninst\u271d\u2076 : Algebra S' R\ninst\u271d\u2075 : Algebra S S'\ninst\u271d\u2074 : IsScalarTower S S' R\nI : Ideal R\nA : Type u_1\nB : Type u_2\ninst\u271d\u00b3 : CommRing A\ninst\u271d\u00b2 : CommRing B\ninst\u271d\u00b9 : Algebra R A\ninst\u271d : Algebra R B\nf : A \u2192\u2090[R] B\n\u22a2 RingHom.ker f.kerSquareLift.toRingHom \u2264 (RingHom.ker f.toRingHom).cotangentIdeal",
426
+ "tactic": "intro x hx"
427
+ },
428
+ {
429
+ "annotated_tactic": [
430
+ "\"obtain \\u27e8x, rfl\\u27e9 := <a>Ideal.Quotient.mk_surjective<\\/a> x\"",
431
+ "[{\"full_name\":\"Ideal.Quotient.mk_surjective\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[159,9],\"def_end_pos\":[159,22]}]"
432
+ ],
433
+ "state_after": "case a.intro\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u00b9\u2070 : CommRing R\ninst\u271d\u2079 : CommSemiring S\ninst\u271d\u2078 : Algebra S R\ninst\u271d\u2077 : CommSemiring S'\ninst\u271d\u2076 : Algebra S' R\ninst\u271d\u2075 : Algebra S S'\ninst\u271d\u2074 : IsScalarTower S S' R\nI : Ideal R\nA : Type u_1\nB : Type u_2\ninst\u271d\u00b3 : CommRing A\ninst\u271d\u00b2 : CommRing B\ninst\u271d\u00b9 : Algebra R A\ninst\u271d : Algebra R B\nf : A \u2192\u2090[R] B\nx : A\nhx : (Quotient.mk (RingHom.ker f.toRingHom ^ 2)) x \u2208 RingHom.ker f.kerSquareLift.toRingHom\n\u22a2 (Quotient.mk (RingHom.ker f.toRingHom ^ 2)) x \u2208 (RingHom.ker f.toRingHom).cotangentIdeal",
434
+ "state_before": "case a\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u00b9\u2070 : CommRing R\ninst\u271d\u2079 : CommSemiring S\ninst\u271d\u2078 : Algebra S R\ninst\u271d\u2077 : CommSemiring S'\ninst\u271d\u2076 : Algebra S' R\ninst\u271d\u2075 : Algebra S S'\ninst\u271d\u2074 : IsScalarTower S S' R\nI : Ideal R\nA : Type u_1\nB : Type u_2\ninst\u271d\u00b3 : CommRing A\ninst\u271d\u00b2 : CommRing B\ninst\u271d\u00b9 : Algebra R A\ninst\u271d : Algebra R B\nf : A \u2192\u2090[R] B\nx : A \u29f8 RingHom.ker f.toRingHom ^ 2\nhx : x \u2208 RingHom.ker f.kerSquareLift.toRingHom\n\u22a2 x \u2208 (RingHom.ker f.toRingHom).cotangentIdeal",
435
+ "tactic": "obtain \u27e8x, rfl\u27e9 := Ideal.Quotient.mk_surjective x"
436
+ },
437
+ {
438
+ "annotated_tactic": [
439
+ "\"exact \\u27e8x, hx, <a>rfl<\\/a>\\u27e9\"",
440
+ "[{\"full_name\":\"rfl\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[294,22],\"def_end_pos\":[294,25]}]"
441
+ ],
442
+ "state_after": "no goals",
443
+ "state_before": "case a.intro\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u00b9\u2070 : CommRing R\ninst\u271d\u2079 : CommSemiring S\ninst\u271d\u2078 : Algebra S R\ninst\u271d\u2077 : CommSemiring S'\ninst\u271d\u2076 : Algebra S' R\ninst\u271d\u2075 : Algebra S S'\ninst\u271d\u2074 : IsScalarTower S S' R\nI : Ideal R\nA : Type u_1\nB : Type u_2\ninst\u271d\u00b3 : CommRing A\ninst\u271d\u00b2 : CommRing B\ninst\u271d\u00b9 : Algebra R A\ninst\u271d : Algebra R B\nf : A \u2192\u2090[R] B\nx : A\nhx : (Quotient.mk (RingHom.ker f.toRingHom ^ 2)) x \u2208 RingHom.ker f.kerSquareLift.toRingHom\n\u22a2 (Quotient.mk (RingHom.ker f.toRingHom ^ 2)) x \u2208 (RingHom.ker f.toRingHom).cotangentIdeal",
444
+ "tactic": "exact \u27e8x, hx, rfl\u27e9"
445
+ },
446
+ {
447
+ "annotated_tactic": [
448
+ "\"rintro _ \\u27e8x, hx, rfl\\u27e9\"",
449
+ "[]"
450
+ ],
451
+ "state_after": "case a.intro.intro\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u00b9\u2070 : CommRing R\ninst\u271d\u2079 : CommSemiring S\ninst\u271d\u2078 : Algebra S R\ninst\u271d\u2077 : CommSemiring S'\ninst\u271d\u2076 : Algebra S' R\ninst\u271d\u2075 : Algebra S S'\ninst\u271d\u2074 : IsScalarTower S S' R\nI : Ideal R\nA : Type u_1\nB : Type u_2\ninst\u271d\u00b3 : CommRing A\ninst\u271d\u00b2 : CommRing B\ninst\u271d\u00b9 : Algebra R A\ninst\u271d : Algebra R B\nf : A \u2192\u2090[R] B\nx : A\nhx : x \u2208 \u2191(RingHom.ker f.toRingHom)\n\u22a2 (Quotient.mk (RingHom.ker f.toRingHom ^ 2)).toSemilinearMap x \u2208 RingHom.ker f.kerSquareLift.toRingHom",
452
+ "state_before": "case a\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u00b9\u2070 : CommRing R\ninst\u271d\u2079 : CommSemiring S\ninst\u271d\u2078 : Algebra S R\ninst\u271d\u2077 : CommSemiring S'\ninst\u271d\u2076 : Algebra S' R\ninst\u271d\u2075 : Algebra S S'\ninst\u271d\u2074 : IsScalarTower S S' R\nI : Ideal R\nA : Type u_1\nB : Type u_2\ninst\u271d\u00b3 : CommRing A\ninst\u271d\u00b2 : CommRing B\ninst\u271d\u00b9 : Algebra R A\ninst\u271d : Algebra R B\nf : A \u2192\u2090[R] B\n\u22a2 (RingHom.ker f.toRingHom).cotangentIdeal \u2264 RingHom.ker f.kerSquareLift.toRingHom",
453
+ "tactic": "rintro _ \u27e8x, hx, rfl\u27e9"
454
+ },
455
+ {
456
+ "annotated_tactic": [
457
+ "\"exact hx\"",
458
+ "[]"
459
+ ],
460
+ "state_after": "no goals",
461
+ "state_before": "case a.intro.intro\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u00b9\u2070 : CommRing R\ninst\u271d\u2079 : CommSemiring S\ninst\u271d\u2078 : Algebra S R\ninst\u271d\u2077 : CommSemiring S'\ninst\u271d\u2076 : Algebra S' R\ninst\u271d\u2075 : Algebra S S'\ninst\u271d\u2074 : IsScalarTower S S' R\nI : Ideal R\nA : Type u_1\nB : Type u_2\ninst\u271d\u00b3 : CommRing A\ninst\u271d\u00b2 : CommRing B\ninst\u271d\u00b9 : Algebra R A\ninst\u271d : Algebra R B\nf : A \u2192\u2090[R] B\nx : A\nhx : x \u2208 \u2191(RingHom.ker f.toRingHom)\n\u22a2 (Quotient.mk (RingHom.ker f.toRingHom ^ 2)).toSemilinearMap x \u2208 RingHom.ker f.kerSquareLift.toRingHom",
462
+ "tactic": "exact hx"
463
+ }
464
+ ],
465
+ "url": "https://github.com/leanprover-community/mathlib4"
466
+ }
467
+ },
468
+ "theorem_name": "AlgHom.ker_kerSquareLift"
469
+ },
470
+ {
471
+ "errors": [
472
+ "internal transition boundary mismatch",
473
+ "internal transition boundary mismatch"
474
+ ],
475
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
476
+ "proof_id": "mathlib:Ideal.cotangentIdeal_square",
477
+ "provenance": {
478
+ "selection": {
479
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
480
+ "end": [
481
+ 128,
482
+ 41
483
+ ],
484
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
485
+ "full_name": "Ideal.cotangentIdeal_square",
486
+ "start": [
487
+ 122,
488
+ 1
489
+ ],
490
+ "traced_tactics": [
491
+ {
492
+ "annotated_tactic": [
493
+ "\"rw [<a>eq_bot_iff<\\/a>, <a>pow_two<\\/a> I.cotangentIdeal, \\u2190 <a>smul_eq_mul<\\/a>]\"",
494
+ "[{\"full_name\":\"eq_bot_iff\",\"def_path\":\"Mathlib\\/Order\\/BoundedOrder.lean\",\"def_pos\":[331,9],\"def_end_pos\":[331,19]},{\"full_name\":\"pow_two\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Defs.lean\",\"def_pos\":[679,32],\"def_end_pos\":[679,39]},{\"full_name\":\"smul_eq_mul\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Action\\/Defs.lean\",\"def_pos\":[89,7],\"def_end_pos\":[89,18]}]"
495
+ ],
496
+ "state_after": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\n\u22a2 I.cotangentIdeal \u2022 I.cotangentIdeal \u2264 \u22a5",
497
+ "state_before": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\n\u22a2 I.cotangentIdeal ^ 2 = \u22a5",
498
+ "tactic": "rw [eq_bot_iff, pow_two I.cotangentIdeal, \u2190 smul_eq_mul]"
499
+ },
500
+ {
501
+ "annotated_tactic": [
502
+ "\"intro x hx\"",
503
+ "[]"
504
+ ],
505
+ "state_after": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\nx : R \u29f8 I ^ 2\nhx : x \u2208 I.cotangentIdeal \u2022 I.cotangentIdeal\n\u22a2 x \u2208 \u22a5",
506
+ "state_before": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\n\u22a2 I.cotangentIdeal \u2022 I.cotangentIdeal \u2264 \u22a5",
507
+ "tactic": "intro x hx"
508
+ },
509
+ {
510
+ "annotated_tactic": [
511
+ "\"refine <a>Submodule.smul_induction_on<\\/a> hx ?_ ?_\"",
512
+ "[{\"full_name\":\"Submodule.smul_induction_on\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Operations.lean\",\"def_pos\":[142,9],\"def_end_pos\":[142,26]}]"
513
+ ],
514
+ "state_after": "case refine_1\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\nx : R \u29f8 I ^ 2\nhx : x \u2208 I.cotangentIdeal \u2022 I.cotangentIdeal\n\u22a2 \u2200 r \u2208 I.cotangentIdeal, \u2200 n \u2208 I.cotangentIdeal, r \u2022 n \u2208 \u22a5\n\ncase refine_2\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\nx : R \u29f8 I ^ 2\nhx : x \u2208 I.cotangentIdeal \u2022 I.cotangentIdeal\n\u22a2 \u2200 (x y : R \u29f8 I ^ 2), x \u2208 \u22a5 \u2192 y \u2208 \u22a5 \u2192 x + y \u2208 \u22a5",
515
+ "state_before": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\nx : R \u29f8 I ^ 2\nhx : x \u2208 I.cotangentIdeal \u2022 I.cotangentIdeal\n\u22a2 x \u2208 \u22a5",
516
+ "tactic": "refine Submodule.smul_induction_on hx ?_ ?_"
517
+ },
518
+ {
519
+ "annotated_tactic": [
520
+ "\"rintro _ \\u27e8x, hx, rfl\\u27e9 _ \\u27e8y, hy, rfl\\u27e9\"",
521
+ "[]"
522
+ ],
523
+ "state_after": "case refine_1.intro.intro.intro.intro\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\nx\u271d : R \u29f8 I ^ 2\nhx\u271d : x\u271d \u2208 I.cotangentIdeal \u2022 I.cotangentIdeal\nx : R\nhx : x \u2208 \u2191I\ny : R\nhy : y \u2208 \u2191I\n\u22a2 (Quotient.mk (I ^ 2)).toSemilinearMap x \u2022 (Quotient.mk (I ^ 2)).toSemilinearMap y \u2208 \u22a5",
524
+ "state_before": "case refine_1\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\nx : R \u29f8 I ^ 2\nhx : x \u2208 I.cotangentIdeal \u2022 I.cotangentIdeal\n\u22a2 \u2200 r \u2208 I.cotangentIdeal, \u2200 n \u2208 I.cotangentIdeal, r \u2022 n \u2208 \u22a5",
525
+ "tactic": "rintro _ \u27e8x, hx, rfl\u27e9 _ \u27e8y, hy, rfl\u27e9"
526
+ },
527
+ {
528
+ "annotated_tactic": [
529
+ "\"apply (<a>Submodule.Quotient.eq<\\/a> _).<a>mpr<\\/a> _\"",
530
+ "[{\"full_name\":\"Submodule.Quotient.eq\",\"def_path\":\"Mathlib\\/LinearAlgebra\\/Quotient.lean\",\"def_pos\":[81,19],\"def_end_pos\":[81,21]},{\"full_name\":\"Iff.mpr\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Core.lean\",\"def_pos\":[120,3],\"def_end_pos\":[120,6]}]"
531
+ ],
532
+ "state_after": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\nx\u271d : R \u29f8 I ^ 2\nhx\u271d : x\u271d \u2208 I.cotangentIdeal \u2022 I.cotangentIdeal\nx : R\nhx : x \u2208 \u2191I\ny : R\nhy : y \u2208 \u2191I\n\u22a2 (fun x x_1 => x * x_1) x y - 0 \u2208 I ^ 2",
533
+ "state_before": "case refine_1.intro.intro.intro.intro\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\nx\u271d : R \u29f8 I ^ 2\nhx\u271d : x\u271d \u2208 I.cotangentIdeal \u2022 I.cotangentIdeal\nx : R\nhx : x \u2208 \u2191I\ny : R\nhy : y \u2208 \u2191I\n\u22a2 (Quotient.mk (I ^ 2)).toSemilinearMap x \u2022 (Quotient.mk (I ^ 2)).toSemilinearMap y \u2208 \u22a5",
534
+ "tactic": "apply (Submodule.Quotient.eq _).mpr _"
535
+ },
536
+ {
537
+ "annotated_tactic": [
538
+ "\"rw [<a>sub_zero<\\/a>, <a>pow_two<\\/a>]\"",
539
+ "[{\"full_name\":\"sub_zero\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Basic.lean\",\"def_pos\":[489,3],\"def_end_pos\":[489,14]},{\"full_name\":\"pow_two\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Defs.lean\",\"def_pos\":[679,32],\"def_end_pos\":[679,39]}]"
540
+ ],
541
+ "state_after": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\nx\u271d : R \u29f8 I ^ 2\nhx\u271d : x\u271d \u2208 I.cotangentIdeal \u2022 I.cotangentIdeal\nx : R\nhx : x \u2208 \u2191I\ny : R\nhy : y \u2208 \u2191I\n\u22a2 (fun x x_1 => x * x_1) x y \u2208 I * I",
542
+ "state_before": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\nx\u271d : R \u29f8 I ^ 2\nhx\u271d : x\u271d \u2208 I.cotangentIdeal \u2022 I.cotangentIdeal\nx : R\nhx : x \u2208 \u2191I\ny : R\nhy : y \u2208 \u2191I\n\u22a2 (fun x x_1 => x * x_1) x y - 0 \u2208 I ^ 2",
543
+ "tactic": "rw [sub_zero, pow_two]"
544
+ },
545
+ {
546
+ "annotated_tactic": [
547
+ "\"exact <a>Ideal.mul_mem_mul<\\/a> hx hy\"",
548
+ "[{\"full_name\":\"Ideal.mul_mem_mul\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Operations.lean\",\"def_pos\":[434,9],\"def_end_pos\":[434,20]}]"
549
+ ],
550
+ "state_after": "no goals",
551
+ "state_before": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\nx\u271d : R \u29f8 I ^ 2\nhx\u271d : x\u271d \u2208 I.cotangentIdeal \u2022 I.cotangentIdeal\nx : R\nhx : x \u2208 \u2191I\ny : R\nhy : y \u2208 \u2191I\n\u22a2 (fun x x_1 => x * x_1) x y \u2208 I * I",
552
+ "tactic": "exact Ideal.mul_mem_mul hx hy"
553
+ },
554
+ {
555
+ "annotated_tactic": [
556
+ "\"intro x y hx hy\"",
557
+ "[]"
558
+ ],
559
+ "state_after": "case refine_2\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\nx\u271d : R \u29f8 I ^ 2\nhx\u271d : x\u271d \u2208 I.cotangentIdeal \u2022 I.cotangentIdeal\nx y : R \u29f8 I ^ 2\nhx : x \u2208 \u22a5\nhy : y \u2208 \u22a5\n\u22a2 x + y \u2208 \u22a5",
560
+ "state_before": "case refine_2\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\nx : R \u29f8 I ^ 2\nhx : x \u2208 I.cotangentIdeal \u2022 I.cotangentIdeal\n\u22a2 \u2200 (x y : R \u29f8 I ^ 2), x \u2208 \u22a5 \u2192 y \u2208 \u22a5 \u2192 x + y \u2208 \u22a5",
561
+ "tactic": "intro x y hx hy"
562
+ },
563
+ {
564
+ "annotated_tactic": [
565
+ "\"exact <a>add_mem<\\/a> hx hy\"",
566
+ "[{\"full_name\":\"AddMemClass.add_mem\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Subsemigroup\\/Basic.lean\",\"def_pos\":[72,3],\"def_end_pos\":[72,10]}]"
567
+ ],
568
+ "state_after": "no goals",
569
+ "state_before": "case refine_2\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI\u271d I : Ideal R\nx\u271d : R \u29f8 I ^ 2\nhx\u271d : x\u271d \u2208 I.cotangentIdeal \u2022 I.cotangentIdeal\nx y : R \u29f8 I ^ 2\nhx : x \u2208 \u22a5\nhy : y \u2208 \u22a5\n\u22a2 x + y \u2208 \u22a5",
570
+ "tactic": "exact add_mem hx hy"
571
+ }
572
+ ],
573
+ "url": "https://github.com/leanprover-community/mathlib4"
574
+ }
575
+ },
576
+ "theorem_name": "Ideal.cotangentIdeal_square"
577
+ },
578
+ {
579
+ "errors": [
580
+ "internal transition boundary mismatch",
581
+ "internal transition boundary mismatch"
582
+ ],
583
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
584
+ "proof_id": "mathlib:Ideal.cotangent_subsingleton_iff",
585
+ "provenance": {
586
+ "selection": {
587
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
588
+ "end": [
589
+ 96,
590
+ 88
591
+ ],
592
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
593
+ "full_name": "Ideal.cotangent_subsingleton_iff",
594
+ "start": [
595
+ 88,
596
+ 1
597
+ ],
598
+ "traced_tactics": [
599
+ {
600
+ "annotated_tactic": [
601
+ "\"constructor\"",
602
+ "[]"
603
+ ],
604
+ "state_after": "case mp\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\n\u22a2 Subsingleton I.Cotangent \u2192 IsIdempotentElem I\n\ncase mpr\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\n\u22a2 IsIdempotentElem I \u2192 Subsingleton I.Cotangent",
605
+ "state_before": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\n\u22a2 Subsingleton I.Cotangent \u2194 IsIdempotentElem I",
606
+ "tactic": "constructor"
607
+ },
608
+ {
609
+ "annotated_tactic": [
610
+ "\"intro H\"",
611
+ "[]"
612
+ ],
613
+ "state_after": "case mp\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\nH : Subsingleton I.Cotangent\n\u22a2 IsIdempotentElem I",
614
+ "state_before": "case mp\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\n\u22a2 Subsingleton I.Cotangent \u2192 IsIdempotentElem I",
615
+ "tactic": "intro H"
616
+ },
617
+ {
618
+ "annotated_tactic": [
619
+ "\"refine (<a>pow_two<\\/a> I).symm.trans (<a>le_antisymm<\\/a> (<a>Ideal.pow_le_self<\\/a> <a>two_ne_zero<\\/a>) ?_)\"",
620
+ "[{\"full_name\":\"pow_two\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Defs.lean\",\"def_pos\":[679,32],\"def_end_pos\":[679,39]},{\"full_name\":\"le_antisymm\",\"def_path\":\"Mathlib\\/Init\\/Order\\/Defs.lean\",\"def_pos\":[188,9],\"def_end_pos\":[188,20]},{\"full_name\":\"Ideal.pow_le_self\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Operations.lean\",\"def_pos\":[784,9],\"def_end_pos\":[784,20]},{\"full_name\":\"two_ne_zero\",\"def_path\":\"Mathlib\\/Algebra\\/NeZero.lean\",\"def_pos\":[65,7],\"def_end_pos\":[65,18]}]"
621
+ ],
622
+ "state_after": "case mp\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\nH : Subsingleton I.Cotangent\n\u22a2 I \u2264 I ^ 2",
623
+ "state_before": "case mp\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\nH : Subsingleton I.Cotangent\n\u22a2 IsIdempotentElem I",
624
+ "tactic": "refine (pow_two I).symm.trans (le_antisymm (Ideal.pow_le_self two_ne_zero) ?_)"
625
+ },
626
+ {
627
+ "annotated_tactic": [
628
+ "\"exact fun x hx => (I.toCotangent_eq_zero \\u27e8x, hx\\u27e9).<a>mp<\\/a> (<a>Subsingleton.elim<\\/a> _ _)\"",
629
+ "[{\"full_name\":\"Iff.mp\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Core.lean\",\"def_pos\":[118,3],\"def_end_pos\":[118,5]},{\"full_name\":\"Subsingleton.elim\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Core.lean\",\"def_pos\":[1015,19],\"def_end_pos\":[1015,36]}]"
630
+ ],
631
+ "state_after": "no goals",
632
+ "state_before": "case mp\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\nH : Subsingleton I.Cotangent\n\u22a2 I \u2264 I ^ 2",
633
+ "tactic": "exact fun x hx => (I.toCotangent_eq_zero \u27e8x, hx\u27e9).mp (Subsingleton.elim _ _)"
634
+ },
635
+ {
636
+ "annotated_tactic": [
637
+ "\"exact fun e =>\\n \\u27e8fun x y =>\\n <a>Quotient.inductionOn\\u2082'<\\/a> x y fun x y =>\\n I.toCotangent_eq.mpr <| ((<a>pow_two<\\/a> I).<a>trans<\\/a> e).<a>symm<\\/a> \\u25b8 I.sub_mem x.prop y.prop\\u27e9\"",
638
+ "[{\"full_name\":\"Quotient.inductionOn\\u2082'\",\"def_path\":\"Mathlib\\/Data\\/Quot.lean\",\"def_pos\":[685,19],\"def_end_pos\":[685,32]},{\"full_name\":\"pow_two\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Defs.lean\",\"def_pos\":[679,32],\"def_end_pos\":[679,39]},{\"full_name\":\"Eq.trans\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[335,9],\"def_end_pos\":[335,17]},{\"full_name\":\"Eq.symm\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[323,9],\"def_end_pos\":[323,16]}]"
639
+ ],
640
+ "state_after": "no goals",
641
+ "state_before": "case mpr\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\n\u22a2 IsIdempotentElem I \u2192 Subsingleton I.Cotangent",
642
+ "tactic": "exact fun e =>\n \u27e8fun x y =>\n Quotient.inductionOn\u2082' x y fun x y =>\n I.toCotangent_eq.mpr <| ((pow_two I).trans e).symm \u25b8 I.sub_mem x.prop y.prop\u27e9"
643
+ }
644
+ ],
645
+ "url": "https://github.com/leanprover-community/mathlib4"
646
+ }
647
+ },
648
+ "theorem_name": "Ideal.cotangent_subsingleton_iff"
649
+ },
650
+ {
651
+ "errors": [
652
+ "internal transition boundary mismatch",
653
+ "internal transition boundary mismatch"
654
+ ],
655
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
656
+ "proof_id": "mathlib:Ideal.to_quotient_square_range",
657
+ "provenance": {
658
+ "selection": {
659
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
660
+ "end": [
661
+ 135,
662
+ 94
663
+ ],
664
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
665
+ "full_name": "Ideal.to_quotient_square_range",
666
+ "start": [
667
+ 131,
668
+ 1
669
+ ],
670
+ "traced_tactics": [
671
+ {
672
+ "annotated_tactic": [
673
+ "\"trans <a>LinearMap.range<\\/a> (I.cotangentToQuotientSquare.comp I.toCotangent)\"",
674
+ "[{\"full_name\":\"LinearMap.range\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Submodule\\/Range.lean\",\"def_pos\":[58,5],\"def_end_pos\":[58,10]}]"
675
+ ],
676
+ "state_after": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\n\u22a2 LinearMap.range I.cotangentToQuotientSquare = LinearMap.range (I.cotangentToQuotientSquare \u2218\u2097 I.toCotangent)\n\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\n\u22a2 LinearMap.range (I.cotangentToQuotientSquare \u2218\u2097 I.toCotangent) = Submodule.restrictScalars R I.cotangentIdeal",
677
+ "state_before": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\n\u22a2 LinearMap.range I.cotangentToQuotientSquare = Submodule.restrictScalars R I.cotangentIdeal",
678
+ "tactic": "trans LinearMap.range (I.cotangentToQuotientSquare.comp I.toCotangent)"
679
+ },
680
+ {
681
+ "annotated_tactic": [
682
+ "\"rw [<a>LinearMap.range_comp<\\/a>, I.toCotangent_range, <a>Submodule.map_top<\\/a>]\"",
683
+ "[{\"full_name\":\"LinearMap.range_comp\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Submodule\\/Range.lean\",\"def_pos\":[90,9],\"def_end_pos\":[90,19]},{\"full_name\":\"Submodule.map_top\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Submodule\\/Range.lean\",\"def_pos\":[290,9],\"def_end_pos\":[290,16]}]"
684
+ ],
685
+ "state_after": "no goals",
686
+ "state_before": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\n\u22a2 LinearMap.range I.cotangentToQuotientSquare = LinearMap.range (I.cotangentToQuotientSquare \u2218\u2097 I.toCotangent)",
687
+ "tactic": "rw [LinearMap.range_comp, I.toCotangent_range, Submodule.map_top]"
688
+ },
689
+ {
690
+ "annotated_tactic": [
691
+ "\"rw [<a>to_quotient_square_comp_toCotangent<\\/a>, <a>LinearMap.range_comp<\\/a>, I.range_subtype]\"",
692
+ "[{\"full_name\":\"Ideal.to_quotient_square_comp_toCotangent\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Cotangent.lean\",\"def_pos\":[107,9],\"def_end_pos\":[107,44]},{\"full_name\":\"LinearMap.range_comp\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Submodule\\/Range.lean\",\"def_pos\":[90,9],\"def_end_pos\":[90,19]}]"
693
+ ],
694
+ "state_after": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\n\u22a2 Submodule.map (Submodule.mkQ (I ^ 2)) I = Submodule.restrictScalars R I.cotangentIdeal",
695
+ "state_before": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\n\u22a2 LinearMap.range (I.cotangentToQuotientSquare \u2218\u2097 I.toCotangent) = Submodule.restrictScalars R I.cotangentIdeal",
696
+ "tactic": "rw [to_quotient_square_comp_toCotangent, LinearMap.range_comp, I.range_subtype]"
697
+ },
698
+ {
699
+ "annotated_tactic": [
700
+ "\"ext\"",
701
+ "[]"
702
+ ],
703
+ "state_after": "case h\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\nx\u271d : R \u29f8 I ^ 2\n\u22a2 x\u271d \u2208 Submodule.map (Submodule.mkQ (I ^ 2)) I \u2194 x\u271d \u2208 Submodule.restrictScalars R I.cotangentIdeal",
704
+ "state_before": "R : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\n\u22a2 Submodule.map (Submodule.mkQ (I ^ 2)) I = Submodule.restrictScalars R I.cotangentIdeal",
705
+ "tactic": "ext"
706
+ },
707
+ {
708
+ "annotated_tactic": [
709
+ "\"rfl\"",
710
+ "[]"
711
+ ],
712
+ "state_after": "no goals",
713
+ "state_before": "case h\nR : Type u\nS : Type v\nS' : Type w\ninst\u271d\u2076 : CommRing R\ninst\u271d\u2075 : CommSemiring S\ninst\u271d\u2074 : Algebra S R\ninst\u271d\u00b3 : CommSemiring S'\ninst\u271d\u00b2 : Algebra S' R\ninst\u271d\u00b9 : Algebra S S'\ninst\u271d : IsScalarTower S S' R\nI : Ideal R\nx\u271d : R \u29f8 I ^ 2\n\u22a2 x\u271d \u2208 Submodule.map (Submodule.mkQ (I ^ 2)) I \u2194 x\u271d \u2208 Submodule.restrictScalars R I.cotangentIdeal",
714
+ "tactic": "rfl"
715
+ }
716
+ ],
717
+ "url": "https://github.com/leanprover-community/mathlib4"
718
+ }
719
+ },
720
+ "theorem_name": "Ideal.to_quotient_square_range"
721
+ },
722
+ {
723
+ "errors": [
724
+ "internal transition boundary mismatch",
725
+ "internal transition boundary mismatch"
726
+ ],
727
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
728
+ "proof_id": "mathlib:LocalRing.CotangentSpace.span_image_eq_top_iff",
729
+ "provenance": {
730
+ "selection": {
731
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
732
+ "end": [
733
+ 259,
734
+ 39
735
+ ],
736
+ "file_path": "Mathlib/RingTheory/Ideal/Cotangent.lean",
737
+ "full_name": "LocalRing.CotangentSpace.span_image_eq_top_iff",
738
+ "start": [
739
+ 253,
740
+ 1
741
+ ],
742
+ "traced_tactics": [
743
+ {
744
+ "annotated_tactic": [
745
+ "\"rw [\\u2190 <a>map_eq_top_iff<\\/a>, \\u2190 (<a>Submodule.restrictScalars_injective<\\/a> R ..).<a>eq_iff<\\/a>,\\n <a>Submodule.restrictScalars_span<\\/a>]\"",
746
+ "[{\"full_name\":\"LocalRing.CotangentSpace.map_eq_top_iff\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Cotangent.lean\",\"def_pos\":[243,7],\"def_end_pos\":[243,36]},{\"full_name\":\"Submodule.restrictScalars_injective\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Submodule\\/RestrictScalars.lean\",\"def_pos\":[60,9],\"def_end_pos\":[60,34]},{\"full_name\":\"Function.Injective.eq_iff\",\"def_path\":\"Mathlib\\/Logic\\/Function\\/Basic.lean\",\"def_pos\":[85,9],\"def_end_pos\":[85,25]},{\"full_name\":\"Submodule.restrictScalars_span\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Tower.lean\",\"def_pos\":[268,9],\"def_end_pos\":[268,29]}]"
747
+ ],
748
+ "state_after": "R : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\ns : Set \u21a5(maximalIdeal R)\n\u22a2 Submodule.span R (\u21d1(maximalIdeal R).toCotangent '' s) = Submodule.restrictScalars R \u22a4 \u2194\n Submodule.map (maximalIdeal R).toCotangent (Submodule.span R s) = \u22a4\n\ncase hsur\nR : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\ns : Set \u21a5(maximalIdeal R)\n\u22a2 Function.Surjective \u21d1(algebraMap R (ResidueField R))",
749
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\ns : Set \u21a5(maximalIdeal R)\n\u22a2 Submodule.span (ResidueField R) (\u21d1(maximalIdeal R).toCotangent '' s) = \u22a4 \u2194 Submodule.span R s = \u22a4",
750
+ "tactic": "rw [\u2190 map_eq_top_iff, \u2190 (Submodule.restrictScalars_injective R ..).eq_iff,\n Submodule.restrictScalars_span]"
751
+ },
752
+ {
753
+ "annotated_tactic": [
754
+ "\"simp only [<a>Ideal.toCotangent_apply<\\/a>, <a>Submodule.restrictScalars_top<\\/a>, <a>Submodule.map_span<\\/a>]\"",
755
+ "[{\"full_name\":\"Ideal.toCotangent_apply\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Cotangent.lean\",\"def_pos\":[59,34],\"def_end_pos\":[59,39]},{\"full_name\":\"Submodule.restrictScalars_top\",\"def_path\":\"Mathlib\\/Algebra\\/Module\\/Submodule\\/RestrictScalars.lean\",\"def_pos\":[111,9],\"def_end_pos\":[111,28]},{\"full_name\":\"Submodule.map_span\",\"def_path\":\"Mathlib\\/LinearAlgebra\\/Span.lean\",\"def_pos\":[132,9],\"def_end_pos\":[132,17]}]"
756
+ ],
757
+ "state_after": "no goals",
758
+ "state_before": "R : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\ns : Set \u21a5(maximalIdeal R)\n\u22a2 Submodule.span R (\u21d1(maximalIdeal R).toCotangent '' s) = Submodule.restrictScalars R \u22a4 \u2194\n Submodule.map (maximalIdeal R).toCotangent (Submodule.span R s) = \u22a4",
759
+ "tactic": "simp only [Ideal.toCotangent_apply, Submodule.restrictScalars_top, Submodule.map_span]"
760
+ },
761
+ {
762
+ "annotated_tactic": [
763
+ "\"exact <a>Ideal.Quotient.mk_surjective<\\/a>\"",
764
+ "[{\"full_name\":\"Ideal.Quotient.mk_surjective\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Quotient.lean\",\"def_pos\":[159,9],\"def_end_pos\":[159,22]}]"
765
+ ],
766
+ "state_after": "no goals",
767
+ "state_before": "case hsur\nR : Type u_1\ninst\u271d\u00b2 : CommRing R\ninst\u271d\u00b9 : LocalRing R\ninst\u271d : IsNoetherianRing R\ns : Set \u21a5(maximalIdeal R)\n\u22a2 Function.Surjective \u21d1(algebraMap R (ResidueField R))",
768
+ "tactic": "exact Ideal.Quotient.mk_surjective"
769
+ }
770
+ ],
771
+ "url": "https://github.com/leanprover-community/mathlib4"
772
+ }
773
+ },
774
+ "theorem_name": "LocalRing.CotangentSpace.span_image_eq_top_iff"
775
+ },
776
+ {
777
+ "errors": [
778
+ "internal transition boundary mismatch",
779
+ "internal transition boundary mismatch"
780
+ ],
781
+ "file_path": "Mathlib/RingTheory/Ideal/IdempotentFG.lean",
782
+ "proof_id": "mathlib:Ideal.isIdempotentElem_iff_eq_bot_or_top",
783
+ "provenance": {
784
+ "selection": {
785
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
786
+ "end": [
787
+ 47,
788
+ 51
789
+ ],
790
+ "file_path": "Mathlib/RingTheory/Ideal/IdempotentFG.lean",
791
+ "full_name": "Ideal.isIdempotentElem_iff_eq_bot_or_top",
792
+ "start": [
793
+ 38,
794
+ 1
795
+ ],
796
+ "traced_tactics": [
797
+ {
798
+ "annotated_tactic": [
799
+ "\"constructor\"",
800
+ "[]"
801
+ ],
802
+ "state_after": "case mp\nR : Type u_1\ninst\u271d\u00b9 : CommRing R\ninst\u271d : IsDomain R\nI : Ideal R\nh : I.FG\n\u22a2 IsIdempotentElem I \u2192 I = \u22a5 \u2228 I = \u22a4\n\ncase mpr\nR : Type u_1\ninst\u271d\u00b9 : CommRing R\ninst\u271d : IsDomain R\nI : Ideal R\nh : I.FG\n\u22a2 I = \u22a5 \u2228 I = \u22a4 \u2192 IsIdempotentElem I",
803
+ "state_before": "R : Type u_1\ninst\u271d\u00b9 : CommRing R\ninst\u271d : IsDomain R\nI : Ideal R\nh : I.FG\n\u22a2 IsIdempotentElem I \u2194 I = \u22a5 \u2228 I = \u22a4",
804
+ "tactic": "constructor"
805
+ },
806
+ {
807
+ "annotated_tactic": [
808
+ "\"intro H\"",
809
+ "[]"
810
+ ],
811
+ "state_after": "case mp\nR : Type u_1\ninst\u271d\u00b9 : CommRing R\ninst\u271d : IsDomain R\nI : Ideal R\nh : I.FG\nH : IsIdempotentElem I\n\u22a2 I = \u22a5 \u2228 I = \u22a4",
812
+ "state_before": "case mp\nR : Type u_1\ninst\u271d\u00b9 : CommRing R\ninst\u271d : IsDomain R\nI : Ideal R\nh : I.FG\n\u22a2 IsIdempotentElem I \u2192 I = \u22a5 \u2228 I = \u22a4",
813
+ "tactic": "intro H"
814
+ },
815
+ {
816
+ "annotated_tactic": [
817
+ "\"obtain \\u27e8e, he, rfl\\u27e9 := (I.isIdempotentElem_iff_of_fg h).<a>mp<\\/a> H\"",
818
+ "[{\"full_name\":\"Iff.mp\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Core.lean\",\"def_pos\":[118,3],\"def_end_pos\":[118,5]}]"
819
+ ],
820
+ "state_after": "case mp.intro.intro\nR : Type u_1\ninst\u271d\u00b9 : CommRing R\ninst\u271d : IsDomain R\ne : R\nhe : IsIdempotentElem e\nh : FG (Submodule.span R {e})\nH : IsIdempotentElem (Submodule.span R {e})\n\u22a2 Submodule.span R {e} = \u22a5 \u2228 Submodule.span R {e} = \u22a4",
821
+ "state_before": "case mp\nR : Type u_1\ninst\u271d\u00b9 : CommRing R\ninst\u271d : IsDomain R\nI : Ideal R\nh : I.FG\nH : IsIdempotentElem I\n\u22a2 I = \u22a5 \u2228 I = \u22a4",
822
+ "tactic": "obtain \u27e8e, he, rfl\u27e9 := (I.isIdempotentElem_iff_of_fg h).mp H"
823
+ },
824
+ {
825
+ "annotated_tactic": [
826
+ "\"simp only [<a>Ideal.submodule_span_eq<\\/a>, <a>Ideal.span_singleton_eq_bot<\\/a>]\"",
827
+ "[{\"full_name\":\"Ideal.submodule_span_eq\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Basic.lean\",\"def_pos\":[120,9],\"def_end_pos\":[120,26]},{\"full_name\":\"Ideal.span_singleton_eq_bot\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Basic.lean\",\"def_pos\":[199,9],\"def_end_pos\":[199,30]}]"
828
+ ],
829
+ "state_after": "case mp.intro.intro\nR : Type u_1\ninst\u271d\u00b9 : CommRing R\ninst\u271d : IsDomain R\ne : R\nhe : IsIdempotentElem e\nh : FG (Submodule.span R {e})\nH : IsIdempotentElem (Submodule.span R {e})\n\u22a2 e = 0 \u2228 span {e} = \u22a4",
830
+ "state_before": "case mp.intro.intro\nR : Type u_1\ninst\u271d\u00b9 : CommRing R\ninst\u271d : IsDomain R\ne : R\nhe : IsIdempotentElem e\nh : FG (Submodule.span R {e})\nH : IsIdempotentElem (Submodule.span R {e})\n\u22a2 Submodule.span R {e} = \u22a5 \u2228 Submodule.span R {e} = \u22a4",
831
+ "tactic": "simp only [Ideal.submodule_span_eq, Ideal.span_singleton_eq_bot]"
832
+ },
833
+ {
834
+ "annotated_tactic": [
835
+ "\"apply <a>Or.imp<\\/a> <a>id<\\/a> _ (IsIdempotentElem.iff_eq_zero_or_one.mp he)\"",
836
+ "[{\"full_name\":\"Or.imp\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/SimpLemmas.lean\",\"def_pos\":[172,9],\"def_end_pos\":[172,15]},{\"full_name\":\"id\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[33,15],\"def_end_pos\":[33,17]}]"
837
+ ],
838
+ "state_after": "R : Type u_1\ninst\u271d\u00b9 : CommRing R\ninst\u271d : IsDomain R\ne : R\nhe : IsIdempotentElem e\nh : FG (Submodule.span R {e})\nH : IsIdempotentElem (Submodule.span R {e})\n\u22a2 e = 1 \u2192 span {e} = \u22a4",
839
+ "state_before": "case mp.intro.intro\nR : Type u_1\ninst\u271d\u00b9 : CommRing R\ninst\u271d : IsDomain R\ne : R\nhe : IsIdempotentElem e\nh : FG (Submodule.span R {e})\nH : IsIdempotentElem (Submodule.span R {e})\n\u22a2 e = 0 \u2228 span {e} = \u22a4",
840
+ "tactic": "apply Or.imp id _ (IsIdempotentElem.iff_eq_zero_or_one.mp he)"
841
+ },
842
+ {
843
+ "annotated_tactic": [
844
+ "\"rintro rfl\"",
845
+ "[]"
846
+ ],
847
+ "state_after": "R : Type u_1\ninst\u271d\u00b9 : CommRing R\ninst\u271d : IsDomain R\nhe : IsIdempotentElem 1\nh : FG (Submodule.span R {1})\nH : IsIdempotentElem (Submodule.span R {1})\n\u22a2 span {1} = \u22a4",
848
+ "state_before": "R : Type u_1\ninst\u271d\u00b9 : CommRing R\ninst\u271d : IsDomain R\ne : R\nhe : IsIdempotentElem e\nh : FG (Submodule.span R {e})\nH : IsIdempotentElem (Submodule.span R {e})\n\u22a2 e = 1 \u2192 span {e} = \u22a4",
849
+ "tactic": "rintro rfl"
850
+ },
851
+ {
852
+ "annotated_tactic": [
853
+ "\"simp\"",
854
+ "[]"
855
+ ],
856
+ "state_after": "no goals",
857
+ "state_before": "R : Type u_1\ninst\u271d\u00b9 : CommRing R\ninst\u271d : IsDomain R\nhe : IsIdempotentElem 1\nh : FG (Submodule.span R {1})\nH : IsIdempotentElem (Submodule.span R {1})\n\u22a2 span {1} = \u22a4",
858
+ "tactic": "simp"
859
+ },
860
+ {
861
+ "annotated_tactic": [
862
+ "\"rintro (rfl | rfl) <;> simp [<a>IsIdempotentElem<\\/a>]\"",
863
+ "[{\"full_name\":\"IsIdempotentElem\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Idempotents.lean\",\"def_pos\":[39,5],\"def_end_pos\":[39,21]}]"
864
+ ],
865
+ "state_after": "no goals",
866
+ "state_before": "case mpr\nR : Type u_1\ninst\u271d\u00b9 : CommRing R\ninst\u271d : IsDomain R\nI : Ideal R\nh : I.FG\n\u22a2 I = \u22a5 \u2228 I = \u22a4 \u2192 IsIdempotentElem I",
867
+ "tactic": "rintro (rfl | rfl) <;> simp [IsIdempotentElem]"
868
+ }
869
+ ],
870
+ "url": "https://github.com/leanprover-community/mathlib4"
871
+ }
872
+ },
873
+ "theorem_name": "Ideal.isIdempotentElem_iff_eq_bot_or_top"
874
+ }
875
+ ],
876
+ "validation_rejected_proofs": 6,
877
+ "zero_transition_proofs": 0
878
+ },
879
+ "shards": [
880
+ {
881
+ "path": "data/train/mathlib-001682-0000-c19f87ac0f2daf47.parquet",
882
+ "sha256": "c19f87ac0f2daf47fee94c69a87da1629013806e4be4c2d1689ce3082810795b",
883
+ "bytes": 192111,
884
+ "rows": 12,
885
+ "revision": "d60e29d6cee3c6b2c6967d9f9c90939917c38808"
886
+ },
887
+ {
888
+ "path": "data/dev/mathlib-001682-0000-08d3c945db77180c.parquet",
889
+ "sha256": "08d3c945db77180c3f119d1b5712df4bb5a430499ab3bb39d0e17971081d197f",
890
+ "bytes": 42049,
891
+ "rows": 1,
892
+ "revision": "d60e29d6cee3c6b2c6967d9f9c90939917c38808"
893
+ },
894
+ {
895
+ "path": "data/internal_test/mathlib-001682-0000-64177a9fe9dd1614.parquet",
896
+ "sha256": "64177a9fe9dd161409117ab3c1783451ccf91d60b08f3e9f8e9a29fc7ea8fbca",
897
+ "bytes": 44038,
898
+ "rows": 3,
899
+ "revision": "d60e29d6cee3c6b2c6967d9f9c90939917c38808"
900
+ }
901
+ ],
902
+ "proof_ids": [
903
+ "mathlib:Ideal.cotangentEquivIdeal_symm_apply",
904
+ "mathlib:Ideal.map_toCotangent_ker",
905
+ "mathlib:Ideal.mem_toCotangent_ker",
906
+ "mathlib:Ideal.toCotangent_eq",
907
+ "mathlib:LocalRing.finrank_cotangentSpace_eq_zero_iff",
908
+ "mathlib:LocalRing.finrank_cotangentSpace_le_one_iff",
909
+ "mathlib:LocalRing.subsingleton_cotangentSpace_iff"
910
+ ],
911
+ "proof_keys": [
912
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/Cotangent.lean\",null,null,\"Ideal.cotangentEquivIdeal_symm_apply\"]",
913
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/Cotangent.lean\",null,null,\"Ideal.map_toCotangent_ker\"]",
914
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/Cotangent.lean\",null,null,\"Ideal.mem_toCotangent_ker\"]",
915
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/Cotangent.lean\",null,null,\"Ideal.toCotangent_eq\"]",
916
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/Cotangent.lean\",null,null,\"LocalRing.finrank_cotangentSpace_eq_zero_iff\"]",
917
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/Cotangent.lean\",null,null,\"LocalRing.finrank_cotangentSpace_le_one_iff\"]",
918
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/Cotangent.lean\",null,null,\"LocalRing.subsingleton_cotangentSpace_iff\"]"
919
+ ]
920
+ }
manifests/batches/mathlib/001683.json ADDED
@@ -0,0 +1,291 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "format": "leangpt-parquet-v2",
3
+ "batch": "mathlib/001683",
4
+ "batch_fingerprint": "868a551ab3d3c2c0b9535943c8d94926ac3b87fb0a939eb6df5f77c37fbd0ba1",
5
+ "evidence": {
6
+ "batch_fingerprint": "868a551ab3d3c2c0b9535943c8d94926ac3b87fb0a939eb6df5f77c37fbd0ba1",
7
+ "contamination_matches": [],
8
+ "failures": [
9
+ {
10
+ "error": "theorem has no selected tactic transitions",
11
+ "full_name": "Ideal.associatesEquivIsPrincipal_apply",
12
+ "id": "Ideal.associatesEquivIsPrincipal_apply",
13
+ "reason": "import_failure",
14
+ "selection": {
15
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
16
+ "end": [
17
+ 61,
18
+ 69
19
+ ],
20
+ "file_path": "Mathlib/RingTheory/Ideal/IsPrincipal.lean",
21
+ "full_name": "Ideal.associatesEquivIsPrincipal_apply",
22
+ "start": [
23
+ 60,
24
+ 1
25
+ ],
26
+ "traced_tactics": [],
27
+ "url": "https://github.com/leanprover-community/mathlib4"
28
+ },
29
+ "source_file": "Mathlib/RingTheory/Ideal/IsPrincipal.lean"
30
+ },
31
+ {
32
+ "error": "theorem has no selected tactic transitions",
33
+ "full_name": "Ideal.associatesEquivIsPrincipal_symm_apply",
34
+ "id": "Ideal.associatesEquivIsPrincipal_symm_apply",
35
+ "reason": "import_failure",
36
+ "selection": {
37
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
38
+ "end": [
39
+ 65,
40
+ 84
41
+ ],
42
+ "file_path": "Mathlib/RingTheory/Ideal/IsPrincipal.lean",
43
+ "full_name": "Ideal.associatesEquivIsPrincipal_symm_apply",
44
+ "start": [
45
+ 64,
46
+ 1
47
+ ],
48
+ "traced_tactics": [],
49
+ "url": "https://github.com/leanprover-community/mathlib4"
50
+ },
51
+ "source_file": "Mathlib/RingTheory/Ideal/IsPrincipal.lean"
52
+ },
53
+ {
54
+ "error": "theorem has no selected tactic transitions",
55
+ "full_name": "Ideal.mem_isPrincipalSubmonoid_iff",
56
+ "id": "Ideal.mem_isPrincipalSubmonoid_iff",
57
+ "reason": "import_failure",
58
+ "selection": {
59
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
60
+ "end": [
61
+ 40,
62
+ 58
63
+ ],
64
+ "file_path": "Mathlib/RingTheory/Ideal/IsPrincipal.lean",
65
+ "full_name": "Ideal.mem_isPrincipalSubmonoid_iff",
66
+ "start": [
67
+ 39,
68
+ 1
69
+ ],
70
+ "traced_tactics": [],
71
+ "url": "https://github.com/leanprover-community/mathlib4"
72
+ },
73
+ "source_file": "Mathlib/RingTheory/Ideal/IsPrincipal.lean"
74
+ },
75
+ {
76
+ "error": "theorem has no selected tactic transitions",
77
+ "full_name": "Ideal.span_singleton_mem_isPrincipalSubmonoid",
78
+ "id": "Ideal.span_singleton_mem_isPrincipalSubmonoid",
79
+ "reason": "import_failure",
80
+ "selection": {
81
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
82
+ "end": [
83
+ 43,
84
+ 83
85
+ ],
86
+ "file_path": "Mathlib/RingTheory/Ideal/IsPrincipal.lean",
87
+ "full_name": "Ideal.span_singleton_mem_isPrincipalSubmonoid",
88
+ "start": [
89
+ 42,
90
+ 1
91
+ ],
92
+ "traced_tactics": [],
93
+ "url": "https://github.com/leanprover-community/mathlib4"
94
+ },
95
+ "source_file": "Mathlib/RingTheory/Ideal/IsPrincipal.lean"
96
+ }
97
+ ],
98
+ "input_proofs": 9,
99
+ "input_units": 2,
100
+ "proofs": 5,
101
+ "published_proofs": 3,
102
+ "published_transitions": 4,
103
+ "replay_failures": [],
104
+ "transitions": 15,
105
+ "validation_failures": [
106
+ {
107
+ "errors": [
108
+ "internal transition boundary mismatch",
109
+ "internal transition boundary mismatch",
110
+ "internal transition boundary mismatch",
111
+ "internal transition boundary mismatch"
112
+ ],
113
+ "file_path": "Mathlib/RingTheory/Ideal/IsPrimary.lean",
114
+ "proof_id": "mathlib:Ideal.isPrimary_inf",
115
+ "provenance": {
116
+ "selection": {
117
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
118
+ "end": [
119
+ 52,
120
+ 24
121
+ ],
122
+ "file_path": "Mathlib/RingTheory/Ideal/IsPrimary.lean",
123
+ "full_name": "Ideal.isPrimary_inf",
124
+ "start": [
125
+ 42,
126
+ 1
127
+ ],
128
+ "traced_tactics": [
129
+ {
130
+ "annotated_tactic": [
131
+ "\"rw [<a>radical_inf<\\/a>, hij, <a>inf_idem<\\/a>]\"",
132
+ "[{\"full_name\":\"Ideal.radical_inf\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Operations.lean\",\"def_pos\":[1002,9],\"def_end_pos\":[1002,20]},{\"full_name\":\"inf_idem\",\"def_path\":\"Mathlib\\/Order\\/Lattice.lean\",\"def_pos\":[456,9],\"def_end_pos\":[456,17]}]"
133
+ ],
134
+ "state_after": "R : Type u_1\ninst\u271d : CommSemiring R\nI J : Ideal R\nhi : I.IsPrimary\nhj : J.IsPrimary\nhij : I.radical = J.radical\nx y : R\nx\u271d : x * y \u2208 I \u2293 J\nhxyi : x * y \u2208 \u2191I\nhxyj : x * y \u2208 \u2191J\n\u22a2 x \u2208 I \u2293 J \u2228 y \u2208 J.radical",
135
+ "state_before": "R : Type u_1\ninst\u271d : CommSemiring R\nI J : Ideal R\nhi : I.IsPrimary\nhj : J.IsPrimary\nhij : I.radical = J.radical\nx y : R\nx\u271d : x * y \u2208 I \u2293 J\nhxyi : x * y \u2208 \u2191I\nhxyj : x * y \u2208 \u2191J\n\u22a2 x \u2208 I \u2293 J \u2228 y \u2208 (I \u2293 J).radical",
136
+ "tactic": "rw [radical_inf, hij, inf_idem]"
137
+ },
138
+ {
139
+ "annotated_tactic": [
140
+ "\"cases' hi.2 hxyi with hxi hyi\"",
141
+ "[]"
142
+ ],
143
+ "state_after": "case inl\nR : Type u_1\ninst\u271d : CommSemiring R\nI J : Ideal R\nhi : I.IsPrimary\nhj : J.IsPrimary\nhij : I.radical = J.radical\nx y : R\nx\u271d : x * y \u2208 I \u2293 J\nhxyi : x * y \u2208 \u2191I\nhxyj : x * y \u2208 \u2191J\nhxi : x \u2208 I\n\u22a2 x \u2208 I \u2293 J \u2228 y \u2208 J.radical\n\ncase inr\nR : Type u_1\ninst\u271d : CommSemiring R\nI J : Ideal R\nhi : I.IsPrimary\nhj : J.IsPrimary\nhij : I.radical = J.radical\nx y : R\nx\u271d : x * y \u2208 I \u2293 J\nhxyi : x * y \u2208 \u2191I\nhxyj : x * y \u2208 \u2191J\nhyi : y \u2208 I.radical\n\u22a2 x \u2208 I \u2293 J \u2228 y \u2208 J.radical",
144
+ "state_before": "R : Type u_1\ninst\u271d : CommSemiring R\nI J : Ideal R\nhi : I.IsPrimary\nhj : J.IsPrimary\nhij : I.radical = J.radical\nx y : R\nx\u271d : x * y \u2208 I \u2293 J\nhxyi : x * y \u2208 \u2191I\nhxyj : x * y \u2208 \u2191J\n\u22a2 x \u2208 I \u2293 J \u2228 y \u2208 J.radical",
145
+ "tactic": "cases' hi.2 hxyi with hxi hyi"
146
+ },
147
+ {
148
+ "annotated_tactic": [
149
+ "\"cases' hj.2 hxyj with hxj hyj\"",
150
+ "[]"
151
+ ],
152
+ "state_after": "case inl.inl\nR : Type u_1\ninst\u271d : CommSemiring R\nI J : Ideal R\nhi : I.IsPrimary\nhj : J.IsPrimary\nhij : I.radical = J.radical\nx y : R\nx\u271d : x * y \u2208 I \u2293 J\nhxyi : x * y \u2208 \u2191I\nhxyj : x * y \u2208 \u2191J\nhxi : x \u2208 I\nhxj : x \u2208 J\n\u22a2 x \u2208 I \u2293 J \u2228 y \u2208 J.radical\n\ncase inl.inr\nR : Type u_1\ninst\u271d : CommSemiring R\nI J : Ideal R\nhi : I.IsPrimary\nhj : J.IsPrimary\nhij : I.radical = J.radical\nx y : R\nx\u271d : x * y \u2208 I \u2293 J\nhxyi : x * y \u2208 \u2191I\nhxyj : x * y \u2208 \u2191J\nhxi : x \u2208 I\nhyj : y \u2208 J.radical\n\u22a2 x \u2208 I \u2293 J \u2228 y \u2208 J.radical",
153
+ "state_before": "case inl\nR : Type u_1\ninst\u271d : CommSemiring R\nI J : Ideal R\nhi : I.IsPrimary\nhj : J.IsPrimary\nhij : I.radical = J.radical\nx y : R\nx\u271d : x * y \u2208 I \u2293 J\nhxyi : x * y \u2208 \u2191I\nhxyj : x * y \u2208 \u2191J\nhxi : x \u2208 I\n\u22a2 x \u2208 I \u2293 J \u2228 y \u2208 J.radical",
154
+ "tactic": "cases' hj.2 hxyj with hxj hyj"
155
+ },
156
+ {
157
+ "annotated_tactic": [
158
+ "\"exact <a>Or.inl<\\/a> \\u27e8hxi, hxj\\u27e9\"",
159
+ "[{\"full_name\":\"Or.inl\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[534,5],\"def_end_pos\":[534,8]}]"
160
+ ],
161
+ "state_after": "no goals",
162
+ "state_before": "case inl.inl\nR : Type u_1\ninst\u271d : CommSemiring R\nI J : Ideal R\nhi : I.IsPrimary\nhj : J.IsPrimary\nhij : I.radical = J.radical\nx y : R\nx\u271d : x * y \u2208 I \u2293 J\nhxyi : x * y \u2208 \u2191I\nhxyj : x * y \u2208 \u2191J\nhxi : x \u2208 I\nhxj : x \u2208 J\n\u22a2 x \u2208 I \u2293 J \u2228 y \u2208 J.radical",
163
+ "tactic": "exact Or.inl \u27e8hxi, hxj\u27e9"
164
+ },
165
+ {
166
+ "annotated_tactic": [
167
+ "\"exact <a>Or.inr<\\/a> hyj\"",
168
+ "[{\"full_name\":\"Or.inr\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[536,5],\"def_end_pos\":[536,8]}]"
169
+ ],
170
+ "state_after": "no goals",
171
+ "state_before": "case inl.inr\nR : Type u_1\ninst\u271d : CommSemiring R\nI J : Ideal R\nhi : I.IsPrimary\nhj : J.IsPrimary\nhij : I.radical = J.radical\nx y : R\nx\u271d : x * y \u2208 I \u2293 J\nhxyi : x * y \u2208 \u2191I\nhxyj : x * y \u2208 \u2191J\nhxi : x \u2208 I\nhyj : y \u2208 J.radical\n\u22a2 x \u2208 I \u2293 J \u2228 y \u2208 J.radical",
172
+ "tactic": "exact Or.inr hyj"
173
+ },
174
+ {
175
+ "annotated_tactic": [
176
+ "\"rw [hij] at hyi\"",
177
+ "[]"
178
+ ],
179
+ "state_after": "case inr\nR : Type u_1\ninst\u271d : CommSemiring R\nI J : Ideal R\nhi : I.IsPrimary\nhj : J.IsPrimary\nhij : I.radical = J.radical\nx y : R\nx\u271d : x * y \u2208 I \u2293 J\nhxyi : x * y \u2208 \u2191I\nhxyj : x * y \u2208 \u2191J\nhyi : y \u2208 J.radical\n\u22a2 x \u2208 I \u2293 J \u2228 y \u2208 J.radical",
180
+ "state_before": "case inr\nR : Type u_1\ninst\u271d : CommSemiring R\nI J : Ideal R\nhi : I.IsPrimary\nhj : J.IsPrimary\nhij : I.radical = J.radical\nx y : R\nx\u271d : x * y \u2208 I \u2293 J\nhxyi : x * y \u2208 \u2191I\nhxyj : x * y \u2208 \u2191J\nhyi : y \u2208 I.radical\n\u22a2 x \u2208 I \u2293 J \u2228 y \u2208 J.radical",
181
+ "tactic": "rw [hij] at hyi"
182
+ },
183
+ {
184
+ "annotated_tactic": [
185
+ "\"exact <a>Or.inr<\\/a> hyi\"",
186
+ "[{\"full_name\":\"Or.inr\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[536,5],\"def_end_pos\":[536,8]}]"
187
+ ],
188
+ "state_after": "no goals",
189
+ "state_before": "case inr\nR : Type u_1\ninst\u271d : CommSemiring R\nI J : Ideal R\nhi : I.IsPrimary\nhj : J.IsPrimary\nhij : I.radical = J.radical\nx y : R\nx\u271d : x * y \u2208 I \u2293 J\nhxyi : x * y \u2208 \u2191I\nhxyj : x * y \u2208 \u2191J\nhyi : y \u2208 J.radical\n\u22a2 x \u2208 I \u2293 J \u2228 y \u2208 J.radical",
190
+ "tactic": "exact Or.inr hyi"
191
+ }
192
+ ],
193
+ "url": "https://github.com/leanprover-community/mathlib4"
194
+ }
195
+ },
196
+ "theorem_name": "Ideal.isPrimary_inf"
197
+ },
198
+ {
199
+ "errors": [
200
+ "internal transition boundary mismatch",
201
+ "internal transition boundary mismatch"
202
+ ],
203
+ "file_path": "Mathlib/RingTheory/Ideal/IsPrimary.lean",
204
+ "proof_id": "mathlib:Ideal.isPrime_radical",
205
+ "provenance": {
206
+ "selection": {
207
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
208
+ "end": [
209
+ 39,
210
+ 47
211
+ ],
212
+ "file_path": "Mathlib/RingTheory/Ideal/IsPrimary.lean",
213
+ "full_name": "Ideal.isPrime_radical",
214
+ "start": [
215
+ 34,
216
+ 1
217
+ ],
218
+ "traced_tactics": [
219
+ {
220
+ "annotated_tactic": [
221
+ "\"rw [<a>mul_pow<\\/a>] at hxy\"",
222
+ "[{\"full_name\":\"mul_pow\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Basic.lean\",\"def_pos\":[310,32],\"def_end_pos\":[310,39]}]"
223
+ ],
224
+ "state_after": "R : Type u_1\ninst\u271d : CommSemiring R\nI : Ideal R\nhi : I.IsPrimary\nx y : R\nx\u271d : x * y \u2208 I.radical\nm : \u2115\nhxy : x ^ m * y ^ m \u2208 I\n\u22a2 x \u2208 I.radical \u2228 y \u2208 I.radical",
225
+ "state_before": "R : Type u_1\ninst\u271d : CommSemiring R\nI : Ideal R\nhi : I.IsPrimary\nx y : R\nx\u271d : x * y \u2208 I.radical\nm : \u2115\nhxy : (x * y) ^ m \u2208 I\n\u22a2 x \u2208 I.radical \u2228 y \u2208 I.radical",
226
+ "tactic": "rw [mul_pow] at hxy"
227
+ },
228
+ {
229
+ "annotated_tactic": [
230
+ "\"cases' hi.2 hxy with h h\"",
231
+ "[]"
232
+ ],
233
+ "state_after": "case inl\nR : Type u_1\ninst\u271d : CommSemiring R\nI : Ideal R\nhi : I.IsPrimary\nx y : R\nx\u271d : x * y \u2208 I.radical\nm : \u2115\nhxy : x ^ m * y ^ m \u2208 I\nh : x ^ m \u2208 I\n\u22a2 x \u2208 I.radical \u2228 y \u2208 I.radical\n\ncase inr\nR : Type u_1\ninst\u271d : CommSemiring R\nI : Ideal R\nhi : I.IsPrimary\nx y : R\nx\u271d : x * y \u2208 I.radical\nm : \u2115\nhxy : x ^ m * y ^ m \u2208 I\nh : y ^ m \u2208 I.radical\n\u22a2 x \u2208 I.radical \u2228 y \u2208 I.radical",
234
+ "state_before": "R : Type u_1\ninst\u271d : CommSemiring R\nI : Ideal R\nhi : I.IsPrimary\nx y : R\nx\u271d : x * y \u2208 I.radical\nm : \u2115\nhxy : x ^ m * y ^ m \u2208 I\n\u22a2 x \u2208 I.radical \u2228 y \u2208 I.radical",
235
+ "tactic": "cases' hi.2 hxy with h h"
236
+ },
237
+ {
238
+ "annotated_tactic": [
239
+ "\"exact <a>Or.inl<\\/a> \\u27e8m, h\\u27e9\"",
240
+ "[{\"full_name\":\"Or.inl\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[534,5],\"def_end_pos\":[534,8]}]"
241
+ ],
242
+ "state_after": "no goals",
243
+ "state_before": "case inl\nR : Type u_1\ninst\u271d : CommSemiring R\nI : Ideal R\nhi : I.IsPrimary\nx y : R\nx\u271d : x * y \u2208 I.radical\nm : \u2115\nhxy : x ^ m * y ^ m \u2208 I\nh : x ^ m \u2208 I\n\u22a2 x \u2208 I.radical \u2228 y \u2208 I.radical",
244
+ "tactic": "exact Or.inl \u27e8m, h\u27e9"
245
+ },
246
+ {
247
+ "annotated_tactic": [
248
+ "\"exact <a>Or.inr<\\/a> (<a>mem_radical_of_pow_mem<\\/a> h)\"",
249
+ "[{\"full_name\":\"Or.inr\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[536,5],\"def_end_pos\":[536,8]},{\"full_name\":\"Ideal.mem_radical_of_pow_mem\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Operations.lean\",\"def_pos\":[982,9],\"def_end_pos\":[982,31]}]"
250
+ ],
251
+ "state_after": "no goals",
252
+ "state_before": "case inr\nR : Type u_1\ninst\u271d : CommSemiring R\nI : Ideal R\nhi : I.IsPrimary\nx y : R\nx\u271d : x * y \u2208 I.radical\nm : \u2115\nhxy : x ^ m * y ^ m \u2208 I\nh : y ^ m \u2208 I.radical\n\u22a2 x \u2208 I.radical \u2228 y \u2208 I.radical",
253
+ "tactic": "exact Or.inr (mem_radical_of_pow_mem h)"
254
+ }
255
+ ],
256
+ "url": "https://github.com/leanprover-community/mathlib4"
257
+ }
258
+ },
259
+ "theorem_name": "Ideal.isPrime_radical"
260
+ }
261
+ ],
262
+ "validation_rejected_proofs": 2,
263
+ "zero_transition_proofs": 0
264
+ },
265
+ "shards": [
266
+ {
267
+ "path": "data/train/mathlib-001683-0000-712c75a520893e0e.parquet",
268
+ "sha256": "712c75a520893e0e7593e62132f0ea0fb14e7cff84141eaf7987731fdeecc897",
269
+ "bytes": 57730,
270
+ "rows": 3,
271
+ "revision": "d60e29d6cee3c6b2c6967d9f9c90939917c38808"
272
+ },
273
+ {
274
+ "path": "data/internal_test/mathlib-001683-0000-0b976739e6ebf030.parquet",
275
+ "sha256": "0b976739e6ebf03045c8131a12c0fc78f39dc1eb278dee0b48d95226d550aea5",
276
+ "bytes": 32882,
277
+ "rows": 1,
278
+ "revision": "d60e29d6cee3c6b2c6967d9f9c90939917c38808"
279
+ }
280
+ ],
281
+ "proof_ids": [
282
+ "mathlib:Ideal.associatesEquivIsPrincipal_map_one",
283
+ "mathlib:Ideal.associatesEquivIsPrincipal_map_zero",
284
+ "mathlib:Ideal.associatesEquivIsPrincipal_mul"
285
+ ],
286
+ "proof_keys": [
287
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/IsPrincipal.lean\",null,null,\"Ideal.associatesEquivIsPrincipal_map_one\"]",
288
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/IsPrincipal.lean\",null,null,\"Ideal.associatesEquivIsPrincipal_map_zero\"]",
289
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Ideal/IsPrincipal.lean\",null,null,\"Ideal.associatesEquivIsPrincipal_mul\"]"
290
+ ]
291
+ }
manifests/batches/mathlib/001684.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001687.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001688.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001689.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001690.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001692.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001694.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001695.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001696.json ADDED
@@ -0,0 +1,425 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "format": "leangpt-parquet-v2",
3
+ "batch": "mathlib/001696",
4
+ "batch_fingerprint": "4093ecb7126b956907ba11a59fb5564718b2156c44457fc391669c256e4a2a13",
5
+ "evidence": {
6
+ "batch_fingerprint": "4093ecb7126b956907ba11a59fb5564718b2156c44457fc391669c256e4a2a13",
7
+ "contamination_matches": [],
8
+ "failures": [
9
+ {
10
+ "error": "theorem has no selected tactic transitions",
11
+ "full_name": "Ideal.primeCompl_le_nonZeroDivisors",
12
+ "id": "Ideal.primeCompl_le_nonZeroDivisors",
13
+ "reason": "import_failure",
14
+ "selection": {
15
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
16
+ "end": [
17
+ 52,
18
+ 67
19
+ ],
20
+ "file_path": "Mathlib/RingTheory/Localization/AtPrime.lean",
21
+ "full_name": "Ideal.primeCompl_le_nonZeroDivisors",
22
+ "start": [
23
+ 51,
24
+ 1
25
+ ],
26
+ "traced_tactics": [],
27
+ "url": "https://github.com/leanprover-community/mathlib4"
28
+ },
29
+ "source_file": "Mathlib/RingTheory/Localization/AtPrime.lean"
30
+ },
31
+ {
32
+ "error": "no internal trace for tactic 'simpa using ht.symm'",
33
+ "full_name": "IsLocalization.AtPrime.Nontrivial",
34
+ "id": "IsLocalization.AtPrime.Nontrivial",
35
+ "reason": "import_failure",
36
+ "selection": {
37
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
38
+ "end": [
39
+ 76,
40
+ 47
41
+ ],
42
+ "file_path": "Mathlib/RingTheory/Localization/AtPrime.lean",
43
+ "full_name": "IsLocalization.AtPrime.Nontrivial",
44
+ "start": [
45
+ 71,
46
+ 1
47
+ ],
48
+ "traced_tactics": [
49
+ {
50
+ "annotated_tactic": [
51
+ "\"rw [\\u2190 (<a>algebraMap<\\/a> R S).<a>map_one<\\/a>, \\u2190 (<a>algebraMap<\\/a> R S).<a>map_zero<\\/a>] at hze\"",
52
+ "[{\"full_name\":\"algebraMap\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Defs.lean\",\"def_pos\":[110,5],\"def_end_pos\":[110,15]},{\"full_name\":\"RingHom.map_one\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Hom\\/Defs.lean\",\"def_pos\":[551,19],\"def_end_pos\":[551,26]},{\"full_name\":\"algebraMap\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Defs.lean\",\"def_pos\":[110,5],\"def_end_pos\":[110,15]},{\"full_name\":\"RingHom.map_zero\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Hom\\/Defs.lean\",\"def_pos\":[546,19],\"def_end_pos\":[546,27]}]"
53
+ ],
54
+ "state_after": "R : Type u_1\ninst\u271d\u2074 : CommSemiring R\nM : Submonoid R\nS : Type u_2\ninst\u271d\u00b3 : CommSemiring S\ninst\u271d\u00b2 : Algebra R S\nP\u271d : Type u_3\ninst\u271d\u00b9 : CommSemiring P\u271d\nP : Ideal R\nhp : P.IsPrime\ninst\u271d : IsLocalization.AtPrime S P\nhze : (algebraMap R S) 0 = (algebraMap R S) 1\n\u22a2 False",
55
+ "state_before": "R : Type u_1\ninst\u271d\u2074 : CommSemiring R\nM : Submonoid R\nS : Type u_2\ninst\u271d\u00b3 : CommSemiring S\ninst\u271d\u00b2 : Algebra R S\nP\u271d : Type u_3\ninst\u271d\u00b9 : CommSemiring P\u271d\nP : Ideal R\nhp : P.IsPrime\ninst\u271d : IsLocalization.AtPrime S P\nhze : 0 = 1\n\u22a2 False",
56
+ "tactic": "rw [\u2190 (algebraMap R S).map_one, \u2190 (algebraMap R S).map_zero] at hze"
57
+ },
58
+ {
59
+ "annotated_tactic": [
60
+ "\"obtain \\u27e8t, ht\\u27e9 := (<a>eq_iff_exists<\\/a> P.primeCompl S).1 hze\"",
61
+ "[{\"full_name\":\"IsLocalization.eq_iff_exists\",\"def_path\":\"Mathlib\\/RingTheory\\/Localization\\/Basic.lean\",\"def_pos\":[128,9],\"def_end_pos\":[128,22]}]"
62
+ ],
63
+ "state_after": "case intro\nR : Type u_1\ninst\u271d\u2074 : CommSemiring R\nM : Submonoid R\nS : Type u_2\ninst\u271d\u00b3 : CommSemiring S\ninst\u271d\u00b2 : Algebra R S\nP\u271d : Type u_3\ninst\u271d\u00b9 : CommSemiring P\u271d\nP : Ideal R\nhp : P.IsPrime\ninst\u271d : IsLocalization.AtPrime S P\nhze : (algebraMap R S) 0 = (algebraMap R S) 1\nt : \u21a5P.primeCompl\nht : \u2191t * 0 = \u2191t * 1\n\u22a2 False",
64
+ "state_before": "R : Type u_1\ninst\u271d\u2074 : CommSemiring R\nM : Submonoid R\nS : Type u_2\ninst\u271d\u00b3 : CommSemiring S\ninst\u271d\u00b2 : Algebra R S\nP\u271d : Type u_3\ninst\u271d\u00b9 : CommSemiring P\u271d\nP : Ideal R\nhp : P.IsPrime\ninst\u271d : IsLocalization.AtPrime S P\nhze : (algebraMap R S) 0 = (algebraMap R S) 1\n\u22a2 False",
65
+ "tactic": "obtain \u27e8t, ht\u27e9 := (eq_iff_exists P.primeCompl S).1 hze"
66
+ },
67
+ {
68
+ "annotated_tactic": [
69
+ "\"have htz : (t : R) = 0 := by simpa using ht.symm\"",
70
+ "[]"
71
+ ],
72
+ "state_after": "case intro\nR : Type u_1\ninst\u271d\u2074 : CommSemiring R\nM : Submonoid R\nS : Type u_2\ninst\u271d\u00b3 : CommSemiring S\ninst\u271d\u00b2 : Algebra R S\nP\u271d : Type u_3\ninst\u271d\u00b9 : CommSemiring P\u271d\nP : Ideal R\nhp : P.IsPrime\ninst\u271d : IsLocalization.AtPrime S P\nhze : (algebraMap R S) 0 = (algebraMap R S) 1\nt : \u21a5P.primeCompl\nht : \u2191t * 0 = \u2191t * 1\nhtz : \u2191t = 0\n\u22a2 False",
73
+ "state_before": "case intro\nR : Type u_1\ninst\u271d\u2074 : CommSemiring R\nM : Submonoid R\nS : Type u_2\ninst\u271d\u00b3 : CommSemiring S\ninst\u271d\u00b2 : Algebra R S\nP\u271d : Type u_3\ninst\u271d\u00b9 : CommSemiring P\u271d\nP : Ideal R\nhp : P.IsPrime\ninst\u271d : IsLocalization.AtPrime S P\nhze : (algebraMap R S) 0 = (algebraMap R S) 1\nt : \u21a5P.primeCompl\nht : \u2191t * 0 = \u2191t * 1\n\u22a2 False",
74
+ "tactic": "have htz : (t : R) = 0 := by simpa using ht.symm"
75
+ },
76
+ {
77
+ "annotated_tactic": [
78
+ "\"exact t.2 (htz.symm \\u25b8 P.zero_mem : \\u2191t \\u2208 P)\"",
79
+ "[]"
80
+ ],
81
+ "state_after": "no goals",
82
+ "state_before": "case intro\nR : Type u_1\ninst\u271d\u2074 : CommSemiring R\nM : Submonoid R\nS : Type u_2\ninst\u271d\u00b3 : CommSemiring S\ninst\u271d\u00b2 : Algebra R S\nP\u271d : Type u_3\ninst\u271d\u00b9 : CommSemiring P\u271d\nP : Ideal R\nhp : P.IsPrime\ninst\u271d : IsLocalization.AtPrime S P\nhze : (algebraMap R S) 0 = (algebraMap R S) 1\nt : \u21a5P.primeCompl\nht : \u2191t * 0 = \u2191t * 1\nhtz : \u2191t = 0\n\u22a2 False",
83
+ "tactic": "exact t.2 (htz.symm \u25b8 P.zero_mem : \u2191t \u2208 P)"
84
+ },
85
+ {
86
+ "annotated_tactic": [
87
+ "\"simpa using ht.symm\"",
88
+ "[]"
89
+ ],
90
+ "state_after": "no goals",
91
+ "state_before": "R : Type u_1\ninst\u271d\u2074 : CommSemiring R\nM : Submonoid R\nS : Type u_2\ninst\u271d\u00b3 : CommSemiring S\ninst\u271d\u00b2 : Algebra R S\nP\u271d : Type u_3\ninst\u271d\u00b9 : CommSemiring P\u271d\nP : Ideal R\nhp : P.IsPrime\ninst\u271d : IsLocalization.AtPrime S P\nhze : (algebraMap R S) 0 = (algebraMap R S) 1\nt : \u21a5P.primeCompl\nht : \u2191t * 0 = \u2191t * 1\n\u22a2 \u2191t = 0",
92
+ "tactic": "simpa using ht.symm"
93
+ }
94
+ ],
95
+ "url": "https://github.com/leanprover-community/mathlib4"
96
+ },
97
+ "source_file": "Mathlib/RingTheory/Localization/AtPrime.lean"
98
+ },
99
+ {
100
+ "error": "theorem has no selected tactic transitions",
101
+ "full_name": "IsLocalization.AtPrime.isUnit_mk'_iff",
102
+ "id": "IsLocalization.AtPrime.isUnit_mk'_iff",
103
+ "reason": "import_failure",
104
+ "selection": {
105
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
106
+ "end": [
107
+ 163,
108
+ 78
109
+ ],
110
+ "file_path": "Mathlib/RingTheory/Localization/AtPrime.lean",
111
+ "full_name": "IsLocalization.AtPrime.isUnit_mk'_iff",
112
+ "start": [
113
+ 161,
114
+ 1
115
+ ],
116
+ "traced_tactics": [],
117
+ "url": "https://github.com/leanprover-community/mathlib4"
118
+ },
119
+ "source_file": "Mathlib/RingTheory/Localization/AtPrime.lean"
120
+ },
121
+ {
122
+ "error": "theorem has no selected tactic transitions",
123
+ "full_name": "IsLocalization.AtPrime.isUnit_to_map_iff",
124
+ "id": "IsLocalization.AtPrime.isUnit_to_map_iff",
125
+ "reason": "import_failure",
126
+ "selection": {
127
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
128
+ "end": [
129
+ 144,
130
+ 33
131
+ ],
132
+ "file_path": "Mathlib/RingTheory/Localization/AtPrime.lean",
133
+ "full_name": "IsLocalization.AtPrime.isUnit_to_map_iff",
134
+ "start": [
135
+ 140,
136
+ 1
137
+ ],
138
+ "traced_tactics": [],
139
+ "url": "https://github.com/leanprover-community/mathlib4"
140
+ },
141
+ "source_file": "Mathlib/RingTheory/Localization/AtPrime.lean"
142
+ },
143
+ {
144
+ "error": "theorem has no selected tactic transitions",
145
+ "full_name": "Localization.AtPrime.comap_maximalIdeal",
146
+ "id": "Localization.AtPrime.comap_maximalIdeal",
147
+ "reason": "import_failure",
148
+ "selection": {
149
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
150
+ "end": [
151
+ 192,
152
+ 48
153
+ ],
154
+ "file_path": "Mathlib/RingTheory/Localization/AtPrime.lean",
155
+ "full_name": "Localization.AtPrime.comap_maximalIdeal",
156
+ "start": [
157
+ 187,
158
+ 1
159
+ ],
160
+ "traced_tactics": [],
161
+ "url": "https://github.com/leanprover-community/mathlib4"
162
+ },
163
+ "source_file": "Mathlib/RingTheory/Localization/AtPrime.lean"
164
+ },
165
+ {
166
+ "error": "no internal trace for tactic 'convert congr_arg (Ideal.map (algebraMap R (Localization.AtPrime I)))\\n(AtPrime.comap_maximalIdeal (hI := hI)).symm'",
167
+ "full_name": "Localization.AtPrime.map_eq_maximalIdeal",
168
+ "id": "Localization.AtPrime.map_eq_maximalIdeal",
169
+ "reason": "import_failure",
170
+ "selection": {
171
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
172
+ "end": [
173
+ 204,
174
+ 30
175
+ ],
176
+ "file_path": "Mathlib/RingTheory/Localization/AtPrime.lean",
177
+ "full_name": "Localization.AtPrime.map_eq_maximalIdeal",
178
+ "start": [
179
+ 197,
180
+ 1
181
+ ],
182
+ "traced_tactics": [
183
+ {
184
+ "annotated_tactic": [
185
+ "\"convert <a>congr_arg<\\/a> (<a>Ideal.map<\\/a> (<a>algebraMap<\\/a> R (<a>Localization.AtPrime<\\/a> I)))\\n -- Porting note: `algebraMap R ...` can not be solve by unification\\n (<a>AtPrime.comap_maximalIdeal<\\/a> (hI := hI)).<a>symm<\\/a>\"",
186
+ "[{\"full_name\":\"congr_arg\",\"def_path\":\".lake\\/packages\\/batteries\\/Batteries\\/Logic.lean\",\"def_pos\":[76,7],\"def_end_pos\":[76,16]},{\"full_name\":\"Ideal.map\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Maps.lean\",\"def_pos\":[36,5],\"def_end_pos\":[36,8]},{\"full_name\":\"algebraMap\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Defs.lean\",\"def_pos\":[110,5],\"def_end_pos\":[110,15]},{\"full_name\":\"Localization.AtPrime\",\"def_path\":\"Mathlib\\/RingTheory\\/Localization\\/AtPrime.lean\",\"def_pos\":[65,18],\"def_end_pos\":[65,38]},{\"full_name\":\"Localization.AtPrime.comap_maximalIdeal\",\"def_path\":\"Mathlib\\/RingTheory\\/Localization\\/AtPrime.lean\",\"def_pos\":[187,9],\"def_end_pos\":[187,35]},{\"full_name\":\"Eq.symm\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[323,9],\"def_end_pos\":[323,16]}]"
187
+ ],
188
+ "state_after": "case h.e'_3\nR : Type u_1\ninst\u271d\u00b3 : CommSemiring R\nM : Submonoid R\nS : Type u_2\ninst\u271d\u00b2 : CommSemiring S\ninst\u271d\u00b9 : Algebra R S\nP : Type u_3\ninst\u271d : CommSemiring P\nI : Ideal R\nhI : I.IsPrime\n\u22a2 LocalRing.maximalIdeal (Localization I.primeCompl) =\n Ideal.map (algebraMap R (Localization.AtPrime I))\n (Ideal.comap (algebraMap R (Localization.AtPrime I)) (LocalRing.maximalIdeal (Localization I.primeCompl)))",
189
+ "state_before": "R : Type u_1\ninst\u271d\u00b3 : CommSemiring R\nM : Submonoid R\nS : Type u_2\ninst\u271d\u00b2 : CommSemiring S\ninst\u271d\u00b9 : Algebra R S\nP : Type u_3\ninst\u271d : CommSemiring P\nI : Ideal R\nhI : I.IsPrime\n\u22a2 Ideal.map (algebraMap R (Localization.AtPrime I)) I = LocalRing.maximalIdeal (Localization I.primeCompl)",
190
+ "tactic": "convert congr_arg (Ideal.map (algebraMap R (Localization.AtPrime I)))\n(AtPrime.comap_maximalIdeal (hI := hI)).symm"
191
+ },
192
+ {
193
+ "annotated_tactic": [
194
+ "\"rw [<a>map_comap<\\/a> I.primeCompl]\"",
195
+ "[{\"full_name\":\"IsLocalization.map_comap\",\"def_path\":\"Mathlib\\/RingTheory\\/Localization\\/Ideal.lean\",\"def_pos\":[67,9],\"def_end_pos\":[67,18]}]"
196
+ ],
197
+ "state_after": "no goals",
198
+ "state_before": "case h.e'_3\nR : Type u_1\ninst\u271d\u00b3 : CommSemiring R\nM : Submonoid R\nS : Type u_2\ninst\u271d\u00b2 : CommSemiring S\ninst\u271d\u00b9 : Algebra R S\nP : Type u_3\ninst\u271d : CommSemiring P\nI : Ideal R\nhI : I.IsPrime\n\u22a2 LocalRing.maximalIdeal (Localization I.primeCompl) =\n Ideal.map (algebraMap R (Localization.AtPrime I))\n (Ideal.comap (algebraMap R (Localization.AtPrime I)) (LocalRing.maximalIdeal (Localization I.primeCompl)))",
199
+ "tactic": "rw [map_comap I.primeCompl]"
200
+ }
201
+ ],
202
+ "url": "https://github.com/leanprover-community/mathlib4"
203
+ },
204
+ "source_file": "Mathlib/RingTheory/Localization/AtPrime.lean"
205
+ },
206
+ {
207
+ "error": "theorem has no selected tactic transitions",
208
+ "full_name": "Localization.localRingHom_id",
209
+ "id": "Localization.localRingHom_id",
210
+ "reason": "import_failure",
211
+ "selection": {
212
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
213
+ "end": [
214
+ 258,
215
+ 43
216
+ ],
217
+ "file_path": "Mathlib/RingTheory/Localization/AtPrime.lean",
218
+ "full_name": "Localization.localRingHom_id",
219
+ "start": [
220
+ 257,
221
+ 1
222
+ ],
223
+ "traced_tactics": [],
224
+ "url": "https://github.com/leanprover-community/mathlib4"
225
+ },
226
+ "source_file": "Mathlib/RingTheory/Localization/AtPrime.lean"
227
+ },
228
+ {
229
+ "error": "theorem has no selected tactic transitions",
230
+ "full_name": "Localization.localRingHom_mk'",
231
+ "id": "Localization.localRingHom_mk'",
232
+ "reason": "import_failure",
233
+ "selection": {
234
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
235
+ "end": [
236
+ 238,
237
+ 16
238
+ ],
239
+ "file_path": "Mathlib/RingTheory/Localization/AtPrime.lean",
240
+ "full_name": "Localization.localRingHom_mk'",
241
+ "start": [
242
+ 233,
243
+ 1
244
+ ],
245
+ "traced_tactics": [],
246
+ "url": "https://github.com/leanprover-community/mathlib4"
247
+ },
248
+ "source_file": "Mathlib/RingTheory/Localization/AtPrime.lean"
249
+ },
250
+ {
251
+ "error": "theorem has no selected tactic transitions",
252
+ "full_name": "Localization.localRingHom_to_map",
253
+ "id": "Localization.localRingHom_to_map",
254
+ "reason": "import_failure",
255
+ "selection": {
256
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
257
+ "end": [
258
+ 230,
259
+ 13
260
+ ],
261
+ "file_path": "Mathlib/RingTheory/Localization/AtPrime.lean",
262
+ "full_name": "Localization.localRingHom_to_map",
263
+ "start": [
264
+ 228,
265
+ 1
266
+ ],
267
+ "traced_tactics": [],
268
+ "url": "https://github.com/leanprover-community/mathlib4"
269
+ },
270
+ "source_file": "Mathlib/RingTheory/Localization/AtPrime.lean"
271
+ },
272
+ {
273
+ "error": "theorem has no selected tactic transitions",
274
+ "full_name": "Localization.localRingHom_unique",
275
+ "id": "Localization.localRingHom_unique",
276
+ "reason": "import_failure",
277
+ "selection": {
278
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
279
+ "end": [
280
+ 253,
281
+ 20
282
+ ],
283
+ "file_path": "Mathlib/RingTheory/Localization/AtPrime.lean",
284
+ "full_name": "Localization.localRingHom_unique",
285
+ "start": [
286
+ 250,
287
+ 1
288
+ ],
289
+ "traced_tactics": [],
290
+ "url": "https://github.com/leanprover-community/mathlib4"
291
+ },
292
+ "source_file": "Mathlib/RingTheory/Localization/AtPrime.lean"
293
+ },
294
+ {
295
+ "error": "theorem has no selected tactic transitions",
296
+ "full_name": "IsLocalization.Away.finitePresentation",
297
+ "id": "IsLocalization.Away.finitePresentation",
298
+ "reason": "import_failure",
299
+ "selection": {
300
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
301
+ "end": [
302
+ 49,
303
+ 100
304
+ ],
305
+ "file_path": "Mathlib/RingTheory/Localization/Away/AdjoinRoot.lean",
306
+ "full_name": "IsLocalization.Away.finitePresentation",
307
+ "start": [
308
+ 46,
309
+ 1
310
+ ],
311
+ "traced_tactics": [],
312
+ "url": "https://github.com/leanprover-community/mathlib4"
313
+ },
314
+ "source_file": "Mathlib/RingTheory/Localization/Away/AdjoinRoot.lean"
315
+ },
316
+ {
317
+ "error": "theorem has no selected tactic transitions",
318
+ "full_name": "IsLocalization.adjoin_inv",
319
+ "id": "IsLocalization.adjoin_inv",
320
+ "reason": "import_failure",
321
+ "selection": {
322
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
323
+ "end": [
324
+ 43,
325
+ 79
326
+ ],
327
+ "file_path": "Mathlib/RingTheory/Localization/Away/AdjoinRoot.lean",
328
+ "full_name": "IsLocalization.adjoin_inv",
329
+ "start": [
330
+ 42,
331
+ 1
332
+ ],
333
+ "traced_tactics": [],
334
+ "url": "https://github.com/leanprover-community/mathlib4"
335
+ },
336
+ "source_file": "Mathlib/RingTheory/Localization/Away/AdjoinRoot.lean"
337
+ }
338
+ ],
339
+ "input_proofs": 18,
340
+ "input_units": 2,
341
+ "proofs": 6,
342
+ "published_proofs": 5,
343
+ "published_transitions": 19,
344
+ "replay_failures": [],
345
+ "transitions": 21,
346
+ "validation_failures": [
347
+ {
348
+ "errors": [
349
+ "internal transition boundary mismatch"
350
+ ],
351
+ "file_path": "Mathlib/RingTheory/Localization/AtPrime.lean",
352
+ "proof_id": "mathlib:Localization.localRingHom_comp",
353
+ "provenance": {
354
+ "selection": {
355
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
356
+ "end": [
357
+ 267,
358
+ 75
359
+ ],
360
+ "file_path": "Mathlib/RingTheory/Localization/AtPrime.lean",
361
+ "full_name": "Localization.localRingHom_comp",
362
+ "start": [
363
+ 262,
364
+ 1
365
+ ],
366
+ "traced_tactics": [
367
+ {
368
+ "annotated_tactic": [
369
+ "\"rw [hIJ, hJK, <a>Ideal.comap_comap<\\/a> f g]\"",
370
+ "[{\"full_name\":\"Ideal.comap_comap\",\"def_path\":\"Mathlib\\/RingTheory\\/Ideal\\/Maps.lean\",\"def_pos\":[138,9],\"def_end_pos\":[138,20]}]"
371
+ ],
372
+ "state_after": "no goals",
373
+ "state_before": "R : Type u_1\ninst\u271d\u2074 : CommSemiring R\nM : Submonoid R\nS\u271d : Type u_2\ninst\u271d\u00b3 : CommSemiring S\u271d\ninst\u271d\u00b2 : Algebra R S\u271d\nP : Type u_3\ninst\u271d\u00b9 : CommSemiring P\nI : Ideal R\nhI : I.IsPrime\nS : Type u_4\ninst\u271d : CommSemiring S\nJ : Ideal S\nhJ : J.IsPrime\nK : Ideal P\nhK : K.IsPrime\nf : R \u2192+* S\nhIJ : I = Ideal.comap f J\ng : S \u2192+* P\nhJK : J = Ideal.comap g K\n\u22a2 I = Ideal.comap (g.comp f) K",
374
+ "tactic": "rw [hIJ, hJK, Ideal.comap_comap f g]"
375
+ },
376
+ {
377
+ "annotated_tactic": [
378
+ "\"simp only [<a>Function.comp_apply<\\/a>, <a>RingHom.coe_comp<\\/a>, <a>localRingHom_to_map<\\/a>]\"",
379
+ "[{\"full_name\":\"Function.comp_apply\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Core.lean\",\"def_pos\":[35,17],\"def_end_pos\":[35,36]},{\"full_name\":\"RingHom.coe_comp\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Hom\\/Defs.lean\",\"def_pos\":[666,9],\"def_end_pos\":[666,17]},{\"full_name\":\"Localization.localRingHom_to_map\",\"def_path\":\"Mathlib\\/RingTheory\\/Localization\\/AtPrime.lean\",\"def_pos\":[228,9],\"def_end_pos\":[228,28]}]"
380
+ ],
381
+ "state_after": "no goals",
382
+ "state_before": "R : Type u_1\ninst\u271d\u2074 : CommSemiring R\nM : Submonoid R\nS\u271d : Type u_2\ninst\u271d\u00b3 : CommSemiring S\u271d\ninst\u271d\u00b2 : Algebra R S\u271d\nP : Type u_3\ninst\u271d\u00b9 : CommSemiring P\nI : Ideal R\nhI : I.IsPrime\nS : Type u_4\ninst\u271d : CommSemiring S\nJ : Ideal S\nhJ : J.IsPrime\nK : Ideal P\nhK : K.IsPrime\nf : R \u2192+* S\nhIJ : I = Ideal.comap f J\ng : S \u2192+* P\nhJK : J = Ideal.comap g K\nr : R\n\u22a2 ((localRingHom J K g hJK).comp (localRingHom I J f hIJ)) ((algebraMap R (Localization.AtPrime I)) r) =\n (algebraMap P (Localization.AtPrime K)) ((g.comp f) r)",
383
+ "tactic": "simp only [Function.comp_apply, RingHom.coe_comp, localRingHom_to_map]"
384
+ }
385
+ ],
386
+ "url": "https://github.com/leanprover-community/mathlib4"
387
+ }
388
+ },
389
+ "theorem_name": "Localization.localRingHom_comp"
390
+ }
391
+ ],
392
+ "validation_rejected_proofs": 1,
393
+ "zero_transition_proofs": 0
394
+ },
395
+ "shards": [
396
+ {
397
+ "path": "data/train/mathlib-001696-0000-4cd293fc9b06327b.parquet",
398
+ "sha256": "4cd293fc9b06327b0320ff8a14d6a74a84a06f08445f8215c2c0f67753912110",
399
+ "bytes": 90379,
400
+ "rows": 18,
401
+ "revision": "d60e29d6cee3c6b2c6967d9f9c90939917c38808"
402
+ },
403
+ {
404
+ "path": "data/internal_test/mathlib-001696-0000-1c0883833f21b22a.parquet",
405
+ "sha256": "1c0883833f21b22a0344ca0e667aa3088c0e14455f274b756d0857e6afc5e8c5",
406
+ "bytes": 58495,
407
+ "rows": 1,
408
+ "revision": "d60e29d6cee3c6b2c6967d9f9c90939917c38808"
409
+ }
410
+ ],
411
+ "proof_ids": [
412
+ "mathlib:IsLocalization.AtPrime.comap_maximalIdeal",
413
+ "mathlib:IsLocalization.AtPrime.localRing",
414
+ "mathlib:IsLocalization.AtPrime.mk'_mem_maximal_iff",
415
+ "mathlib:IsLocalization.AtPrime.to_map_mem_maximal_iff",
416
+ "mathlib:Localization.le_comap_primeCompl_iff"
417
+ ],
418
+ "proof_keys": [
419
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Localization/AtPrime.lean\",null,null,\"IsLocalization.AtPrime.comap_maximalIdeal\"]",
420
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Localization/AtPrime.lean\",null,null,\"IsLocalization.AtPrime.localRing\"]",
421
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Localization/AtPrime.lean\",null,null,\"IsLocalization.AtPrime.mk'_mem_maximal_iff\"]",
422
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Localization/AtPrime.lean\",null,null,\"IsLocalization.AtPrime.to_map_mem_maximal_iff\"]",
423
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/Localization/AtPrime.lean\",null,null,\"Localization.le_comap_primeCompl_iff\"]"
424
+ ]
425
+ }
manifests/batches/mathlib/001697.json ADDED
The diff for this file is too large to render. See raw diff