Theorems · Theorem · order theory
liftFun_vecCons
∀ {α : Type u_1} {n : ℕ} (r : α → α → Prop) [IsTrans α r] {f : Fin (n + 1) → α} {a : α},
Relator.LiftFun (fun x1 x2 => x1 < x2) r (Matrix.vecCons a f) (Matrix.vecCons a f) ↔
r a (f 0) ∧ Relator.LiftFun (fun x1 x2 => x1 < x2) r f f- Defined in
- Mathlib.Order.Fin.Tuple
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 33 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- IsTrans
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Matrix.vecConsstatement and proof · cited by 852
- IsTransstatement and proof · cited by 157
- Relator.LiftFunstatement · cited by 47
- Matrix.cons_val_succproof · cited by 47
- Fin.liftFun_iff_succproof · cited by 6
Cited by4
Results whose statement or proof uses this declaration.
- monotone_vecConsproof · cited by 2
- strictMono_vecConsproof · cited by 1
- strictAnti_vecConsproof · cited by 1
- Fin.liftFun_consproof · cited by 1