oeis_340737_conjecture_0.lean`

Explanation legend Lean4 Domain Explanation Language (L4DEL)

L4DEL explanations are a separate layer. They do not change the Lean source. Intuition is explanatory prose; numbered items are a reading path; sources link the wording back to evidence.

L4DEL: Lean4 Domain Explanation Language

Annotation provenance. This overlay contains 348 curated AI-written annotations and 373 mechanical source-derived annotations. They have not been human-reviewed as explanations; treat them as unverified and not mathematical authority. Retained generation history: The 12 manuscript-grounded curated result annotations were composed from pinned companion PDFs and named source records in a Codex session on 2026-10-14; no human review is claimed, and the exact runtime model identifier was not exposed to the artifact generator. Twelve supporting declarations for the Hilbert-functions result were upgraded on 2026-10-14 from mechanically condensed doc comments to declaration-specific explanations bound to exact page-one terminology in the pinned human-written companion. The other Hilbert challenge statements were deliberately not described as companion-backed results because that manuscript proves P5 specifically. Fifteen previously unannotated declarations along the Hilbert P5 proof spine were annotated on 2026-10-14 from the pinned companion's seven-page argument, covering the two-generator decomposition, finite-difference bounds, critical-case reduction, and final log-concavity step. Each quotation is bound to its exact manuscript page and Lean declaration; no human review is claimed. Twenty-four further declarations along the Hilbert P5 box-count and finite-difference spine were annotated on 2026-10-14, covering the two-dimensional slice count, three-dimensional box formula, first- and second-difference identities, the seven-threshold curvature expression, boundary handling, pointwise transport, sum linearity, and lower-or-upper region classification. Every annotation is bound to an exact quotation on pages 2 or 3 of the pinned human-written companion; Lean-specific boundary and threshold helpers are identified as implementation lemmas rather than separate manuscript claims. No human review is claimed. Twenty-eight further declarations along the Hilbert P5 argument were annotated on 2026-10-14 from pages 2 through 6 of the pinned human-written companion. They expose the shifted residual sequence, exact lower- and upper-region formulas, symmetry by complementary divisors, the curvature-one and curvature-two splits, and the final algebraic reductions. Lean-only transport and integer-arithmetic helpers are labeled as proof infrastructure rather than new manuscript claims; each quotation is page-bound in the source ledger, and no human review is claimed. Twenty high-level declarations completing the Hilbert P5 curvature-one and curvature-two case spine were annotated on 2026-10-14 from pages 3 through 7 of the pinned human-written companion. The explanations separate cases A and B, lower and upper monomial regions, shifted residual evaluation, impossible mixed regions, and the surviving upper-upper estimate; wrapper lemmas are explicitly described as proof structure. Every quotation is page-bound, and no human review is claimed. Twenty-two graph-reconstruction declarations were upgraded or added on 2026-10-14 from the pinned four-page human-written companion, covering the incidence-deletion deck, edge and degree recovery, unique isolated vertices, vertex-type reconstruction, neighboring-type descent, adjacency recovery, and final bipartite isomorphism. The result annotation also records that `G_not_regular` is present in the Lean statement but unused by its proof term and absent from the companion theorem. Exact historical quotations from Paul J. Kelly (1957) and Bondy with Hemminger (1977) are linked separately; no human review is claimed. Eighteen declarations along the Erdős 741(i) strict-natural-density counterexample were added on 2026-10-14, covering the carry-free base-four digit split, full cross-sum coverage, sparse pure self-sums, fixed-factor fat intervals, the lower-scale density deficit, upper-scale sum growth, and the final convergence contradiction. The result annotation was corrected to distinguish the negative strict-natural-density Lean theorem from the compatible affirmative upper-density companion theorem; Ulam AI's written counterexample is explicitly identified as using a different interval length with the same mechanism. The quotations are page- and hash-bound where the PDFs expose text; Paul Erdős's scanned 1994 question was visually checked and is linked separately without a machine-audit claim. No human review is claimed. Twenty-eight additional declaration-level annotations were added on 2026-10-14 for the Erdős 12(i) proof, and its IsGood definition was upgraded from a source-comment condensation. They cover the prime and Chinese-remainder moduli, the actual Lean congruence-block witness, exclusion of cross-block and same-block triples, lower and upper counting bounds, and the positive liminf. The prior result annotation was corrected because the pinned human-written companion proves the same theorem with a different base-2-to-base-3 construction; it is no longer presented as the Lean proof. The original property-P definition from Erdős and Sárközy (1970) is separately linked and page-bound; no human review is claimed. The remaining fifty declarations in the Erdős 12(i) file were annotated on 2026-10-14, completing declaration-level coverage of all eighty definitions, lemmas, and theorems in that file. These additions expose the prime-recursion invariants, divisibility transport, Chinese-remainder witness bounds, numerical density envelopes, injective block coding, and liminf support lemmas instead of leaving the proof spine as raw Lean; no human review is claimed. Eighteen supporting declarations for Erdős 125 were added on 2026-10-14, completing all nineteen declarations in the file. The annotations follow the pinned companion through digit-block decomposition, irrational logarithmic approximation, the explicit Lean contraction factor 11/12, geometric iteration, and the lower-density conclusion. The original 1996 question of Burr, Erdős, Graham, and Li and the 2026 discussion contributions of GTSoukalas, Terence Tao, and Giuseppe Melfi are linked separately; no human review is claimed. Twenty-eight supporting declarations for Erdős 138 were upgraded or added on 2026-10-14, completing all twenty-nine declarations in the file. The annotations separate the greedy difference proof from the Lean-specific representation bridges and ultrafilter compactness proof of existence, and bind quotations from the pinned companion, the AlphaProof Nexus paper, Erdős's 1981 source, van der Waerden's recollection, and the 2026 Erdős Problems discussion. No human review is claimed. The curated Erdős 12(ii), 138, and 152 annotations were further linked on 2026-10-14 to exact quotations from Felix Behrend, Bartel van der Waerden, and Paul Erdős with Pál Turán; the historical quotation sources are labeled separately from the pinned AlphaProof proof companions. The curated Hilbert-functions result, its OrderIdeal and pureOSequence definitions, and the Erdős 846 annotation were further linked on 2026-10-14 to exact quotations from Richard P. Stanley and from Moe Putterman, Mehtaab Sawhney, and Gregory Valiant. The Stanley PDF is hash- and page-bound in the source ledger; these historical sources are labeled separately from the pinned AlphaProof proof companions. Three additional target-specific annotations for Ben Green's Problem 57, exact last-iterate anchored-GDA convergence, and Graffiti.pc Conjecture 2 were composed on 2026-10-14 from the exact pinned Lean statements, quotations from the AlphaProof Nexus paper, and quotations from Green, Ryu with Yuan and Yin, Surina et al., and Wang with Dai and Tong; no human review is claimed. Two additional target-specific quantum-optics annotations for the explicit AME(11,5) construction and the even N >= 4, D = N monochromatic-quantum-graph theorem were composed on 2026-10-14 from the exact pinned Lean statements, page-bound quotations from the AlphaProof Nexus paper, Helwig et al., and Krenn, Gu, and Zeilinger, and Mario Krenn's public priority correction. The AME annotation makes no first-discovery claim; the monochromatic annotation states that the local AlphaProof wrapper contains sorry and links the separate pinned proof-bearing Formal Conjectures artifact without silently treating it as local verification. Twelve declarations that the pinned source repeats verbatim in several files were annotated in only one of the copies, so the build rejected them as differing copies. On 2026-10-16 each curated annotation was copied unchanged to every identical copy: the eleven Hilbert-functions definitions from hilbert_functions_5 to hilbert_functions_1, _2, _3, _4, _7 and _8, and Erdos12.IsGood from erdos_12.parts.i to erdos_12.parts.ii (the better-sourced annotation was kept in each case). Each copy's quotations are bound in the source ledger like the original's; no new text was written and no human review is claimed. The remaining source-derived annotations were generated mechanically from pinned source comments by tooling developed in a GPT-5.6 Sol session at ultra reasoning; GPT-5.6 Sol did not originate the source prose.

Credit: Google DeepMind published the AlphaProof Nexus proof artifacts. The pinned repository identifies the mathematical sources and collaborators, including OEIS, Erdős Problems, Gergely Bérczi, and Mario Krenn; those source records remain the authority for individual credit.

Project sources: Pinned AlphaProof Nexus results documentation, AlphaProof Nexus paper, Pinned human-written natural-language proof companions

54 declarations, 0 contain sorry, 0 declared as axioms

Imports (1)

FormalConjectures.Util.ProblemImports

def A340737 A340737: Numerators of a sequence of fractions converging to $e$ line 48 source
Source documentation
A340737: Numerators of a sequence of fractions converging to $e$. $$a(1) = 3, a(2) = 5$$ For $n > 2$: $$a(n) = \begin{cases} \left(\frac{n+2}{2}\right) a(n-1) - a(n-2) - \left(\frac{n-2}{2}\right) a(n-3) & \text{if } n \text{ is even} \\ 2 a(n-1) + n a(n-2) & \text{if } n \text{ is odd} \end{cases}$$

standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat
Proof uses: WellFounded.Nat.fix, InvImage, LT.lt, A340737.match_1, Unit, OfNat.ofNat, Nat.succ, HAdd.hAdd, HSub.hSub, dite, Eq, HMod.hMod, HDiv.hDiv, Int.toNat, Int, HMul.hMul, Int.ofNat, Not
18 instances, coercions and auxiliary constants left out.
```
noncomputable def A340737 (n : ℕ) : ℕ :=
…
```
def A340738 A340738: Denominators of a sequence of fractions converging to $e$ line 80 source
Source documentation
A340738: Denominators of a sequence of fractions converging to $e$. This sequence is defined by the same recurrence relation as A340737 but with initial values $b(1)=1, b(2)=2$. $$b(1) = 1, b(2) = 2$$ For $n > 2$: $$b(n) = \begin{cases} \left(\frac{n+2}{2}\right) b(n-1) - b(n-2) - \left(\frac{n-2}{2}\right) b(n-3) & \text{if } n \text{ is even} \\ 2 b(n-1) + n b(n-2) & \text{if } n \text{ is odd} \end{cases}$$

standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat
Proof uses: WellFounded.Nat.fix, InvImage, LT.lt, A340737.match_1, Unit, OfNat.ofNat, Nat.succ, HAdd.hAdd, HSub.hSub, dite, Eq, HMod.hMod, HDiv.hDiv, Int.toNat, Int, HMul.hMul, Int.ofNat, Not
18 instances, coercions and auxiliary constants left out.
```
noncomputable def A340738 (n : ℕ) : ℕ :=
…
```
def u line 140 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real
Proof uses: HPow.hPow, HMul.hMul, HSub.hSub, OfNat.ofNat
9 instances, coercions and auxiliary constants left out.
def du line 142 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real
Proof uses: HMul.hMul, HPow.hPow, HSub.hSub, OfNat.ofNat
15 instances, coercions and auxiliary constants left out.
lemma hasDerivAt_u line 144 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real, HasDerivAt, u, du
Proof uses: id, HasDerivAt.pow, HMul.hMul, HSub.hSub, OfNat.ofNat, HasDerivAt.congr_deriv, HAdd.hAdd, Neg.neg, HasDerivAt.mul, hasDerivAt_id', HasDerivAt.const_sub, Mathlib.Tactic.Ring.of_eq, Nat.rawCast, HPow.hPow, Mathlib.Tactic.Ring.instCommSemiringNat, Int.rawCast, Int.negOfNat, Mathlib.Tactic.Ring.add_congr, Mathlib.Tactic.Ring.mul_congr, Mathlib.Tactic.Ring.cast_pos and 33 more
143 instances, coercions and auxiliary constants left out.

Tactic trace: 4 steps
Open to load the checked before-and-after goal states.
def ddu line 148 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real
Proof uses: HSub.hSub, HMul.hMul, OfNat.ofNat, HPow.hPow
15 instances, coercions and auxiliary constants left out.
lemma hasDerivAt_du line 151 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real, HasDerivAt, du, ddu
Proof uses: id, HasDerivAt.congr_deriv, HMul.hMul, HPow.hPow, HSub.hSub, OfNat.ofNat, HAdd.hAdd, Neg.neg, HasDerivAt.mul, HasDerivAt.const_mul, HasDerivAt.pow, hasDerivAt_id', HasDerivAt.const_sub, Or.elim, Eq, GT.gt, Nat.eq_zero_or_pos, of_eq_true, Eq.trans, True and 83 more
171 instances, coercions and auxiliary constants left out.

Tactic trace: 6 steps
Open to load the checked before-and-after goal states.
lemma ddu_eq line 156 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real, Eq, ddu, HAdd.hAdd, OfNat.ofNat, HSub.hSub, HMul.hMul, u
Proof uses: Eq.mpr, Mathlib.Meta.NormNum.instAtLeastTwo, HPow.hPow, id, congrArg, congr, Eq.trans, Nat.cast_add, Mathlib.Meta.NormNum.IsNat.to_eq, Mathlib.Meta.NormNum.isNat_natCast, Mathlib.Meta.NormNum.isNat_ofNat, Eq.refl, Eq.rec, Mathlib.Tactic.Ring.of_eq, Nat.rawCast, Mathlib.Tactic.Ring.instCommSemiringNat, Int.rawCast, Int.negOfNat, Mathlib.Meta.NormNum.instAddMonoidWithOne, Mathlib.Tactic.Ring.sub_congr and 49 more
62 instances, coercions and auxiliary constants left out.

Tactic trace: 4 steps
Open to load the checked before-and-after goal states.
lemma u_nonneg line 160 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real, LE.le, OfNat.ofNat, u
Proof uses: id, pow_nonneg, HMul.hMul, HSub.hSub, mul_nonneg, sub_nonneg_of_le
36 instances, coercions and auxiliary constants left out.

Tactic trace: 2 steps
Open to load the checked before-and-after goal states.
def J line 164 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real
Proof uses: intervalIntegral, HMul.hMul, u, Real.exp, OfNat.ofNat, MeasureTheory.MeasureSpace.volume
12 instances, coercions and auxiliary constants left out.
lemma J_nonneg line 166 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, LE.le, Real, OfNat.ofNat, J
Proof uses: id, intervalIntegral, HMul.hMul, u, Real.exp, MeasureTheory.MeasureSpace.volume, intervalIntegral.integral_nonneg, HPow.hPow, HSub.hSub, Complex.re, Complex.exp, zero_le_one, Membership.mem, Set, Set.Icc, J_nonneg.match_1, cast, Eq.trans, congr, congrArg and 8 more
58 instances, coercions and auxiliary constants left out.

Tactic trace: 4 steps
Open to load the checked before-and-after goal states.
lemma J_zero line 171 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Eq, Real, J, OfNat.ofNat, Nat, HSub.hSub, Real.exp
Proof uses: Eq.mpr, intervalIntegral, HMul.hMul, u, MeasureTheory.MeasureSpace.volume, id, congrArg, J.eq_1, HAdd.hAdd, Neg.neg, sub_eq_add_neg, of_eq_true, HPow.hPow, Eq.trans, True, funext, pow_zero, one_mul, integral_exp, Real.exp_zero and 3 more
39 instances, coercions and auxiliary constants left out.

Tactic trace: 2 steps
Open to load the checked before-and-after goal states.
lemma J_one line 175 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Eq, Real, J, OfNat.ofNat, Nat, HSub.hSub, Real.exp
Proof uses: Eq.mpr, intervalIntegral, HMul.hMul, u, NormedSpace.exp, MeasureTheory.MeasureSpace.volume, id, congr, congrArg, funext, Real.exp_eq_exp_ℝ, HPow.hPow, pow_one, congrFun, Eq.trans, mul_sub, mul_one, sub_mul, intervalIntegral.integral_sub, of_eq_true and 126 more
146 instances, coercions and auxiliary constants left out.

Tactic trace: 10 steps
Open to load the checked before-and-after goal states.
lemma J_le line 183 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, LE.le, Real, J, HDiv.hDiv, Real.exp, OfNat.ofNat, HPow.hPow
Proof uses: id, Eq.mpr, intervalIntegral, HMul.hMul, u, Complex.re, Complex.exp, MeasureTheory.MeasureSpace.volume, HSub.hSub, Mathlib.Meta.NormNum.instAtLeastTwo, Eq, Eq.trans, Complex, congr, congrArg, funext, Real.cos, Complex.im, Complex.exp_re, Real.cos_zero and 132 more
193 instances, coercions and auxiliary constants left out.

Tactic trace: 7 steps
Open to load the checked before-and-after goal states.
lemma J_tendsto_zero line 188 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Filter.Tendsto, Nat, Real, J, Filter.atTop, nhds, OfNat.ofNat
Proof uses: id, Eq.mpr, LE.le, Filter, Filter.map, intervalIntegral, HMul.hMul, u, Real.exp, MeasureTheory.MeasureSpace.volume, MeasureTheory.integral, MeasureTheory.Measure.restrict, Set.Ioc, HPow.hPow, HSub.hSub, Eq, congrArg, funext, intervalIntegral.integral_of_le, Mathlib.Meta.NormNum.isNat_le_true and 143 more
173 instances, coercions and auxiliary constants left out.

Tactic trace: 21 steps
Open to load the checked before-and-after goal states.
lemma deriv_u_exp line 195 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real, HasDerivAt, HMul.hMul, u, Real.exp, HAdd.hAdd, du
Proof uses: id, HPow.hPow, HSub.hSub, OfNat.ofNat, Eq.mpr, Eq, HasDerivAt.congr_simp, Eq.refl, add_mul, HasDerivAt.mul, HasDerivAt.pow, HasDerivAt.congr_deriv, Neg.neg, hasDerivAt_id', HasDerivAt.const_sub, Mathlib.Tactic.Ring.of_eq, Nat.rawCast, Mathlib.Tactic.Ring.instCommSemiringNat, Int.rawCast, Int.negOfNat and 36 more
154 instances, coercions and auxiliary constants left out.

Tactic trace: 3 steps
Open to load the checked before-and-after goal states.
lemma deriv_du_exp line 199 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real, HasDerivAt, HMul.hMul, du, Real.exp, HAdd.hAdd, ddu
Proof uses: id, Eq.mpr, HPow.hPow, HSub.hSub, OfNat.ofNat, Eq, HasDerivAt.congr_simp, Eq.refl, add_mul, Function.comp, Neg.neg, HasDerivAt.congr_deriv, HasDerivAt.mul, HasDerivAt.const_mul, HasDerivAt.pow, hasDerivAt_id', HasDerivAt.const_sub, Real.hasDerivAt_exp, symm, Eq.trans and 65 more
166 instances, coercions and auxiliary constants left out.

Tactic trace: 10 steps
Open to load the checked before-and-after goal states.
lemma int_deriv_u_exp line 204 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, LE.le, OfNat.ofNat, Eq, Real, intervalIntegral, HMul.hMul, HAdd.hAdd, du, u, Real.exp, MeasureTheory.MeasureSpace.volume
Proof uses: id, HasDerivAt, HPow.hPow, HSub.hSub, Neg.neg, HasDerivAt.mul, HasDerivAt.pow, hasDerivAt_id', HasDerivAt.const_sub, Real.hasDerivAt_exp, Eq.trans, intervalIntegral.integral_eq_sub_of_hasDerivAt, Membership.mem, Set, Set.uIcc, Function.comp, HasDerivAt.congr_deriv, Eq.mpr, congrArg, Pi.pow_apply and 93 more
152 instances, coercions and auxiliary constants left out.

Tactic trace: 7 steps
Open to load the checked before-and-after goal states.
lemma int_deriv_du_exp line 209 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, LE.le, OfNat.ofNat, Eq, Real, intervalIntegral, HMul.hMul, HAdd.hAdd, ddu, du, Real.exp, MeasureTheory.MeasureSpace.volume
Proof uses: id, Eq.mpr, HPow.hPow, HSub.hSub, congrArg, funext, add_mul, HasDerivAt, Neg.neg, HasDerivAt.mul, HasDerivAt.pow, hasDerivAt_id', HasDerivAt.const_sub, HasDerivAt.const_mul, Real.hasDerivAt_exp, Eq.symm, Eq.trans, intervalIntegral.integral_eq_sub_of_hasDerivAt, Membership.mem, Set and 105 more
159 instances, coercions and auxiliary constants left out.

Tactic trace: 11 steps
Open to load the checked before-and-after goal states.
lemma int_ddu_eq_J line 216 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, LE.le, OfNat.ofNat, Eq, Real, intervalIntegral, HMul.hMul, ddu, Real.exp, MeasureTheory.MeasureSpace.volume, J
Proof uses: id, HSub.hSub, HPow.hPow, u, Eq.mpr, congrArg, Eq.symm, propext, sub_eq_zero, intervalIntegral.integral_sub, Continuous.intervalIntegrable, Continuous.comp', Prod, Prod.mk, Prod.fst, Prod.snd, continuous_mul, Continuous.prodMk, Continuous.sub, Continuous.mul and 115 more
160 instances, coercions and auxiliary constants left out.

Tactic trace: 21 steps
Open to load the checked before-and-after goal states.
lemma J_rec line 226 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Eq, Real, J, HAdd.hAdd, OfNat.ofNat, HSub.hSub, HMul.hMul
Proof uses: id, Eq.mpr, Star.star, MeasureTheory.integral, MeasureTheory.Measure.restrict, MeasureTheory.MeasureSpace.volume, Set.Ioc, u, Real.exp, Neg.neg, intervalIntegral, HPow.hPow, congr, congrArg, Eq.trans, NormedAddCommGroup, NormedSpace, MeasureTheory.Measure, LE.le, Eq.symm and 178 more
198 instances, coercions and auxiliary constants left out.

Tactic trace: 21 steps
Open to load the checked before-and-after goal states.
def seqU line 237 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real
Proof uses: seqU.match_1, Unit, OfNat.ofNat, Nat.succ, HAdd.hAdd, HMul.hMul, HSub.hSub
17 instances, coercions and auxiliary constants left out.
def seqV line 242 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real
Proof uses: seqU.match_1, Unit, OfNat.ofNat, Nat.succ, HAdd.hAdd, HMul.hMul, HSub.hSub
16 instances, coercions and auxiliary constants left out.
lemma A_match_all line 247 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, And, Eq, Real, A340737, HAdd.hAdd, HMul.hMul, OfNat.ofNat, seqU, HDiv.hDiv
Proof uses: Nat.recAux, of_eq_true, Eq.trans, True, congr, congrArg, Mathlib.Meta.NormNum.instAtLeastTwo, Mathlib.Meta.NormNum.IsNat.to_eq, Mathlib.Meta.NormNum.isNat_add, Eq.refl, Mathlib.Meta.NormNum.isNat_mul, Mathlib.Meta.NormNum.isNat_ofNat, Mathlib.Meta.NormNum.isNat_natCast, eq_self, eq_true, True.intro, Mathlib.Meta.NormNum.instAddMonoidWithOne', Nat.cast_one, Mathlib.Meta.NormNum.IsNNRat.to_isNat, Mathlib.Meta.NormNum.isNNRat_div and 109 more
171 instances, coercions and auxiliary constants left out.

Tactic trace: 13 steps
Open to load the checked before-and-after goal states.
lemma B_match_all line 260 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, And, Eq, Real, A340738, HAdd.hAdd, HMul.hMul, OfNat.ofNat, seqV, HDiv.hDiv
Proof uses: Nat.recAux, of_eq_true, Eq.trans, True, congr, congrArg, Mathlib.Meta.NormNum.IsNat.to_eq, Mathlib.Meta.NormNum.isNat_add, Eq.refl, Mathlib.Meta.NormNum.isNat_mul, Mathlib.Meta.NormNum.isNat_ofNat, Nat.cast_one, eq_self, eq_true, True.intro, Mathlib.Meta.NormNum.instAddMonoidWithOne', Mathlib.Meta.NormNum.instAtLeastTwo, Mathlib.Meta.NormNum.isNat_natCast, mul_one, Mathlib.Meta.NormNum.IsNNRat.to_isNat and 134 more
198 instances, coercions and auxiliary constants left out.

Tactic trace: 21 steps
Open to load the checked before-and-after goal states.
lemma seqV_ge_one line 274 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, LE.le, Real, OfNat.ofNat, seqV
Proof uses: id, Nat.twoStepInduction, seqU.match_1, Unit, Nat.succ, HAdd.hAdd, HMul.hMul, HSub.hSub, le_refl, le_add_of_nonneg_of_le, Nat.rec, PProd, PProd.mk, Nat.zero, PUnit, PUnit.unit, mul_nonneg, le_of_not_gt, LT.lt, Mathlib.Tactic.Linarith.lt_irrefl and 65 more
88 instances, coercions and auxiliary constants left out.

Tactic trace: 7 steps
Open to load the checked before-and-after goal states.
def seqD line 278 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real
Proof uses: HMul.hMul, HPow.hPow, Neg.neg, OfNat.ofNat, Nat.factorial, HSub.hSub, seqV, Real.exp, seqU
12 instances, coercions and auxiliary constants left out.
lemma seqD_zero line 280 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Eq, Real, seqD, OfNat.ofNat, Nat, HSub.hSub, Real.exp
Proof uses: Eq.mpr, HMul.hMul, seqV, seqU, id, congrArg, HPow.hPow, Neg.neg, Nat.factorial, Eq.trans, Mathlib.Meta.NormNum.IsNat.to_eq, Mathlib.Meta.NormNum.isNat_mul, Eq.refl, Mathlib.Meta.NormNum.IsInt.to_isNat, Mathlib.Meta.NormNum.isInt_pow, Int.negOfNat, Int.ofNat, Mathlib.Meta.NormNum.isInt_neg, Mathlib.Meta.NormNum.IsNat.to_isInt, Mathlib.Meta.NormNum.isNat_ofNat and 12 more
39 instances, coercions and auxiliary constants left out.

Tactic trace: 2 steps
Open to load the checked before-and-after goal states.
lemma seqD_one line 284 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Eq, Real, seqD, OfNat.ofNat, Nat, HSub.hSub, Real.exp
Proof uses: id, of_eq_true, HMul.hMul, HPow.hPow, Neg.neg, Nat.factorial, Complex.re, Complex.exp, Complex, Eq.trans, True, congrArg, congr, Mathlib.Meta.NormNum.IsInt.neg_to_eq, Mathlib.Meta.NormNum.isInt_mul, Int.negOfNat, Int.ofNat, Eq.refl, Mathlib.Meta.NormNum.isInt_pow, Mathlib.Meta.NormNum.isInt_neg and 14 more
64 instances, coercions and auxiliary constants left out.

Tactic trace: 2 steps
Open to load the checked before-and-after goal states.
lemma seqD_rec line 288 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Eq, Real, seqD, HAdd.hAdd, OfNat.ofNat, HSub.hSub, HMul.hMul
Proof uses: id, Eq.mpr, HPow.hPow, Neg.neg, Nat.factorial, seqV, Real.exp, seqU, congr, Nat.succ, congrArg, Eq.trans, Nat.cast_mul, Nat.cast_succ, Nat.cast_add, Nat.cast_one, two_mul, Mathlib.Tactic.Ring.of_eq, Nat.rawCast, Mathlib.Tactic.Ring.instCommSemiringNat and 53 more
66 instances, coercions and auxiliary constants left out.

Tactic trace: 3 steps
Open to load the checked before-and-after goal states.
lemma J_eq_seqD_both line 293 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, And, Eq, Real, J, seqD, HAdd.hAdd, OfNat.ofNat
Proof uses: Nat.recAux, Eq.mpr, intervalIntegral, HMul.hMul, u, Real.exp, MeasureTheory.MeasureSpace.volume, HSub.hSub, seqV, seqU, id, congr, HPow.hPow, Neg.neg, Nat.factorial, congrArg, Eq.trans, Mathlib.Meta.NormNum.IsNat.to_eq, Mathlib.Meta.NormNum.isNat_mul, Eq.refl and 129 more
132 instances, coercions and auxiliary constants left out.

Tactic trace: 18 steps
Open to load the checked before-and-after goal states.
lemma J_eq_seqD line 306 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Eq, Real, J, seqD
Proof uses: And.left, HAdd.hAdd, OfNat.ofNat, J_eq_seqD_both
3 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
lemma seqD_tendsto_zero line 309 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Filter.Tendsto, Nat, Real, seqD, Filter.atTop, nhds, OfNat.ofNat
Proof uses: Eq, J, funext, Eq.symm, J_eq_seqD, Eq.mpr, id, congrArg, J_tendsto_zero
12 instances, coercions and auxiliary constants left out.

Tactic trace: 5 steps
Open to load the checked before-and-after goal states.
lemma tendsto_abs_zero_of_tendsto_zero line 316 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real, Filter.Tendsto, Filter.atTop, nhds, OfNat.ofNat, abs
Proof uses: Filter.Tendsto.comp, Norm.norm, tendsto_norm_zero
27 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
lemma tendsto_zero_of_abs_le line 319 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real, LE.le, abs, Filter.Tendsto, Filter.atTop, nhds, OfNat.ofNat
Proof uses: squeeze_zero_norm
24 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
def seqE line 322 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Real
Proof uses: HSub.hSub, seqU, HMul.hMul, seqV, Real.exp, OfNat.ofNat
6 instances, coercions and auxiliary constants left out.
lemma seqD_eq_seqE line 324 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Eq, Real, seqD, HMul.hMul, HPow.hPow, Neg.neg, OfNat.ofNat, HAdd.hAdd, Nat.factorial, seqE
Proof uses: id, HSub.hSub, seqV, Real.exp, seqU, Eq.mpr, congrArg, Eq.trans, pow_succ, mul_neg, mul_one, neg_mul, Mathlib.Tactic.Ring.of_eq, Nat.rawCast, Mathlib.Tactic.Ring.instCommSemiringNat, Int.rawCast, Int.negOfNat, Mathlib.Tactic.Ring.mul_congr, Mathlib.Tactic.Ring.pow_congr, Mathlib.Tactic.Ring.neg_congr and 39 more
66 instances, coercions and auxiliary constants left out.

Tactic trace: 5 steps
Open to load the checked before-and-after goal states.
lemma abs_seqD_eq_fact_mul_abs_seqE line 331 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Eq, Real, abs, seqD, HMul.hMul, Nat.factorial, seqE
Proof uses: id, Eq.trans, HPow.hPow, Neg.neg, OfNat.ofNat, HSub.hSub, seqV, Real.exp, seqU, Max.max, abs_mul, congr_arg₂, of_eq_true, True, congrArg, congr, abs_pow, abs_neg, abs_one, one_pow and 4 more
51 instances, coercions and auxiliary constants left out.

Tactic trace: 3 steps
Open to load the checked before-and-after goal states.
lemma abs_seqE_le_abs_seqD line 335 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, LE.le, Real, abs, seqE, seqD
Proof uses: id, Eq.trans_le, HSub.hSub, seqU, HMul.hMul, seqV, Real.exp, OfNat.ofNat, Max.max, HPow.hPow, Neg.neg, Nat.factorial, abs_sub_comm, LE.le.trans, Norm.norm, le_mul_of_one_le_left, norm_nonneg, of_eq_true, Eq.trans, True and 14 more
73 instances, coercions and auxiliary constants left out.

Tactic trace: 3 steps
Open to load the checked before-and-after goal states.
lemma seqE_tendsto_zero line 339 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Filter.Tendsto, Nat, Real, seqE, Filter.atTop, nhds, OfNat.ofNat
Proof uses: abs, seqD, tendsto_abs_zero_of_tendsto_zero, seqD_tendsto_zero, tendsto_zero_of_abs_le, abs_seqE_le_abs_seqD
14 instances, coercions and auxiliary constants left out.

Tactic trace: 2 steps
Open to load the checked before-and-after goal states.
lemma tendsto_seqE_div_seqV_zero line 343 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Filter.Tendsto, Nat, Real, HDiv.hDiv, seqE, seqV, Filter.atTop, nhds, OfNat.ofNat
Proof uses: abs, tendsto_abs_zero_of_tendsto_zero, seqE_tendsto_zero, LE.le, Eq.mpr, id, Eq, congrArg, abs_div, seqV_ge_one, le_trans, le_abs_self, div_le_div_of_nonneg_left, abs_nonneg, zero_lt_one, Eq.mp, div_one, tendsto_zero_of_abs_le
79 instances, coercions and auxiliary constants left out.

Tactic trace: 11 steps
Open to load the checked before-and-after goal states.
lemma seqU_eq line 356 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Eq, Real, seqU, HAdd.hAdd, HMul.hMul, seqV, Real.exp, OfNat.ofNat, seqE
Proof uses: id, Mathlib.Tactic.Ring.of_eq, HSub.hSub, HPow.hPow, Nat.rawCast, Mathlib.Tactic.Ring.instCommSemiringNat, Mathlib.Tactic.Ring.atom_pf, Mathlib.Tactic.Ring.add_congr, Int.rawCast, Int.negOfNat, Mathlib.Tactic.Ring.mul_congr, Mathlib.Tactic.Ring.add_mul, Mathlib.Tactic.Ring.mul_add, Mathlib.Tactic.Ring.mul_pf_left, Mathlib.Tactic.Ring.mul_pf_right, Mathlib.Tactic.Ring.one_mul, Mathlib.Tactic.Ring.mul_zero, Mathlib.Tactic.Ring.add_pf_add_zero, Mathlib.Tactic.Ring.zero_mul, Mathlib.Tactic.Ring.sub_congr and 20 more
35 instances, coercions and auxiliary constants left out.

Tactic trace: 2 steps
Open to load the checked before-and-after goal states.
lemma seqU_div_seqV_eq line 360 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Eq, Real, HDiv.hDiv, seqU, seqV, HAdd.hAdd, Real.exp, OfNat.ofNat, seqE
Proof uses: Eq.mpr, HMul.hMul, id, congrArg, seqU_eq, Ne, LE.le, seqV_ge_one, Not.intro, Mathlib.Tactic.Linarith.lt_irrefl, Eq.mp, LT.lt, Neg.neg, HSub.hSub, Mathlib.Tactic.Ring.of_eq, Mathlib.Tactic.Ring.add_congr, HPow.hPow, Nat.rawCast, Mathlib.Tactic.Ring.instCommSemiringNat, Int.rawCast and 37 more
78 instances, coercions and auxiliary constants left out.

Tactic trace: 5 steps
Open to load the checked before-and-after goal states.
lemma tendsto_seqU_div_seqV line 367 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Filter.Tendsto, Nat, Real, HDiv.hDiv, seqU, seqV, Filter.atTop, nhds, Real.exp, OfNat.ofNat
Proof uses: Eq, HAdd.hAdd, seqE, funext, seqU_div_seqV_eq, Eq.mpr, id, congrArg, Filter.Tendsto.add, tendsto_const_nhds, tendsto_seqE_div_seqV_zero, Eq.mp, add_zero
36 instances, coercions and auxiliary constants left out.

Tactic trace: 7 steps
Open to load the checked before-and-after goal states.
lemma tendsto_shift line 377 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Filter, Filter.Tendsto, Filter.atTop, HAdd.hAdd, OfNat.ofNat
Proof uses: Eq.mpr, id, Eq, congrArg, propext, Filter.tendsto_add_atTop_iff_nat
8 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
lemma A_even_eq_seqU line 380 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Eq, Real, A340737, HAdd.hAdd, HMul.hMul, OfNat.ofNat, HDiv.hDiv, seqU
Proof uses: And.right, A_match_all
30 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
lemma B_even_eq_seqV line 383 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Eq, Real, A340738, HAdd.hAdd, HMul.hMul, OfNat.ofNat, HDiv.hDiv, seqV
Proof uses: And.right, B_match_all
30 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
lemma A_even_div_B_even_eq line 386 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Eq, Real, HDiv.hDiv, A340737, HAdd.hAdd, HMul.hMul, OfNat.ofNat, A340738, seqU, seqV
Proof uses: A_even_eq_seqU, B_even_eq_seqV, Eq.mpr, id, congrArg, Mathlib.Tactic.Ring.of_eq, HPow.hPow, Nat.rawCast, Mathlib.Tactic.Ring.instCommSemiringNat, Inv.inv, Mathlib.Meta.NormNum.instAddMonoidWithOne', Mathlib.Tactic.Ring.div_congr, NNRat.rawCast, Mathlib.Tactic.Ring.atom_pf, Mathlib.Tactic.Ring.cast_pos, Mathlib.Meta.NormNum.isNat_ofNat, Eq.refl, Mathlib.Meta.NormNum.instAtLeastTwo, Mathlib.Tactic.Ring.div_pf, Mathlib.Tactic.Ring.inv_single and 20 more
64 instances, coercions and auxiliary constants left out.

Tactic trace: 8 steps
Open to load the checked before-and-after goal states.
lemma A_even_div_B_even_eq_e_add line 397 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, Eq, Real, HDiv.hDiv, A340737, HAdd.hAdd, HMul.hMul, OfNat.ofNat, A340738, Real.exp, seqE, seqV
Proof uses: seqU, A_even_div_B_even_eq, Eq.mpr, id, congrArg, seqU_eq, Mathlib.Tactic.Ring.of_eq, HPow.hPow, Nat.rawCast, Mathlib.Tactic.Ring.instCommSemiringNat, Mathlib.Tactic.Ring.add_congr, Mathlib.Tactic.Ring.mul_congr, Mathlib.Tactic.Ring.cast_pos, Mathlib.Meta.NormNum.isNat_ofNat, Eq.refl, Mathlib.Meta.NormNum.instAtLeastTwo, Mathlib.Tactic.Ring.atom_pf, Mathlib.Tactic.Ring.add_mul, Mathlib.Tactic.Ring.mul_add, Mathlib.Tactic.Ring.mul_pf_right and 89 more
136 instances, coercions and auxiliary constants left out.

Tactic trace: 28 steps
Open to load the checked before-and-after goal states.
lemma abs_even_error_term_le line 418 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat, LE.le, Real, abs, HDiv.hDiv, HAdd.hAdd, HMul.hMul, OfNat.ofNat, seqE, seqV
Proof uses: id, Eq.trans_le, HSub.hSub, seqU, seqU.match_1, Unit, Nat.succ, Real.exp, abs_div, div_le_of_le_mul₀, abs_nonneg, add_nonneg, LE.le.trans, Norm.norm, norm_add_le_of_le, norm_mul_le_of_le, Eq.le, abs_of_nonneg, le_of_not_gt, LT.lt and 89 more
150 instances, coercions and auxiliary constants left out.

Tactic trace: 24 steps
Open to load the checked before-and-after goal states.
lemma tendsto_even_error_term line 427 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Filter.Tendsto, Nat, Real, HDiv.hDiv, HAdd.hAdd, HMul.hMul, OfNat.ofNat, seqE, seqV, Filter.atTop, nhds
Proof uses: seqE_tendsto_zero, abs, tendsto_abs_zero_of_tendsto_zero, tendsto_shift, Filter.Tendsto.add, tendsto_zero_of_abs_le, abs_even_error_term_le, Eq.mp, congrArg, add_zero
56 instances, coercions and auxiliary constants left out.

Tactic trace: 6 steps
Open to load the checked before-and-after goal states.
lemma tendsto_A_even_div_B_even line 435 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Filter.Tendsto, Nat, Real, HDiv.hDiv, A340737, HAdd.hAdd, HMul.hMul, OfNat.ofNat, A340738, Filter.atTop, nhds, Real.exp
Proof uses: Eq, seqE, seqV, funext, A_even_div_B_even_eq_e_add, Eq.mpr, id, congrArg, Filter.Tendsto.add, tendsto_const_nhds, tendsto_even_error_term, Eq.mp, add_zero
53 instances, coercions and auxiliary constants left out.

Tactic trace: 7 steps
Open to load the checked before-and-after goal states.
lemma tendsto_even_odd_pos line 446 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: TopologicalSpace, Nat, Filter, Filter.Tendsto, HAdd.hAdd, HMul.hMul, OfNat.ofNat, Filter.atTop
Proof uses: Eq.mpr, Set, Membership.mem, Exists, GE.ge, id, Eq, Nonempty, Preorder, IsDirectedOrder, propext, Filter.tendsto_atTop', Exists.elim, Eq.mp, Exists.intro, tendsto_even_odd_pos.match_1, Or, Nat.even_or_odd', Or.elim, Eq.rec and 3 more
28 instances, coercions and auxiliary constants left out.

Tactic trace: 5 steps
Open to load the checked before-and-after goal states.
theorem target_theorem_0 line 456 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Filter.Tendsto, Nat, Real, HDiv.hDiv, A340737, A340738, Filter.atTop, nhds, Real.exp, OfNat.ofNat
Proof uses: HAdd.hAdd, HMul.hMul, Eq, seqU, seqV, funext, And.left, A_match_all, B_match_all, Eq.mpr, id, congrArg, Eq.refl, tendsto_shift, tendsto_seqU_div_seqV, tendsto_even_odd_pos, tendsto_A_even_div_B_even
32 instances, coercions and auxiliary constants left out.

Distinct definitions of this name: APNOutputs/OEIS/A224515_conjecture_existence.lean:269 (different declaration text), APNOutputs/OEIS/A309132_conjecture_carmichael.lean:375 (different declaration text), APNOutputs/OEIS/A382590_conjecture_kth_prime_factor_is_eventually_periodic.lean:303 (different declaration text), APNOutputs/OEIS/a091669_conjecture_primitive_root.lean:275 (different declaration text), APNOutputs/OEIS/a325046_odd_terms_at_k_times_k_plus_1.lean:187 (different declaration text), APNOutputs/OEIS/oeis_103311_conjecture_0.lean:240 (different declaration text), APNOutputs/OEIS/oeis_108_conjecture_2.lean:281 (different declaration text), APNOutputs/OEIS/oeis_113254_conjecture_0.lean:153 (different declaration text), APNOutputs/OEIS/oeis_175386_conjecture_0.lean:326 (different declaration text), APNOutputs/OEIS/oeis_194806_conjecture_0.lean:495 (different declaration text), APNOutputs/OEIS/oeis_227582_conjecture_0.lean:306 (different declaration text), APNOutputs/OEIS/oeis_228143_conjecture_1.lean:730 (different declaration text), APNOutputs/OEIS/oeis_243106_conjecture_0.lean:164 (different declaration text), APNOutputs/OEIS/oeis_248802_conjecture_0.lean:223 (different declaration text), APNOutputs/OEIS/oeis_248802_conjecture_4.lean:841 (different declaration text), APNOutputs/OEIS/oeis_256012_conjecture_0.lean:116 (different declaration text), APNOutputs/OEIS/oeis_267581_conjecture_0.lean:212 (different declaration text), APNOutputs/OEIS/oeis_271591_conjecture_0.lean:518 (different declaration text), APNOutputs/OEIS/oeis_278070_conjecture_0.lean:91 (different declaration text), APNOutputs/OEIS/oeis_282779_conjecture_0.lean:141 (different declaration text), APNOutputs/OEIS/oeis_289411_conjecture_0.lean:189 (different declaration text), APNOutputs/OEIS/oeis_2897_conjecture_0.lean:427 (different declaration text), APNOutputs/OEIS/oeis_306424_conjecture_0.lean:300 (different declaration text), APNOutputs/OEIS/oeis_307865_conjecture_0.lean:212 (different declaration text), APNOutputs/OEIS/oeis_323557_conjecture_0.lean:214 (different declaration text), APNOutputs/OEIS/oeis_341254_conjecture_0.lean:136 (different declaration text), APNOutputs/OEIS/oeis_363347_conjecture_2.lean:848 (different declaration text), APNOutputs/OEIS/oeis_372761_conjecture_2.lean:756 (different declaration text), APNOutputs/OEIS/oeis_51293_conjecture_0.lean:517 (different declaration text), APNOutputs/OEIS/oeis_62567_conjecture_0.lean:329 (different declaration text), APNOutputs/OEIS/oeis_A028859_conjecture_1.lean:432 (different declaration text), APNOutputs/OEIS/oeis_A258667_conjecture_0.lean:446 (different declaration text), APNOutputs/OEIS/oeis_a211417_conjecture_specific.lean:264 (different declaration text), APNOutputs/OEIS/oeis_a237271_conjecture_2.lean:124 (different declaration text), APNOutputs/OEIS/oeis_a300997_finite_difference_is_one_or_two.lean:1111 (different declaration text), APNOutputs/OEIS/oeis_a363102_conjecture_1.lean:302 (different declaration text), APNOutputs/OEIS/oeis_a368692_conjecture_integrality.lean:182 (different declaration text). Qualify references as target_theorem_0@path.

Tactic trace: 9 steps
Open to load the checked before-and-after goal states.