Proof of `Ünïcode: $\mu$ -descent and $\varepsilon$ – $\delta$ weakening (ℵ₀ rungs, ∀∃, 中文)` (1st statement)

groundedproofs/Lax771644Proofs/UnicodeNames.lean · lax-771644

What this proof establishes

thm✓Lax771644.UnicodeNames

thm✓Lax771644.UnicodeNames (1st statement)

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

The $\varepsilon$ – $\delta$ statement follows from the $\mu$ statement.

Proof strategy

Apply the other statement and weaken one rung.

Attribution

Synthetic: written for this benchmark. The mathematics is a one-line divisibility weakening; only the shape of the dependency edges is the point.