This is a follow-up to
How to write a low-level proof in Isar?
Having
lemma por_qandr_imp_porq: assumes "p ∨ (q ∧ r)" shows "p ∨ q"
proof -
note assms
moreover
have "p ⟹ p ∨ q"
by (rule p_imp_porq)
moreover
have "q ∧ r ⟹ p ∨ q"
by (rule qandr_imp_porq)
ultimately
show ?thesis
by (rule disjE[of p "q∧r" "p∨q"])
qed
if I point the cursor after ultimately
, Isabelle/JEdit's Output window shows
proof (chain)
picking this:
p ∨ q ∧ r
p ⟹ p ∨ q
q ∧ r ⟹ p ∨ q
calculation:
p ∨ q ∧ r
p ⟹ p ∨ q
q ∧ r ⟹ p ∨ q
where calculation is in grey background. The contents of the picking this
and the calculation
parts are identical, but what is the difference between the two in their meaning?