人工智能数学验证工具LEAN4【入门介绍8】小于等于世界-证明＜=是自然数的一个全序

视频链接：人工智能数学验证工具LEAN4【入门介绍8】小于等于世界-证明<=是自然数的一个全序_哔哩哔哩_bilibili

import Game.Levels.LessOrEqual.L10le_one
World "LessOrEqual"
Level 11
Title "le_two"

namespace MyNat

TheoremTab "012"

/-- `le_two x` is a proof that if `x ≤ 2` then `x = 0` or `x = 1` or `x = 2`. -/
TheoremDoc MyNat.le_two as "le_two" in "≤"

Introduction "
We'll need this lemma to prove that two is prime!

You'll need to know that `∨` is right associative. This means that
`x = 0 ∨ x = 1 ∨ x = 2` actually means `x = 0 ∨ (x = 1 ∨ x = 2)`.
This affects how `left` and `right` work.
"

/-- If $x \leq 2$ then $x = 0$ or $1$ or $2$. -/
Statement le_two (x : ℕ) (hx : x ≤ 2) : x = 0 ∨ x = 1 ∨ x = 2 := by
  cases x with y
  left
  rfl
  cases y with z
  right
  left
  rw [one_eq_succ_zero]
  rfl
  rw [two_eq_succ_one, one_eq_succ_zero] at hx ⊢
  apply succ_le_succ at hx
  apply succ_le_succ at hx
  apply le_zero at hx
  rw [hx]
  right
  right
  rfl

Conclusion "
Nice!

The next step in the development of order theory is to develop
the theory of the interplay between `≤` and multiplication.
If you've already done Multiplication World, you're now ready for
Advanced Multiplication World. Click on \"Leave World\" to access it.
"