HyperCactus0 commited on
Commit
187ceb4
·
verified ·
1 Parent(s): 82bfa16

Record 9 verified HPC batch manifests

Browse files
manifests/batches/mathlib/001634.json ADDED
@@ -0,0 +1,212 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "format": "leangpt-parquet-v2",
3
+ "batch": "mathlib/001634",
4
+ "batch_fingerprint": "cb9562e2173e1be8f3cab9098bac061413f52d574346813e62c56646f1de0125",
5
+ "evidence": {
6
+ "batch_fingerprint": "cb9562e2173e1be8f3cab9098bac061413f52d574346813e62c56646f1de0125",
7
+ "batch_outcome": "all_inputs_failed_with_evidence",
8
+ "contamination_matches": [],
9
+ "failures": [
10
+ {
11
+ "full_name": "Action.Iso.conj_\u03c1",
12
+ "id": "Action.Iso.conj_\u03c1",
13
+ "reason": "missing_trace",
14
+ "selection": {
15
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
16
+ "end": [
17
+ 306,
18
+ 62
19
+ ],
20
+ "file_path": "Mathlib/RepresentationTheory/Action/Basic.lean",
21
+ "full_name": "Action.Iso.conj_\u03c1",
22
+ "start": [
23
+ 304,
24
+ 1
25
+ ],
26
+ "traced_tactics": [
27
+ {
28
+ "annotated_tactic": [
29
+ "\"rw [<a>Iso.conj_apply<\\/a>, <a>Iso.eq_inv_comp<\\/a>]\"",
30
+ "[{\"full_name\":\"CategoryTheory.Iso.conj_apply\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Conj.lean\",\"def_pos\":[99,9],\"def_end_pos\":[99,19]},{\"full_name\":\"CategoryTheory.Iso.eq_inv_comp\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Iso.lean\",\"def_pos\":[215,9],\"def_end_pos\":[215,20]}]"
31
+ ],
32
+ "state_after": "V : Type (u + 1)\ninst\u271d : LargeCategory V\nG : MonCat\nM N : Action V G\nf : M \u2245 N\ng : \u2191G\n\u22a2 ((forget V G).mapIso f).hom \u226b N.\u03c1 g = M.\u03c1 g \u226b ((forget V G).mapIso f).hom",
33
+ "state_before": "V : Type (u + 1)\ninst\u271d : LargeCategory V\nG : MonCat\nM N : Action V G\nf : M \u2245 N\ng : \u2191G\n\u22a2 N.\u03c1 g = ((forget V G).mapIso f).conj (M.\u03c1 g)",
34
+ "tactic": "rw [Iso.conj_apply, Iso.eq_inv_comp]"
35
+ },
36
+ {
37
+ "annotated_tactic": [
38
+ "\"simp [f.hom.comm]\"",
39
+ "[]"
40
+ ],
41
+ "state_after": "no goals",
42
+ "state_before": "V : Type (u + 1)\ninst\u271d : LargeCategory V\nG : MonCat\nM N : Action V G\nf : M \u2245 N\ng : \u2191G\n\u22a2 ((forget V G).mapIso f).hom \u226b N.\u03c1 g = M.\u03c1 g \u226b ((forget V G).mapIso f).hom",
43
+ "tactic": "simp [f.hom.comm]"
44
+ }
45
+ ],
46
+ "url": "https://github.com/leanprover-community/mathlib4"
47
+ },
48
+ "source_file": "Mathlib/RepresentationTheory/Action/Basic.lean"
49
+ },
50
+ {
51
+ "full_name": "Action.comp_hom",
52
+ "id": "Action.comp_hom",
53
+ "reason": "missing_trace",
54
+ "selection": {
55
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
56
+ "end": [
57
+ 146,
58
+ 6
59
+ ],
60
+ "file_path": "Mathlib/RepresentationTheory/Action/Basic.lean",
61
+ "full_name": "Action.comp_hom",
62
+ "start": [
63
+ 144,
64
+ 1
65
+ ],
66
+ "traced_tactics": [],
67
+ "url": "https://github.com/leanprover-community/mathlib4"
68
+ },
69
+ "source_file": "Mathlib/RepresentationTheory/Action/Basic.lean"
70
+ },
71
+ {
72
+ "full_name": "Action.hom_ext",
73
+ "id": "Action.hom_ext",
74
+ "reason": "missing_trace",
75
+ "selection": {
76
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
77
+ "end": [
78
+ 135,
79
+ 16
80
+ ],
81
+ "file_path": "Mathlib/RepresentationTheory/Action/Basic.lean",
82
+ "full_name": "Action.hom_ext",
83
+ "start": [
84
+ 133,
85
+ 1
86
+ ],
87
+ "traced_tactics": [],
88
+ "url": "https://github.com/leanprover-community/mathlib4"
89
+ },
90
+ "source_file": "Mathlib/RepresentationTheory/Action/Basic.lean"
91
+ },
92
+ {
93
+ "full_name": "Action.id_hom",
94
+ "id": "Action.id_hom",
95
+ "reason": "missing_trace",
96
+ "selection": {
97
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
98
+ "end": [
99
+ 139,
100
+ 6
101
+ ],
102
+ "file_path": "Mathlib/RepresentationTheory/Action/Basic.lean",
103
+ "full_name": "Action.id_hom",
104
+ "start": [
105
+ 138,
106
+ 1
107
+ ],
108
+ "traced_tactics": [],
109
+ "url": "https://github.com/leanprover-community/mathlib4"
110
+ },
111
+ "source_file": "Mathlib/RepresentationTheory/Action/Basic.lean"
112
+ },
113
+ {
114
+ "full_name": "Action.\u03c1_one",
115
+ "id": "Action.\u03c1_one",
116
+ "reason": "missing_trace",
117
+ "selection": {
118
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
119
+ "end": [
120
+ 50,
121
+ 98
122
+ ],
123
+ "file_path": "Mathlib/RepresentationTheory/Action/Basic.lean",
124
+ "full_name": "Action.\u03c1_one",
125
+ "start": [
126
+ 50,
127
+ 1
128
+ ],
129
+ "traced_tactics": [
130
+ {
131
+ "annotated_tactic": [
132
+ "\"rw [<a>MonoidHom.map_one<\\/a>]\"",
133
+ "[{\"full_name\":\"MonoidHom.map_one\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Hom\\/Defs.lean\",\"def_pos\":[758,19],\"def_end_pos\":[758,36]}]"
134
+ ],
135
+ "state_after": "V : Type (u + 1)\ninst\u271d : LargeCategory V\nG : MonCat\nA : Action V G\n\u22a2 1 = \ud835\udfd9 A.V",
136
+ "state_before": "V : Type (u + 1)\ninst\u271d : LargeCategory V\nG : MonCat\nA : Action V G\n\u22a2 A.\u03c1 1 = \ud835\udfd9 A.V",
137
+ "tactic": "rw [MonoidHom.map_one]"
138
+ },
139
+ {
140
+ "annotated_tactic": [
141
+ "\"rfl\"",
142
+ "[]"
143
+ ],
144
+ "state_after": "no goals",
145
+ "state_before": "V : Type (u + 1)\ninst\u271d : LargeCategory V\nG : MonCat\nA : Action V G\n\u22a2 1 = \ud835\udfd9 A.V",
146
+ "tactic": "rfl"
147
+ }
148
+ ],
149
+ "url": "https://github.com/leanprover-community/mathlib4"
150
+ },
151
+ "source_file": "Mathlib/RepresentationTheory/Action/Basic.lean"
152
+ },
153
+ {
154
+ "error": "theorem has no selected tactic transitions",
155
+ "full_name": "Action.FintypeCat.ofMulAction_apply",
156
+ "id": "Action.FintypeCat.ofMulAction_apply",
157
+ "reason": "import_failure",
158
+ "selection": {
159
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
160
+ "end": [
161
+ 92,
162
+ 6
163
+ ],
164
+ "file_path": "Mathlib/RepresentationTheory/Action/Concrete.lean",
165
+ "full_name": "Action.FintypeCat.ofMulAction_apply",
166
+ "start": [
167
+ 90,
168
+ 1
169
+ ],
170
+ "traced_tactics": [],
171
+ "url": "https://github.com/leanprover-community/mathlib4"
172
+ },
173
+ "source_file": "Mathlib/RepresentationTheory/Action/Concrete.lean"
174
+ },
175
+ {
176
+ "error": "theorem has no selected tactic transitions",
177
+ "full_name": "Action.ofMulAction_apply",
178
+ "id": "Action.ofMulAction_apply",
179
+ "reason": "import_failure",
180
+ "selection": {
181
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
182
+ "end": [
183
+ 32,
184
+ 6
185
+ ],
186
+ "file_path": "Mathlib/RepresentationTheory/Action/Concrete.lean",
187
+ "full_name": "Action.ofMulAction_apply",
188
+ "start": [
189
+ 30,
190
+ 1
191
+ ],
192
+ "traced_tactics": [],
193
+ "url": "https://github.com/leanprover-community/mathlib4"
194
+ },
195
+ "source_file": "Mathlib/RepresentationTheory/Action/Concrete.lean"
196
+ }
197
+ ],
198
+ "input_proofs": 7,
199
+ "input_units": 2,
200
+ "proofs": 0,
201
+ "published_proofs": 0,
202
+ "published_transitions": 0,
203
+ "replay_failures": [],
204
+ "transitions": 0,
205
+ "validation_failures": [],
206
+ "validation_rejected_proofs": 0,
207
+ "zero_transition_proofs": 0
208
+ },
209
+ "shards": [],
210
+ "proof_ids": [],
211
+ "proof_keys": []
212
+ }
manifests/batches/mathlib/001635.json ADDED
@@ -0,0 +1,813 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "format": "leangpt-parquet-v2",
3
+ "batch": "mathlib/001635",
4
+ "batch_fingerprint": "ce425384c659f2dfe3bb7a14895643b3abd7f92126c8e8162bdd10e27007a65d",
5
+ "evidence": {
6
+ "batch_fingerprint": "ce425384c659f2dfe3bb7a14895643b3abd7f92126c8e8162bdd10e27007a65d",
7
+ "batch_outcome": "all_inputs_failed_with_evidence",
8
+ "contamination_matches": [],
9
+ "failures": [
10
+ {
11
+ "full_name": "Action.neg_hom",
12
+ "id": "Action.neg_hom",
13
+ "reason": "missing_trace",
14
+ "selection": {
15
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
16
+ "end": [
17
+ 275,
18
+ 6
19
+ ],
20
+ "file_path": "Mathlib/RepresentationTheory/Action/Limits.lean",
21
+ "full_name": "Action.neg_hom",
22
+ "start": [
23
+ 274,
24
+ 1
25
+ ],
26
+ "traced_tactics": [],
27
+ "url": "https://github.com/leanprover-community/mathlib4"
28
+ },
29
+ "source_file": "Mathlib/RepresentationTheory/Action/Limits.lean"
30
+ },
31
+ {
32
+ "full_name": "Action.smul_hom",
33
+ "id": "Action.smul_hom",
34
+ "reason": "missing_trace",
35
+ "selection": {
36
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
37
+ "end": [
38
+ 325,
39
+ 6
40
+ ],
41
+ "file_path": "Mathlib/RepresentationTheory/Action/Limits.lean",
42
+ "full_name": "Action.smul_hom",
43
+ "start": [
44
+ 324,
45
+ 1
46
+ ],
47
+ "traced_tactics": [],
48
+ "url": "https://github.com/leanprover-community/mathlib4"
49
+ },
50
+ "source_file": "Mathlib/RepresentationTheory/Action/Limits.lean"
51
+ },
52
+ {
53
+ "full_name": "Action.sum_hom",
54
+ "id": "Action.sum_hom",
55
+ "reason": "missing_trace",
56
+ "selection": {
57
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
58
+ "end": [
59
+ 288,
60
+ 27
61
+ ],
62
+ "file_path": "Mathlib/RepresentationTheory/Action/Limits.lean",
63
+ "full_name": "Action.sum_hom",
64
+ "start": [
65
+ 286,
66
+ 1
67
+ ],
68
+ "traced_tactics": [],
69
+ "url": "https://github.com/leanprover-community/mathlib4"
70
+ },
71
+ "source_file": "Mathlib/RepresentationTheory/Action/Limits.lean"
72
+ },
73
+ {
74
+ "full_name": "Action.zero_hom",
75
+ "id": "Action.zero_hom",
76
+ "reason": "missing_trace",
77
+ "selection": {
78
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
79
+ "end": [
80
+ 216,
81
+ 6
82
+ ],
83
+ "file_path": "Mathlib/RepresentationTheory/Action/Limits.lean",
84
+ "full_name": "Action.zero_hom",
85
+ "start": [
86
+ 215,
87
+ 1
88
+ ],
89
+ "traced_tactics": [],
90
+ "url": "https://github.com/leanprover-community/mathlib4"
91
+ },
92
+ "source_file": "Mathlib/RepresentationTheory/Action/Limits.lean"
93
+ },
94
+ {
95
+ "full_name": "Action.associator_hom_hom",
96
+ "id": "Action.associator_hom_hom",
97
+ "reason": "missing_trace",
98
+ "selection": {
99
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
100
+ "end": [
101
+ 85,
102
+ 7
103
+ ],
104
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
105
+ "full_name": "Action.associator_hom_hom",
106
+ "start": [
107
+ 82,
108
+ 1
109
+ ],
110
+ "traced_tactics": [
111
+ {
112
+ "annotated_tactic": [
113
+ "\"dsimp\"",
114
+ "[]"
115
+ ],
116
+ "state_after": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX Y Z : Action V G\n\u22a2 (\ud835\udfd9 (X.V \u2297 Y.V) \u2297 \ud835\udfd9 Z.V) \u226b (\u03b1_ X.V Y.V Z.V).hom \u226b (\ud835\udfd9 X.V \u2297 \ud835\udfd9 (Y.V \u2297 Z.V)) = (\u03b1_ X.V Y.V Z.V).hom",
117
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX Y Z : Action V G\n\u22a2 (\u03b1_ X Y Z).hom.hom = (\u03b1_ X.V Y.V Z.V).hom",
118
+ "tactic": "dsimp"
119
+ },
120
+ {
121
+ "annotated_tactic": [
122
+ "\"simp\"",
123
+ "[]"
124
+ ],
125
+ "state_after": "no goals",
126
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX Y Z : Action V G\n\u22a2 (\ud835\udfd9 (X.V \u2297 Y.V) \u2297 \ud835\udfd9 Z.V) \u226b (\u03b1_ X.V Y.V Z.V).hom \u226b (\ud835\udfd9 X.V \u2297 \ud835\udfd9 (Y.V \u2297 Z.V)) = (\u03b1_ X.V Y.V Z.V).hom",
127
+ "tactic": "simp"
128
+ }
129
+ ],
130
+ "url": "https://github.com/leanprover-community/mathlib4"
131
+ },
132
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
133
+ },
134
+ {
135
+ "full_name": "Action.associator_inv_hom",
136
+ "id": "Action.associator_inv_hom",
137
+ "reason": "missing_trace",
138
+ "selection": {
139
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
140
+ "end": [
141
+ 93,
142
+ 7
143
+ ],
144
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
145
+ "full_name": "Action.associator_inv_hom",
146
+ "start": [
147
+ 90,
148
+ 1
149
+ ],
150
+ "traced_tactics": [
151
+ {
152
+ "annotated_tactic": [
153
+ "\"dsimp\"",
154
+ "[]"
155
+ ],
156
+ "state_after": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX Y Z : Action V G\n\u22a2 ((\ud835\udfd9 X.V \u2297 \ud835\udfd9 (Y.V \u2297 Z.V)) \u226b (\u03b1_ X.V Y.V Z.V).inv) \u226b (\ud835\udfd9 (X.V \u2297 Y.V) \u2297 \ud835\udfd9 Z.V) = (\u03b1_ X.V Y.V Z.V).inv",
157
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX Y Z : Action V G\n\u22a2 (\u03b1_ X Y Z).inv.hom = (\u03b1_ X.V Y.V Z.V).inv",
158
+ "tactic": "dsimp"
159
+ },
160
+ {
161
+ "annotated_tactic": [
162
+ "\"simp\"",
163
+ "[]"
164
+ ],
165
+ "state_after": "no goals",
166
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX Y Z : Action V G\n\u22a2 ((\ud835\udfd9 X.V \u2297 \ud835\udfd9 (Y.V \u2297 Z.V)) \u226b (\u03b1_ X.V Y.V Z.V).inv) \u226b (\ud835\udfd9 (X.V \u2297 Y.V) \u2297 \ud835\udfd9 Z.V) = (\u03b1_ X.V Y.V Z.V).inv",
167
+ "tactic": "simp"
168
+ }
169
+ ],
170
+ "url": "https://github.com/leanprover-community/mathlib4"
171
+ },
172
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
173
+ },
174
+ {
175
+ "full_name": "Action.functorCategoryMonoidalAdjunction.counit_app_app",
176
+ "id": "Action.functorCategoryMonoidalAdjunction.counit_app_app",
177
+ "reason": "missing_trace",
178
+ "selection": {
179
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
180
+ "end": [
181
+ 247,
182
+ 6
183
+ ],
184
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
185
+ "full_name": "Action.functorCategoryMonoidalAdjunction.counit_app_app",
186
+ "start": [
187
+ 245,
188
+ 1
189
+ ],
190
+ "traced_tactics": [],
191
+ "url": "https://github.com/leanprover-community/mathlib4"
192
+ },
193
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
194
+ },
195
+ {
196
+ "full_name": "Action.functorCategoryMonoidalAdjunction.unit_app_hom",
197
+ "id": "Action.functorCategoryMonoidalAdjunction.unit_app_hom",
198
+ "reason": "missing_trace",
199
+ "selection": {
200
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
201
+ "end": [
202
+ 240,
203
+ 6
204
+ ],
205
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
206
+ "full_name": "Action.functorCategoryMonoidalAdjunction.unit_app_hom",
207
+ "start": [
208
+ 238,
209
+ 1
210
+ ],
211
+ "traced_tactics": [],
212
+ "url": "https://github.com/leanprover-community/mathlib4"
213
+ },
214
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
215
+ },
216
+ {
217
+ "full_name": "Action.functorCategoryMonoidalEquivalence.functor_map",
218
+ "id": "Action.functorCategoryMonoidalEquivalence.functor_map",
219
+ "reason": "missing_trace",
220
+ "selection": {
221
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
222
+ "end": [
223
+ 254,
224
+ 6
225
+ ],
226
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
227
+ "full_name": "Action.functorCategoryMonoidalEquivalence.functor_map",
228
+ "start": [
229
+ 252,
230
+ 1
231
+ ],
232
+ "traced_tactics": [],
233
+ "url": "https://github.com/leanprover-community/mathlib4"
234
+ },
235
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
236
+ },
237
+ {
238
+ "full_name": "Action.functorCategoryMonoidalEquivalence.inverse_map",
239
+ "id": "Action.functorCategoryMonoidalEquivalence.inverse_map",
240
+ "reason": "missing_trace",
241
+ "selection": {
242
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
243
+ "end": [
244
+ 262,
245
+ 6
246
+ ],
247
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
248
+ "full_name": "Action.functorCategoryMonoidalEquivalence.inverse_map",
249
+ "start": [
250
+ 259,
251
+ 1
252
+ ],
253
+ "traced_tactics": [],
254
+ "url": "https://github.com/leanprover-community/mathlib4"
255
+ },
256
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
257
+ },
258
+ {
259
+ "full_name": "Action.functorCategoryMonoidalEquivalence.\u03b5_app",
260
+ "id": "Action.functorCategoryMonoidalEquivalence.\u03b5_app",
261
+ "reason": "missing_trace",
262
+ "selection": {
263
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
264
+ "end": [
265
+ 233,
266
+ 6
267
+ ],
268
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
269
+ "full_name": "Action.functorCategoryMonoidalEquivalence.\u03b5_app",
270
+ "start": [
271
+ 229,
272
+ 1
273
+ ],
274
+ "traced_tactics": [
275
+ {
276
+ "annotated_tactic": [
277
+ "\"dsimp only [<a>functorCategoryMonoidalEquivalence<\\/a>]\"",
278
+ "[{\"full_name\":\"Action.functorCategoryMonoidalEquivalence\",\"def_path\":\"Mathlib\\/RepresentationTheory\\/Action\\/Monoidal.lean\",\"def_pos\":[192,5],\"def_end_pos\":[192,39]}]"
279
+ ],
280
+ "state_after": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\n\u22a2 (Monoidal.fromTransported (functorCategoryEquivalence V G).symm).\u03b5.app PUnit.unit =\n \ud835\udfd9 ((\ud835\udfd9_ (SingleObj \u2191G \u2964 V)).obj PUnit.unit)",
281
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\n\u22a2 (functorCategoryMonoidalEquivalence V G).\u03b5.app PUnit.unit = \ud835\udfd9 ((\ud835\udfd9_ (SingleObj \u2191G \u2964 V)).obj PUnit.unit)",
282
+ "tactic": "dsimp only [functorCategoryMonoidalEquivalence]"
283
+ },
284
+ {
285
+ "annotated_tactic": [
286
+ "\"simp only [<a>Monoidal.fromTransported_toLaxMonoidalFunctor_\\u03b5<\\/a>]\"",
287
+ "[{\"full_name\":\"CategoryTheory.Monoidal.fromTransported_toLaxMonoidalFunctor_\\u03b5\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monoidal\\/Transport.lean\",\"def_pos\":[187,3],\"def_end_pos\":[187,9]}]"
288
+ ],
289
+ "state_after": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\n\u22a2 ((functorCategoryEquivalence V G).symm.unitIso.hom.app (\ud835\udfd9_ (SingleObj \u2191G \u2964 V))).app PUnit.unit =\n \ud835\udfd9 ((\ud835\udfd9_ (SingleObj \u2191G \u2964 V)).obj PUnit.unit)",
290
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\n\u22a2 (Monoidal.fromTransported (functorCategoryEquivalence V G).symm).\u03b5.app PUnit.unit =\n \ud835\udfd9 ((\ud835\udfd9_ (SingleObj \u2191G \u2964 V)).obj PUnit.unit)",
291
+ "tactic": "simp only [Monoidal.fromTransported_toLaxMonoidalFunctor_\u03b5]"
292
+ },
293
+ {
294
+ "annotated_tactic": [
295
+ "\"rfl\"",
296
+ "[]"
297
+ ],
298
+ "state_after": "no goals",
299
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\n\u22a2 ((functorCategoryEquivalence V G).symm.unitIso.hom.app (\ud835\udfd9_ (SingleObj \u2191G \u2964 V))).app PUnit.unit =\n \ud835\udfd9 ((\ud835\udfd9_ (SingleObj \u2191G \u2964 V)).obj PUnit.unit)",
300
+ "tactic": "rfl"
301
+ }
302
+ ],
303
+ "url": "https://github.com/leanprover-community/mathlib4"
304
+ },
305
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
306
+ },
307
+ {
308
+ "full_name": "Action.functorCategoryMonoidalEquivalence.\u03bc_app",
309
+ "id": "Action.functorCategoryMonoidalEquivalence.\u03bc_app",
310
+ "reason": "missing_trace",
311
+ "selection": {
312
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
313
+ "end": [
314
+ 214,
315
+ 6
316
+ ],
317
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
318
+ "full_name": "Action.functorCategoryMonoidalEquivalence.\u03bc_app",
319
+ "start": [
320
+ 212,
321
+ 1
322
+ ],
323
+ "traced_tactics": [],
324
+ "url": "https://github.com/leanprover-community/mathlib4"
325
+ },
326
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
327
+ },
328
+ {
329
+ "full_name": "Action.leftDual_v",
330
+ "id": "Action.leftDual_v",
331
+ "reason": "missing_trace",
332
+ "selection": {
333
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
334
+ "end": [
335
+ 300,
336
+ 6
337
+ ],
338
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
339
+ "full_name": "Action.leftDual_v",
340
+ "start": [
341
+ 299,
342
+ 1
343
+ ],
344
+ "traced_tactics": [],
345
+ "url": "https://github.com/leanprover-community/mathlib4"
346
+ },
347
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
348
+ },
349
+ {
350
+ "full_name": "Action.leftDual_\u03c1",
351
+ "id": "Action.leftDual_\u03c1",
352
+ "reason": "missing_trace",
353
+ "selection": {
354
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
355
+ "end": [
356
+ 314,
357
+ 35
358
+ ],
359
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
360
+ "full_name": "Action.leftDual_\u03c1",
361
+ "start": [
362
+ 313,
363
+ 1
364
+ ],
365
+ "traced_tactics": [
366
+ {
367
+ "annotated_tactic": [
368
+ "\"rw [\\u2190 <a>SingleObj.inv_as_inv<\\/a>]\"",
369
+ "[{\"full_name\":\"CategoryTheory.SingleObj.inv_as_inv\",\"def_path\":\"Mathlib\\/CategoryTheory\\/SingleObj.lean\",\"def_pos\":[94,9],\"def_end_pos\":[94,19]}]"
370
+ ],
371
+ "state_after": "V : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory V\nG : MonCat\ninst\u271d\u00b9 : MonoidalCategory V\nH : Grp\nX : Action V ((forget\u2082 Grp MonCat).obj H)\ninst\u271d : LeftRigidCategory V\nh : \u2191H\n\u22a2 (\u1601X).\u03c1 h = \u1601X.\u03c1 (inv h)\n\ncase x\nV : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory V\nG : MonCat\ninst\u271d\u00b9 : MonoidalCategory V\nH : Grp\nX : Action V ((forget\u2082 Grp MonCat).obj H)\ninst\u271d : LeftRigidCategory V\nh : \u2191H\n\u22a2 SingleObj H.1\n\ncase y\nV : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory V\nG : MonCat\ninst\u271d\u00b9 : MonoidalCategory V\nH : Grp\nX : Action V ((forget\u2082 Grp MonCat).obj H)\ninst\u271d : LeftRigidCategory V\nh : \u2191H\n\u22a2 SingleObj H.1",
372
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory V\nG : MonCat\ninst\u271d\u00b9 : MonoidalCategory V\nH : Grp\nX : Action V ((forget\u2082 Grp MonCat).obj H)\ninst\u271d : LeftRigidCategory V\nh : \u2191H\n\u22a2 (\u1601X).\u03c1 h = \u1601X.\u03c1 h\u207b\u00b9",
373
+ "tactic": "rw [\u2190 SingleObj.inv_as_inv]"
374
+ },
375
+ {
376
+ "annotated_tactic": [
377
+ "\"rfl\"",
378
+ "[]"
379
+ ],
380
+ "state_after": "no goals",
381
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory V\nG : MonCat\ninst\u271d\u00b9 : MonoidalCategory V\nH : Grp\nX : Action V ((forget\u2082 Grp MonCat).obj H)\ninst\u271d : LeftRigidCategory V\nh : \u2191H\n\u22a2 (\u1601X).\u03c1 h = \u1601X.\u03c1 (inv h)\n\ncase x\nV : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory V\nG : MonCat\ninst\u271d\u00b9 : MonoidalCategory V\nH : Grp\nX : Action V ((forget\u2082 Grp MonCat).obj H)\ninst\u271d : LeftRigidCategory V\nh : \u2191H\n\u22a2 SingleObj H.1\n\ncase y\nV : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory V\nG : MonCat\ninst\u271d\u00b9 : MonoidalCategory V\nH : Grp\nX : Action V ((forget\u2082 Grp MonCat).obj H)\ninst\u271d : LeftRigidCategory V\nh : \u2191H\n\u22a2 SingleObj H.1",
382
+ "tactic": "rfl"
383
+ }
384
+ ],
385
+ "url": "https://github.com/leanprover-community/mathlib4"
386
+ },
387
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
388
+ },
389
+ {
390
+ "full_name": "Action.leftUnitor_hom_hom",
391
+ "id": "Action.leftUnitor_hom_hom",
392
+ "reason": "missing_trace",
393
+ "selection": {
394
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
395
+ "end": [
396
+ 100,
397
+ 7
398
+ ],
399
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
400
+ "full_name": "Action.leftUnitor_hom_hom",
401
+ "start": [
402
+ 98,
403
+ 1
404
+ ],
405
+ "traced_tactics": [
406
+ {
407
+ "annotated_tactic": [
408
+ "\"dsimp\"",
409
+ "[]"
410
+ ],
411
+ "state_after": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX : Action V G\n\u22a2 ((\ud835\udfd9 (\ud835\udfd9_ V) \u2297 \ud835\udfd9 X.V) \u226b (\u03bb_ X.V).hom) \u226b \ud835\udfd9 X.V = (\u03bb_ X.V).hom",
412
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX : Action V G\n\u22a2 (\u03bb_ X).hom.hom = (\u03bb_ X.V).hom",
413
+ "tactic": "dsimp"
414
+ },
415
+ {
416
+ "annotated_tactic": [
417
+ "\"simp\"",
418
+ "[]"
419
+ ],
420
+ "state_after": "no goals",
421
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX : Action V G\n\u22a2 ((\ud835\udfd9 (\ud835\udfd9_ V) \u2297 \ud835\udfd9 X.V) \u226b (\u03bb_ X.V).hom) \u226b \ud835\udfd9 X.V = (\u03bb_ X.V).hom",
422
+ "tactic": "simp"
423
+ }
424
+ ],
425
+ "url": "https://github.com/leanprover-community/mathlib4"
426
+ },
427
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
428
+ },
429
+ {
430
+ "full_name": "Action.leftUnitor_inv_hom",
431
+ "id": "Action.leftUnitor_inv_hom",
432
+ "reason": "missing_trace",
433
+ "selection": {
434
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
435
+ "end": [
436
+ 107,
437
+ 7
438
+ ],
439
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
440
+ "full_name": "Action.leftUnitor_inv_hom",
441
+ "start": [
442
+ 105,
443
+ 1
444
+ ],
445
+ "traced_tactics": [
446
+ {
447
+ "annotated_tactic": [
448
+ "\"dsimp\"",
449
+ "[]"
450
+ ],
451
+ "state_after": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX : Action V G\n\u22a2 \ud835\udfd9 X.V \u226b (\u03bb_ X.V).inv \u226b (\ud835\udfd9 (\ud835\udfd9_ V) \u2297 \ud835\udfd9 X.V) = (\u03bb_ X.V).inv",
452
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX : Action V G\n\u22a2 (\u03bb_ X).inv.hom = (\u03bb_ X.V).inv",
453
+ "tactic": "dsimp"
454
+ },
455
+ {
456
+ "annotated_tactic": [
457
+ "\"simp\"",
458
+ "[]"
459
+ ],
460
+ "state_after": "no goals",
461
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX : Action V G\n\u22a2 \ud835\udfd9 X.V \u226b (\u03bb_ X.V).inv \u226b (\ud835\udfd9 (\ud835\udfd9_ V) \u2297 \ud835\udfd9 X.V) = (\u03bb_ X.V).inv",
462
+ "tactic": "simp"
463
+ }
464
+ ],
465
+ "url": "https://github.com/leanprover-community/mathlib4"
466
+ },
467
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
468
+ },
469
+ {
470
+ "full_name": "Action.rightDual_v",
471
+ "id": "Action.rightDual_v",
472
+ "reason": "missing_trace",
473
+ "selection": {
474
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
475
+ "end": [
476
+ 294,
477
+ 6
478
+ ],
479
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
480
+ "full_name": "Action.rightDual_v",
481
+ "start": [
482
+ 293,
483
+ 1
484
+ ],
485
+ "traced_tactics": [],
486
+ "url": "https://github.com/leanprover-community/mathlib4"
487
+ },
488
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
489
+ },
490
+ {
491
+ "full_name": "Action.rightDual_\u03c1",
492
+ "id": "Action.rightDual_\u03c1",
493
+ "reason": "missing_trace",
494
+ "selection": {
495
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
496
+ "end": [
497
+ 307,
498
+ 35
499
+ ],
500
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
501
+ "full_name": "Action.rightDual_\u03c1",
502
+ "start": [
503
+ 306,
504
+ 1
505
+ ],
506
+ "traced_tactics": [
507
+ {
508
+ "annotated_tactic": [
509
+ "\"rw [\\u2190 <a>SingleObj.inv_as_inv<\\/a>]\"",
510
+ "[{\"full_name\":\"CategoryTheory.SingleObj.inv_as_inv\",\"def_path\":\"Mathlib\\/CategoryTheory\\/SingleObj.lean\",\"def_pos\":[94,9],\"def_end_pos\":[94,19]}]"
511
+ ],
512
+ "state_after": "V : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory V\nG : MonCat\ninst\u271d\u00b9 : MonoidalCategory V\nH : Grp\nX : Action V ((forget\u2082 Grp MonCat).obj H)\ninst\u271d : RightRigidCategory V\nh : \u2191H\n\u22a2 X\u1601.\u03c1 h = X.\u03c1 (inv h)\u1601\n\ncase x\nV : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory V\nG : MonCat\ninst\u271d\u00b9 : MonoidalCategory V\nH : Grp\nX : Action V ((forget\u2082 Grp MonCat).obj H)\ninst\u271d : RightRigidCategory V\nh : \u2191H\n\u22a2 SingleObj H.1\n\ncase y\nV : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory V\nG : MonCat\ninst\u271d\u00b9 : MonoidalCategory V\nH : Grp\nX : Action V ((forget\u2082 Grp MonCat).obj H)\ninst\u271d : RightRigidCategory V\nh : \u2191H\n\u22a2 SingleObj H.1",
513
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory V\nG : MonCat\ninst\u271d\u00b9 : MonoidalCategory V\nH : Grp\nX : Action V ((forget\u2082 Grp MonCat).obj H)\ninst\u271d : RightRigidCategory V\nh : \u2191H\n\u22a2 X\u1601.\u03c1 h = X.\u03c1 h\u207b\u00b9\u1601",
514
+ "tactic": "rw [\u2190 SingleObj.inv_as_inv]"
515
+ },
516
+ {
517
+ "annotated_tactic": [
518
+ "\"rfl\"",
519
+ "[]"
520
+ ],
521
+ "state_after": "no goals",
522
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory V\nG : MonCat\ninst\u271d\u00b9 : MonoidalCategory V\nH : Grp\nX : Action V ((forget\u2082 Grp MonCat).obj H)\ninst\u271d : RightRigidCategory V\nh : \u2191H\n\u22a2 X\u1601.\u03c1 h = X.\u03c1 (inv h)\u1601\n\ncase x\nV : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory V\nG : MonCat\ninst\u271d\u00b9 : MonoidalCategory V\nH : Grp\nX : Action V ((forget\u2082 Grp MonCat).obj H)\ninst\u271d : RightRigidCategory V\nh : \u2191H\n\u22a2 SingleObj H.1\n\ncase y\nV : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory V\nG : MonCat\ninst\u271d\u00b9 : MonoidalCategory V\nH : Grp\nX : Action V ((forget\u2082 Grp MonCat).obj H)\ninst\u271d : RightRigidCategory V\nh : \u2191H\n\u22a2 SingleObj H.1",
523
+ "tactic": "rfl"
524
+ }
525
+ ],
526
+ "url": "https://github.com/leanprover-community/mathlib4"
527
+ },
528
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
529
+ },
530
+ {
531
+ "full_name": "Action.rightUnitor_hom_hom",
532
+ "id": "Action.rightUnitor_hom_hom",
533
+ "reason": "missing_trace",
534
+ "selection": {
535
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
536
+ "end": [
537
+ 114,
538
+ 7
539
+ ],
540
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
541
+ "full_name": "Action.rightUnitor_hom_hom",
542
+ "start": [
543
+ 112,
544
+ 1
545
+ ],
546
+ "traced_tactics": [
547
+ {
548
+ "annotated_tactic": [
549
+ "\"dsimp\"",
550
+ "[]"
551
+ ],
552
+ "state_after": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX : Action V G\n\u22a2 ((\ud835\udfd9 X.V \u2297 \ud835\udfd9 (\ud835\udfd9_ V)) \u226b (\u03c1_ X.V).hom) \u226b \ud835\udfd9 X.V = (\u03c1_ X.V).hom",
553
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX : Action V G\n\u22a2 (\u03c1_ X).hom.hom = (\u03c1_ X.V).hom",
554
+ "tactic": "dsimp"
555
+ },
556
+ {
557
+ "annotated_tactic": [
558
+ "\"simp\"",
559
+ "[]"
560
+ ],
561
+ "state_after": "no goals",
562
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX : Action V G\n\u22a2 ((\ud835\udfd9 X.V \u2297 \ud835\udfd9 (\ud835\udfd9_ V)) \u226b (\u03c1_ X.V).hom) \u226b \ud835\udfd9 X.V = (\u03c1_ X.V).hom",
563
+ "tactic": "simp"
564
+ }
565
+ ],
566
+ "url": "https://github.com/leanprover-community/mathlib4"
567
+ },
568
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
569
+ },
570
+ {
571
+ "full_name": "Action.rightUnitor_inv_hom",
572
+ "id": "Action.rightUnitor_inv_hom",
573
+ "reason": "missing_trace",
574
+ "selection": {
575
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
576
+ "end": [
577
+ 121,
578
+ 7
579
+ ],
580
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
581
+ "full_name": "Action.rightUnitor_inv_hom",
582
+ "start": [
583
+ 119,
584
+ 1
585
+ ],
586
+ "traced_tactics": [
587
+ {
588
+ "annotated_tactic": [
589
+ "\"dsimp\"",
590
+ "[]"
591
+ ],
592
+ "state_after": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX : Action V G\n\u22a2 \ud835\udfd9 X.V \u226b (\u03c1_ X.V).inv \u226b (\ud835\udfd9 X.V \u2297 \ud835\udfd9 (\ud835\udfd9_ V)) = (\u03c1_ X.V).inv",
593
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX : Action V G\n\u22a2 (\u03c1_ X).inv.hom = (\u03c1_ X.V).inv",
594
+ "tactic": "dsimp"
595
+ },
596
+ {
597
+ "annotated_tactic": [
598
+ "\"simp\"",
599
+ "[]"
600
+ ],
601
+ "state_after": "no goals",
602
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b9 : LargeCategory V\nG : MonCat\ninst\u271d : MonoidalCategory V\nX : Action V G\n\u22a2 \ud835\udfd9 X.V \u226b (\u03c1_ X.V).inv \u226b (\ud835\udfd9 X.V \u2297 \ud835\udfd9 (\ud835\udfd9_ V)) = (\u03c1_ X.V).inv",
603
+ "tactic": "simp"
604
+ }
605
+ ],
606
+ "url": "https://github.com/leanprover-community/mathlib4"
607
+ },
608
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
609
+ },
610
+ {
611
+ "full_name": "Action.tensorUnit_rho",
612
+ "id": "Action.tensorUnit_rho",
613
+ "reason": "missing_trace",
614
+ "selection": {
615
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
616
+ "end": [
617
+ 49,
618
+ 6
619
+ ],
620
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
621
+ "full_name": "Action.tensorUnit_rho",
622
+ "start": [
623
+ 48,
624
+ 1
625
+ ],
626
+ "traced_tactics": [],
627
+ "url": "https://github.com/leanprover-community/mathlib4"
628
+ },
629
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
630
+ },
631
+ {
632
+ "full_name": "Action.tensorUnit_v",
633
+ "id": "Action.tensorUnit_v",
634
+ "reason": "missing_trace",
635
+ "selection": {
636
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
637
+ "end": [
638
+ 43,
639
+ 6
640
+ ],
641
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
642
+ "full_name": "Action.tensorUnit_v",
643
+ "start": [
644
+ 42,
645
+ 1
646
+ ],
647
+ "traced_tactics": [],
648
+ "url": "https://github.com/leanprover-community/mathlib4"
649
+ },
650
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
651
+ },
652
+ {
653
+ "full_name": "Action.tensor_rho",
654
+ "id": "Action.tensor_rho",
655
+ "reason": "missing_trace",
656
+ "selection": {
657
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
658
+ "end": [
659
+ 61,
660
+ 6
661
+ ],
662
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
663
+ "full_name": "Action.tensor_rho",
664
+ "start": [
665
+ 60,
666
+ 1
667
+ ],
668
+ "traced_tactics": [],
669
+ "url": "https://github.com/leanprover-community/mathlib4"
670
+ },
671
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
672
+ },
673
+ {
674
+ "full_name": "Action.tensor_v",
675
+ "id": "Action.tensor_v",
676
+ "reason": "missing_trace",
677
+ "selection": {
678
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
679
+ "end": [
680
+ 55,
681
+ 6
682
+ ],
683
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
684
+ "full_name": "Action.tensor_v",
685
+ "start": [
686
+ 54,
687
+ 1
688
+ ],
689
+ "traced_tactics": [],
690
+ "url": "https://github.com/leanprover-community/mathlib4"
691
+ },
692
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
693
+ },
694
+ {
695
+ "full_name": "Action.whiskerLeft_hom",
696
+ "id": "Action.whiskerLeft_hom",
697
+ "reason": "missing_trace",
698
+ "selection": {
699
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
700
+ "end": [
701
+ 74,
702
+ 6
703
+ ],
704
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
705
+ "full_name": "Action.whiskerLeft_hom",
706
+ "start": [
707
+ 72,
708
+ 1
709
+ ],
710
+ "traced_tactics": [],
711
+ "url": "https://github.com/leanprover-community/mathlib4"
712
+ },
713
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
714
+ },
715
+ {
716
+ "full_name": "Action.whiskerRight_hom",
717
+ "id": "Action.whiskerRight_hom",
718
+ "reason": "missing_trace",
719
+ "selection": {
720
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
721
+ "end": [
722
+ 79,
723
+ 6
724
+ ],
725
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
726
+ "full_name": "Action.whiskerRight_hom",
727
+ "start": [
728
+ 77,
729
+ 1
730
+ ],
731
+ "traced_tactics": [],
732
+ "url": "https://github.com/leanprover-community/mathlib4"
733
+ },
734
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
735
+ },
736
+ {
737
+ "full_name": "CategoryTheory.MonoidalFunctor.mapAction_\u03b5_inv_hom",
738
+ "id": "CategoryTheory.MonoidalFunctor.mapAction_\u03b5_inv_hom",
739
+ "reason": "missing_trace",
740
+ "selection": {
741
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
742
+ "end": [
743
+ 415,
744
+ 56
745
+ ],
746
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
747
+ "full_name": "CategoryTheory.MonoidalFunctor.mapAction_\u03b5_inv_hom",
748
+ "start": [
749
+ 413,
750
+ 1
751
+ ],
752
+ "traced_tactics": [
753
+ {
754
+ "annotated_tactic": [
755
+ "\"rw [\\u2190 <a>cancel_mono<\\/a> F.\\u03b5, <a>IsIso.inv_hom_id<\\/a>, \\u2190 F.mapAction_toLaxMonoidalFunctor_\\u03b5_hom G,\\n \\u2190 <a>Action.comp_hom<\\/a>, <a>IsIso.inv_hom_id<\\/a>, <a>Action.id_hom<\\/a>]\"",
756
+ "[{\"full_name\":\"CategoryTheory.cancel_mono\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Category\\/Basic.lean\",\"def_pos\":[310,9],\"def_end_pos\":[310,20]},{\"full_name\":\"CategoryTheory.IsIso.inv_hom_id\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Iso.lean\",\"def_pos\":[291,9],\"def_end_pos\":[291,19]},{\"full_name\":\"Action.comp_hom\",\"def_path\":\"Mathlib\\/RepresentationTheory\\/Action\\/Basic.lean\",\"def_pos\":[144,9],\"def_end_pos\":[144,17]},{\"full_name\":\"CategoryTheory.IsIso.inv_hom_id\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Iso.lean\",\"def_pos\":[291,9],\"def_end_pos\":[291,19]},{\"full_name\":\"Action.id_hom\",\"def_path\":\"Mathlib\\/RepresentationTheory\\/Action\\/Basic.lean\",\"def_pos\":[138,9],\"def_end_pos\":[138,15]}]"
757
+ ],
758
+ "state_after": "no goals",
759
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b3 : LargeCategory V\nG\u271d : MonCat\nW : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory W\ninst\u271d\u00b9 : MonoidalCategory V\ninst\u271d : MonoidalCategory W\nF : MonoidalFunctor V W\nG : MonCat\n\u22a2 (inv (F.mapAction G).\u03b5).hom = inv F.\u03b5",
760
+ "tactic": "rw [\u2190 cancel_mono F.\u03b5, IsIso.inv_hom_id, \u2190 F.mapAction_toLaxMonoidalFunctor_\u03b5_hom G,\n \u2190 Action.comp_hom, IsIso.inv_hom_id, Action.id_hom]"
761
+ }
762
+ ],
763
+ "url": "https://github.com/leanprover-community/mathlib4"
764
+ },
765
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
766
+ },
767
+ {
768
+ "full_name": "CategoryTheory.MonoidalFunctor.mapAction_\u03bc_inv_hom",
769
+ "id": "CategoryTheory.MonoidalFunctor.mapAction_\u03bc_inv_hom",
770
+ "reason": "missing_trace",
771
+ "selection": {
772
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
773
+ "end": [
774
+ 423,
775
+ 56
776
+ ],
777
+ "file_path": "Mathlib/RepresentationTheory/Action/Monoidal.lean",
778
+ "full_name": "CategoryTheory.MonoidalFunctor.mapAction_\u03bc_inv_hom",
779
+ "start": [
780
+ 420,
781
+ 1
782
+ ],
783
+ "traced_tactics": [
784
+ {
785
+ "annotated_tactic": [
786
+ "\"rw [\\u2190 <a>cancel_mono<\\/a> (F.\\u03bc X.V Y.V), <a>IsIso.inv_hom_id<\\/a>, \\u2190 F.mapAction_toLaxMonoidalFunctor_\\u03bc_hom G,\\n \\u2190 <a>Action.comp_hom<\\/a>, <a>IsIso.inv_hom_id<\\/a>, <a>Action.id_hom<\\/a>]\"",
787
+ "[{\"full_name\":\"CategoryTheory.cancel_mono\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Category\\/Basic.lean\",\"def_pos\":[310,9],\"def_end_pos\":[310,20]},{\"full_name\":\"CategoryTheory.IsIso.inv_hom_id\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Iso.lean\",\"def_pos\":[291,9],\"def_end_pos\":[291,19]},{\"full_name\":\"Action.comp_hom\",\"def_path\":\"Mathlib\\/RepresentationTheory\\/Action\\/Basic.lean\",\"def_pos\":[144,9],\"def_end_pos\":[144,17]},{\"full_name\":\"CategoryTheory.IsIso.inv_hom_id\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Iso.lean\",\"def_pos\":[291,9],\"def_end_pos\":[291,19]},{\"full_name\":\"Action.id_hom\",\"def_path\":\"Mathlib\\/RepresentationTheory\\/Action\\/Basic.lean\",\"def_pos\":[138,9],\"def_end_pos\":[138,15]}]"
788
+ ],
789
+ "state_after": "no goals",
790
+ "state_before": "V : Type (u + 1)\ninst\u271d\u00b3 : LargeCategory V\nG\u271d : MonCat\nW : Type (u + 1)\ninst\u271d\u00b2 : LargeCategory W\ninst\u271d\u00b9 : MonoidalCategory V\ninst\u271d : MonoidalCategory W\nF : MonoidalFunctor V W\nG : MonCat\nX Y : Action V G\n\u22a2 (inv ((F.mapAction G).\u03bc X Y)).hom = inv (F.\u03bc X.V Y.V)",
791
+ "tactic": "rw [\u2190 cancel_mono (F.\u03bc X.V Y.V), IsIso.inv_hom_id, \u2190 F.mapAction_toLaxMonoidalFunctor_\u03bc_hom G,\n \u2190 Action.comp_hom, IsIso.inv_hom_id, Action.id_hom]"
792
+ }
793
+ ],
794
+ "url": "https://github.com/leanprover-community/mathlib4"
795
+ },
796
+ "source_file": "Mathlib/RepresentationTheory/Action/Monoidal.lean"
797
+ }
798
+ ],
799
+ "input_proofs": 28,
800
+ "input_units": 2,
801
+ "proofs": 0,
802
+ "published_proofs": 0,
803
+ "published_transitions": 0,
804
+ "replay_failures": [],
805
+ "transitions": 0,
806
+ "validation_failures": [],
807
+ "validation_rejected_proofs": 0,
808
+ "zero_transition_proofs": 0
809
+ },
810
+ "shards": [],
811
+ "proof_ids": [],
812
+ "proof_keys": []
813
+ }
manifests/batches/mathlib/001639.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001641.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001642.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001651.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001659.json ADDED
The diff for this file is too large to render. See raw diff
 
