tactics.v 1.35 KiB
From stdpp Require Import tactics.
Goal forall P1 P2 P3 P4 (P: Prop),
P1 ∨ (Is_true (P2 || P3)) ∨ P4 →
(P1 → P) →
(P2 → P) →
(P3 → P) →
(P4 → P) →
P.
Proof.
intros * HH X1 X2 X3 X4.
destruct_or? HH; [ exact (X1 HH) | exact (X2 HH) | exact (X3 HH) | exact (X4 HH) ].
Qed.
Goal forall P1 P2 P3 P4 (P: Prop),
P1 ∨ P2 →
P3 ∨ P4 →
(P1 → P3 → P) →
(P1 → P4 → P) →
(P2 → P3 → P) →
(P2 → P4 → P) →
P.
Proof.
intros * HH1 HH2 X1 X2 X3 X4.
destruct_or?; [ exact (X1 HH1 HH2) | exact (X3 HH1 HH2) | exact (X2 HH1 HH2) | exact (X4 HH1 HH2) ].
Qed.
Goal forall P1 P2 P3 P4 (P: Prop),
id (P1 ∨ P2) →
id (P3 ∨ P4) →
(P1 → P3 → P) →
(P1 → P4 → P) →
(P2 → P3 → P) →
(P2 → P4 → P) →
P.
Proof.
intros * HH1 HH2 X1 X2 X3 X4.
Fail progress destruct_or?.
Fail progress destruct_or!.
destruct_or! HH1; destruct_or! HH2;
[ exact (X1 HH1 HH2) | exact (X2 HH1 HH2) | exact (X3 HH1 HH2) | exact (X4 HH1 HH2) ].
Qed.
Goal forall P1 P2 P3 P4,
P1 ∧ (Is_true (P2 && P3)) ∧ P4 →
P1 ∧ P2 ∧ P3.
Proof.
intros * HH. split_and!; [ destruct_and? HH; assumption | destruct_and?; assumption | ].
destruct_and?. Fail destruct_and!. assumption.
Qed.
Goal forall (n : nat), ∃ m : nat, True.
Proof. intros ?. rename select nat into m. exists m. done. Qed.