Dubuc-Penon compact types

Content created by Fredrik Bakke, Jonathan Prieto-Cubides and Egbert Rijke.

Created on 2022-04-09.
Last modified on 2023-06-08.

module foundation.dubuc-penon-compact-types where
Imports 
open import foundation.disjunction
open import foundation.universe-levels

open import foundation-core.propositions
open import foundation-core.subtypes

Idea

A type is said to be Dubuc-Penon compact if for every proposition P and every subtype Q of X such that P ∨ Q x holds for all x, then either P is true or Q contains every element of X.

Definition

is-dubuc-penon-compact-Prop :
  {l : Level} (l1 l2 : Level) → UU l → Prop (l ⊔ lsuc l1 ⊔ lsuc l2)
is-dubuc-penon-compact-Prop l1 l2 X =
  Π-Prop
    ( Prop l1)
    ( λ P →
      Π-Prop
        ( subtype l2 X)
        ( λ Q →
          function-Prop
            ( (x : X) → type-disj-Prop P (Q x))
            ( disj-Prop P (Π-Prop X Q))))

is-dubuc-penon-compact :
  {l : Level} (l1 l2 : Level) → UU l → UU (l ⊔ lsuc l1 ⊔ lsuc l2)
is-dubuc-penon-compact l1 l2 X = type-Prop (is-dubuc-penon-compact-Prop l1 l2 X)

Recent changes