1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
15 (* ********************************************************************** *)
16 (* Progetto FreeScale *)
18 (* Sviluppato da: Ing. Cosimo Oliboni, oliboni@cs.unibo.it *)
19 (* Ultima modifica: 05/08/2009 *)
21 (* ********************************************************************** *)
23 include "num/bool.ma".
29 ndefinition bool_destruct_aux ≝
30 Πb1,b2:bool.ΠP:Prop.b1 = b2 →
31 match eq_bool b1 b2 with [ true ⇒ P → P | false ⇒ P ].
33 ndefinition bool_destruct : bool_destruct_aux.
41 nlemma symmetric_eqbool : symmetricT bool bool eq_bool.
49 nlemma symmetric_andbool : symmetricT bool bool and_bool.
57 nlemma associative_andbool : ∀b1,b2,b3.((b1 ⊗ b2) ⊗ b3) = (b1 ⊗ (b2 ⊗ b3)).
66 nlemma symmetric_orbool : symmetricT bool bool or_bool.
74 nlemma associative_orbool : ∀b1,b2,b3.((b1 ⊕ b2) ⊕ b3) = (b1 ⊕ (b2 ⊕ b3)).
83 nlemma symmetric_xorbool : symmetricT bool bool xor_bool.
91 nlemma associative_xorbool : ∀b1,b2,b3.((b1 ⊙ b2) ⊙ b3) = (b1 ⊙ (b2 ⊙ b3)).
100 nlemma eqbool_to_eq : ∀b1,b2:bool.(eq_bool b1 b2 = true) → (b1 = b2).
105 ##[ ##1,4: #H; napply refl_eq
106 ##| ##*: #H; napply (bool_destruct … H)
110 nlemma eq_to_eqbool : ∀b1,b2.b1 = b2 → eq_bool b1 b2 = true.
115 ##[ ##1,4: #H; napply refl_eq
116 ##| ##*: #H; napply (bool_destruct … H)
120 nlemma decidable_bool : ∀x,y:bool.decidable (x = y).
125 ##[ ##1,4: napply (or2_intro1 (? = ?) (? ≠ ?) …); napply refl_eq
126 ##| ##*: napply (or2_intro2 (? = ?) (? ≠ ?) …);
129 napply (bool_destruct … H)
133 nlemma neqbool_to_neq : ∀b1,b2:bool.(eq_bool b1 b2 = false) → (b1 ≠ b2).
138 ##[ ##1,4: #H; napply (bool_destruct … H)
139 ##| ##*: #H; #H1; napply (bool_destruct … H1)
143 nlemma neq_to_neqbool : ∀b1,b2.b1 ≠ b2 → eq_bool b1 b2 = false.
148 ##[ ##1,4: #H; nelim (H (refl_eq …))
149 ##| ##*: #H; napply refl_eq
153 nlemma andb_true_true_l: ∀b1,b2.(b1 ⊗ b2) = true → b1 = true.
158 ##[ ##1,2: #H; napply refl_eq
159 ##| ##*: #H; napply (bool_destruct … H)
163 nlemma andb_true_true_r: ∀b1,b2.(b1 ⊗ b2) = true → b2 = true.
168 ##[ ##1,3: #H; napply refl_eq
169 ##| ##*: #H; napply (bool_destruct … H)
174 : ∀b1,b2.(b1 ⊗ b2) = false →
175 (b1 = false) ∨ (b2 = false).
180 ##[ ##1: #H; napply (bool_destruct … H)
181 ##| ##2,4: #H; napply (or2_intro2 … H)
182 ##| ##3: #H; napply (or2_intro1 … H)
187 : ∀b1,b2,b3.(b1 ⊗ b2 ⊗ b3) = false →
188 Or3 (b1 = false) (b2 = false) (b3 = false).
194 ##[ ##1: #H; napply (bool_destruct … H)
195 ##| ##5,6,7,8: #H; napply (or3_intro1 … H)
196 ##| ##2,4: #H; napply (or3_intro3 … H)
197 ##| ##3: #H; napply (or3_intro2 … H)
202 : ∀b1,b2,b3,b4.(b1 ⊗ b2 ⊗ b3 ⊗ b4) = false →
203 Or4 (b1 = false) (b2 = false) (b3 = false) (b4 = false).
210 ##[ ##1: #H; napply (bool_destruct … H)
211 ##| ##9,10,11,12,13,14,15,16: #H; napply (or4_intro1 … H)
212 ##| ##5,6,7,8: #H; napply (or4_intro2 … H)
213 ##| ##3,4: #H; napply (or4_intro3 … H)
214 ##| ##2: #H; napply (or4_intro4 … H)
219 : ∀b1,b2,b3,b4,b5.(b1 ⊗ b2 ⊗ b3 ⊗ b4 ⊗ b5) = false →
220 Or5 (b1 = false) (b2 = false) (b3 = false) (b4 = false) (b5 = false).
221 #b1; #b2; #b3; #b4; #b5;
228 ##[ ##1: #H; napply (bool_destruct … H)
229 ##| ##17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32: #H; napply (or5_intro1 … H)
230 ##| ##9,10,11,12,13,14,15,16: #H; napply (or5_intro2 … H)
231 ##| ##5,6,7,8: #H; napply (or5_intro3 … H)
232 ##| ##3,4: #H; napply (or5_intro4 … H)
233 ##| ##2: #H; napply (or5_intro5 … H)
237 nlemma andb_false2_1 : ∀b.(false ⊗ b) = false.
238 #b; nnormalize; napply refl_eq. nqed.
239 nlemma andb_false2_2 : ∀b.(b ⊗ false) = false.
240 #b; nelim b; nnormalize; napply refl_eq. nqed.
242 nlemma andb_false3_1 : ∀b1,b2.(false ⊗ b1 ⊗ b2) = false.
243 #b1; #b2; nnormalize; napply refl_eq. nqed.
244 nlemma andb_false3_2 : ∀b1,b2.(b1 ⊗ false ⊗ b2) = false.
245 #b1; #b2; nelim b1; nnormalize; napply refl_eq. nqed.
246 nlemma andb_false3_3 : ∀b1,b2.(b1 ⊗ b2 ⊗ false) = false.
247 #b1; #b2; nelim b1; nelim b2; nnormalize; napply refl_eq. nqed.
249 nlemma andb_false4_1 : ∀b1,b2,b3.(false ⊗ b1 ⊗ b2 ⊗ b3) = false.
250 #b1; #b2; #b3; nnormalize; napply refl_eq. nqed.
251 nlemma andb_false4_2 : ∀b1,b2,b3.(b1 ⊗ false ⊗ b2 ⊗ b3) = false.
252 #b1; #b2; #b3; nelim b1; nnormalize; napply refl_eq. nqed.
253 nlemma andb_false4_3 : ∀b1,b2,b3.(b1 ⊗ b2 ⊗ false ⊗ b3) = false.
254 #b1; #b2; #b3; nelim b1; nelim b2; nnormalize; napply refl_eq. nqed.
255 nlemma andb_false4_4 : ∀b1,b2,b3.(b1 ⊗ b2 ⊗ b3 ⊗ false) = false.
256 #b1; #b2; #b3; nelim b1; nelim b2; nelim b3; nnormalize; napply refl_eq. nqed.
258 nlemma andb_false5_1 : ∀b1,b2,b3,b4.(false ⊗ b1 ⊗ b2 ⊗ b3 ⊗ b4) = false.
259 #b1; #b2; #b3; #b4; nnormalize; napply refl_eq. nqed.
260 nlemma andb_false5_2 : ∀b1,b2,b3,b4.(b1 ⊗ false ⊗ b2 ⊗ b3 ⊗ b4) = false.
261 #b1; #b2; #b3; #b4; nelim b1; nnormalize; napply refl_eq. nqed.
262 nlemma andb_false5_3 : ∀b1,b2,b3,b4.(b1 ⊗ b2 ⊗ false ⊗ b3 ⊗ b4) = false.
263 #b1; #b2; #b3; #b4; nelim b1; nelim b2; nnormalize; napply refl_eq. nqed.
264 nlemma andb_false5_4 : ∀b1,b2,b3,b4.(b1 ⊗ b2 ⊗ b3 ⊗ false ⊗ b4) = false.
265 #b1; #b2; #b3; #b4; nelim b1; nelim b2; nelim b3; nnormalize; napply refl_eq. nqed.
266 nlemma andb_false5_5 : ∀b1,b2,b3,b4.(b1 ⊗ b2 ⊗ b3 ⊗ b4 ⊗ false) = false.
267 #b1; #b2; #b3; #b4; nelim b1; nelim b2; nelim b3; nelim b4; nnormalize; napply refl_eq. nqed.
269 nlemma orb_false_false_l : ∀b1,b2:bool.(b1 ⊕ b2) = false → b1 = false.
274 ##[ ##4: #H; napply refl_eq
275 ##| ##*: #H; napply (bool_destruct … H)
279 nlemma orb_false_false_r : ∀b1,b2:bool.(b1 ⊕ b2) = false → b2 = false.
284 ##[ ##4: #H; napply refl_eq
285 ##| ##*: #H; napply (bool_destruct … H)