[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
,
Theorem mult-03
⊦ 2 ≤ m ∧ 2 ≤ n → ¬ prime(m * n)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
prime-smallest
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
mult
,
Used spec theorems:
Used simplifier rules:
nat
/
not-zero
nat-mult
/
one
nat-mult
/
mult-a
nat-mult
/
mult-c