(* Inverso_del_inverso_en_grupos.thy -- Si G un grupo y a \ G, entonces (a⁻¹)⁻¹ = a -- José A. Alonso Jiménez -- Sevilla, 15-mayo-2024 -- ------------------------------------------------------------------ *) (* --------------------------------------------------------------------- -- Sea G un grupo y a \ G. Demostrar que -- (a⁻¹)⁻¹ = a -- ------------------------------------------------------------------ *) theory Inverso_del_inverso_en_grupos imports Main begin context group begin (* 1\ demostración *) lemma "inverse (inverse a) = a" proof - have "inverse (inverse a) = (inverse (inverse a)) \<^bold>* \<^bold>1" by (simp only: right_neutral) also have "\ = inverse (inverse a) \<^bold>* (inverse a \<^bold>* a)" by (simp only: left_inverse) also have "\ = (inverse (inverse a) \<^bold>* inverse a) \<^bold>* a" by (simp only: assoc) also have "\ = \<^bold>1 \<^bold>* a" by (simp only: left_inverse) also have "\ = a" by (simp only: left_neutral) finally show "inverse (inverse a) = a" by this qed (* 2\ demostración *) lemma "inverse (inverse a) = a" proof - have "inverse (inverse a) = (inverse (inverse a)) \<^bold>* \<^bold>1" by simp also have "\ = inverse (inverse a) \<^bold>* (inverse a \<^bold>* a)" by simp also have "\ = (inverse (inverse a) \<^bold>* inverse a) \<^bold>* a" by simp also have "\ = \<^bold>1 \<^bold>* a" by simp finally show "inverse (inverse a) = a" by simp qed (* 3\ demostración *) lemma "inverse (inverse a) = a" proof (rule inverse_unique) show "inverse a \<^bold>* a = \<^bold>1" by (simp only: left_inverse) qed (* 4\ demostración *) lemma "inverse (inverse a) = a" proof (rule inverse_unique) show "inverse a \<^bold>* a = \<^bold>1" by simp qed (* 5\ demostración *) lemma "inverse (inverse a) = a" by (rule inverse_unique) simp (* 6\ demostración *) lemma "inverse (inverse a) = a" by (simp only: inverse_inverse) (* 7\ demostración *) lemma "inverse (inverse a) = a" by simp end end