[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 gcd-partial
n = N, m = M ⊦ [: N, M | (N' = N'' ∧ M' = M''), true, true, GCD(; N, M)] (N = M ∧ N = gcd(n, m))
Type: A user defined theorem
Validity: The proof is valid.
Features: tl,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 18
Proof steps: 32
Used lemmas:
rely
,
inv
,
gcd-loop-partial
,
Used spec theorems:
RG2-Theory
/instance/
RG2-Sound
RG2-Theory
/instance/
RG-restr-def
Used simplifier rules:
nat-prime
/
gcd-sym-eq
nat
/
ler
nat
/
fle
nat
/
fle-01
nat
/
let
nat
/
le-ls-simp
nat
/
lels-02
nat-basic1
/
lf
nat-basic1
/
trans-1
nat-basic2
/
succ
nat-prime
/
gcd-id
nat-basic1
/
ref-1
nat-basic1
/
f
nat-basic1
/
lf-01
nat-basic1
/
lf-02
nat
/
lels-01