[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 5 from proof ex-two (
previous step
)
2 * m0 = m ∨ 2 * m0 + 1 = m ⊦ ∃ n. m = 2 * n, ∃ n. m = 2 * n + 1
User applied rule case distinction
And obtained the following new goals
Proof step 6
:
2 * m0 = m ⊦ ∃ n. m = 2 * n, ∃ n. m = 2 * n + 1
Proof step 8
:
2 * m0 + 1 = m ⊦ ∃ n. m = 2 * n, ∃ n. m = 2 * n + 1
Rule argument
pos: left 1
Additional information