reconciliation-Nat.lor_assoc
- Kind
- kernel-term
- Status
- checked
Supports: ∀ (n m k : ℕ), n ||| m ||| k = n ||| (m ||| k)
Evidence notes
Registers an independently constructed native theorem (`F:nat-lor-assoc`, `Nat.lor_assoc` in `nat_prelude/rec_agreement.rs`) whose proposition definitionally matches this proof-free imported goal -- Mathlib's `Nat.lor` is `Nat.bitwise or`, and our `Nat.lor` is proved equal to the `bitwise or_fn` specialization by `Nat.bitwise_or_eq_lor`, so this closes the SAME function's associativity, not a lookalike about a different definition (the criterion this repository uses to decide when flipping an `ml430` mirror is honest: Mathlib's `def` is the same function, not merely a theorem about a different one). No Autogenesis operation produced the theorem; the route taken (`lor_aux_assoc_of_fuel` via the `lor_aux_ne_zero_of_right_ne_zero` invariant, a double `Nat.div_mod_unique` reconstruction, the outer induction's own `ih`, and a new `lor_bit_assoc` max-associativity lemma) is NOT Mathlib's own route, which is why `depends_on` still names the still-open `F:ml430-nat-lor-bit-a2f98c7c` -- that edge records curriculum lineage, not a dependency this proof actually used.