[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 product-prime-divides
⊦ prime(i) → (i | Π ints ↔ (∃ j. j ∈ ints ∧ i | j))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
all_prime_divisors-product-del
,
Used by units in proved state:
int-fac
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 9
Used lemmas:
product-one
,
product-app
,
prod-empty
,
Used spec theorems:
int-gcd
/
prime-divides
Used simplifier rules:
int-gcd
/
prime-divides-one
list
/intlista/
in-empty
list
/intlista/
in-17
list
/intlista/
in-append
list
/intlista/
a
list
/intlista/
c