Inhabited chains in preorders
Content created by Fredrik Bakke.
Created on 2024-11-20.
Last modified on 2024-11-20.
module order-theory.inhabited-chains-preorders where
Imports
open import foundation.dependent-pair-types open import foundation.inhabited-subtypes open import foundation.propositions open import foundation.subtypes open import foundation.universe-levels open import order-theory.chains-preorders open import order-theory.preorders open import order-theory.subpreorders open import order-theory.total-preorders
Idea
An
inhabited chain¶
in a preorder P
is a
subtype S
of P
such that the ordering of P
restricted to S
is linear and
inhabited.
Definitions
The predicate on chains in preorders of being inhabited
module _ {l1 l2 l3 : Level} (X : Preorder l1 l2) (S : chain-Preorder l3 X) where is-inhabited-prop-chain-Preorder : Prop (l1 ⊔ l3) is-inhabited-prop-chain-Preorder = is-inhabited-subtype-Prop (subpreorder-chain-Preorder X S) is-inhabited-chain-Preorder : UU (l1 ⊔ l3) is-inhabited-chain-Preorder = type-Prop is-inhabited-prop-chain-Preorder is-prop-is-inhabited-chain-Preorder : is-prop is-inhabited-chain-Preorder is-prop-is-inhabited-chain-Preorder = is-prop-type-Prop is-inhabited-prop-chain-Preorder
Inhabited chains in preorders
inhabited-chain-Preorder : {l1 l2 : Level} (l : Level) (X : Preorder l1 l2) → UU (l1 ⊔ l2 ⊔ lsuc l) inhabited-chain-Preorder l X = Σ (chain-Preorder l X) (is-inhabited-chain-Preorder X) module _ {l1 l2 l3 : Level} (X : Preorder l1 l2) (C : inhabited-chain-Preorder l3 X) where chain-inhabited-chain-Preorder : chain-Preorder l3 X chain-inhabited-chain-Preorder = pr1 C subpreorder-inhabited-chain-Preorder : Subpreorder l3 X subpreorder-inhabited-chain-Preorder = subpreorder-chain-Preorder X chain-inhabited-chain-Preorder is-chain-inhabited-chain-Preorder : is-chain-Subpreorder X subpreorder-inhabited-chain-Preorder is-chain-inhabited-chain-Preorder = is-chain-subpreorder-chain-Preorder X chain-inhabited-chain-Preorder is-inhabited-inhabited-chain-Preorder : is-inhabited-chain-Preorder X chain-inhabited-chain-Preorder is-inhabited-inhabited-chain-Preorder = pr2 C type-inhabited-chain-Preorder : UU (l1 ⊔ l3) type-inhabited-chain-Preorder = type-subtype subpreorder-inhabited-chain-Preorder inclusion-subpreorder-inhabited-chain-Preorder : type-inhabited-chain-Preorder → type-Preorder X inclusion-subpreorder-inhabited-chain-Preorder = inclusion-subtype subpreorder-inhabited-chain-Preorder module _ {l1 l2 l3 l4 : Level} (X : Preorder l1 l2) (C : inhabited-chain-Preorder l3 X) (D : inhabited-chain-Preorder l4 X) where inclusion-prop-inhabited-chain-Preorder : Prop (l1 ⊔ l3 ⊔ l4) inclusion-prop-inhabited-chain-Preorder = inclusion-prop-chain-Preorder X ( chain-inhabited-chain-Preorder X C) ( chain-inhabited-chain-Preorder X D) inclusion-inhabited-chain-Preorder : UU (l1 ⊔ l3 ⊔ l4) inclusion-inhabited-chain-Preorder = type-Prop inclusion-prop-inhabited-chain-Preorder is-prop-inclusion-inhabited-chain-Preorder : is-prop inclusion-inhabited-chain-Preorder is-prop-inclusion-inhabited-chain-Preorder = is-prop-type-Prop inclusion-prop-inhabited-chain-Preorder
Recent changes
- 2024-11-20. Fredrik Bakke. Two fixed point theorems (#1227).