reconciliation-Nat.bitwise_swap
- Kind
- kernel-term
- Status
- checked
Supports: ∀ {f : Bool → Bool → Bool}, Nat.bitwise (Function.swap f) = Function.swap (Nat.bitwise f)
Evidence notes
Registers an independently constructed native theorem (`F:nat-bitwise-swap`, `Nat.bitwise_swap` in `nat_prelude/bitwise.rs`) whose proposition matches this proof-free imported goal up to the standard, funext-avoiding restatement this kernel uses throughout (this kernel has no `funext`, so a `Function.swap`-level function equality is stated pointwise: `forall f m n, bitwise (swap f) m n = bitwise f n m` is the applied form of `bitwise (swap f) = swap (bitwise f)`). Our `Nat.bitwise` genuinely IS Mathlib's own general combinator (not a specialization), so the flip is honest in the strongest sense this repository's mirror-flip criterion recognizes: Mathlib's `def Nat.bitwise` and ours are the same function, and this closes the same theorem about it, restated in a form this kernel can actually state.