Theorems · Theorem · logic and foundations

Directed.sequence.congr_simp

∀ {α : Type u_1} {β : Type u_2} [inst : Encodable α] [inst_1 : Inhabited α] {r r_1 : β → β → Prop} (e_r : r = r_1)
  (f f_1 : α → β) (e_f : f = f_1) (hf : Directed r f) (a a_1 : ℕ),
  a = a_1 → Directed.sequence f hf a = Directed.sequence f_1 ⋯ a_1

Defined in: Mathlib.Logic.Encodable.Basic
Cited by: 0 results in Mathlib
Foundations: Depth 10 from the axioms · uses Classical.choice
Assumes: Encodable Inhabited

Mathlib docs Source Loogle LeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites3

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Directedstatement and proof · cited by 213
Encodablestatement and proof · cited by 140
Directed.sequencestatement and proof · cited by 10

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.