|
QED stood for either quod erat demonstrandum or quod est demonstatum, which respectively mean "which was to be shown" and "which has been shown". Modern custom is to use a little square instead of the letters QED. ... auto-QED Make \end{Theorem} insert a \qed automatically.
|
www.paultaylor.eu/proofs/QEDdoc
www.paultaylor.eu/proofs/QEDdoc
|
|
|
|
Qed. Theorem False_Q: False -> Q. Proof. intro ff. destruct ff. Qed. ... Qed. Theorem Absurd: P -> ~ P -> Q. Proof. intros p np; destruct np; assumption. ...
|
www.labri.fr/perso/casteran/FM/CoursDeLogique/Corrige/p...
www.labri.fr/perso/casteran/FM/CoursDeLogique/Corrige/proplog.v
|
|
|
Qed. Theorem lazy_example : forall n:nat, (S n) + 0 = S n. ... Qed. End combinatory_logic. Theorem example_for_subst : forall (a b c d:nat), ...
|
www.labri.fr/perso/casteran/CoqArt/autotac/SRC/chap7.v
|
|
Qed. Theorem Not_EqLt : ~ exists x : Term, exists y : Term, Eq x y /\ Lt x y. .... Qed. Theorem lparen2mparen : forall s:S, lparen s -> mparen s. Proof. ...
|
sigpl.or.kr/school/2009s/sigpl2009-hw.v
|
|
Qed. Check le_ind. Theorem le_transitive_easy : forall n1 n2 n3, .... Qed. Theorem exec_is_safe: forall c, valid c -> forall G, Gtyped Gtypes G -> exists G' ...
|
adam.chlipala.net/itp/lectures/lecture4.v
|
|
Qed. Theorem check_even_sound : forall n, check_even n = true -> isEven n. intros. ... Qed. Hint Resolve add_sound. Theorem forward_sound : forall (hyp ...
|
adam.chlipala.net/itp/lectures/lecture11.v
|
|
also have "A --> C" proof assume A then show C by (rule r1) qed also have "B --> C" proof assume B then show C by (rule r2) qed finally show C . qed theorem exI [intro]: "P a ==> ∃x. P x" proof (unfold Ex_def) assume "P a" show "∀C. (∀x. P x --> C) --> C" proof fix C show "(∀x. P x --> C) --> C" proof assume...
|
www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL...
www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/ex/Higher_Order_Logic.html
|
|
The roots of any orthogonal polynomial are real and distinct. See also [Section IX]. QED ... Follows directly from Theorem 8.1 and Lemma 8.3.
|
graham.main.nc.us/~bhammel/FCCR/VIII.html
|
|
THEOREM OF THE DAY; Cantor’s Theorem The power set 2X of a set X cannot be put into one to one correspondence with X. Thus the cardinality of 2X is strictly greater than that of X. Proof: Think of the elements of X as some, possibly infinite, collection of people.
|
myweb.lsbu.ac.uk/~whittyr/MathSci/TheoremOfTheDay/Logic...
myweb.lsbu.ac.uk/~whittyr/MathSci/TheoremOfTheDay/LogicAndComputerScience/Cantor/TotDCantor.pdf
|
|
