Proof for EasyLean/Basic.lean - #60
Open
aleph-prover-test[bot] wants to merge 1 commit into
Open
Conversation
Automated commit at 20260323_094105
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Proven lemmas: 2/2
The current goal is to prove two elementary theorems in Lean: first, that the real system 3a + 2b = 5 and a + b = 2 forces a = 1 and b = 1; second, that for natural numbers, from a = b, a = d, and a = c one can conclude c = b.
This was naturally decomposed into two independent sub-problems, one for each theorem. The first is a 2×2 linear algebra exercise over ℝ, and the second is a basic equality-transitivity fact over ℕ.
Progress is complete: 2 out of 2 sub-problems have been solved. For mathd_algebra_513, the proof uses linear reasoning: one can combine the two equations to isolate one variable and then the other, and Lean’s linarith tactic is enough to finish it directly. For eq_four, the proof is a short chain of equalities: from a = c we get c = a, and composing with a = b gives c = b.
At this point, nothing remains open in this batch. The main interesting proof ideas were that the first theorem can be dispatched either by explicit substitution or by a single linear-arithmetic step, while the second shows that one of the assumptions, a = d, is actually unused.