[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 13 from proof prime-def-mod (
previous step
)
1 < j, 0 < j, ∀ i. 1 < i ∧ i * i ≤ j → j % i ≠ 0 ⊦ 2 ≤ j ∧ (∀ i. 1 < i ∧ i < j → ¬ i | j)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 14
:
0 < j, 1 < j, ∀ i. 1 < i ∧ i * i ≤ j → j % i ≠ 0 ⊦ 2 ≤ j ∧ (1 < i ∧ i < j → ¬ i | j)
Rule argument
Additional information