Corpus formal_theorem canonical 2026-05-27T20:53:50+00:00
Corpus v3 · Formal theorem cid005290FTH0027canonicalv1

no_tie (theorem)

/-- [I.L03] No-Tie Lemma: If b₁ · A↑↑(c₁-1) = b₂ · A↑↑(c₂-1) (=: v), and both c₁, c₂ are maximal (¬(A↑↑cᵢ ∣ v)), then c₁ = c₂ and b₁ = b₂. Proof: Suppose c₁ < c₂. Then A↑↑c₁ ∣ A↑↑(c₂-1) (since both are powers of A and c₁ ≤ c₂-1). Hence A↑↑c₁ ∣ v = b₂ · A↑↑(c₂-1). But ¬(A↑↑c₁ ∣ v), contradiction. So c₁ = c₂, then b₁ = b₂. -/

Formalization

lean_axiom_freesorries: 0project axioms: 0
  • ModuleTauLib.BookI.Coordinates.NoTie
  • Declarationno_tie
  • Lean toolchainleanprover/lean4:v4.x.x

Identifiers

  • Corpus ID cid005290
  • Primary alias FTH0027
  • Type Formal theorem
  • Status canonical
  • Visibility public
  • Version v1

Aliases & legacy IDs

no_tieno-tieTauLib.BookI.Coordinates.NoTie::no_tie

Release lines

corpus_v2corpus_v3_working

Version & History

  • v1 · 2026-05-10 imported from v2 taulib declarations

Status disclaimer

A Corpus Item page reports the program's current internal record for this item. It does not imply external verification, scientific consensus, or final proof unless explicitly stated. Read it together with its dependencies, formalization status, and the program's overall stance.

Save or share this page for inspection

Download a portable dossier, copy a reviewer note, or send this page to someone who can inspect it.

Email to expert