Package relation-natural-thm: Properties of relations over natural numbers

Information

name	relation-natural-thm
version	1.20
description	Properties of relations over natural numbers
author	Joe Hurd <joe@gilith.com>
license	HOLLight
provenance	HOL Light theory extracted on 2012-04-05
requires	bool function natural relation-def relation-natural-def relation-thm relation-well-founded set
show	Data.Bool Function Number.Natural Relation

Files

Package tarball relation-natural-thm-1.20.tgz
Theory file relation-natural-thm.thy (included in the package tarball)

Theorems

⊦ irreflexive isSuc

⊦ transitive (<)

⊦ wellFounded (<)

⊦ wellFounded isSuc

⊦ subrelation isSuc (<)

⊦ transitiveClosure isSuc = (<)

⊦ ∀m. wellFounded (measure m)

⊦ ∀r. subrelation isSuc r ∧ transitive r ⇒ subrelation (<) r

⊦ ∀r. wellFounded r ⇔ ¬∃f. ∀n. r (f (suc n)) (f n)

⊦ ∀p g h. ∃f. ∀x. f x = if p x then f (g x) else h x

⊦ ∀m a b. (∀y. measure m y a ⇒ measure m y b) ⇔ m a ≤ m b

⊦ ∀r.
    wellFounded r ⇒
    ∀h.
      (∀f g x. (∀z. r z x ⇒ f z = g z) ⇒ h f x = h g x) ⇒
      ∃!f. ∀x. f x = h f x

⊦ ∀r.
(∀x. ¬r x x) ∧ (∀x y z. r x y ∧ r y z ⇒ r x z) ∧
(∀x. Set.finite { y. y | r y x }) ⇒ wellFounded r

Input Type Operators

→
bool
Number
- Natural
  - natural
Set
- Set.set

Input Constants

=
select
Data
- Bool
  - ∀
  - ∧
  - ⇒
  - ∃
  - ∃!
  - ∨
  - ¬
  - cond
  - ⊥
  - ⊤
Function
- id
Number
- Natural
  - +
  - <
  - ≤
  - isSuc
  - suc
  - zero
Relation
- bigIntersect
- irreflexive
- measure
- subrelation
- transitive
- transitiveClosure
- wellFounded
Set
- Set.finite
- Set.fromPredicate
- Set.image
- Set.infinite
- Set.insert
- Set.∈
- Set.⊆
- Set.universe

Assumptions

⊦ ⊤

⊦ Set.infinite Set.universe

⊦ ¬⊥ ⇔ ⊤

⊦ ¬⊤ ⇔ ⊥

⊦ ∀x. Set.∈ x Set.universe

⊦ ∀t. t ⇒ t

⊦ ⊥ ⇔ ∀p. p

⊦ ∀x. id x = x

⊦ ∀t. t ∨ ¬t

⊦ ∀n. ¬(n < n)

⊦ ∀n. 0 < suc n

⊦ ∀n. n < suc n

⊦ (¬) = λp. p ⇒ ⊥

⊦ ∀t. (∀x. t) ⇔ t

⊦ ∀t. (∃x. t) ⇔ t

⊦ ∀t. (λx. t x) = t

⊦ (∀) = λp. p = λx. ⊤

⊦ ∀t. ¬¬t ⇔ t

⊦ ∀t. (⊤ ⇔ t) ⇔ t

⊦ ∀t. ⊥ ∧ t ⇔ ⊥

⊦ ∀t. ⊤ ∧ t ⇔ t

⊦ ∀t. t ∧ ⊥ ⇔ ⊥

⊦ ∀t. t ∧ ⊤ ⇔ t

⊦ ∀t. ⊥ ⇒ t ⇔ ⊤

⊦ ∀t. ⊤ ⇒ t ⇔ t

⊦ ∀t. t ⇒ ⊤ ⇔ ⊤

⊦ ∀t. ⊥ ∨ t ⇔ t

⊦ ∀t. ⊤ ∨ t ⇔ ⊤

⊦ ∀t. t ∨ ⊥ ⇔ t

⊦ ∀t. t ∨ ⊤ ⇔ ⊤

