[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Proof step 12 from proof primes-rec (
previous step
)
prime(i), ∀ i. (∀ i0. i0 = i ∨ i0 ∈ ints0 → prime(i0)) → prime(i) ∧ (∀ i. i ∈ ints0 → prime(i)), ∀ i2. i2 = i0 ∨ i2 ∈ ints0 → prime(i2) ⊦ prime(i0)
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 3 terms: i0
Additional information
Used terms: i0