AFTD Auto-Formalizing Theoretical Domains

Fin.funPredPredAbove

defimported Lean

Given a bijection Fin (n1 + 1 + 1) → Fin (n + 1 + 1)) and a pair i j : Fin (n1 + 1 + 1), then funPredPredAbove i j _ σ _ : Fin n1 → Fin n corresponds to the induced bijection formed by dropping i and j in the source and their image in the target.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Fin in
variable {n : ℕ} {c : Fin (n + 1 + 1) → C} in
def Fin.funPredPredAbove {n n1 : ℕ} (i j : Fin (n1 + 1 + 1)) (hij : i ≠ j)
    (σ : Fin (n1 + 1 + 1) → Fin (n + 1 + 1)) (hσ : Function.Bijective σ)
    (m : Fin n1) : Fin n
Defined in
Physlib, `Fin.funPredPredAbove`
Lean proof
By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 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
09 Oct 2026
Axioms
none listed
Built on 15
Used by 3

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Fin in
variable {n : ℕ} {c : Fin (n + 1 + 1) → C} in
/-- Given a bijection `Fin (n1 + 1 + 1) → Fin (n + 1 + 1))` and a pair `i j : Fin (n1 + 1 + 1)`, then `funPredPredAbove i j _ σ _ : Fin n1 → Fin n` corresponds to the induced bijection formed by dropping `i` and `j` in the source and their image in the target. -/
def Fin.funPredPredAbove {n n1 : ℕ} (i j : Fin (n1 + 1 + 1)) (hij : i ≠ j)
    (σ : Fin (n1 + 1 + 1) → Fin (n + 1 + 1)) (hσ : Function.Bijective σ)
    (m : Fin n1) : Fin n :=
  predPredAbove (σ i) (σ j)
    (by simp [hσ.injective.eq_iff, hij])
    (σ (succSuccAbove i j m)) (by simp [hσ.injective.eq_iff, Ne.symm])
See it in the graphDiscuss this resultChallenge it