From a0844a9b6eb88f9e75f7305e8d1505cf502fb81a Mon Sep 17 00:00:00 2001 From: Frédéric Besson Date: Wed, 30 Oct 2019 09:38:01 +0100 Subject: More robust proof of `size_and` (#320) The proposed proof only uses `zify` for closing the goal. This is needed for Coq PR #10982 which changes the inner working of `zify`. --- lib/Integers.v | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) (limited to 'lib/Integers.v') diff --git a/lib/Integers.v b/lib/Integers.v index 3b6c35eb..8990c78d 100644 --- a/lib/Integers.v +++ b/lib/Integers.v @@ -3322,10 +3322,11 @@ Proof. assert (0 <= Z.min (size a) (size b)). generalize (size_range a) (size_range b). zify; omega. apply bits_size_3. auto. intros. - rewrite bits_and. zify. subst z z0. destruct H1. - rewrite (bits_size_2 a). auto. omega. - rewrite (bits_size_2 b). apply andb_false_r. omega. - omega. + rewrite bits_and by omega. + rewrite andb_false_iff. + generalize (bits_size_2 a i). + generalize (bits_size_2 b i). + zify; intuition. Qed. Corollary and_interval: -- cgit