Commit 2026-02-13 04:47 c5134ef9

View on Github →

chore: use @[to_dual] in Bounds.Basic (#35208) This PR adds @[to_dual] name dictionary entries for atom/coatom and lfp/gfp, and uses @[to_dual] to auto-generate dual theorems in Order.Bounds.Basic, deleting the hand-written versions. 27 @[to_dual] annotations total, deleting 27 hand-written duals. Remaining pairs not converted:

  • bddAbove_insert/bddBelow_insert — needs directed/codirected dictionary entry, which causes problems elsewhere
  • IsLUB.exists_between/IsGLB.exists_between@[to_dual] swaps the And conjuncts
  • Bounded interval theorems (Icc, Ico, etc.) — arguments swap under duality
  • DenselyOrdered interval theorems — dual proofs need simpa [Ioo_toDual]
  • isGreatest_himp/isLeast_sdiff — needs himp/sdiff dictionary entry 🤖 Prepared with Claude Code

Estimated changes

deleted theorem IsGLB.nonempty
deleted theorem IsGLB.prod
deleted theorem IsGLB.unique
deleted theorem IsGreatest.unique
deleted theorem OrderBot.lowerBounds_univ
deleted theorem bddAbove_iff_subset_Iic
deleted theorem bddBelow_empty
deleted theorem bddBelow_insert
modified theorem isGLB_empty_iff
deleted theorem isGLB_lt_iff
deleted theorem isGLB_pair
deleted theorem isGLB_univ
deleted theorem isGLB_upperBounds
modified theorem isGreatest_univ_iff
deleted theorem isLUB_empty
deleted theorem isLUB_empty_iff
deleted theorem isLeast_pair
deleted theorem isLeast_univ
deleted theorem isLeast_univ_iff
deleted theorem lowerBounds_empty
deleted theorem lowerBounds_insert
deleted theorem lowerBounds_prod
deleted theorem lt_isGLB_iff
deleted theorem nonempty_of_not_bddBelow
deleted theorem not_bddBelow_univ
modified theorem upperBounds_prod