Package relation-well-founded-thm: relation-well-founded-thm

Information

name	relation-well-founded-thm
version	1.0
description	relation-well-founded-thm
author	Joe Hurd <joe@gilith.com>
license	HOLLight
provenance	HOL Light theory extracted on 2011-02-19
show	Data.Bool

Files

Package tarball relation-well-founded-thm-1.0.tgz
Theory file relation-well-founded-thm.thy (included in the package tarball)

Theorems

⊦ Relation.wellFounded Number.Natural.<

⊦ ∀<< m.
Relation.wellFounded << ⇒ Relation.wellFounded (λx x'. << (m x) (m x'))

⊦ ∀<<.
Relation.wellFounded << ⇔ ¬∃s. ∀n. << (s (Number.Natural.suc n)) (s n)

⊦ ∀<< <<<.
(∀x y. << x y ⇒ <<< x y) ∧ Relation.wellFounded <<< ⇒
Relation.wellFounded <<

⊦ ∀<<.
Relation.wellFounded << ⇔ ∀P. (∀x. (∀y. << y x ⇒ P y) ⇒ P x) ⇒ ∀x. P x

⊦ ∀<<.
Relation.wellFounded << ⇔ ∀P. (∃x. P x) ⇔ ∃x. P x ∧ ∀y. << y x ⇒ ¬P y

⊦ ∀H.
(∀f g n. (∀m. Number.Natural.< m n ⇒ f m = g m) ⇒ H f n = H g n) ⇒
∃f. ∀n. f n = H f n

⊦ ∀<< <<<.
    Relation.wellFounded << ∧ Relation.wellFounded <<< ⇒
    Relation.wellFounded
      (λ(Data.Pair., x1 y1) (Data.Pair., x2 y2). << x1 x2 ∧ <<< y1 y2)

⊦ ∀<<.
    Relation.wellFounded << ⇒
    ∀H.
      (∀f g x. (∀z. << z x ⇒ f z = g z) ⇒ H f x = H g x) ⇒
      ∃f. ∀x. f x = H f x

⊦ ∀<<.
    Relation.wellFounded << ⇒
    ∀H.
      (∀f g x. (∀z. << z x ⇒ f z = g z) ⇒ H f x = H g x) ⇒
      ∃!f. ∀x. f x = H f x

⊦ ∀<<.
    (∀H.
       (∀f g x. (∀z. << z x ⇒ f z = g z) ⇒ H f x = H g x) ⇒
       ∃f. ∀x. f x = H f x) ⇒ Relation.wellFounded <<

⊦ ∀R S.
    Relation.wellFounded R ∧ Relation.wellFounded S ⇒
    Relation.wellFounded
      (λ(Data.Pair., r1 s1) (Data.Pair., r2 s2).
         R r1 r2 ∨ r1 = r2 ∧ S s1 s2)

⊦ ∀R S.
    Relation.wellFounded R ∧ (∀a. Relation.wellFounded (S a)) ⇒
    Relation.wellFounded
      (λ(Data.Pair., r1 s1) (Data.Pair., r2 s2).
         R r1 r2 ∨ r1 = r2 ∧ S r1 s1 s2)

⊦ ∀<<.
    Relation.wellFounded << ⇒
    ∀H S.
      (∀f g x.
         (∀z. << z x ⇒ f z = g z ∧ S z (f z)) ⇒
         H f x = H g x ∧ S x (H f x)) ⇒ ∃f. ∀x. f x = H f x

⊦ ∀<<.
    Relation.wellFounded << ⇒
    ∀H.
      (∀f g x. (∀z. << z x ⇒ f z = g z) ⇒ H f x = H g x) ⇒
      ∀f g. (∀x. f x = H f x) ∧ (∀x. g x = H g x) ⇒ f = g

⊦ ∀<<.
    (∀H.
       (∀f g x. (∀z. << z x ⇒ (f z ⇔ g z)) ⇒ (H f x ⇔ H g x)) ⇒
       ∀f g. (∀x. f x ⇔ H f x) ∧ (∀x. g x ⇔ H g x) ⇒ f = g) ⇒
    Relation.wellFounded <<

Input Type Operators

→
bool
Data
- Pair
  - Data.Pair.*
Number
- Natural
  - Number.Natural.natural

Input Constants

=
Data
- Bool
  - ∀
  - ∧
  - ⇒
  - ∃
  - ∃!
  - ∨
  - ¬
  - cond
  - select
  - F
  - T
- Pair
  - Data.Pair.,
Function
- Function.id
Number
- Natural
  - Number.Natural.<
  - Number.Natural.suc
