mmtheorems8 - Metamath Proof Explorer

Jump to page: Contents + 1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10687

Statement List for Metamath Proof Explorer - 701-800 - Page 8 of 107

Type	Label	Description
Statement
Theorem	mpan2d 701	A deduction based on modus ponens.
|- (ph -> ch)   &   |- (ph -> ((ps /\ ch) -> th))   =>   |- (ph -> (ps -> th))
Theorem	mp2and 702	A deduction based on modus ponens.
|- (ph -> ps)   &   |- (ph -> ch)   &   |- (ph -> ((ps /\ ch) -> th))   =>   |- (ph -> th)
Theorem	mpdan 703	An inference based on modus ponens.
|- (ph -> ps)   &   |- ((ph /\ ps) -> ch)   =>   |- (ph -> ch)
Theorem	mpancom 704	An inference based on modus ponens with commutation of antecedents.
|- (ps -> ph)   &   |- ((ph /\ ps) -> ch)   =>   |- (ps -> ch)
Theorem	mpanl1 705	An inference based on modus ponens.
|- ph   &   |- (((ph /\ ps) /\ ch) -> th)   =>   |- ((ps /\ ch) -> th)
Theorem	mpanl2 706	An inference based on modus ponens.
|- ps   &   |- (((ph /\ ps) /\ ch) -> th)   =>   |- ((ph /\ ch) -> th)
Theorem	mpanl12 707	An inference based on modus ponens.
|- ph   &   |- ps   &   |- (((ph /\ ps) /\ ch) -> th)   =>   |- (ch -> th)
Theorem	mpanr1 708	An inference based on modus ponens.
|- ps   &   |- ((ph /\ (ps /\ ch)) -> th)   =>   |- ((ph /\ ch) -> th)
Theorem	mpanr2 709	An inference based on modus ponens.
|- ch   &   |- ((ph /\ (ps /\ ch)) -> th)   =>   |- ((ph /\ ps) -> th)
Theorem	mpanlr1 710	An inference based on modus ponens.
|- ps   &   |- (((ph /\ (ps /\ ch)) /\ th) -> ta)   =>   |- (((ph /\ ch) /\ th) -> ta)
Theorem	mtt 711	Modus-tollens-like theorem.
|- (-. ph -> (-. ps <-> (ps -> ph)))
Theorem	mt2bi 712	A false consequent falsifies an antecedent.
|- ph   =>   |- (-. ps <-> (ps -> -. ph))
Theorem	mtbid 713	A deduction from a biconditional, similar to modus tollens.
|- (ph -> -. ps)   &   |- (ph -> (ps <-> ch))   =>   |- (ph -> -. ch)
Theorem	mtbird 714	A deduction from a biconditional, similar to modus tollens.
|- (ph -> -. ch)   &   |- (ph -> (ps <-> ch))   =>   |- (ph -> -. ps)
Theorem	mtbii 715	An inference from a biconditional, similar to modus tollens.
|- -. ps   &   |- (ph -> (ps <-> ch))   =>   |- (ph -> -. ch)
Theorem	mtbiri 716	An inference from a biconditional, similar to modus tollens.
|- -. ch   &   |- (ph -> (ps <-> ch))   =>   |- (ph -> -. ps)
Theorem	2th 717	Two truths are equivalent.
|- ph   &   |- ps   =>   |- (ph <-> ps)
Theorem	2false 718	Two falsehoods are equivalent.
|- -. ph   &   |- -. ps   =>   |- (ph <-> ps)
Theorem	tbt 719	A wff is equivalent to its equivalence with truth. (The proof was shortened by Juha Arpiainen, 19-Jan-06.)
|- ph   =>   |- (ps <-> (ps <-> ph))
Theorem	nbn2 720	The negation of a wff is equivalent to the wff's equivalence to falsehood. (Contributed by Juha Arpiainen, 19-Jan-06.)
|- (-. ph -> (-. ps <-> (ph <-> ps)))
Theorem	nbn 721	The negation of a wff is equivalent to the wff's equivalence to falsehood.
|- -. ph   =>   |- (-. ps <-> (ps <-> ph))
Theorem	nbn3 722	Transfer falsehood via equivalence.
|- ph   =>   |- (-. ps <-> (ps <-> -. ph))
Theorem	biantru 723	A wff is equivalent to its conjunction with truth.
|- ph   =>   |- (ps <-> (ps /\ ph))
Theorem	biantrur 724	A wff is equivalent to its conjunction with truth.
|- ph   =>   |- (ps <-> (ph /\ ps))
Theorem	biantrud 725	A wff is equivalent to its conjunction with truth.
|- (ph -> ps)   =>   |- (ph -> (ch <-> (ch /\ ps)))
Theorem	biantrurd 726	A wff is equivalent to its conjunction with truth.
|- (ph -> ps)   =>   |- (ph -> (ch <-> (ps /\ ch)))
Theorem	mpbiran 727	Detach truth from conjunction in biconditional.
|- (ph <-> (ps /\ ch))   &   |- ps   =>   |- (ph <-> ch)
Theorem	mpbiran2 728	Detach truth from conjunction in biconditional.
|- (ph <-> (ps /\ ch))   &   |- ch   =>   |- (ph <-> ps)
Theorem	mpbir2an 729	Detach a conjunction of truths in a biconditional.
|- (ph <-> (ps /\ ch))   &   |- ps   &   |- ch   =>   |- ph
Theorem	biimt 730	A wff is equivalent to itself with true antecedent.
|- (ph -> (ps <-> (ph -> ps)))
Theorem	pm5.5 731	Theorem *5.5 of [WhiteheadRussell] p. 125.
|- (ph -> ((ph -> ps) <-> ps))
Theorem	pm5.62 732	Theorem *5.62 of [WhiteheadRussell] p. 125. (Contributed by Roy F. Longton, 21-Jun-2005.)
|- (((ph /\ ps) \/ -. ps) <-> (ph \/ -. ps))
Theorem	biort 733	A wff is disjoined with truth is true.
|- (ph -> (ph <-> (ph \/ ps)))
Theorem	biorf 734	A wff is equivalent to its disjunction with falsehood. Theorem *4.74 of [WhiteheadRussell] p. 121.
|- (-. ph -> (ps <-> (ph \/ ps)))
Theorem	biorfi 735	A wff is equivalent to its disjunction with falsehood.
|- -. ph   =>   |- (ps <-> (ps \/ ph))
Theorem	bianfi 736	A wff conjoined with falsehood is false.
|- -. ph   =>   |- (ph <-> (ps /\ ph))
Theorem	bianfd 737	A wff conjoined with falsehood is false.
|- (ph -> -. ps)   =>   |- (ph -> (ps <-> (ps /\ ch)))
Theorem	pm4.82 738	Theorem *4.82 of [WhiteheadRussell] p. 122.
|- (((ph -> ps) /\ (ph -> -. ps)) <-> -. ph)
Theorem	pm4.83 739	Theorem *4.83 of [WhiteheadRussell] p. 122.
|- (((ph -> ps) /\ (-. ph -> ps)) <-> ps)
Theorem	pclem6 740	Negation inferred from embedded conjunct.
|- ((ph <-> (ps /\ -. ph)) -> -. ps)
Theorem	biantr 741	A transitive law of equivalence. Compare Theorem *4.22 of [WhiteheadRussell] p. 117.
|- (((ph <-> ps) /\ (ch <-> ps)) -> (ph <-> ch))
Theorem	orbidi 742	Disjunction distributes over the biconditional. An axiom of system DS in Vladimir Lifschitz, "On calculational proofs" (1998), http://citeseer.ist.psu.edu/lifschitz98calculational.html.
|- ((ph \/ (ps <-> ch)) <-> ((ph \/ ps) <-> (ph \/ ch)))
Theorem	biass 743	Associative law for the biconditional. An axiom of system DS in Vladimir Lifschitz, "On calculational proofs" (1998), http://citeseer.ist.psu.edu/lifschitz98calculational.html. Interestingly, this law was not included in Principia Mathematica but was apparently first noted by Jan Lukasiewicz circa 1923. (The proof was shortened by Juha Arpiainen, 19-Jan-06.)
|- (((ph <-> ps) <-> ch) <-> (ph <-> (ps <-> ch)))
Theorem	biluk 744	Lukasiewicz's shortest axiom for equivalential calculus. Storrs McCall, ed., Polish Logic 1920-1939 (Oxford, 1967), p. 96.
|- ((ph <-> ps) <-> ((ch <-> ps) <-> (ph <-> ch)))
Theorem	pm5.7 745	Disjunction distributes over the biconditional. Theorem *5.7 of [WhiteheadRussell] p. 125. This theorem is similar to orbidi 742. (Contributed by Roy F. Longton, 21-Jun-2005.)
|- (((ph \/ ch) <-> (ps \/ ch)) <-> (ch \/ (ph <-> ps)))
Theorem	bigolden 746	Dijkstra-Scholten's Golden Rule for calculational proofs.
|- (((ph /\ ps) <-> ph) <-> (ps <-> (ph \/ ps)))
Theorem	pm5.71 747	Theorem *5.71 of [WhiteheadRussell] p. 125. (Contributed by Roy F. Longton, 23-Jun-2005.)
|- ((ps -> -. ch) -> (((ph \/ ps) /\ ch) <-> (ph /\ ch)))
Theorem	pm5.75 748	Theorem *5.75 of [WhiteheadRussell] p. 126.
|- (((ch -> -. ps) /\ (ph <-> (ps \/ ch))) -> ((ph /\ -. ps) <-> ch))
Theorem	bimsc1 749	Removal of conjunct from one side of an equivalence.
|- (((ph -> ps) /\ (ch <-> (ps /\ ph))) -> (ch <-> ph))
Theorem	ecase2d 750	Deduction for elimination by cases.
|- (ph -> ps)   &   |- (ph -> -. (ps /\ ch))   &   |- (ph -> -. (ps /\ th))   &   |- (ph -> (ta \/ (ch \/ th)))   =>   |- (ph -> ta)
Theorem	ecase3 751	Inference for elimination by cases.
|- (ph -> ch)   &   |- (ps -> ch)   &   |- (-. (ph \/ ps) -> ch)   =>   |- ch
Theorem	ecase 752	Inference for elimination by cases.
|- (-. ph -> ch)   &   |- (-. ps -> ch)   &   |- ((ph /\ ps) -> ch)   =>   |- ch
Theorem	ecase3d 753	Deduction for elimination by cases.
|- (ph -> (ps -> th))   &   |- (ph -> (ch -> th))   &   |- (ph -> (-. (ps \/ ch) -> th))   =>   |- (ph -> th)
Theorem	ccase 754	Inference for combining cases.
|- ((ph /\ ps) -> ta)   &   |- ((ch /\ ps) -> ta)   &   |- ((ph /\ th) -> ta)   &   |- ((ch /\ th) -> ta)   =>   |- (((ph \/ ch) /\ (ps \/ th)) -> ta)
Theorem	ccased 755	Deduction for combining cases.
|- (ph -> ((ps /\ ch) -> et))   &   |- (ph -> ((th /\ ch) -> et))   &   |- (ph -> ((ps /\ ta) -> et))   &   |- (ph -> ((th /\ ta) -> et))   =>   |- (ph -> (((ps \/ th) /\ (ch \/ ta)) -> et))
Theorem	ccase2 756	Inference for combining cases.
|- ((ph /\ ps) -> ta)   &   |- (ch -> ta)   &   |- (th -> ta)   =>   |- (((ph \/ ch) /\ (ps \/ th)) -> ta)
Theorem	4cases 757	Inference eliminating two antecedents from the four possible cases that result from their true/false combinations.
|- ((ph /\ ps) -> ch)   &   |- ((ph /\ -. ps) -> ch)   &   |- ((-. ph /\ ps) -> ch)   &   |- ((-. ph /\ -. ps) -> ch)   =>   |- ch
Theorem	niabn 758	Miscellaneous inference relating falsehoods.
|- ph   =>   |- (-. ps -> ((ch /\ ps) <-> -. ph))
Theorem	dedlem0a 759	Lemma for an alternate version of weak deduction theorem.
Theorem	dedlem0b 760	Lemma for an alternate version of weak deduction theorem.
Theorem	dedlema 761	Lemma for weak deduction theorem.
Theorem	dedlemb 762	Lemma for weak deduction theorem.
Theorem	elimh 763	Hypothesis builder for weak deduction theorem. For more information, see the Deduction Theorem link on the Metamath Proof Explorer home page.
|- ((ph <-> ((ph /\ ch) \/ (ps /\ -. ch))) -> (ch <-> ta))   &   |- ((ps <->