The elimination command performs proof steps
that break up whole antecedent or consequent logical predicates
into smaller antecedents and consequents.
Those that generate a single sub-goal are as follows.
| p ? | | ? p |
| e ? | | ? e |
? p | | | p ? |
? e | | | e ? |
| p1 p2 ? | | | p1, p2 ? |
| e1 e2 ? | | | e1, e2 ? |
? p1 p2 | | ? p1, p2 |
? e1 e2 | | ? e1, e2 |
? p1 p2 | | | p1 ? p2 |
? e1 e2 | | | e1 ? e2 |
? ds | p1 p2 | | ds | p1 ? p2 |
| ds | p1 p2 ? | | ds | p1, p2 ? |
Those that generate two separate sub-goals are as follows.
Tactic example
"elimination" p3 p4
This example applies the elimination command
to predicates p3 and p4.
IT 27-Sep-1999