• Top
  • Documentation
  • Books
  • Recursion-and-induction
  • Boolean-reasoning
  • Debugging
  • Projects
    • Apt
    • Acre
    • Milawa
    • Smtlink
    • Abnf
    • Vwsim
    • Isar
    • Wp-gen
    • Dimacs-reader
    • Legacy-defrstobj
    • Prime-field-constraint-systems
    • Proof-checker-array
    • Soft
    • Farray
    • Rp-rewriter
    • Instant-runoff-voting
    • Imp-language
    • Sidekick
    • Leftist-trees
      • Leftist-tree-sort
      • Leftist-tree-fns
      • Leftist-tree-thms
        • Leftist-tree-misc-thms
        • Leftist-tree-structure-thms
          • Proper-merge-lt
          • Proper-insert-lt
          • Proper-delete-min-lt
          • Proper-build-lt
        • Leftist-tree-rank-thms
      • How-many-lt
      • Ltree-sort
    • Taspi
    • Bitcoin
    • Des
    • Ethereum
    • Sha-2
    • Yul
    • Zcash
    • Proof-checker-itp13
    • Bigmem
    • Regex
    • ACL2-programming-language
    • Java
    • C
    • Jfkr
    • X86isa
    • Equational
    • Cryptography
    • Where-do-i-place-my-book
    • Json
    • Built-ins
    • Execloader
    • Solidity
    • Paco
    • Concurrent-programs
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Testing-utilities
  • Math

• Leftist-tree-thms

Leftist-tree-structure-thms

Theorems proving that the basic operations respect PROPER-LT

Subtopics

Proper-merge-lt

Proper-insert-lt

Proper-delete-min-lt

Proper-build-lt