Theorems · Theorem · order theory
Function.semiconj_of_isLUB
∀ {α : Type u_1} {G : Type u_4} [inst : PartialOrder α] [inst_1 : Group G] (f₁ f₂ : G →* α ≃o α) {h : α → α},
(∀ (x : α), IsLUB (Set.range fun g' => (f₁ g')⁻¹ ((f₂ g') x)) (h x)) → ∀ (g : G), Function.Semiconj h ⇑(f₂ g) ⇑(f₁ g)- Defined in
- Mathlib.Order.SemiconjSup
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 28 from the axioms · uses propext, Quot.sound
- Assumes
- PartialOrderGroup
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites19
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Setproof · cited by 53,352
- PartialOrderstatement and proof · cited by 6,410
- Groupstatement and proof · cited by 6,238
- Set.imageproof · cited by 5,609
- Set.rangestatement and proof · cited by 4,705
- MonoidHomstatement and proof · cited by 3,629
- map_mulproof · cited by 1,137
- OrderIsostatement and proof · cited by 874
- IsLUBstatement and proof · cited by 280
- mul_inv_revproof · cited by 270
- Set.range_compproof · cited by 223
Cited by2
Results whose statement or proof uses this declaration.
- Function.csSup_div_semiconjproof · cited by 1
- Function.sSup_div_semiconjproof · cited by 0