![]() |
by
![]() |
![]() |
|
![]() |
|
![]() |
![]() |
|
![]() |
The justification takes the variables and labels of
plus some
parameters
and generates the k subgoals
.
The hypothesis rule generates no subgoals and so terminates a branch of
the proof tree. Such rules are thus found at the leaves.
By putting into the justifications still more information, we can
reveal all the links between a goal and its subgoals. To illustrate
this information, consider the
L rule and the
L
rule.
![]() |
![]() |
![]() |
![]() |
![]() |
If the
R justification provided the label y, then all the
information for generating the subgoal would be present. If the &L rule
provided the labels p, q then the data is present for generating its subgoals
as well. So we will add this information to form a complete
justificationcomplete justification.
Notice that these labels behave like the variable names xi in the sense that we can systematically rename them without changing the meaning of a sequent or a justification. They act like bound variables in the sequent. The phrase new u, v in a justification allows us to explicitly name these bound variables.