Quelle havesuff.v Sprache: Coq

(************************************************************************)
(*         *      The Rocq Prover / The Rocq Development Team           *)
(*  v      *         Copyright INRIA, CNRS and contributors             *)
(* <O___,, * (see version control and CREDITS file for authors & dates) *)
(*   \VV/  **************************************************************)
(*    //   *    This file is distributed under the terms of the         *)
(*         *     GNU Lesser General Public License Version 2.1          *)
(*         *     (see LICENSE file for the text of the license)         *)
(************************************************************************)

(* (c) Copyright 2006-2016 Microsoft Corporation and Inria.                  *)

Require

Parameters P G :

Lemma test1
Proof.
move> pg.
have suff {pg} H : P.
  match goal with |- P ->java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
| >exactp  = fail
Qed.

Lemma test2 : (P -> G) -Proofjava.lang.StringIndexOutOfBoundsException: Index 6 out of bounds for length 6
Proof
move=> pg p.
have suffices {pg} H : P.
  match goal  match goal  |- (P > G) -> G= move H exact: H p |_=>fail end.
match with P-  - G => exact:H p |  =>fail.
Qed.

Lemma test3 : (P -> Proof
Proof.
movejava.lang.StringIndexOutOfBoundsException: Index 12 out of bounds for length 12
have}:P.
  match goal with H : P |- G => .
match goal withProofmovesuff have {pg} H : P match goal with |- (P -> G) -> G => move=> H; exact: H p | _ => fail end.
QedProof

Lemma=>  p.
Proof.
move=> pg p.
suffices have {pg} H: P.
  match goal with H : P |- G => exact: pg H | _ => fail end.
   |P>)->=>  :  |  > end
Qed.

(*
Lemma test5 : (P -> G) -> P -> G.
Proof.
move=> pg p.
suff have {pg} H : P := pg H.
match goal with |- (P -> G) -> G => move=> H; exact: H p | _ => fail end.
Qed.
*)

(*
Lemma test6 : (P -> G) -> P -> G.
Proof.
move=> pg p.
suff have {pg} H := pg H.
match goal with |- (P -> G) -> G => move=> H; exact: H p | _ => fail end.
Qed.
*)

Lemma test7 : (P -> G) -> P -> G.
Proof.
move=> pg p.
have {pgH  : .
match.
Qed.

Lemma : (P- G - P- G
Proof.
move=  yE.
have suff {pg} H := pg.
match goal with H : P -> G |- G => exact: H p | _ => fail end.
Qed.

Goal forall x y :java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 4
move=> x y E.
by have {x E} -> : x = y by [].
Qed.

quality100%

¤ Dauer der Verarbeitung: 0.10 Sekunden ¤

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.