reconciliation-Nat.bitwise_comm
- Kind
- kernel-term
- Status
- checked
Supports: ∀ {f : Bool → Bool → Bool}, (∀ (b b' : Bool), f b b' = f b' b) → ∀ (n m : ℕ), Nat.bitwise f n m = Nat.bitwise f m n
Evidence notes
Registers an independently constructed native theorem (`F:nat-bitwise-comm`, `Nat.bitwise_comm` in `nat_prelude/bitwise.rs`) whose proposition definitionally matches this proof-free imported goal, modulo the cosmetic `n m` / `m n` argument-name order in the two universally quantified naturals -- both sides state the SAME proposition (`bitwise` commutative for a commutative `f`), and `Eq` is symmetric regardless. Unlike `Nat.land_comm`/`Nat.lor_comm` (which needed a DIFFERENT route than Mathlib's own `bitwise_comm`, since our `land`/`lor` are hand-rolled fuel recursions rather than `bitwise` specializations at proof-construction time), this fact's native proof genuinely IS Mathlib's own general `Nat.bitwise` combinator, 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.