Question: ( * * Create an inductive relation that holds if , and only if , element ' x ' appears before element ' y '

(**
Create an inductive relation that holds if, and only if, element 'x'
appears before element 'y' in the given list.
We can define `succ` inductively as follows:
(x, y) succ l
-----------------------R1------------------R2
(x, y) succ x :: y :: l (x, y) succ z :: l
Rule R1 says that x succeeds y in the list that starts with [x, y].
Rule R2 says that if x succeeds y in list l then x succeeds y in a list
the list that results from adding z to list l.
*)
Inductive succ {X : Type}(x:X)(y:X): list X -> Prop :=
| succ_here : forall l, succ x y (x :: y :: l)
| succ_later : forall z l, succ x y l -> succ x y (z :: l).
Theorem succ3:
(* Only one of the following propositions is provable.
Replace 'False' by the only provable proposition and then prove it:
1) succ 24[1;2;3;4]
2) ~ succ 24[1;2;3;4]
*)
~ succ 24[1;2;3;4].
Proof.
Qed.
please prove this.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!