⊦ ∀m. m < 0 ⇔ ⊥

⊦ ∀m. m + 0 = m

⊦ ∀r. wellFounded r ⇒ irreflexive r

⊦ ∀t. (⊥ ⇔ t) ⇔ ¬t

⊦ ∀t. (t ⇔ ⊥) ⇔ ¬t

⊦ ∀t. t ⇒ ⊥ ⇔ ¬t

⊦ ∀s. Set.infinite s ⇔ ¬Set.finite s

⊦ (⇒) = λp q. p ∧ q ⇔ p

⊦ ∀t. (t ⇔ ⊤) ∨ (t ⇔ ⊥)

⊦ ∀t₁ t₂. (if ⊥ then t₁ else t₂) = t₂

⊦ ∀t₁ t₂. (if ⊤ then t₁ else t₂) = t₁

⊦ ∀f y. (let x ← y in f x) = f y

⊦ ∀x y. x = y ⇔ y = x

⊦ ∀t₁ t₂. t₁ ∧ t₂ ⇔ t₂ ∧ t₁

⊦ ∀t₁ t₂. t₁ ∨ t₂ ⇔ t₂ ∨ t₁

⊦ ∀s x. Set.finite (Set.insert x s) ⇔ Set.finite s

⊦ ∀m n. isSuc m n ⇔ suc m = n

⊦ ∀m n. ¬(m ≤ n) ⇔ n < m

⊦ ∀m. m = 0 ∨ ∃n. m = suc n

⊦ (∧) = λp q. (λf. f p q) = λf. f ⊤ ⊤

⊦ ∀p. ¬(∀x. p x) ⇔ ∃x. ¬p x

⊦ ∀p. ¬(∃x. p x) ⇔ ∀x. ¬p x

⊦ (∃) = λp. ∀q. (∀x. p x ⇒ q) ⇒ q

⊦ ∀t₁ t₂. ¬(t₁ ⇒ t₂) ⇔ t₁ ∧ ¬t₂

⊦ ∀m n. m + suc n = suc (m + n)

⊦ ∀m n. suc m < suc n ⇔ m < n

⊦ ∀s t. Set.finite t ∧ Set.⊆ s t ⇒ Set.finite s

⊦ ∀r s. subrelation r s ∧ wellFounded s ⇒ wellFounded r

⊦ ∀t₁ t₂. ¬(t₁ ∧ t₂) ⇔ ¬t₁ ∨ ¬t₂

⊦ ∀r m. wellFounded r ⇒ wellFounded (λx y. r (m x) (m y))

⊦ ∀f g. (∀x. f x = g x) ⇔ f = g

⊦ (∨) = λp q. ∀r. (p ⇒ r) ⇒ (q ⇒ r) ⇒ r

⊦ ∀m n. m < n ∨ n < m ∨ m = n

⊦ ∀r s.
subrelation r s ∧ transitive s ⇒ subrelation (transitiveClosure r) s

⊦ ∀r s. subrelation r s ∧ subrelation s r ⇒ r = s

⊦ ∀m n. m < n ⇔ ∃d. n = m + suc d

⊦ ∀m x y. measure m x y ⇔ m x < m y

⊦ ∀p q. (∀x. p ∨ q x) ⇔ p ∨ ∀x. q x

⊦ ∀p q. (∃x. p ∧ q x) ⇔ p ∧ ∃x. q x

⊦ ∀p q. p ∧ (∀x. q x) ⇔ ∀x. p ∧ q x

⊦ ∀p q. p ∧ (∃x. q x) ⇔ ∃x. p ∧ q x

⊦ ∀p q. p ∨ (∀x. q x) ⇔ ∀x. p ∨ q x

⊦ ∀p q. p ∨ (∃x. q x) ⇔ ∃x. p ∨ q x

⊦ ∀m n. m < suc n ⇔ m = n ∨ m < n

⊦ ∀p q. (∀x. p x) ∧ q ⇔ ∀x. p x ∧ q

⊦ ∀p q. (∃x. p x) ∧ q ⇔ ∃x. p x ∧ q

⊦ ∀p q. (∃x. p x) ⇒ q ⇔ ∀x. p x ⇒ q