- Numeral
  - Number.Numeral.zero
Relation
- Relation.wellFounded

Assumptions

⊦ T

⊦ F ⇔ ∀p. p

⊦ ∀x. Function.id x = x

⊦ (¬) = λp. p ⇒ F

⊦ (∃) = λP. P ((select) P)

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

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

⊦ (∀) = λP. P = λx. T

⊦ ∀x. x = x ⇔ T

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

⊦ ∀t. (t ⇔ T) ∨ (t ⇔ F)

⊦ ∀P x. P x ⇒ P ((select) P)

⊦ (¬T ⇔ F) ∧ (¬F ⇔ T)

⊦ ∀f y. (λx. f x) y = f y

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

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

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

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

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

⊦ ∀t1 t2. ¬(t1 ⇒ t2) ⇔ t1 ∧ ¬t2

⊦ ∀P. (∀p. P p) ⇔ ∀p1 p2. P (Data.Pair., p1 p2)

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

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

⊦ ∀PAIR'. ∃fn. ∀a0 a1. fn (Data.Pair., a0 a1) = PAIR' a0 a1

⊦ ∀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

⊦ ∀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

⊦ ∀t1 t2 t3. t1 ∧ t2 ∧ t3 ⇔ (t1 ∧ t2) ∧ t3

⊦ ∀t1 t2 t3. t1 ∨ t2 ∨ t3 ⇔ (t1 ∨ t2) ∨ t3

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

⊦ ∀t1 t2. (if T then t1 else t2) = t1 ∧ (if F then t1 else t2) = t2

⊦ ∀P.
P Number.Numeral.zero ∧ (∀n. P n ⇒ P (Number.Natural.suc n)) ⇒ ∀n. P n

⊦ (∀t. ¬¬t ⇔ t) ∧ (¬T ⇔ F) ∧ (¬F ⇔ T)

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

⊦ ∀P. (∀n. (∀m. Number.Natural.< 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

⊦ ∀e f.
    ∃fn.
      fn Number.Numeral.zero = e ∧
      ∀n. fn (Number.Natural.suc n) = f (fn n) n

⊦ ∀P. (∃n. P n) ⇔ ∃n. P n ∧ ∀m. Number.Natural.< m n ⇒ ¬P m

⊦ ∀A B C D. (A ⇒ B) ∧ (C ⇒ D) ⇒ A ∧ C ⇒ B ∧ D

⊦ ∀A B C D. (B ⇒ A) ∧ (C ⇒ D) ⇒ (A ⇒ C) ⇒ B ⇒ D

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

⊦ (∀m. Number.Natural.< m Number.Numeral.zero ⇔ F) ∧
  ∀m n.
    Number.Natural.< m (Number.Natural.suc n) ⇔
    m = n ∨ Number.Natural.< m n

⊦ ∀<<.
Relation.wellFounded << ⇔ ∀P. (∃x. P x) ⇒ ∃x. P x ∧ ∀y. << y x ⇒ ¬P y

⊦ ∀t1 t2. (¬(t1 ∧ t2) ⇔ ¬t1 ∨ ¬t2) ∧ (¬(t1 ∨ t2) ⇔ ¬t1 ∧ ¬t2)

⊦ ∀t. ((T ⇔ t) ⇔ t) ∧ ((t ⇔ T) ⇔ t) ∧ ((F ⇔ t) ⇔ ¬t) ∧ ((t ⇔ F) ⇔ ¬t)

⊦ ∀t. (T ∧ t ⇔ t) ∧ (t ∧ T ⇔ t) ∧ (F ∧ t ⇔ F) ∧ (t ∧ F ⇔ F) ∧ (t ∧ t ⇔ t)

⊦ ∀t. (T ∨ t ⇔ T) ∧ (t ∨ T ⇔ T) ∧ (F ∨ t ⇔ t) ∧ (t ∨ F ⇔ t) ∧ (t ∨ t ⇔ t)

⊦ ∀t. (T ⇒ t ⇔ t) ∧ (t ⇒ T ⇔ T) ∧ (F ⇒ t ⇔ T) ∧ (t ⇒ t ⇔ T) ∧ (t ⇒ F ⇔ ¬t)

⊦ ∀p q r.
(p ∨ q ⇔ q ∨ p) ∧ ((p ∨ q) ∨ r ⇔ p ∨ q ∨ r) ∧ (p ∨ q ∨ r ⇔ q ∨ p ∨ r) ∧
(p ∨ p ⇔ p) ∧ (p ∨ p ∨ q ⇔ p ∨ q)