Entry Value
Name natural-prime_59
Conclusion (!n i. inc_counters_sieve n i [] = T,[n,0,0]) /\ (!n i p k j ps. inc_counters_sieve n i (CONS (p,k,j) ps) = (let k' = (k + i) MOD p in let j' = j + i in if k' = 0 then F,CONS (p,0,j') ps else let b,ps' = inc_counters_sieve n j' ps in b,CONS (p,k',0) ps'))
Constructive Proof No
Axiom 
!t. t \/ ~t 
(\a. a = (\b. (\c. c) = (\c. c))) (\d. (\e. d e) = d) 
(\a. a = (\b. (\c. c) = (\c. c)))
(\d. (\e. e = (\f. (\c. c) = (\c. c)))
     (\g. (\h i.
               (\j k.
                    (\l. l j k) =
                    (\m. m ((\c. c) = (\c. c)) ((\c. c) = (\c. c))))
               h
               i <=>
               h)
          (d g)
          (d ((@) d))))
Classical Lemmas
  • !a b a' b'. a,b = a',b' <=> a = a' /\ b = b'
  • !a b. FST (a,b) = a
  • !a b. SND (a,b) = b
  • !t1 t2. ~(t1 /\ t2) <=> ~t1 \/ ~t2
  • !t1 t2. ~(t1 ==> t2) <=> t1 /\ ~t2
  • !t1 t2. ~(t1 \/ t2) <=> ~t1 /\ ~t2
  • !t. ~ ~t <=> t
  • !t. (t <=> T) \/ (t <=> F)
  • !p q. (!x. p x \/ q) <=> (!x. p x) \/ q
  • !p q. (!x. p x) \/ q <=> (!x. p x \/ q)
  • !p. (?x. ~p x) <=> ~(!x. p x)
  • !p. ~(!x. p x) <=> (?x. ~p x)
  • !p. ~(?x. p x) <=> (!x. ~p x)
  • !f. ?fn. !a b. fn (a,b) = f a b
  • (!n i. inc_counters_sieve n i [] = T,[n,0,0]) /\ (!n i p k j ps. inc_counters_sieve n i (CONS (p,k,j) ps) = (let k' = (k + i) MOD p in let j' = j + i in if k' = 0 then F,CONS (p,0,j') ps else let b,ps' = inc_counters_sieve n j' ps in b,CONS (p,k',0) ps'))
    		•
    Constructive Lemmas
  • T
  • !x y. x = y <=> y = x
  • !x y. x = y ==> y = x
  • !a b a' b'. a,b = a',b' <=> a = a' /\ b = b'
  • !a b. FST (a,b) = a
  • !a b. SND (a,b) = b
  • !x. x = x
  • !x. (@y. y = x) = x
  • !t1 t2 t3. (t1 /\ t2) /\ t3 <=> t1 /\ t2 /\ t3
  • !t1 t2 t3. (t1 \/ t2) \/ t3 <=> t1 \/ t2 \/ t3
  • !t1 t2. ~(t1 /\ t2) <=> ~t1 \/ ~t2
  • !t1 t2. ~(t1 ==> t2) <=> t1 /\ ~t2
  • !t1 t2. ~(t1 \/ t2) <=> ~t1 /\ ~t2
  • !t1 t2. t1 \/ t2 <=> t2 \/ t1
  • !p q. p /\ (?x. q x) <=> (?x. p /\ q x)
  • !t. (!x. t) <=> t
  • !t. ~ ~t <=> t
  • !t. F /\ t <=> F
  • !t. T /\ t <=> t
  • !t. t /\ F <=> F
  • !t. t /\ T <=> t
  • !t. t /\ t <=> t
  • !t. (F <=> t) <=> ~t
  • !t. (T <=> t) <=> t
  • !t. (t <=> F) <=> ~t
  • !t. (t <=> T) <=> t
  • !t. F ==> t <=> T
  • !t. T ==> t <=> t
  • !t. t ==> F <=> ~t
  • !t. t ==> T <=> T
  • !t. F \/ t <=> t
  • !t. T \/ t <=> T
  • !t. t \/ F <=> t
  • !t. t \/ T <=> T
  • !t. t \/ t <=> t
  • !t. t ==> t
  • !t. (t <=> T) \/ (t <=> F)
  • !f y. (\x. f x) y = f y
  • !f g. (!x. f x = g x) <=> f = g
  • !f g. (!x. f x = g x) ==> f = g
  • !t. (\x. t x) = t
  • !p x. (!y. p y <=> y = x) ==> (@) p = x
  • !p x. p x ==> p ((@) p)
  • !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)
  • !p q. (!x. p x /\ q x) <=> (!x. p x) /\ (!x. q x)
  • !p. (?x. ~p x) <=> ~(!x. p x)
  • !p. ~(!x. p x) <=> (?x. ~p x)
  • !p. ~(?x. p x) <=> (!x. ~p x)
  • !f. ?fn. !a b. fn (a,b) = f a b
  • !r. (!x. ?y. r x y) <=> (?f. !x. r x (f x))
  • (!n i. inc_counters_sieve n i [] = T,[n,0,0]) /\ (!n i p k j ps. inc_counters_sieve n i (CONS (p,k,j) ps) = (let k' = (k + i) MOD p in let j' = j + i in if k' = 0 then F,CONS (p,0,j') ps else let b,ps' = inc_counters_sieve n j' ps in b,CONS (p,k',0) ps'))
  • F <=> (!p. p)
  • T <=> (\p. p) = (\p. p)
  • ~F <=> T
  • ~T <=> F
  • LET_END = (\t. t)
  • (~) = (\p. p ==> F)
  • (/\) = (\p q. (\f. f p q) = (\f. f T T))
  • (==>) = (\p q. p /\ q <=> p)
  • (\/) = (\p q. !r. (p ==> r) ==> (q ==> r) ==> r)
  • LET = (\f. f)
  • (!) = (\p. p = (\x. T))
  • (?) = (\p. !q. (!x. p x ==> q) ==> q)
  • (?) = (\p. p ((@) p))
  • (?!) = (\p. (?) p /\ (!x y. p x /\ p y ==> x = y))
  • NUMERAL = (\n. n)
    		•
    Contained Package natural-prime
    Comment Natural-prime package from OpenTheory.
    Back to main package pageBack to contained package page