Mathlib Map

Theorems · Theorem · order theory

WellFounded.notMem_of_lt_min

∀ {α : Type u_1} {r : α → α → Prop} {wf : WellFounded r} {s : Set α} {hs : s.Nonempty} {x : α},
  r x (wf.min s hs) → x ∉ s
Defined in
Mathlib.Order.WellFounded
Cited by
1 results in Mathlib
Foundations
Depth 16 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

WellFounded.mem_of_lt_min_compl · cited by 1WellFounded.mem_of_lt_min…Set · cited by 53352SetSet.Nonempty · cited by 2627Set.NonemptyWellFounded.min · cited by 33WellFounded.minWellFounded.not_lt_min · cited by 20WellFounded.not_lt_minWellFounded.notMem_of_lt_minCITED BYCITES

Cites4

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

Cited by1

Results whose statement or proof uses this declaration.