Reference · Finite types, distributions and Markov chains
rainbow.math.finite.subtype
Finite propositions and finite-subtype bridges as checked proof data.
type/finite-proposition
type/finite-proposition : (P : Prop) → type/finite P
type/finite-of-subsingleton
type/finite-of-subsingleton.{l} :
(A : Sort l) (subsingleton : type/subsingleton A)
→ type/finite Asubtype/extensional
subtype/extensional.{u} :
(A : Type u) (source : set/Set A) (left right : data/Subtype A source)
(same-value : subtype/value A source left = subtype/value A source right)
→ left = right= = equality/Eq
set/finite-subtype-equivalence
set/finite-subtype-equivalence.{u} :
(A : Type u) (source : set/Set A)
→ proposition/conjunction (set/finite A source → type/finite (data/Subtype A source)) (type/finite (data/Subtype A source) → set/finite A source)set/finite-subtype-proposition-equality
set/finite-subtype-proposition-equality.{u} :
(A : Type u) (source : set/Set A)
→ set/finite A source = type/finite (data/Subtype A source)= = equality/Eq