Theorems · Theorem · order theory
Relation.fibration_iff_image_Iic
∀ {α : Type u_1} {β : Type u_2} {f : α → β} [inst : Preorder α] [inst_1 : Preorder β],
Monotone f →
(Relation.Fibration (fun x1 x2 => x1 ≤ x2) (fun x1 x2 => x1 ≤ x2) f ↔ ∀ (x : α), f '' Set.Iic x = Set.Iic (f x))- Defined in
- Mathlib.Order.UpperLower.Fibration
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Preorderstatement and proof · cited by 7,952
- Set.imagestatement and proof · cited by 5,609
- le_antisymmproof · cited by 2,068
- le_rflproof · cited by 1,558
- Monotonestatement and proof · cited by 1,397
- Set.Iicstatement and proof · cited by 1,111
- Relation.Fibrationstatement and proof · cited by 14
- isLowerSet_Iicproof · cited by 8
- IsLowerSet.Iic_subsetproof · cited by 6
- Relation.fibration_iff_isLowerSet_image_Iicproof · cited by 4
- Relation.Fibration.isLowerSet_imageproof · cited by 4
Cited by2
Results whose statement or proof uses this declaration.
- specializingMap_iff_closure_singletonproof · cited by 1
- Relation.fibration_iff_image_Iciproof · cited by 0