Iterated successors of truncation levels
Content created by Fredrik Bakke.
Created on 2025-08-30.
Last modified on 2026-09-09.
module foundation.iterated-successors-truncation-levels where open import foundation-core.iterated-successors-truncation-levels public
Imports
open import elementary-number-theory.addition-natural-numbers open import elementary-number-theory.natural-numbers open import foundation.action-on-identifications-functions open import foundation.truncation-levels open import foundation-core.identity-types
Properties
Coherence with addition on natural numbers
add+2-truncation-level-minus-one-ℕ : (k n : ℕ) → truncation-level-minus-one-ℕ (k +ℕ n) = add+2-𝕋 ( truncation-level-minus-one-ℕ k) ( truncation-level-minus-two-ℕ n) add+2-truncation-level-minus-one-ℕ k zero-ℕ = refl add+2-truncation-level-minus-one-ℕ k (succ-ℕ n) = ap succ-𝕋 (add+2-truncation-level-minus-one-ℕ k n)
Recent changes
- 2026-09-09. Fredrik Bakke. Strict inequality of cardinals (#2004).
- 2026-09-09. Fredrik Bakke. 𝑘-projective 𝑘-types are (𝑘 + 𝑛)-projective for all 𝑛 (#1846).
- 2025-08-30. Fredrik Bakke. Closure properties of π-finite types (#1311).