reconciliation-Nat.land_bit
- Kind
- kernel-term
- Status
- checked
Supports: ∀ (a : Bool) (m : ℕ) (b : Bool) (n : ℕ), Nat.bit a m &&& Nat.bit b n = Nat.bit (a && b) (m &&& n)
Evidence notes
Registers an independently constructed native theorem (`F:nat-land-bit`, `Nat.land_bit` in `nat_prelude/bit_decode.rs`) whose proposition definitionally matches this proof-free imported goal -- Mathlib's `Nat.land` is `Nat.bitwise and`, and our `Nat.land` is proved equal to the `bitwise and_fn` specialization by `Nat.bitwise_and_eq_land`, so this closes the SAME function's `bit`-decode identity, 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 (the `Nat.bit` decode bridge -- an artificially chosen sufficient fuel, plus `Nat.bit_div_two`/`Nat.bit_mod_two` decoding, plus a `Bool`-first case tree resolving the two fuel-recursion guards) is NOT Mathlib's own route via `bitwise_bit'`, which is why this fact's `depends_on` stays empty rather than naming `F:ml430-nat-bitwise-bit-4c4b28a8` -- our proof never used the general `bitwise` recursion equations.