AFTD Auto-Formalizing Theoretical Domains

Cslib.Crypto.Protocols.PerfectSecrecy.OTP.eq_xor_iff_xor_eq

theoremverifiedformalizationimported Lean

XOR by a fixed mask is self-inverse on BitVec: c = k ^^^ m ↔ c ^^^ m = k.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
lemma Cslib.Crypto.Protocols.PerfectSecrecy.OTP.eq_xor_iff_xor_eq {l : ℕ} (c m k : BitVec l) :
    (c = k ^^^ m) ↔ (c ^^^ m = k)
Formalizes
CSLib, `Cslib.Crypto.Protocols.PerfectSecrecy.OTP.eq_xor_iff_xor_eq`
Lean proof
By Samuel Schlesinger, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Samuel Schlesinger. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true in/-- XOR by a fixed mask is self-inverse on `BitVec`: `c = k ^^^ m ↔ c ^^^ m = k`. -/lemma Cslib.Crypto.Protocols.PerfectSecrecy.OTP.eq_xor_iff_xor_eq {l : ℕ} (c m k : BitVec l) :    (c = k ^^^ m) ↔ (c ^^^ m = k) := by grind
See it in the graphDiscuss this resultChallenge it