Skip to content

Instantly share code, notes, and snippets.

@cppio
Created May 27, 2025 12:03
Show Gist options
  • Save cppio/ad76f0b014cc127cc3008d36409f6ea8 to your computer and use it in GitHub Desktop.
Save cppio/ad76f0b014cc127cc3008d36409f6ea8 to your computer and use it in GitHub Desktop.
Lean proof that higher universes don't embed into lower ones.
inductive Tree : Sort (max (u + 1) v)
| node {A : Sort u} (c : A → Tree)
theorem no_embedding
(Lower : Sort (max (u + 1) v) → Sort u)
(down : ∀ {α}, α → Lower α)
(up : ∀ {α}, Lower α → α)
(up_down : ∀ {α} (x : α), x = up (down x))
: False := by
induction h : Tree.node up
case node ih =>
cases h
exact ih _ (up_down _)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment