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
theory X imports Complex_Main begin | |
consts a :: "nat => real" | |
theorem | |
"k > 0 ==> | |
(ALL e. e > 0 --> (EX N1. (ALL n. n > N1 --> abs (a n - b) < e))) | |
= (ALL e. e > 0 --> (EX N2. (ALL n. n > N2 --> abs (a n - b) < k * e)))" | |
apply(rule iffI) | |
apply(rule allI) | |
apply(rule impI) | |
apply(drule_tac x="k * e" in spec) | |
apply(drule mp) | |
apply(simp) | |
apply(erule exE) | |
apply(rule_tac x="N1" in exI) | |
apply(rule allI) | |
apply(rule impI) | |
apply(drule_tac x="n" in spec) | |
apply(drule mp) | |
apply(simp) | |
apply(simp) | |
(**) | |
apply(rule allI) | |
apply(rule impI) | |
apply(drule_tac x="e / k" in spec) | |
apply(drule mp) | |
apply(simp) | |
apply(erule exE) | |
apply(rule_tac x="N2" in exI) | |
apply(rule allI) | |
apply(rule impI) | |
apply(drule_tac x="n" in spec) | |
apply(drule mp) | |
apply(simp) | |
apply(simp) | |
done | |
theorem | |
"k > 0 ==> | |
(ALL e. e > 0 --> (EX N1. n > N1 --> abs (a n - b) < e)) | |
= (ALL e. e > 0 --> (EX N2. n > N2 --> abs (a n - b) < k * e))" | |
apply(rule iffI) | |
apply(rule allI) | |
apply(rule impI) | |
apply(drule_tac x="k * e" in spec) | |
apply(drule mp) | |
apply(simp) | |
apply(erule exE) | |
apply(rule_tac x="N1" in exI) | |
apply(rule impI) | |
apply(drule mp) | |
apply(simp) | |
apply(simp) | |
(**) | |
apply(rule allI) | |
apply(rule impI) | |
apply(drule_tac x="e / k" in spec) | |
apply(drule mp) | |
apply(simp) | |
apply(erule exE) | |
apply(rule_tac x="N2" in exI) | |
apply(rule impI) | |
apply(drule mp) | |
apply(simp) | |
apply(simp) | |
done |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment