MATCH_MP : (thm -> thm -> thm)
Variables free in the consequent but not the antecedent of the first argument
theorem will be replaced by variants if this is necessary to maintain the full
generality of the theorem, and any which were universally quantified over in
the first argument theorem will be universally quantified over in the result,
and in the same order.
A1 |- !x1..xn. t1 ==> t2 A2 |- t1'
-------------------------------------- MATCH_MP
A1 u A2 |- !xa..xk. t2'
#let ith = # (GENL ["x:num"; "z:num"] o DISCH_ALL o AP_TERM "$+ (w + z)") # (ASSUME "x:num = y");; ith = |- !x z. (x = y) ==> ((w + z) + x = (w + z) + y) #let th = ASSUME "w:num = z";; th = w = z |- w = z #MATCH_MP5 ith th;; w = z |- !z'. (w' + z') + w = (w' + z') + z