proposition: Lemma bool_gimmics1 a : a != a.-1 -> a != 0.
proof: Proof. Lemma view_gimmics1 p a b : p -> (p ==> (a == b.*2)) -> a./2 = b. Lemma maxn_idPl m n : reflect (maxn m n = m) (m >= n). Proof. apply: (iffP idP). Qed.
imports: mathcomp(all_ssreflect)