⊦ ∀p q. (∀x. p x) ∨ q ⇔ ∀x. p x ∨ q

⊦ ∀p q. (∃x. p x) ∨ q ⇔ ∃x. p x ∨ q

⊦ ∀t₁ t₂ t₃. (t₁ ∧ t₂) ∧ t₃ ⇔ t₁ ∧ t₂ ∧ t₃

⊦ ∀t₁ t₂ t₃. (t₁ ∨ t₂) ∨ t₃ ⇔ t₁ ∨ t₂ ∨ t₃

⊦ ∀m n p. m < n ∧ n < p ⇒ m < p

⊦ ∀m n p. m < n ∧ n ≤ p ⇒ m < p

⊦ ∀s t. Set.⊆ s t ⇔ ∀x. Set.∈ x s ⇒ Set.∈ x t

⊦ ∀p x. (∀y. p y ⇔ y = x) ⇒ (select) p = x

⊦ ∀p. (∀x. ∃y. p x y) ⇔ ∃y. ∀x. p x (y x)

⊦ ∀p. p 0 ∧ (∀n. p n ⇒ p (suc n)) ⇒ ∀n. p n

⊦ ∀r s. subrelation r (bigIntersect s) ⇔ ∀t. Set.∈ t s ⇒ subrelation r t

⊦ ∀p x. Set.∈ x { y. y | p y } ⇔ p x

⊦ ∀r s. subrelation r s ⇔ ∀x y. r x y ⇒ s x y

⊦ ∀x y s. Set.∈ x (Set.insert y s) ⇔ x = y ∨ Set.∈ x s

⊦ (∃!) = λp. (∃) p ∧ ∀x y. p x ∧ p y ⇒ x = y

⊦ ∀P. (∀n. (∀m. m < n ⇒ P m) ⇒ P n) ⇒ ∀n. P n

⊦ ∀p q. (∀x. p x ∧ q x) ⇔ (∀x. p x) ∧ ∀x. q x

⊦ ∀p q. (∃x. p x ∨ q x) ⇔ (∃x. p x) ∨ ∃x. q x

⊦ ∀p q. (∀x. p x ⇒ q x) ⇒ (∀x. p x) ⇒ ∀x. q x

⊦ ∀p q. (∀x. p x ⇒ q x) ⇒ (∃x. p x) ⇒ ∃x. q x

⊦ ∀p q. (∃x. p x) ∨ (∃x. q x) ⇔ ∃x. p x ∨ q x

⊦ ∀r.
transitiveClosure r =
bigIntersect { s. s | subrelation r s ∧ transitive s }

⊦ ∀e f. ∃!fn. fn 0 = e ∧ ∀n. fn (suc n) = f (fn n) n

⊦ ∀r. transitive r ⇔ ∀x y z. r x y ∧ r y z ⇒ r x z

⊦ ∀p₁ p₂ q₁ q₂. (p₁ ⇒ p₂) ∧ (q₁ ⇒ q₂) ⇒ p₁ ∧ q₁ ⇒ p₂ ∧ q₂

⊦ ∀p₁ p₂ q₁ q₂. (p₂ ⇒ p₁) ∧ (q₁ ⇒ q₂) ⇒ (p₁ ⇒ q₁) ⇒ p₂ ⇒ q₂

⊦ ∀p c x y. p (if c then x else y) ⇔ (c ⇒ p x) ∧ (¬c ⇒ p y)

⊦ ∀r. wellFounded r ⇔ ∀p. (∀x. (∀y. r y x ⇒ p y) ⇒ p x) ⇒ ∀x. p x

⊦ ∀f s.
(∀x y. f x = f y ⇒ x = y) ∧ Set.infinite s ⇒
Set.infinite (Set.image f s)

⊦ ∀p f s. (∀y. Set.∈ y (Set.image f s) ⇒ p y) ⇔ ∀x. Set.∈ x s ⇒ p (f x)

⊦ ∀r. wellFounded r ⇔ ∀p. (∃x. p x) ⇒ ∃x. p x ∧ ∀y. r y x ⇒ ¬p y