manifests/batches/mathlib/001661.json ADDED
@@ -0,0 +1,620 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "format": "leangpt-parquet-v2",
3
+ "batch": "mathlib/001661",
4
+ "batch_fingerprint": "d4b570062fef2b79a8204e057b32ffa6e3c758beb015132de5abb0ad7242a74a",
5
+ "evidence": {
6
+ "batch_fingerprint": "d4b570062fef2b79a8204e057b32ffa6e3c758beb015132de5abb0ad7242a74a",
7
+ "contamination_matches": [],
8
+ "failures": [
9
+ {
10
+ "error": "theorem has no selected tactic transitions",
11
+ "full_name": "Set.integer_valuation_le_one",
12
+ "id": "Set.integer_valuation_le_one",
13
+ "reason": "import_failure",
14
+ "selection": {
15
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
16
+ "end": [
17
+ 82,
18
+ 18
19
+ ],
20
+ "file_path": "Mathlib/RingTheory/DedekindDomain/SInteger.lean",
21
+ "full_name": "Set.integer_valuation_le_one",
22
+ "start": [
23
+ 80,
24
+ 1
25
+ ],
26
+ "traced_tactics": [],
27
+ "url": "https://github.com/leanprover-community/mathlib4"
28
+ },
29
+ "source_file": "Mathlib/RingTheory/DedekindDomain/SInteger.lean"
30
+ },
31
+ {
32
+ "error": "theorem has no selected tactic transitions",
33
+ "full_name": "Set.unit_eq",
34
+ "id": "Set.unit_eq",
35
+ "reason": "import_failure",
36
+ "selection": {
37
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
38
+ "end": [
39
+ 101,
40
+ 25
41
+ ],
42
+ "file_path": "Mathlib/RingTheory/DedekindDomain/SInteger.lean",
43
+ "full_name": "Set.unit_eq",
44
+ "start": [
45
+ 99,
46
+ 1
47
+ ],
48
+ "traced_tactics": [],
49
+ "url": "https://github.com/leanprover-community/mathlib4"
50
+ },
51
+ "source_file": "Mathlib/RingTheory/DedekindDomain/SInteger.lean"
52
+ },
53
+ {
54
+ "error": "theorem has no selected tactic transitions",
55
+ "full_name": "Set.unit_valuation_eq_one",
56
+ "id": "Set.unit_valuation_eq_one",
57
+ "reason": "import_failure",
58
+ "selection": {
59
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
60
+ "end": [
61
+ 106,
62
+ 18
63
+ ],
64
+ "file_path": "Mathlib/RingTheory/DedekindDomain/SInteger.lean",
65
+ "full_name": "Set.unit_valuation_eq_one",
66
+ "start": [
67
+ 104,
68
+ 1
69
+ ],
70
+ "traced_tactics": [],
71
+ "url": "https://github.com/leanprover-community/mathlib4"
72
+ },
73
+ "source_file": "Mathlib/RingTheory/DedekindDomain/SInteger.lean"
74
+ },
75
+ {
76
+ "error": "no internal trace for tactic 'rfl'",
77
+ "full_name": "IsDedekindDomain.HeightOneSpectrum.valuationOfNeZeroToFun_eq",
78
+ "id": "IsDedekindDomain.HeightOneSpectrum.valuationOfNeZeroToFun_eq",
79
+ "reason": "import_failure",
80
+ "selection": {
81
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
82
+ "end": [
83
+ 102,
84
+ 31
85
+ ],
86
+ "file_path": "Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean",
87
+ "full_name": "IsDedekindDomain.HeightOneSpectrum.valuationOfNeZeroToFun_eq",
88
+ "start": [
89
+ 93,
90
+ 1
91
+ ],
92
+ "traced_tactics": [
93
+ {
94
+ "annotated_tactic": [
95
+ "\"rw [show v.valuation (x : K) = _ * _ by rfl]\"",
96
+ "[]"
97
+ ],
98
+ "state_after": "R : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx : K\u02e3\n\u22a2 \u2191(v.valuationOfNeZeroToFun x) =\n \u2191v.intValuation.toMonoidWithZeroHom ((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).1 *\n \u2191((IsUnit.liftRight ((\u2191v.intValuation.toMonoidWithZeroHom).restrict R\u2070) \u22ef)\n ((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).2)\u207b\u00b9",
99
+ "state_before": "R : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx : K\u02e3\n\u22a2 \u2191(v.valuationOfNeZeroToFun x) = v.valuation \u2191x",
100
+ "tactic": "rw [show v.valuation (x : K) = _ * _ by rfl]"
101
+ },
102
+ {
103
+ "annotated_tactic": [
104
+ "\"rw [<a>Units.val_inv_eq_inv_val<\\/a>]\"",
105
+ "[{\"full_name\":\"Units.val_inv_eq_inv_val\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[461,48],\"def_end_pos\":[461,66]}]"
106
+ ],
107
+ "state_after": "R : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx : K\u02e3\n\u22a2 \u2191(v.valuationOfNeZeroToFun x) =\n \u2191v.intValuation.toMonoidWithZeroHom ((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).1 *\n (\u2191((IsUnit.liftRight ((\u2191v.intValuation.toMonoidWithZeroHom).restrict R\u2070) \u22ef)\n ((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).2))\u207b\u00b9",
108
+ "state_before": "R : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx : K\u02e3\n\u22a2 \u2191(v.valuationOfNeZeroToFun x) =\n \u2191v.intValuation.toMonoidWithZeroHom ((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).1 *\n \u2191((IsUnit.liftRight ((\u2191v.intValuation.toMonoidWithZeroHom).restrict R\u2070) \u22ef)\n ((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).2)\u207b\u00b9",
109
+ "tactic": "rw [Units.val_inv_eq_inv_val]"
110
+ },
111
+ {
112
+ "annotated_tactic": [
113
+ "\"change _ = <a>ite<\\/a> _ _ _ * (<a>ite<\\/a> _ _ _)\\u207b\\u00b9\"",
114
+ "[{\"full_name\":\"ite\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[970,21],\"def_end_pos\":[970,24]},{\"full_name\":\"ite\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[970,21],\"def_end_pos\":[970,24]}]"
115
+ ],
116
+ "state_after": "R : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx : K\u02e3\n\u22a2 \u2191(v.valuationOfNeZeroToFun x) =\n (if ((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).1 = 0 then 0\n else\n \u2191(Multiplicative.ofAdd\n (-\u2191((Associates.mk v.asIdeal).count\n (Associates.mk (Ideal.span {((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).1})).factors)))) *\n (if (SubmonoidClass.subtype R\u2070) ((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).2 = 0 then 0\n else\n \u2191(Multiplicative.ofAdd\n (-\u2191((Associates.mk v.asIdeal).count\n (Associates.mk\n (Ideal.span\n {(SubmonoidClass.subtype R\u2070)\n ((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).2})).factors))))\u207b\u00b9",
117
+ "state_before": "R : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx : K\u02e3\n\u22a2 \u2191(v.valuationOfNeZeroToFun x) =\n \u2191v.intValuation.toMonoidWithZeroHom ((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).1 *\n (\u2191((IsUnit.liftRight ((\u2191v.intValuation.toMonoidWithZeroHom).restrict R\u2070) \u22ef)\n ((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).2))\u207b\u00b9",
118
+ "tactic": "change _ = ite _ _ _ * (ite _ _ _)\u207b\u00b9"
119
+ },
120
+ {
121
+ "annotated_tactic": [
122
+ "\"simp_rw [<a>IsLocalization.toLocalizationMap_sec<\\/a>, <a>SubmonoidClass.coe_subtype<\\/a>,\\n <a>if_neg<\\/a> <| <a>IsLocalization.sec_fst_ne_zero<\\/a> <a>le_rfl<\\/a> x.ne_zero,\\n <a>if_neg<\\/a> (<a>nonZeroDivisors.coe_ne_zero<\\/a> _),\\n <a>valuationOfNeZeroToFun<\\/a>, <a>ofAdd_sub<\\/a>, <a>ofAdd_neg<\\/a>, <a>div_inv_eq_mul<\\/a>, <a>WithZero.coe_mul<\\/a>,\\n <a>WithZero.coe_inv<\\/a>, <a>inv_inv<\\/a>]\"",
123
+ "[{\"full_name\":\"IsLocalization.toLocalizationMap_sec\",\"def_path\":\"Mathlib\\/RingTheory\\/Localization\\/Basic.lean\",\"def_pos\":[189,9],\"def_end_pos\":[189,30]},{\"full_name\":\"SubmonoidClass.coe_subtype\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Submonoid\\/Operations.lean\",\"def_pos\":[610,9],\"def_end_pos\":[610,20]},{\"full_name\":\"if_neg\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Core.lean\",\"def_pos\":[937,9],\"def_end_pos\":[937,15]},{\"full_name\":\"IsLocalization.sec_fst_ne_zero\",\"def_path\":\"Mathlib\\/RingTheory\\/Localization\\/Basic.lean\",\"def_pos\":[1259,9],\"def_end_pos\":[1259,24]},{\"full_name\":\"le_rfl\",\"def_path\":\"Mathlib\\/Init\\/Order\\/Defs.lean\",\"def_pos\":[50,9],\"def_end_pos\":[50,15]},{\"full_name\":\"if_neg\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Core.lean\",\"def_pos\":[937,9],\"def_end_pos\":[937,15]},{\"full_name\":\"nonZeroDivisors.coe_ne_zero\",\"def_path\":\"Mathlib\\/Algebra\\/GroupWithZero\\/NonZeroDivisors.lean\",\"def_pos\":[178,9],\"def_end_pos\":[178,36]},{\"full_name\":\"IsDedekindDomain.HeightOneSpectrum.valuationOfNeZeroToFun\",\"def_path\":\"Mathlib\\/RingTheory\\/DedekindDomain\\/SelmerGroup.lean\",\"def_pos\":[85,5],\"def_end_pos\":[85,27]},{\"full_name\":\"ofAdd_sub\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/TypeTags.lean\",\"def_pos\":[377,9],\"def_end_pos\":[377,18]},{\"full_name\":\"ofAdd_neg\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/TypeTags.lean\",\"def_pos\":[359,9],\"def_end_pos\":[359,18]},{\"full_name\":\"div_inv_eq_mul\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Basic.lean\",\"def_pos\":[698,9],\"def_end_pos\":[698,23]},{\"full_name\":\"WithZero.coe_mul\",\"def_path\":\"Mathlib\\/Algebra\\/GroupWithZero\\/WithZero.lean\",\"def_pos\":[49,26],\"def_end_pos\":[49,33]},{\"full_name\":\"WithZero.coe_inv\",\"def_path\":\"Mathlib\\/Algebra\\/GroupWithZero\\/WithZero.lean\",\"def_pos\":[178,26],\"def_end_pos\":[178,33]},{\"full_name\":\"inv_inv\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Defs.lean\",\"def_pos\":[870,9],\"def_end_pos\":[870,16]}]"
124
+ ],
125
+ "state_after": "no goals",
126
+ "state_before": "R : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx : K\u02e3\n\u22a2 \u2191(v.valuationOfNeZeroToFun x) =\n (if ((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).1 = 0 then 0\n else\n \u2191(Multiplicative.ofAdd\n (-\u2191((Associates.mk v.asIdeal).count\n (Associates.mk (Ideal.span {((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).1})).factors)))) *\n (if (SubmonoidClass.subtype R\u2070) ((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).2 = 0 then 0\n else\n \u2191(Multiplicative.ofAdd\n (-\u2191((Associates.mk v.asIdeal).count\n (Associates.mk\n (Ideal.span\n {(SubmonoidClass.subtype R\u2070)\n ((IsLocalization.toLocalizationMap R\u2070 K).sec \u2191x).2})).factors))))\u207b\u00b9",
127
+ "tactic": "simp_rw [IsLocalization.toLocalizationMap_sec, SubmonoidClass.coe_subtype,\n if_neg <| IsLocalization.sec_fst_ne_zero le_rfl x.ne_zero,\n if_neg (nonZeroDivisors.coe_ne_zero _),\n valuationOfNeZeroToFun, ofAdd_sub, ofAdd_neg, div_inv_eq_mul, WithZero.coe_mul,\n WithZero.coe_inv, inv_inv]"
128
+ },
129
+ {
130
+ "annotated_tactic": [
131
+ "\"rfl\"",
132
+ "[]"
133
+ ],
134
+ "state_after": "no goals",
135
+ "state_before": "R : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx : K\u02e3\n\u22a2 v.valuation \u2191x = ?m.4483 * ?m.4486",
136
+ "tactic": "rfl"
137
+ }
138
+ ],
139
+ "url": "https://github.com/leanprover-community/mathlib4"
140
+ },
141
+ "source_file": "Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean"
142
+ },
143
+ {
144
+ "error": "theorem has no selected tactic transitions",
145
+ "full_name": "IsDedekindDomain.HeightOneSpectrum.valuationOfNeZero_eq",
146
+ "id": "IsDedekindDomain.HeightOneSpectrum.valuationOfNeZero_eq",
147
+ "reason": "import_failure",
148
+ "selection": {
149
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
150
+ "end": [
151
+ 116,
152
+ 32
153
+ ],
154
+ "file_path": "Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean",
155
+ "full_name": "IsDedekindDomain.HeightOneSpectrum.valuationOfNeZero_eq",
156
+ "start": [
157
+ 115,
158
+ 1
159
+ ],
160
+ "traced_tactics": [],
161
+ "url": "https://github.com/leanprover-community/mathlib4"
162
+ },
163
+ "source_file": "Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean"
164
+ },
165
+ {
166
+ "error": "no internal trace for tactic 'simpa only [Units.ext_iff, powMonoidHom_apply, Units.val_pow_eq_pow_val] using\\n NoZeroSMulDivisors.algebraMap_injective R K hv'",
167
+ "full_name": "IsDedekindDomain.selmerGroup.fromUnit_ker",
168
+ "id": "IsDedekindDomain.selmerGroup.fromUnit_ker",
169
+ "reason": "import_failure",
170
+ "selection": {
171
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
172
+ "end": [
173
+ 234,
174
+ 78
175
+ ],
176
+ "file_path": "Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean",
177
+ "full_name": "IsDedekindDomain.selmerGroup.fromUnit_ker",
178
+ "start": [
179
+ 209,
180
+ 1
181
+ ],
182
+ "traced_tactics": [
183
+ {
184
+ "annotated_tactic": [
185
+ "\"ext \\u27e8_, _, _, _\\u27e9\"",
186
+ "[]"
187
+ ],
188
+ "state_after": "case h.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker \u2194\n { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
189
+ "state_before": "R : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\n\u22a2 fromUnit.ker = (powMonoidHom n).range",
190
+ "tactic": "ext \u27e8_, _, _, _\u27e9"
191
+ },
192
+ {
193
+ "annotated_tactic": [
194
+ "\"constructor\"",
195
+ "[]"
196
+ ],
197
+ "state_after": "case h.mk.mp\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker \u2192\n { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range\n\ncase h.mk.mpr\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range \u2192\n { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker",
198
+ "state_before": "case h.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker \u2194\n { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
199
+ "tactic": "constructor"
200
+ },
201
+ {
202
+ "annotated_tactic": [
203
+ "\"intro hx\"",
204
+ "[]"
205
+ ],
206
+ "state_after": "case h.mk.mp\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
207
+ "state_before": "case h.mk.mp\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker \u2192\n { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
208
+ "tactic": "intro hx"
209
+ },
210
+ {
211
+ "annotated_tactic": [
212
+ "\"rcases (<a>QuotientGroup.eq_one_iff<\\/a> _).<a>mp<\\/a> (Subtype.mk.inj hx) with \\u27e8\\u27e8v, i, vi, iv\\u27e9, hx\\u27e9\"",
213
+ "[{\"full_name\":\"QuotientGroup.eq_one_iff\",\"def_path\":\"Mathlib\\/GroupTheory\\/QuotientGroup.lean\",\"def_pos\":[129,9],\"def_end_pos\":[129,19]},{\"full_name\":\"Iff.mp\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Core.lean\",\"def_pos\":[118,3],\"def_end_pos\":[118,5]}]"
214
+ ],
215
+ "state_after": "case h.mk.mp.intro.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv i : K\nvi : v * i = 1\niv : i * v = 1\nhx :\n (powMonoidHom n) { val := v, inv := i, val_inv := vi, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
216
+ "state_before": "case h.mk.mp\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
217
+ "tactic": "rcases (QuotientGroup.eq_one_iff _).mp (Subtype.mk.inj hx) with \u27e8\u27e8v, i, vi, iv\u27e9, hx\u27e9"
218
+ },
219
+ {
220
+ "annotated_tactic": [
221
+ "\"have hv : \\u2191(_ ^ n : K\\u02e3) = <a>algebraMap<\\/a> R K _ := <a>congr_arg<\\/a> <a>Units.val<\\/a> hx\"",
222
+ "[{\"full_name\":\"algebraMap\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Defs.lean\",\"def_pos\":[110,5],\"def_end_pos\":[110,15]},{\"full_name\":\"congr_arg\",\"def_path\":\".lake\\/packages\\/batteries\\/Batteries\\/Logic.lean\",\"def_pos\":[76,7],\"def_end_pos\":[76,16]},{\"full_name\":\"Units.val\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[54,3],\"def_end_pos\":[54,6]}]"
223
+ ],
224
+ "state_after": "case h.mk.mp.intro.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv i : K\nvi : v * i = 1\niv : i * v = 1\nhx :\n (powMonoidHom n) { val := v, inv := i, val_inv := vi, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191({ val := v, inv := i, val_inv := vi, inv_val := iv } ^ n) =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
225
+ "state_before": "case h.mk.mp.intro.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv i : K\nvi : v * i = 1\niv : i * v = 1\nhx :\n (powMonoidHom n) { val := v, inv := i, val_inv := vi, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
226
+ "tactic": "have hv : \u2191(_ ^ n : K\u02e3) = algebraMap R K _ := congr_arg Units.val hx"
227
+ },
228
+ {
229
+ "annotated_tactic": [
230
+ "\"have hi : \\u2191(_ ^ n : K\\u02e3)\\u207b\\u00b9 = <a>algebraMap<\\/a> R K _ := <a>congr_arg<\\/a> <a>Units.inv<\\/a> hx\"",
231
+ "[{\"full_name\":\"algebraMap\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Defs.lean\",\"def_pos\":[110,5],\"def_end_pos\":[110,15]},{\"full_name\":\"congr_arg\",\"def_path\":\".lake\\/packages\\/batteries\\/Batteries\\/Logic.lean\",\"def_pos\":[76,7],\"def_end_pos\":[76,16]},{\"full_name\":\"Units.inv\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[56,3],\"def_end_pos\":[56,6]}]"
232
+ ],
233
+ "state_after": "case h.mk.mp.intro.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv i : K\nvi : v * i = 1\niv : i * v = 1\nhx :\n (powMonoidHom n) { val := v, inv := i, val_inv := vi, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191({ val := v, inv := i, val_inv := vi, inv_val := iv } ^ n) =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191({ val := v, inv := i, val_inv := vi, inv_val := iv } ^ n)\u207b\u00b9 =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
234
+ "state_before": "case h.mk.mp.intro.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv i : K\nvi : v * i = 1\niv : i * v = 1\nhx :\n (powMonoidHom n) { val := v, inv := i, val_inv := vi, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191({ val := v, inv := i, val_inv := vi, inv_val := iv } ^ n) =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
235
+ "tactic": "have hi : \u2191(_ ^ n : K\u02e3)\u207b\u00b9 = algebraMap R K _ := congr_arg Units.inv hx"
236
+ },
237
+ {
238
+ "annotated_tactic": [
239
+ "\"rw [<a>Units.val_pow_eq_pow_val<\\/a>] at hv\"",
240
+ "[{\"full_name\":\"Units.val_pow_eq_pow_val\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[424,7],\"def_end_pos\":[424,25]}]"
241
+ ],
242
+ "state_after": "case h.mk.mp.intro.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv i : K\nvi : v * i = 1\niv : i * v = 1\nhx :\n (powMonoidHom n) { val := v, inv := i, val_inv := vi, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191{ val := v, inv := i, val_inv := vi, inv_val := iv } ^ n =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191({ val := v, inv := i, val_inv := vi, inv_val := iv } ^ n)\u207b\u00b9 =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
243
+ "state_before": "case h.mk.mp.intro.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv i : K\nvi : v * i = 1\niv : i * v = 1\nhx :\n (powMonoidHom n) { val := v, inv := i, val_inv := vi, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191({ val := v, inv := i, val_inv := vi, inv_val := iv } ^ n) =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191({ val := v, inv := i, val_inv := vi, inv_val := iv } ^ n)\u207b\u00b9 =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
244
+ "tactic": "rw [Units.val_pow_eq_pow_val] at hv"
245
+ },
246
+ {
247
+ "annotated_tactic": [
248
+ "\"rw [\\u2190 <a>inv_pow<\\/a>, <a>Units.inv_mk<\\/a>, <a>Units.val_pow_eq_pow_val<\\/a>] at hi\"",
249
+ "[{\"full_name\":\"inv_pow\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Basic.lean\",\"def_pos\":[578,7],\"def_end_pos\":[578,14]},{\"full_name\":\"Units.inv_mk\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[243,9],\"def_end_pos\":[243,15]},{\"full_name\":\"Units.val_pow_eq_pow_val\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[424,7],\"def_end_pos\":[424,25]}]"
250
+ ],
251
+ "state_after": "case h.mk.mp.intro.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv i : K\nvi : v * i = 1\niv : i * v = 1\nhx :\n (powMonoidHom n) { val := v, inv := i, val_inv := vi, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191{ val := v, inv := i, val_inv := vi, inv_val := iv } ^ n =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191{ val := i, inv := v, val_inv := iv, inv_val := vi } ^ n =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
252
+ "state_before": "case h.mk.mp.intro.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv i : K\nvi : v * i = 1\niv : i * v = 1\nhx :\n (powMonoidHom n) { val := v, inv := i, val_inv := vi, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191{ val := v, inv := i, val_inv := vi, inv_val := iv } ^ n =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191({ val := v, inv := i, val_inv := vi, inv_val := iv } ^ n)\u207b\u00b9 =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
253
+ "tactic": "rw [\u2190 inv_pow, Units.inv_mk, Units.val_pow_eq_pow_val] at hi"
254
+ },
255
+ {
256
+ "annotated_tactic": [
257
+ "\"rcases <a>IsIntegrallyClosed.exists_algebraMap_eq_of_isIntegral_pow<\\/a> (R := R) (x := v) hn.out\\n (hv.symm \\u25b8 <a>isIntegral_algebraMap<\\/a>) with\\n \\u27e8v', rfl\\u27e9\"",
258
+ "[{\"full_name\":\"IsIntegrallyClosed.exists_algebraMap_eq_of_isIntegral_pow\",\"def_path\":\"Mathlib\\/RingTheory\\/IntegrallyClosed.lean\",\"def_pos\":[210,9],\"def_end_pos\":[210,47]},{\"full_name\":\"isIntegral_algebraMap\",\"def_path\":\"Mathlib\\/RingTheory\\/IntegralClosure.lean\",\"def_pos\":[81,9],\"def_end_pos\":[81,30]}]"
259
+ ],
260
+ "state_after": "case h.mk.mp.intro.mk.intro\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\ni : K\nv' : R\nvi : (algebraMap R K) v' * i = 1\niv : i * (algebraMap R K) v' = 1\nhx :\n (powMonoidHom n) { val := (algebraMap R K) v', inv := i, val_inv := vi, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191{ val := (algebraMap R K) v', inv := i, val_inv := vi, inv_val := iv } ^ n =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191{ val := i, inv := (algebraMap R K) v', val_inv := iv, inv_val := vi } ^ n =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
261
+ "state_before": "case h.mk.mp.intro.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv i : K\nvi : v * i = 1\niv : i * v = 1\nhx :\n (powMonoidHom n) { val := v, inv := i, val_inv := vi, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191{ val := v, inv := i, val_inv := vi, inv_val := iv } ^ n =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191{ val := i, inv := v, val_inv := iv, inv_val := vi } ^ n =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
262
+ "tactic": "rcases IsIntegrallyClosed.exists_algebraMap_eq_of_isIntegral_pow (R := R) (x := v) hn.out\n (hv.symm \u25b8 isIntegral_algebraMap) with\n \u27e8v', rfl\u27e9"
263
+ },
264
+ {
265
+ "annotated_tactic": [
266
+ "\"rcases <a>IsIntegrallyClosed.exists_algebraMap_eq_of_isIntegral_pow<\\/a> (R := R) (x := i) hn.out\\n (hi.symm \\u25b8 <a>isIntegral_algebraMap<\\/a>) with\\n \\u27e8i', rfl\\u27e9\"",
267
+ "[{\"full_name\":\"IsIntegrallyClosed.exists_algebraMap_eq_of_isIntegral_pow\",\"def_path\":\"Mathlib\\/RingTheory\\/IntegrallyClosed.lean\",\"def_pos\":[210,9],\"def_end_pos\":[210,47]},{\"full_name\":\"isIntegral_algebraMap\",\"def_path\":\"Mathlib\\/RingTheory\\/IntegralClosure.lean\",\"def_pos\":[81,9],\"def_end_pos\":[81,30]}]"
268
+ ],
269
+ "state_after": "case h.mk.mp.intro.mk.intro.intro\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv' i' : R\nvi : (algebraMap R K) v' * (algebraMap R K) i' = 1\niv : (algebraMap R K) i' * (algebraMap R K) v' = 1\nhx :\n (powMonoidHom n) { val := (algebraMap R K) v', inv := (algebraMap R K) i', val_inv := vi, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191{ val := (algebraMap R K) v', inv := (algebraMap R K) i', val_inv := vi, inv_val := iv } ^ n =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191{ val := (algebraMap R K) i', inv := (algebraMap R K) v', val_inv := iv, inv_val := vi } ^ n =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
270
+ "state_before": "case h.mk.mp.intro.mk.intro\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\ni : K\nv' : R\nvi : (algebraMap R K) v' * i = 1\niv : i * (algebraMap R K) v' = 1\nhx :\n (powMonoidHom n) { val := (algebraMap R K) v', inv := i, val_inv := vi, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191{ val := (algebraMap R K) v', inv := i, val_inv := vi, inv_val := iv } ^ n =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191{ val := i, inv := (algebraMap R K) v', val_inv := iv, inv_val := vi } ^ n =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
271
+ "tactic": "rcases IsIntegrallyClosed.exists_algebraMap_eq_of_isIntegral_pow (R := R) (x := i) hn.out\n (hi.symm \u25b8 isIntegral_algebraMap) with\n \u27e8i', rfl\u27e9"
272
+ },
273
+ {
274
+ "annotated_tactic": [
275
+ "\"rw [\\u2190 <a>map_mul<\\/a>, <a>map_eq_one_iff<\\/a> _ <| <a>NoZeroSMulDivisors.algebraMap_injective<\\/a> R K] at vi\"",
276
+ "[{\"full_name\":\"map_mul\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Hom\\/Defs.lean\",\"def_pos\":[309,9],\"def_end_pos\":[309,16]},{\"full_name\":\"map_eq_one_iff\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Hom\\/Defs.lean\",\"def_pos\":[220,9],\"def_end_pos\":[220,23]},{\"full_name\":\"NoZeroSMulDivisors.algebraMap_injective\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Basic.lean\",\"def_pos\":[353,9],\"def_end_pos\":[353,29]}]"
277
+ ],
278
+ "state_after": "case h.mk.mp.intro.mk.intro.intro\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv' i' : R\nvi\u271d : (algebraMap R K) v' * (algebraMap R K) i' = 1\nvi : v' * i' = 1\niv : (algebraMap R K) i' * (algebraMap R K) v' = 1\nhx :\n (powMonoidHom n) { val := (algebraMap R K) v', inv := (algebraMap R K) i', val_inv := vi\u271d, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191{ val := (algebraMap R K) v', inv := (algebraMap R K) i', val_inv := vi\u271d, inv_val := iv } ^ n =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191{ val := (algebraMap R K) i', inv := (algebraMap R K) v', val_inv := iv, inv_val := vi\u271d } ^ n =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
279
+ "state_before": "case h.mk.mp.intro.mk.intro.intro\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv' i' : R\nvi : (algebraMap R K) v' * (algebraMap R K) i' = 1\niv : (algebraMap R K) i' * (algebraMap R K) v' = 1\nhx :\n (powMonoidHom n) { val := (algebraMap R K) v', inv := (algebraMap R K) i', val_inv := vi, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191{ val := (algebraMap R K) v', inv := (algebraMap R K) i', val_inv := vi, inv_val := iv } ^ n =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191{ val := (algebraMap R K) i', inv := (algebraMap R K) v', val_inv := iv, inv_val := vi } ^ n =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
280
+ "tactic": "rw [\u2190 map_mul, map_eq_one_iff _ <| NoZeroSMulDivisors.algebraMap_injective R K] at vi"
281
+ },
282
+ {
283
+ "annotated_tactic": [
284
+ "\"rw [\\u2190 <a>map_mul<\\/a>, <a>map_eq_one_iff<\\/a> _ <| <a>NoZeroSMulDivisors.algebraMap_injective<\\/a> R K] at iv\"",
285
+ "[{\"full_name\":\"map_mul\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Hom\\/Defs.lean\",\"def_pos\":[309,9],\"def_end_pos\":[309,16]},{\"full_name\":\"map_eq_one_iff\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Hom\\/Defs.lean\",\"def_pos\":[220,9],\"def_end_pos\":[220,23]},{\"full_name\":\"NoZeroSMulDivisors.algebraMap_injective\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Basic.lean\",\"def_pos\":[353,9],\"def_end_pos\":[353,29]}]"
286
+ ],
287
+ "state_after": "case h.mk.mp.intro.mk.intro.intro\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv' i' : R\nvi\u271d : (algebraMap R K) v' * (algebraMap R K) i' = 1\nvi : v' * i' = 1\niv\u271d : (algebraMap R K) i' * (algebraMap R K) v' = 1\niv : i' * v' = 1\nhx :\n (powMonoidHom n) { val := (algebraMap R K) v', inv := (algebraMap R K) i', val_inv := vi\u271d, inv_val := iv\u271d } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191{ val := (algebraMap R K) v', inv := (algebraMap R K) i', val_inv := vi\u271d, inv_val := iv\u271d } ^ n =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191{ val := (algebraMap R K) i', inv := (algebraMap R K) v', val_inv := iv\u271d, inv_val := vi\u271d } ^ n =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
288
+ "state_before": "case h.mk.mp.intro.mk.intro.intro\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv' i' : R\nvi\u271d : (algebraMap R K) v' * (algebraMap R K) i' = 1\nvi : v' * i' = 1\niv : (algebraMap R K) i' * (algebraMap R K) v' = 1\nhx :\n (powMonoidHom n) { val := (algebraMap R K) v', inv := (algebraMap R K) i', val_inv := vi\u271d, inv_val := iv } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191{ val := (algebraMap R K) v', inv := (algebraMap R K) i', val_inv := vi\u271d, inv_val := iv } ^ n =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191{ val := (algebraMap R K) i', inv := (algebraMap R K) v', val_inv := iv, inv_val := vi\u271d } ^ n =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
289
+ "tactic": "rw [\u2190 map_mul, map_eq_one_iff _ <| NoZeroSMulDivisors.algebraMap_injective R K] at iv"
290
+ },
291
+ {
292
+ "annotated_tactic": [
293
+ "\"rw [<a>Units.val_mk<\\/a>, \\u2190 <a>map_pow<\\/a>] at hv\"",
294
+ "[{\"full_name\":\"Units.val_mk\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[140,9],\"def_end_pos\":[140,15]},{\"full_name\":\"map_pow\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Hom\\/Defs.lean\",\"def_pos\":[473,9],\"def_end_pos\":[473,16]}]"
295
+ ],
296
+ "state_after": "case h.mk.mp.intro.mk.intro.intro\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv' i' : R\nvi\u271d : (algebraMap R K) v' * (algebraMap R K) i' = 1\nvi : v' * i' = 1\niv\u271d : (algebraMap R K) i' * (algebraMap R K) v' = 1\niv : i' * v' = 1\nhx :\n (powMonoidHom n) { val := (algebraMap R K) v', inv := (algebraMap R K) i', val_inv := vi\u271d, inv_val := iv\u271d } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n (algebraMap R K) (v' ^ n) = (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191{ val := (algebraMap R K) i', inv := (algebraMap R K) v', val_inv := iv\u271d, inv_val := vi\u271d } ^ n =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
297
+ "state_before": "case h.mk.mp.intro.mk.intro.intro\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv' i' : R\nvi\u271d : (algebraMap R K) v' * (algebraMap R K) i' = 1\nvi : v' * i' = 1\niv\u271d : (algebraMap R K) i' * (algebraMap R K) v' = 1\niv : i' * v' = 1\nhx :\n (powMonoidHom n) { val := (algebraMap R K) v', inv := (algebraMap R K) i', val_inv := vi\u271d, inv_val := iv\u271d } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n \u2191{ val := (algebraMap R K) v', inv := (algebraMap R K) i', val_inv := vi\u271d, inv_val := iv\u271d } ^ n =\n (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191{ val := (algebraMap R K) i', inv := (algebraMap R K) v', val_inv := iv\u271d, inv_val := vi\u271d } ^ n =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
298
+ "tactic": "rw [Units.val_mk, \u2190 map_pow] at hv"
299
+ },
300
+ {
301
+ "annotated_tactic": [
302
+ "\"exact \\u27e8\\u27e8v', i', vi, iv\\u27e9, by\\n simpa only [<a>Units.ext_iff<\\/a>, <a>powMonoidHom_apply<\\/a>, <a>Units.val_pow_eq_pow_val<\\/a>] using\\n <a>NoZeroSMulDivisors.algebraMap_injective<\\/a> R K hv\\u27e9\"",
303
+ "[{\"full_name\":\"Units.ext_iff\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[160,9],\"def_end_pos\":[160,16]},{\"full_name\":\"powMonoidHom_apply\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Hom\\/Basic.lean\",\"def_pos\":[34,24],\"def_end_pos\":[34,29]},{\"full_name\":\"Units.val_pow_eq_pow_val\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[424,7],\"def_end_pos\":[424,25]},{\"full_name\":\"NoZeroSMulDivisors.algebraMap_injective\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Basic.lean\",\"def_pos\":[353,9],\"def_end_pos\":[353,29]}]"
304
+ ],
305
+ "state_after": "no goals",
306
+ "state_before": "case h.mk.mp.intro.mk.intro.intro\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv' i' : R\nvi\u271d : (algebraMap R K) v' * (algebraMap R K) i' = 1\nvi : v' * i' = 1\niv\u271d : (algebraMap R K) i' * (algebraMap R K) v' = 1\niv : i' * v' = 1\nhx :\n (powMonoidHom n) { val := (algebraMap R K) v', inv := (algebraMap R K) i', val_inv := vi\u271d, inv_val := iv\u271d } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n (algebraMap R K) (v' ^ n) = (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191{ val := (algebraMap R K) i', inv := (algebraMap R K) v', val_inv := iv\u271d, inv_val := vi\u271d } ^ n =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range",
307
+ "tactic": "exact \u27e8\u27e8v', i', vi, iv\u27e9, by\n simpa only [Units.ext_iff, powMonoidHom_apply, Units.val_pow_eq_pow_val] using\n NoZeroSMulDivisors.algebraMap_injective R K hv\u27e9"
308
+ },
309
+ {
310
+ "annotated_tactic": [
311
+ "\"simpa only [<a>Units.ext_iff<\\/a>, <a>powMonoidHom_apply<\\/a>, <a>Units.val_pow_eq_pow_val<\\/a>] using\\n <a>NoZeroSMulDivisors.algebraMap_injective<\\/a> R K hv\"",
312
+ "[{\"full_name\":\"Units.ext_iff\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[160,9],\"def_end_pos\":[160,16]},{\"full_name\":\"powMonoidHom_apply\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Hom\\/Basic.lean\",\"def_pos\":[34,24],\"def_end_pos\":[34,29]},{\"full_name\":\"Units.val_pow_eq_pow_val\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units.lean\",\"def_pos\":[424,7],\"def_end_pos\":[424,25]},{\"full_name\":\"NoZeroSMulDivisors.algebraMap_injective\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Basic.lean\",\"def_pos\":[353,9],\"def_end_pos\":[353,29]}]"
313
+ ],
314
+ "state_after": "no goals",
315
+ "state_before": "R : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nhx\u271d : { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker\nv' i' : R\nvi\u271d : (algebraMap R K) v' * (algebraMap R K) i' = 1\nvi : v' * i' = 1\niv\u271d : (algebraMap R K) i' * (algebraMap R K) v' = 1\niv : i' * v' = 1\nhx :\n (powMonoidHom n) { val := (algebraMap R K) v', inv := (algebraMap R K) i', val_inv := vi\u271d, inv_val := iv\u271d } =\n (Units.map \u2191(algebraMap R K)) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhv :\n (algebraMap R K) (v' ^ n) = (algebraMap R K) \u2191{ val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\nhi :\n \u2191{ val := (algebraMap R K) i', inv := (algebraMap R K) v', val_inv := iv\u271d, inv_val := vi\u271d } ^ n =\n (algebraMap R K) { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }.inv\n\u22a2 (powMonoidHom n) { val := v', inv := i', val_inv := vi, inv_val := iv } =\n { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }",
316
+ "tactic": "simpa only [Units.ext_iff, powMonoidHom_apply, Units.val_pow_eq_pow_val] using\n NoZeroSMulDivisors.algebraMap_injective R K hv"
317
+ },
318
+ {
319
+ "annotated_tactic": [
320
+ "\"rintro \\u27e8x, hx\\u27e9\"",
321
+ "[]"
322
+ ],
323
+ "state_after": "case h.mk.mpr.intro\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nx : R\u02e3\nhx : (powMonoidHom n) x = { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker",
324
+ "state_before": "case h.mk.mpr\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 (powMonoidHom n).range \u2192\n { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker",
325
+ "tactic": "rintro \u27e8x, hx\u27e9"
326
+ },
327
+ {
328
+ "annotated_tactic": [
329
+ "\"rw [\\u2190 hx]\"",
330
+ "[]"
331
+ ],
332
+ "state_after": "case h.mk.mpr.intro\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nx : R\u02e3\nhx : (powMonoidHom n) x = { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\n\u22a2 (powMonoidHom n) x \u2208 fromUnit.ker",
333
+ "state_before": "case h.mk.mpr.intro\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nx : R\u02e3\nhx : (powMonoidHom n) x = { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\n\u22a2 { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d } \u2208 fromUnit.ker",
334
+ "tactic": "rw [\u2190 hx]"
335
+ },
336
+ {
337
+ "annotated_tactic": [
338
+ "\"exact Subtype.mk_eq_mk.mpr <| (<a>QuotientGroup.eq_one_iff<\\/a> _).<a>mpr<\\/a> \\u27e8<a>Units.map<\\/a> (<a>algebraMap<\\/a> R K) x,\\n by simp only [<a>powMonoidHom_apply<\\/a>, <a>RingHom.toMonoidHom_eq_coe<\\/a>, <a>map_pow<\\/a>]\\u27e9\"",
339
+ "[{\"full_name\":\"QuotientGroup.eq_one_iff\",\"def_path\":\"Mathlib\\/GroupTheory\\/QuotientGroup.lean\",\"def_pos\":[129,9],\"def_end_pos\":[129,19]},{\"full_name\":\"Iff.mpr\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Core.lean\",\"def_pos\":[120,3],\"def_end_pos\":[120,6]},{\"full_name\":\"Units.map\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units\\/Hom.lean\",\"def_pos\":[63,5],\"def_end_pos\":[63,8]},{\"full_name\":\"algebraMap\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Defs.lean\",\"def_pos\":[110,5],\"def_end_pos\":[110,15]},{\"full_name\":\"powMonoidHom_apply\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Hom\\/Basic.lean\",\"def_pos\":[34,24],\"def_end_pos\":[34,29]},{\"full_name\":\"RingHom.toMonoidHom_eq_coe\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Hom\\/Defs.lean\",\"def_pos\":[461,9],\"def_end_pos\":[461,27]},{\"full_name\":\"map_pow\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Hom\\/Defs.lean\",\"def_pos\":[473,9],\"def_end_pos\":[473,16]}]"
340
+ ],
341
+ "state_after": "no goals",
342
+ "state_before": "case h.mk.mpr.intro\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nx : R\u02e3\nhx : (powMonoidHom n) x = { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\n\u22a2 (powMonoidHom n) x \u2208 fromUnit.ker",
343
+ "tactic": "exact Subtype.mk_eq_mk.mpr <| (QuotientGroup.eq_one_iff _).mpr \u27e8Units.map (algebraMap R K) x,\n by simp only [powMonoidHom_apply, RingHom.toMonoidHom_eq_coe, map_pow]\u27e9"
344
+ },
345
+ {
346
+ "annotated_tactic": [
347
+ "\"simp only [<a>powMonoidHom_apply<\\/a>, <a>RingHom.toMonoidHom_eq_coe<\\/a>, <a>map_pow<\\/a>]\"",
348
+ "[{\"full_name\":\"powMonoidHom_apply\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Hom\\/Basic.lean\",\"def_pos\":[34,24],\"def_end_pos\":[34,29]},{\"full_name\":\"RingHom.toMonoidHom_eq_coe\",\"def_path\":\"Mathlib\\/Algebra\\/Ring\\/Hom\\/Defs.lean\",\"def_pos\":[461,9],\"def_end_pos\":[461,27]},{\"full_name\":\"map_pow\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Hom\\/Defs.lean\",\"def_pos\":[473,9],\"def_end_pos\":[473,16]}]"
349
+ ],
350
+ "state_after": "no goals",
351
+ "state_before": "R : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nhn : Fact (0 < n)\nval\u271d inv\u271d : R\nval_inv\u271d : val\u271d * inv\u271d = 1\ninv_val\u271d : inv\u271d * val\u271d = 1\nx : R\u02e3\nhx : (powMonoidHom n) x = { val := val\u271d, inv := inv\u271d, val_inv := val_inv\u271d, inv_val := inv_val\u271d }\n\u22a2 (powMonoidHom n) ((Units.map \u2191(algebraMap R K)) x) = (Units.map \u2191(algebraMap R K)) ((powMonoidHom n) x)",
352
+ "tactic": "simp only [powMonoidHom_apply, RingHom.toMonoidHom_eq_coe, map_pow]"
353
+ }
354
+ ],
355
+ "url": "https://github.com/leanprover-community/mathlib4"
356
+ },
357
+ "source_file": "Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean"
358
+ },
359
+ {
360
+ "error": "theorem has no selected tactic transitions",
361
+ "full_name": "IsDedekindDomain.selmerGroup.monotone",
362
+ "id": "IsDedekindDomain.selmerGroup.monotone",
363
+ "reason": "import_failure",
364
+ "selection": {
365
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
366
+ "end": [
367
+ 178,
368
+ 85
369
+ ],
370
+ "file_path": "Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean",
371
+ "full_name": "IsDedekindDomain.selmerGroup.monotone",
372
+ "start": [
373
+ 178,
374
+ 1
375
+ ],
376
+ "traced_tactics": [],
377
+ "url": "https://github.com/leanprover-community/mathlib4"
378
+ },
379
+ "source_file": "Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean"
380
+ }
381
+ ],
382
+ "input_proofs": 12,
383
+ "input_units": 2,
384
+ "proofs": 5,
385
+ "published_proofs": 3,
386
+ "published_transitions": 5,
387
+ "replay_failures": [],
388
+ "transitions": 21,
389
+ "validation_failures": [
390
+ {
391
+ "errors": [
392
+ "internal transition boundary mismatch",
393
+ "internal transition boundary mismatch"
394
+ ],
395
+ "file_path": "Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean",
396
+ "proof_id": "mathlib:IsDedekindDomain.HeightOneSpectrum.valuation_of_unit_eq",
397
+ "provenance": {
398
+ "selection": {
399
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
400
+ "end": [
401
+ 131,
402
+ 35
403
+ ],
404
+ "file_path": "Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean",
405
+ "full_name": "IsDedekindDomain.HeightOneSpectrum.valuation_of_unit_eq",
406
+ "start": [
407
+ 120,
408
+ 1
409
+ ],
410
+ "traced_tactics": [
411
+ {
412
+ "annotated_tactic": [
413
+ "\"rw [\\u2190 <a>WithZero.coe_inj<\\/a>, <a>valuationOfNeZero_eq<\\/a>, <a>Units.coe_map<\\/a>, <a>eq_iff_le_not_lt<\\/a>]\"",
414
+ "[{\"full_name\":\"WithZero.coe_inj\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/WithOne\\/Defs.lean\",\"def_pos\":[175,3],\"def_end_pos\":[175,14]},{\"full_name\":\"IsDedekindDomain.HeightOneSpectrum.valuationOfNeZero_eq\",\"def_path\":\"Mathlib\\/RingTheory\\/DedekindDomain\\/SelmerGroup.lean\",\"def_pos\":[115,9],\"def_end_pos\":[115,29]},{\"full_name\":\"Units.coe_map\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Units\\/Hom.lean\",\"def_pos\":[73,9],\"def_end_pos\":[73,16]},{\"full_name\":\"eq_iff_le_not_lt\",\"def_path\":\"Mathlib\\/Order\\/Basic.lean\",\"def_pos\":[376,9],\"def_end_pos\":[376,25]}]"
415
+ ],
416
+ "state_after": "R : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx : R\u02e3\n\u22a2 v.valuation (\u2191(algebraMap R K) \u2191x) \u2264 \u21911 \u2227 \u00acv.valuation (\u2191(algebraMap R K) \u2191x) < \u21911",
417
+ "state_before": "R : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx : R\u02e3\n\u22a2 v.valuationOfNeZero ((Units.map \u2191(algebraMap R K)) x) = 1",
418
+ "tactic": "rw [\u2190 WithZero.coe_inj, valuationOfNeZero_eq, Units.coe_map, eq_iff_le_not_lt]"
419
+ },
420
+ {
421
+ "annotated_tactic": [
422
+ "\"constructor\"",
423
+ "[]"
424
+ ],
425
+ "state_after": "case left\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx : R\u02e3\n\u22a2 v.valuation (\u2191(algebraMap R K) \u2191x) \u2264 \u21911\n\ncase right\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx : R\u02e3\n\u22a2 \u00acv.valuation (\u2191(algebraMap R K) \u2191x) < \u21911",
426
+ "state_before": "R : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx : R\u02e3\n\u22a2 v.valuation (\u2191(algebraMap R K) \u2191x) \u2264 \u21911 \u2227 \u00acv.valuation (\u2191(algebraMap R K) \u2191x) < \u21911",
427
+ "tactic": "constructor"
428
+ },
429
+ {
430
+ "annotated_tactic": [
431
+ "\"exact v.valuation_le_one x\"",
432
+ "[]"
433
+ ],
434
+ "state_after": "no goals",
435
+ "state_before": "case left\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx : R\u02e3\n\u22a2 v.valuation (\u2191(algebraMap R K) \u2191x) \u2264 \u21911",
436
+ "tactic": "exact v.valuation_le_one x"
437
+ },
438
+ {
439
+ "annotated_tactic": [
440
+ "\"cases' x with x _ hx _\"",
441
+ "[]"
442
+ ],
443
+ "state_after": "case right.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx inv\u271d : R\nhx : x * inv\u271d = 1\ninv_val\u271d : inv\u271d * x = 1\n\u22a2 \u00acv.valuation (\u2191(algebraMap R K) \u2191{ val := x, inv := inv\u271d, val_inv := hx, inv_val := inv_val\u271d }) < \u21911",
444
+ "state_before": "case right\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx : R\u02e3\n\u22a2 \u00acv.valuation (\u2191(algebraMap R K) \u2191x) < \u21911",
445
+ "tactic": "cases' x with x _ hx _"
446
+ },
447
+ {
448
+ "annotated_tactic": [
449
+ "\"change \\u00acv.valuation (<a>algebraMap<\\/a> R K x) < 1\"",
450
+ "[{\"full_name\":\"algebraMap\",\"def_path\":\"Mathlib\\/Algebra\\/Algebra\\/Defs.lean\",\"def_pos\":[110,5],\"def_end_pos\":[110,15]}]"
451
+ ],
452
+ "state_after": "case right.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx inv\u271d : R\nhx : x * inv\u271d = 1\ninv_val\u271d : inv\u271d * x = 1\n\u22a2 \u00acv.valuation ((algebraMap R K) x) < 1",
453
+ "state_before": "case right.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx inv\u271d : R\nhx : x * inv\u271d = 1\ninv_val\u271d : inv\u271d * x = 1\n\u22a2 \u00acv.valuation (\u2191(algebraMap R K) \u2191{ val := x, inv := inv\u271d, val_inv := hx, inv_val := inv_val\u271d }) < \u21911",
454
+ "tactic": "change \u00acv.valuation (algebraMap R K x) < 1"
455
+ },
456
+ {
457
+ "annotated_tactic": [
458
+ "\"apply_fun v.intValuation at hx\"",
459
+ "[]"
460
+ ],
461
+ "state_after": "case right.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx inv\u271d : R\ninv_val\u271d : inv\u271d * x = 1\nhx : v.intValuation (x * inv\u271d) = v.intValuation 1\n\u22a2 \u00acv.valuation ((algebraMap R K) x) < 1",
462
+ "state_before": "case right.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx inv\u271d : R\nhx : x * inv\u271d = 1\ninv_val\u271d : inv\u271d * x = 1\n\u22a2 \u00acv.valuation ((algebraMap R K) x) < 1",
463
+ "tactic": "apply_fun v.intValuation at hx"
464
+ },
465
+ {
466
+ "annotated_tactic": [
467
+ "\"rw [<a>map_one<\\/a>, <a>map_mul<\\/a>] at hx\"",
468
+ "[{\"full_name\":\"map_one\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Hom\\/Defs.lean\",\"def_pos\":[204,9],\"def_end_pos\":[204,16]},{\"full_name\":\"map_mul\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Hom\\/Defs.lean\",\"def_pos\":[309,9],\"def_end_pos\":[309,16]}]"
469
+ ],
470
+ "state_after": "case right.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx inv\u271d : R\ninv_val\u271d : inv\u271d * x = 1\nhx : v.intValuation x * v.intValuation inv\u271d = 1\n\u22a2 \u00acv.valuation ((algebraMap R K) x) < 1",
471
+ "state_before": "case right.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx inv\u271d : R\ninv_val\u271d : inv\u271d * x = 1\nhx : v.intValuation (x * inv\u271d) = v.intValuation 1\n\u22a2 \u00acv.valuation ((algebraMap R K) x) < 1",
472
+ "tactic": "rw [map_one, map_mul] at hx"
473
+ },
474
+ {
475
+ "annotated_tactic": [
476
+ "\"rw [<a>not_lt<\\/a>, \\u2190 hx, \\u2190 <a>mul_one<\\/a> <| v.valuation _, <a>valuation_of_algebraMap<\\/a>,\\n <a>mul_le_mul_left\\u2080<\\/a> <| <a>left_ne_zero_of_mul_eq_one<\\/a> hx]\"",
477
+ "[{\"full_name\":\"not_lt\",\"def_path\":\"Mathlib\\/Init\\/Order\\/Defs.lean\",\"def_pos\":[370,9],\"def_end_pos\":[370,15]},{\"full_name\":\"mul_one\",\"def_path\":\"Mathlib\\/Algebra\\/Group\\/Defs.lean\",\"def_pos\":[483,9],\"def_end_pos\":[483,16]},{\"full_name\":\"IsDedekindDomain.HeightOneSpectrum.valuation_of_algebraMap\",\"def_path\":\"Mathlib\\/RingTheory\\/DedekindDomain\\/AdicValuation.lean\",\"def_pos\":[285,9],\"def_end_pos\":[285,32]},{\"full_name\":\"mul_le_mul_left\\u2080\",\"def_path\":\"Mathlib\\/Algebra\\/Order\\/GroupWithZero\\/Canonical.lean\",\"def_pos\":[230,9],\"def_end_pos\":[230,25]},{\"full_name\":\"left_ne_zero_of_mul_eq_one\",\"def_path\":\"Mathlib\\/Algebra\\/GroupWithZero\\/Basic.lean\",\"def_pos\":[147,9],\"def_end_pos\":[147,35]}]"
478
+ ],
479
+ "state_after": "case right.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx inv\u271d : R\ninv_val\u271d : inv\u271d * x = 1\nhx : v.intValuation x * v.intValuation inv\u271d = 1\n\u22a2 v.intValuation inv\u271d \u2264 1",
480
+ "state_before": "case right.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx inv\u271d : R\ninv_val\u271d : inv\u271d * x = 1\nhx : v.intValuation x * v.intValuation inv\u271d = 1\n\u22a2 \u00acv.valuation ((algebraMap R K) x) < 1",
481
+ "tactic": "rw [not_lt, \u2190 hx, \u2190 mul_one <| v.valuation _, valuation_of_algebraMap,\n mul_le_mul_left\u2080 <| left_ne_zero_of_mul_eq_one hx]"
482
+ },
483
+ {
484
+ "annotated_tactic": [
485
+ "\"exact v.int_valuation_le_one _\"",
486
+ "[]"
487
+ ],
488
+ "state_after": "no goals",
489
+ "state_before": "case right.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nx inv\u271d : R\ninv_val\u271d : inv\u271d * x = 1\nhx : v.intValuation x * v.intValuation inv\u271d = 1\n\u22a2 v.intValuation inv\u271d \u2264 1",
490
+ "tactic": "exact v.int_valuation_le_one _"
491
+ }
492
+ ],
493
+ "url": "https://github.com/leanprover-community/mathlib4"
494
+ }
495
+ },
496
+ "theorem_name": "IsDedekindDomain.HeightOneSpectrum.valuation_of_unit_eq"
497
+ },
498
+ {
499
+ "errors": [
500
+ "internal transition boundary mismatch",
501
+ "internal transition boundary mismatch",
502
+ "internal transition boundary mismatch",
503
+ "internal transition boundary mismatch"
504
+ ],
505
+ "file_path": "Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean",
506
+ "proof_id": "mathlib:IsDedekindDomain.selmerGroup.valuation_ker_eq",
507
+ "provenance": {
508
+ "selection": {
509
+ "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
510
+ "end": [
511
+ 196,
512
+ 66
513
+ ],
514
+ "file_path": "Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean",
515
+ "full_name": "IsDedekindDomain.selmerGroup.valuation_ker_eq",
516
+ "start": [
517
+ 188,
518
+ 1
519
+ ],
520
+ "traced_tactics": [
521
+ {
522
+ "annotated_tactic": [
523
+ "\"ext \\u27e8_, hx\\u27e9\"",
524
+ "[]"
525
+ ],
526
+ "state_after": "case h.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nval\u271d : K\u02e3 \u29f8 (powMonoidHom n).range\nhx : val\u271d \u2208 selmerGroup\n\u22a2 \u27e8val\u271d, hx\u27e9 \u2208 valuation.ker \u2194 \u27e8val\u271d, hx\u27e9 \u2208 selmerGroup.subgroupOf selmerGroup",
527
+ "state_before": "R : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\n\u22a2 valuation.ker = selmerGroup.subgroupOf selmerGroup",
528
+ "tactic": "ext \u27e8_, hx\u27e9"
529
+ },
530
+ {
531
+ "annotated_tactic": [
532
+ "\"constructor\"",
533
+ "[]"
534
+ ],
535
+ "state_after": "case h.mk.mp\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nval\u271d : K\u02e3 \u29f8 (powMonoidHom n).range\nhx : val\u271d \u2208 selmerGroup\n\u22a2 \u27e8val\u271d, hx\u27e9 \u2208 valuation.ker \u2192 \u27e8val\u271d, hx\u27e9 \u2208 selmerGroup.subgroupOf selmerGroup\n\ncase h.mk.mpr\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nval\u271d : K\u02e3 \u29f8 (powMonoidHom n).range\nhx : val\u271d \u2208 selmerGroup\n\u22a2 \u27e8val\u271d, hx\u27e9 \u2208 selmerGroup.subgroupOf selmerGroup \u2192 \u27e8val\u271d, hx\u27e9 \u2208 valuation.ker",
536
+ "state_before": "case h.mk\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nval\u271d : K\u02e3 \u29f8 (powMonoidHom n).range\nhx : val\u271d \u2208 selmerGroup\n\u22a2 \u27e8val\u271d, hx\u27e9 \u2208 valuation.ker \u2194 \u27e8val\u271d, hx\u27e9 \u2208 selmerGroup.subgroupOf selmerGroup",
537
+ "tactic": "constructor"
538
+ },
539
+ {
540
+ "annotated_tactic": [
541
+ "\"intro hx' v _\"",
542
+ "[]"
543
+ ],
544
+ "state_after": "case h.mk.mp\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nval\u271d : K\u02e3 \u29f8 (powMonoidHom n).range\nhx : val\u271d \u2208 selmerGroup\nhx' : \u27e8val\u271d, hx\u27e9 \u2208 valuation.ker\nv : HeightOneSpectrum R\nx\u271d : v \u2209 \u2205\n\u22a2 (v.valuationOfNeZeroMod n) (selmerGroup.subtype \u27e8val\u271d, hx\u27e9) = 1",
545
+ "state_before": "case h.mk.mp\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nval\u271d : K\u02e3 \u29f8 (powMonoidHom n).range\nhx : val\u271d \u2208 selmerGroup\n\u22a2 \u27e8val\u271d, hx\u27e9 \u2208 valuation.ker \u2192 \u27e8val\u271d, hx\u27e9 \u2208 selmerGroup.subgroupOf selmerGroup",
546
+ "tactic": "intro hx' v _"
547
+ },
548
+ {
549
+ "annotated_tactic": [
550
+ "\"by_cases hv : v \\u2208 S\"",
551
+ "[]"
552
+ ],
553
+ "state_after": "case pos\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nval\u271d : K\u02e3 \u29f8 (powMonoidHom n).range\nhx : val\u271d \u2208 selmerGroup\nhx' : \u27e8val\u271d, hx\u27e9 \u2208 valuation.ker\nv : HeightOneSpectrum R\nx\u271d : v \u2209 \u2205\nhv : v \u2208 S\n\u22a2 (v.valuationOfNeZeroMod n) (selmerGroup.subtype \u27e8val\u271d, hx\u27e9) = 1\n\ncase neg\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nval\u271d : K\u02e3 \u29f8 (powMonoidHom n).range\nhx : val\u271d \u2208 selmerGroup\nhx' : \u27e8val\u271d, hx\u27e9 \u2208 valuation.ker\nv : HeightOneSpectrum R\nx\u271d : v \u2209 \u2205\nhv : v \u2209 S\n\u22a2 (v.valuationOfNeZeroMod n) (selmerGroup.subtype \u27e8val\u271d, hx\u27e9) = 1",
554
+ "state_before": "case h.mk.mp\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nval\u271d : K\u02e3 \u29f8 (powMonoidHom n).range\nhx : val\u271d \u2208 selmerGroup\nhx' : \u27e8val\u271d, hx\u27e9 \u2208 valuation.ker\nv : HeightOneSpectrum R\nx\u271d : v \u2209 \u2205\n\u22a2 (v.valuationOfNeZeroMod n) (selmerGroup.subtype \u27e8val\u271d, hx\u27e9) = 1",
555
+ "tactic": "by_cases hv : v \u2208 S"
556
+ },
557
+ {
558
+ "annotated_tactic": [
559
+ "\"exact <a>congr_fun<\\/a> hx' \\u27e8v, hv\\u27e9\"",
560
+ "[{\"full_name\":\"congr_fun\",\"def_path\":\".lake\\/packages\\/batteries\\/Batteries\\/Logic.lean\",\"def_pos\":[78,7],\"def_end_pos\":[78,16]}]"
561
+ ],
562
+ "state_after": "no goals",
563
+ "state_before": "case pos\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nval\u271d : K\u02e3 \u29f8 (powMonoidHom n).range\nhx : val\u271d \u2208 selmerGroup\nhx' : \u27e8val\u271d, hx\u27e9 \u2208 valuation.ker\nv : HeightOneSpectrum R\nx\u271d : v \u2209 \u2205\nhv : v \u2208 S\n\u22a2 (v.valuationOfNeZeroMod n) (selmerGroup.subtype \u27e8val\u271d, hx\u27e9) = 1",
564
+ "tactic": "exact congr_fun hx' \u27e8v, hv\u27e9"
565
+ },
566
+ {
567
+ "annotated_tactic": [
568
+ "\"exact hx v hv\"",
569
+ "[]"
570
+ ],
571
+ "state_after": "no goals",
572
+ "state_before": "case neg\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv\u271d : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nval\u271d : K\u02e3 \u29f8 (powMonoidHom n).range\nhx : val\u271d \u2208 selmerGroup\nhx' : \u27e8val\u271d, hx\u27e9 \u2208 valuation.ker\nv : HeightOneSpectrum R\nx\u271d : v \u2209 \u2205\nhv : v \u2209 S\n\u22a2 (v.valuationOfNeZeroMod n) (selmerGroup.subtype \u27e8val\u271d, hx\u27e9) = 1",
573
+ "tactic": "exact hx v hv"
574
+ },
575
+ {
576
+ "annotated_tactic": [
577
+ "\"exact fun hx' => <a>funext<\\/a> fun v => hx' v <| <a>Set.not_mem_empty<\\/a> v\"",
578
+ "[{\"full_name\":\"funext\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Core.lean\",\"def_pos\":[1817,9],\"def_end_pos\":[1817,15]},{\"full_name\":\"Set.not_mem_empty\",\"def_path\":\"Mathlib\\/Data\\/Set\\/Basic.lean\",\"def_pos\":[402,9],\"def_end_pos\":[402,22]}]"
579
+ ],
580
+ "state_after": "no goals",
581
+ "state_before": "case h.mk.mpr\nR : Type u\ninst\u271d\u2074 : CommRing R\ninst\u271d\u00b3 : IsDedekindDomain R\nK : Type v\ninst\u271d\u00b2 : Field K\ninst\u271d\u00b9 : Algebra R K\ninst\u271d : IsFractionRing R K\nv : HeightOneSpectrum R\nS S' : Set (HeightOneSpectrum R)\nn : \u2115\nval\u271d : K\u02e3 \u29f8 (powMonoidHom n).range\nhx : val\u271d \u2208 selmerGroup\n\u22a2 \u27e8val\u271d, hx\u27e9 \u2208 selmerGroup.subgroupOf selmerGroup \u2192 \u27e8val\u271d, hx\u27e9 \u2208 valuation.ker",
582
+ "tactic": "exact fun hx' => funext fun v => hx' v <| Set.not_mem_empty v"
583
+ }
584
+ ],
585
+ "url": "https://github.com/leanprover-community/mathlib4"
586
+ }
587
+ },
588
+ "theorem_name": "IsDedekindDomain.selmerGroup.valuation_ker_eq"
589
+ }
590
+ ],
591
+ "validation_rejected_proofs": 2,
592
+ "zero_transition_proofs": 0
593
+ },
594
+ "shards": [
595
+ {
596
+ "path": "data/train/mathlib-001661-0000-4055f84133155a69.parquet",
597
+ "sha256": "4055f84133155a69d69d995b4f98785de1d0a09b2f6889ab267bc195bd7b923f",
598
+ "bytes": 54476,
599
+ "rows": 3,
600
+ "revision": "82bfa16b8fd75900ff81d1d4bbdd1ee1cdcdee37"
601
+ },
602
+ {
603
+ "path": "data/internal_test/mathlib-001661-0000-3c7cc24d57c66b90.parquet",
604
+ "sha256": "3c7cc24d57c66b90b6fb4ec39c12918488f37effdc8a0ee287b77552ffd66383",
605
+ "bytes": 138595,
606
+ "rows": 2,
607
+ "revision": "82bfa16b8fd75900ff81d1d4bbdd1ee1cdcdee37"
608
+ }
609
+ ],
610
+ "proof_ids": [
611
+ "mathlib:IsDedekindDomain.HeightOneSpectrum.valuation_of_unit_mod_eq",
612
+ "mathlib:IsDedekindDomain.selmerGroup.fromUnitLift_injective",
613
+ "mathlib:Set.integer_eq"
614
+ ],
615
+ "proof_keys": [
616
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/DedekindDomain/SInteger.lean\",null,null,\"Set.integer_eq\"]",
617
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean\",null,null,\"IsDedekindDomain.HeightOneSpectrum.valuation_of_unit_mod_eq\"]",
618
+ "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean\",null,null,\"IsDedekindDomain.selmerGroup.fromUnitLift_injective\"]"
619
+ ]
620
+ }
manifests/batches/mathlib/001664.json ADDED
The diff for this file is too large to render. See raw diff