Complements of elements of discrete types
Content created by Egbert Rijke and Louis Wasserman.
Created on 2026-05-05.
Last modified on 2026-05-05.
module foundation.complements-elements-discrete-types where
Imports
open import foundation.dependent-pair-types open import foundation.discrete-types open import foundation.identity-types open import foundation.negated-equality open import foundation.negation open import foundation.propositions open import foundation.subtypes open import foundation.universe-levels
Idea
Consider an element a in a discrete type A.
The
complement¶
is the type
{x : A ∣ a ≠ x}.
Definitions
The complement of an element
module _ {l1 : Level} (A : Discrete-Type l1) (a : type-Discrete-Type A) where is-in-complement-element-Discrete-Type : type-Discrete-Type A → UU l1 is-in-complement-element-Discrete-Type x = a ≠ x is-prop-is-in-complement-element-Discrete-Type : (x : type-Discrete-Type A) → is-prop (is-in-complement-element-Discrete-Type x) is-prop-is-in-complement-element-Discrete-Type x = is-prop-neg is-in-complement-element-prop-Discrete-Type : subtype l1 (type-Discrete-Type A) pr1 (is-in-complement-element-prop-Discrete-Type x) = is-in-complement-element-Discrete-Type x pr2 (is-in-complement-element-prop-Discrete-Type x) = is-prop-is-in-complement-element-Discrete-Type x complement-element-Discrete-Type : UU l1 complement-element-Discrete-Type = type-subtype is-in-complement-element-prop-Discrete-Type
Recent changes
- 2026-05-05. Louis Wasserman and Egbert Rijke. The type of permutations on n elements is finite with cardinality n! (#1936).