AFTD Auto-Formalizing Theoretical Domains

PureU1.permThreeInj

defimported Lean

Given three distinct elements an embedding of Fin 3 into Fin n.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Nat in
open Finset in
variable {i j k i' j' k' : Fin n} (hij : i ≠ j) (hjk : j ≠ k) (hik : i ≠ k) (hij' : i' ≠ j')
  (hjk' : j' ≠ k') (hik' : i' ≠ k') in
def PureU1.permThreeInj : Fin 3 ↪ Fin n
Defined in
Physlib, `PureU1.permThreeInj`
Lean proof
By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2024 Joseph Tooby-Smith. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.
Verified
10 Oct 2026
Axioms
none listed
Built on 1
  • NAEtoColor.clauseNodeColorGiven three Boolean values $a, b, c$ (the truth values of a clause's three literals) and an index $k \in \mathrm{Fin}\,3$, returns the…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Nat in
open Finset in
variable {i j k i' j' k' : Fin n} (hij : i ≠ j) (hjk : j ≠ k) (hik : i ≠ k) (hij' : i' ≠ j')
  (hjk' : j' ≠ k') (hik' : i' ≠ k') in
/-- Given three distinct elements an embedding of `Fin 3` into `Fin n`. -/
def PureU1.permThreeInj : Fin 3 ↪ Fin n where
  toFun s := match s with
    | 0 => i
    | 1 => j
    | 2 => k
  inj' s1 s2 := by
    aesop
See it in the graphDiscuss this resultChallenge it