Created
December 8, 2019 20:19
-
-
Save banbh/2ef6a84caac87fd2d5e656b1884203cc to your computer and use it in GitHub Desktop.
Proving lt_aux_two using transitivity
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
lemma lt_aux_two (a b : mynat) : succ a ≤ b → a ≤ b ∧ ¬ (b ≤ a) := | |
begin | |
intro h, | |
split, | |
exact le_trans _ _ _ (le_succ_self a) h, | |
intro h2, | |
exact not_succ_le_self _ (le_trans _ _ _ h h2), | |
end |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment