P. 7 of Theorem List - Metamath Proof Explorer

Theorem List for Metamath Proof Explorer - 601-700   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	expimpd 601	Exportation followed by a deduction version of importation. (Contributed by NM, 6-Sep-2008.)
|- ( ( ph /\ ps ) -> ( ch -> th ) )   =>    |- ( ph -> ( ( ps /\ ch ) -> th ) )
Theorem	exp31 602	An exportation inference. (Contributed by NM, 26-Apr-1994.)
|- ( ( ( ph /\ ps ) /\ ch ) -> th )   =>    |- ( ph -> ( ps -> ( ch -> th ) ) )
Theorem	exp32 603	An exportation inference. (Contributed by NM, 26-Apr-1994.)
|- ( ( ph /\ ( ps /\ ch ) ) -> th )   =>    |- ( ph -> ( ps -> ( ch -> th ) ) )
Theorem	exp4a 604	An exportation inference. (Contributed by NM, 26-Apr-1994.)
|- ( ph -> ( ps -> ( ( ch /\ th ) -> ta ) ) )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ta ) ) ) )
Theorem	exp4b 605	An exportation inference. (Contributed by NM, 26-Apr-1994.) (Proof shortened by Wolf Lammen, 23-Nov-2012.)
|- ( ( ph /\ ps ) -> ( ( ch /\ th ) -> ta ) )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ta ) ) ) )
Theorem	exp4c 606	An exportation inference. (Contributed by NM, 26-Apr-1994.)
|- ( ph -> ( ( ( ps /\ ch ) /\ th ) -> ta ) )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ta ) ) ) )
Theorem	exp4d 607	An exportation inference. (Contributed by NM, 26-Apr-1994.)
|- ( ph -> ( ( ps /\ ( ch /\ th ) ) -> ta ) )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ta ) ) ) )
Theorem	exp41 608	An exportation inference. (Contributed by NM, 26-Apr-1994.)
|- ( ( ( ( ph /\ ps ) /\ ch ) /\ th ) -> ta )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ta ) ) ) )
Theorem	exp42 609	An exportation inference. (Contributed by NM, 26-Apr-1994.)
|- ( ( ( ph /\ ( ps /\ ch ) ) /\ th ) -> ta )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ta ) ) ) )
Theorem	exp43 610	An exportation inference. (Contributed by NM, 26-Apr-1994.)
|- ( ( ( ph /\ ps ) /\ ( ch /\ th ) ) -> ta )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ta ) ) ) )
Theorem	exp44 611	An exportation inference. (Contributed by NM, 26-Apr-1994.)
|- ( ( ph /\ ( ( ps /\ ch ) /\ th ) ) -> ta )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ta ) ) ) )
Theorem	exp45 612	An exportation inference. (Contributed by NM, 26-Apr-1994.)
|- ( ( ph /\ ( ps /\ ( ch /\ th ) ) ) -> ta )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ta ) ) ) )
Theorem	expr 613	Export a wff from a right conjunct. (Contributed by Jeff Hankins, 30-Aug-2009.)
|- ( ( ph /\ ( ps /\ ch ) ) -> th )   =>    |- ( ( ph /\ ps ) -> ( ch -> th ) )
Theorem	exp5c 614	An exportation inference. (Contributed by Jeff Hankins, 7-Jul-2009.)
|- ( ph -> ( ( ps /\ ch ) -> ( ( th /\ ta ) -> et ) ) )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ( ta -> et ) ) ) ) )
Theorem	exp53 615	An exportation inference. (Contributed by Jeff Hankins, 30-Aug-2009.)
|- ( ( ( ( ph /\ ps ) /\ ( ch /\ th ) ) /\ ta ) -> et )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ( ta -> et ) ) ) ) )
Theorem	expl 616	Export a wff from a left conjunct. (Contributed by Jeff Hankins, 28-Aug-2009.)
|- ( ( ( ph /\ ps ) /\ ch ) -> th )   =>    |- ( ph -> ( ( ps /\ ch ) -> th ) )
Theorem	impr 617	Import a wff into a right conjunct. (Contributed by Jeff Hankins, 30-Aug-2009.)
|- ( ( ph /\ ps ) -> ( ch -> th ) )   =>    |- ( ( ph /\ ( ps /\ ch ) ) -> th )
Theorem	impl 618	Export a wff from a left conjunct. (Contributed by Mario Carneiro, 9-Jul-2014.)
|- ( ph -> ( ( ps /\ ch ) -> th ) )   =>    |- ( ( ( ph /\ ps ) /\ ch ) -> th )
Theorem	impac 619	Importation with conjunction in consequent. (Contributed by NM, 9-Aug-1994.)
|- ( ph -> ( ps -> ch ) )   =>    |- ( ( ph /\ ps ) -> ( ch /\ ps ) )
Theorem	exbiri 620	Inference form of exbir 33606. This proof is exbiriVD 34054 automatically translated and minimized. (Contributed by Alan Sare, 31-Dec-2011.) (Proof shortened by Wolf Lammen, 27-Jan-2013.)
|- ( ( ph /\ ps ) -> ( ch <-> th ) )   =>    |- ( ph -> ( ps -> ( th -> ch ) ) )
Theorem	simprbda 621	Deduction eliminating a conjunct. (Contributed by NM, 22-Oct-2007.)
|- ( ph -> ( ps <-> ( ch /\ th ) ) )   =>    |- ( ( ph /\ ps ) -> ch )
Theorem	simplbda 622	Deduction eliminating a conjunct. (Contributed by NM, 22-Oct-2007.)
|- ( ph -> ( ps <-> ( ch /\ th ) ) )   =>    |- ( ( ph /\ ps ) -> th )
Theorem	simplbi2 623	Deduction eliminating a conjunct. (Contributed by Alan Sare, 31-Dec-2011.)
|- ( ph <-> ( ps /\ ch ) )   =>    |- ( ps -> ( ch -> ph ) )
Theorem	simplbi2comt 624	Closed form of simplbi2com 625. (Contributed by Alan Sare, 22-Jul-2012.)
|- ( ( ph <-> ( ps /\ ch ) ) -> ( ch -> ( ps -> ph ) ) )
Theorem	simplbi2com 625	A deduction eliminating a conjunct, similar to simplbi2 623. (Contributed by Alan Sare, 22-Jul-2012.) (Proof shortened by Wolf Lammen, 10-Nov-2012.)
|- ( ph <-> ( ps /\ ch ) )   =>    |- ( ch -> ( ps -> ph ) )
Theorem	dfbi2 626	A theorem similar to the standard definition of the biconditional. Definition of [Margaris] p. 49. (Contributed by NM, 24-Jan-1993.)
|- ( ( ph <-> ps ) <-> ( ( ph -> ps ) /\ ( ps -> ph ) ) )
Theorem	dfbi 627	Definition df-bi 185 rewritten in an abbreviated form to help intuitive understanding of that definition. Note that it is a conjunction of two implications; one which asserts properties that follow from the biconditional and one which asserts properties that imply the biconditional. (Contributed by NM, 15-Aug-2008.)
|- ( ( ( ph <-> ps ) -> ( ( ph -> ps ) /\ ( ps -> ph ) ) ) /\ ( ( ( ph -> ps ) /\ ( ps -> ph ) ) -> ( ph <-> ps ) ) )
Theorem	pm4.71 628	Implication in terms of biconditional and conjunction. Theorem *4.71 of [WhiteheadRussell] p. 120. (Contributed by NM, 21-Jun-1993.) (Proof shortened by Wolf Lammen, 2-Dec-2012.)
|- ( ( ph -> ps ) <-> ( ph <-> ( ph /\ ps ) ) )
Theorem	pm4.71r 629	Implication in terms of biconditional and conjunction. Theorem *4.71 of [WhiteheadRussell] p. 120 (with conjunct reversed). (Contributed by NM, 25-Jul-1999.)
|- ( ( ph -> ps ) <-> ( ph <-> ( ps /\ ph ) ) )
Theorem	pm4.71i 630	Inference converting an implication to a biconditional with conjunction. Inference from Theorem *4.71 of [WhiteheadRussell] p. 120. (Contributed by NM, 4-Jan-2004.)
|- ( ph -> ps )   =>    |- ( ph <-> ( ph /\ ps ) )
Theorem	pm4.71ri 631	Inference converting an implication to a biconditional with conjunction. Inference from Theorem *4.71 of [WhiteheadRussell] p. 120 (with conjunct reversed). (Contributed by NM, 1-Dec-2003.)
|- ( ph -> ps )   =>    |- ( ph <-> ( ps /\ ph ) )
Theorem	pm4.71d 632	Deduction converting an implication to a biconditional with conjunction. Deduction from Theorem *4.71 of [WhiteheadRussell] p. 120. (Contributed by Mario Carneiro, 25-Dec-2016.)
|- ( ph -> ( ps -> ch ) )   =>    |- ( ph -> ( ps <-> ( ps /\ ch ) ) )
Theorem	pm4.71rd 633	Deduction converting an implication to a biconditional with conjunction. Deduction from Theorem *4.71 of [WhiteheadRussell] p. 120. (Contributed by NM, 10-Feb-2005.)
|- ( ph -> ( ps -> ch ) )   =>    |- ( ph -> ( ps <-> ( ch /\ ps ) ) )
Theorem	pm5.32 634	Distribution of implication over biconditional. Theorem *5.32 of [WhiteheadRussell] p. 125. (Contributed by NM, 1-Aug-1994.)
|- ( ( ph -> ( ps <-> ch ) ) <-> ( ( ph /\ ps ) <-> ( ph /\ ch ) ) )
Theorem	pm5.32i 635	Distribution of implication over biconditional (inference rule). (Contributed by NM, 1-Aug-1994.)
|- ( ph -> ( ps <-> ch ) )   =>    |- ( ( ph /\ ps ) <-> ( ph /\ ch ) )
Theorem	pm5.32ri 636	Distribution of implication over biconditional (inference rule). (Contributed by NM, 12-Mar-1995.)
|- ( ph -> ( ps <-> ch ) )   =>    |- ( ( ps /\ ph ) <-> ( ch /\ ph ) )
Theorem	pm5.32d 637	Distribution of implication over biconditional (deduction rule). (Contributed by NM, 29-Oct-1996.)
|- ( ph -> ( ps -> ( ch <-> th ) ) )   =>    |- ( ph -> ( ( ps /\ ch ) <-> ( ps /\ th ) ) )
Theorem	pm5.32rd 638	Distribution of implication over biconditional (deduction rule). (Contributed by NM, 25-Dec-2004.)
|- ( ph -> ( ps -> ( ch <-> th ) ) )   =>    |- ( ph -> ( ( ch /\ ps ) <-> ( th /\ ps ) ) )
Theorem	pm5.32da 639	Distribution of implication over biconditional (deduction rule). (Contributed by NM, 9-Dec-2006.)
|- ( ( ph /\ ps ) -> ( ch <-> th ) )   =>    |- ( ph -> ( ( ps /\ ch ) <-> ( ps /\ th ) ) )
Theorem	biadan2 640	Add a conjunction to an equivalence. (Contributed by Jeff Madsen, 20-Jun-2011.)
|- ( ph -> ps )   &    |- ( ps -> ( ph <-> ch ) )   =>    |- ( ph <-> ( ps /\ ch ) )
Theorem	pm4.24 641	Theorem *4.24 of [WhiteheadRussell] p. 117. (Contributed by NM, 11-May-1993.)
|- ( ph <-> ( ph /\ ph ) )
Theorem	anidm 642	Idempotent law for conjunction. (Contributed by NM, 8-Jan-2004.) (Proof shortened by Wolf Lammen, 14-Mar-2014.)
|- ( ( ph /\ ph ) <-> ph )
Theorem	anidms 643	Inference from idempotent law for conjunction. (Contributed by NM, 15-Jun-1994.)
|- ( ( ph /\ ph ) -> ps )   =>    |- ( ph -> ps )
Theorem	anidmdbi 644	Conjunction idempotence with antecedent. (Contributed by Roy F. Longton, 8-Aug-2005.)
|- ( ( ph -> ( ps /\ ps ) ) <-> ( ph -> ps ) )
Theorem	anasss 645	Associative law for conjunction applied to antecedent (eliminates syllogism). (Contributed by NM, 15-Nov-2002.)
|- ( ( ( ph /\ ps ) /\ ch ) -> th )   =>    |- ( ( ph /\ ( ps /\ ch ) ) -> th )
Theorem	anassrs 646	Associative law for conjunction applied to antecedent (eliminates syllogism). (Contributed by NM, 15-Nov-2002.)
|- ( ( ph /\ ( ps /\ ch ) ) -> th )   =>    |- ( ( ( ph /\ ps ) /\ ch ) -> th )
Theorem	anass 647	Associative law for conjunction. Theorem *4.32 of [WhiteheadRussell] p. 118. (Contributed by NM, 21-Jun-1993.) (Proof shortened by Wolf Lammen, 24-Nov-2012.)
|- ( ( ( ph /\ ps ) /\ ch ) <-> ( ph /\ ( ps /\ ch ) ) )
Theorem	sylanl1 648	A syllogism inference. (Contributed by NM, 10-Mar-2005.)
|- ( ph -> ps )   &    |- ( ( ( ps /\ ch ) /\ th ) -> ta )   =>    |- ( ( ( ph /\ ch ) /\ th ) -> ta )
Theorem	sylanl2 649	A syllogism inference. (Contributed by NM, 1-Jan-2005.)
|- ( ph -> ch )   &    |- ( ( ( ps /\ ch ) /\ th ) -> ta )   =>    |- ( ( ( ps /\ ph ) /\ th ) -> ta )
Theorem	sylanr1 650	A syllogism inference. (Contributed by NM, 9-Apr-2005.)
|- ( ph -> ch )   &    |- ( ( ps /\ ( ch /\ th ) ) -> ta )   =>    |- ( ( ps /\ ( ph /\ th ) ) -> ta )
Theorem	sylanr2 651	A syllogism inference. (Contributed by NM, 9-Apr-2005.)
|- ( ph -> th )   &    |- ( ( ps /\ ( ch /\ th ) ) -> ta )   =>    |- ( ( ps /\ ( ch /\ ph ) ) -> ta )
Theorem	sylani 652	A syllogism inference. (Contributed by NM, 2-May-1996.)
|- ( ph -> ch )   &    |- ( ps -> ( ( ch /\ th ) -> ta ) )   =>    |- ( ps -> ( ( ph /\ th ) -> ta ) )
Theorem	sylan2i 653	A syllogism inference. (Contributed by NM, 1-Aug-1994.)
|- ( ph -> th )   &    |- ( ps -> ( ( ch /\ th ) -> ta ) )   =>    |- ( ps -> ( ( ch /\ ph ) -> ta ) )
Theorem	syl2ani 654	A syllogism inference. (Contributed by NM, 3-Aug-1999.)
|- ( ph -> ch )   &    |- ( et -> th )   &    |- ( ps -> ( ( ch /\ th ) -> ta ) )   =>    |- ( ps -> ( ( ph /\ et ) -> ta ) )
Theorem	sylan9 655	Nested syllogism inference conjoining dissimilar antecedents. (Contributed by NM, 14-May-1993.) (Proof shortened by Andrew Salmon, 7-May-2011.)
|- ( ph -> ( ps -> ch ) )   &    |- ( th -> ( ch -> ta ) )   =>    |- ( ( ph /\ th ) -> ( ps -> ta ) )
Theorem	sylan9r 656	Nested syllogism inference conjoining dissimilar antecedents. (Contributed by NM, 14-May-1993.)
|- ( ph -> ( ps -> ch ) )   &    |- ( th -> ( ch -> ta ) )   =>    |- ( ( th /\ ph ) -> ( ps -> ta ) )
Theorem	mtand 657	A modus tollens deduction. (Contributed by Jeff Hankins, 19-Aug-2009.)
|- ( ph -> -. ch )   &    |- ( ( ph /\ ps ) -> ch )   =>    |- ( ph -> -. ps )
Theorem	mtord 658	A modus tollens deduction involving disjunction. (Contributed by Jeff Hankins, 15-Jul-2009.)
|- ( ph -> -. ch )   &    |- ( ph -> -. th )   &    |- ( ph -> ( ps -> ( ch \/ th ) ) )   =>    |- ( ph -> -. ps )
Theorem	syl2anc 659	Syllogism inference combined with contraction. (Contributed by NM, 16-Mar-2012.)
|- ( ph -> ps )   &    |- ( ph -> ch )   &    |- ( ( ps /\ ch ) -> th )   =>    |- ( ph -> th )
Theorem	sylancl 660	Syllogism inference combined with modus ponens. (Contributed by Jeff Madsen, 2-Sep-2009.)
|- ( ph -> ps )   &    |- ch   &    |- ( ( ps /\ ch ) -> th )   =>    |- ( ph -> th )
Theorem	sylancr 661	Syllogism inference combined with modus ponens. (Contributed by Jeff Madsen, 2-Sep-2009.)
|- ps   &    |- ( ph -> ch )   &    |- ( ( ps /\ ch ) -> th )   =>    |- ( ph -> th )
Theorem	sylanbrc 662	Syllogism inference. (Contributed by Jeff Madsen, 2-Sep-2009.)
|- ( ph -> ps )   &    |- ( ph -> ch )   &    |- ( th <-> ( ps /\ ch ) )   =>    |- ( ph -> th )
Theorem	sylancb 663	A syllogism inference combined with contraction. (Contributed by NM, 3-Sep-2004.)
|- ( ph <-> ps )   &    |- ( ph <-> ch )   &    |- ( ( ps /\ ch ) -> th )   =>    |- ( ph -> th )
Theorem	sylancbr 664	A syllogism inference combined with contraction. (Contributed by NM, 3-Sep-2004.)
|- ( ps <-> ph )   &    |- ( ch <-> ph )   &    |- ( ( ps /\ ch ) -> th )   =>    |- ( ph -> th )
Theorem	sylancom 665	Syllogism inference with commutation of antecedents. (Contributed by NM, 2-Jul-2008.)
|- ( ( ph /\ ps ) -> ch )   &    |- ( ( ch /\ ps ) -> th )   =>    |- ( ( ph /\ ps ) -> th )
Theorem	mpdan 666	An inference based on modus ponens. (Contributed by NM, 23-May-1999.) (Proof shortened by Wolf Lammen, 22-Nov-2012.)
|- ( ph -> ps )   &    |- ( ( ph /\ ps ) -> ch )   =>    |- ( ph -> ch )
Theorem	mpancom 667	An inference based on modus ponens with commutation of antecedents. (Contributed by NM, 28-Oct-2003.) (Proof shortened by Wolf Lammen, 7-Apr-2013.)
|- ( ps -> ph )   &    |- ( ( ph /\ ps ) -> ch )   =>    |- ( ps -> ch )
Theorem	mpan 668	An inference based on modus ponens. (Contributed by NM, 30-Aug-1993.) (Proof shortened by Wolf Lammen, 7-Apr-2013.)
|- ph   &    |- ( ( ph /\ ps ) -> ch )   =>    |- ( ps -> ch )
Theorem	mpan2 669	An inference based on modus ponens. (Contributed by NM, 16-Sep-1993.) (Proof shortened by Wolf Lammen, 19-Nov-2012.)
|- ps   &    |- ( ( ph /\ ps ) -> ch )   =>    |- ( ph -> ch )
Theorem	mp2an 670	An inference based on modus ponens. (Contributed by NM, 13-Apr-1995.)
|- ph   &    |- ps   &    |- ( ( ph /\ ps ) -> ch )   =>    |- ch
Theorem	mp4an 671	An inference based on modus ponens. (Contributed by Jeff Madsen, 15-Jun-2010.)
|- ph   &    |- ps   &    |- ch   &    |- th   &    |- ( ( ( ph /\ ps ) /\ ( ch /\ th ) ) -> ta )   =>    |- ta
Theorem	mpan2d 672	A deduction based on modus ponens. (Contributed by NM, 12-Dec-2004.)
|- ( ph -> ch )   &    |- ( ph -> ( ( ps /\ ch ) -> th ) )   =>    |- ( ph -> ( ps -> th ) )
Theorem	mpand 673	A deduction based on modus ponens. (Contributed by NM, 12-Dec-2004.) (Proof shortened by Wolf Lammen, 7-Apr-2013.)
|- ( ph -> ps )   &    |- ( ph -> ( ( ps /\ ch ) -> th ) )   =>    |- ( ph -> ( ch -> th ) )
Theorem	mpani 674	An inference based on modus ponens. (Contributed by NM, 10-Apr-1994.) (Proof shortened by Wolf Lammen, 19-Nov-2012.)
|- ps   &    |- ( ph -> ( ( ps /\ ch ) -> th ) )   =>    |- ( ph -> ( ch -> th ) )
Theorem	mpan2i 675	An inference based on modus ponens. (Contributed by NM, 10-Apr-1994.) (Proof shortened by Wolf Lammen, 19-Nov-2012.)
|- ch   &    |- ( ph -> ( ( ps /\ ch ) -> th ) )   =>    |- ( ph -> ( ps -> th ) )
Theorem	mp2ani 676	An inference based on modus ponens. (Contributed by NM, 12-Dec-2004.)
|- ps   &    |- ch   &    |- ( ph -> ( ( ps /\ ch ) -> th ) )   =>    |- ( ph -> th )
Theorem	mp2and 677	A deduction based on modus ponens. (Contributed by NM, 12-Dec-2004.)
|- ( ph -> ps )   &    |- ( ph -> ch )   &    |- ( ph -> ( ( ps /\ ch ) -> th ) )   =>    |- ( ph -> th )
Theorem	mpanl1 678	An inference based on modus ponens. (Contributed by NM, 16-Aug-1994.) (Proof shortened by Wolf Lammen, 7-Apr-2013.)
|- ph   &    |- ( ( ( ph /\ ps ) /\ ch ) -> th )   =>    |- ( ( ps /\ ch ) -> th )
Theorem	mpanl2 679	An inference based on modus ponens. (Contributed by NM, 16-Aug-1994.) (Proof shortened by Andrew Salmon, 7-May-2011.)
|- ps   &    |- ( ( ( ph /\ ps ) /\ ch ) -> th )   =>    |- ( ( ph /\ ch ) -> th )
Theorem	mpanl12 680	An inference based on modus ponens. (Contributed by NM, 13-Jul-2005.)
|- ph   &    |- ps   &    |- ( ( ( ph /\ ps ) /\ ch ) -> th )   =>    |- ( ch -> th )
Theorem	mpanr1 681	An inference based on modus ponens. (Contributed by NM, 3-May-1994.) (Proof shortened by Andrew Salmon, 7-May-2011.)
|- ps   &    |- ( ( ph /\ ( ps /\ ch ) ) -> th )   =>    |- ( ( ph /\ ch ) -> th )
Theorem	mpanr2 682	An inference based on modus ponens. (Contributed by NM, 3-May-1994.) (Proof shortened by Andrew Salmon, 7-May-2011.) (Proof shortened by Wolf Lammen, 7-Apr-2013.)
|- ch   &    |- ( ( ph /\ ( ps /\ ch ) ) -> th )   =>    |- ( ( ph /\ ps ) -> th )
Theorem	mpanr12 683	An inference based on modus ponens. (Contributed by NM, 24-Jul-2009.)
|- ps   &    |- ch   &    |- ( ( ph /\ ( ps /\ ch ) ) -> th )   =>    |- ( ph -> th )
Theorem	mpanlr1 684	An inference based on modus ponens. (Contributed by NM, 30-Dec-2004.) (Proof shortened by Wolf Lammen, 7-Apr-2013.)
|- ps   &    |- ( ( ( ph /\ ( ps /\ ch ) ) /\ th ) -> ta )   =>    |- ( ( ( ph /\ ch ) /\ th ) -> ta )
Theorem	pm5.74da 685	Distribution of implication over biconditional (deduction rule). (Contributed by NM, 4-May-2007.)
|- ( ( ph /\ ps ) -> ( ch <-> th ) )   =>    |- ( ph -> ( ( ps -> ch ) <-> ( ps -> th ) ) )
Theorem	pm4.45 686	Theorem *4.45 of [WhiteheadRussell] p. 119. (Contributed by NM, 3-Jan-2005.)
|- ( ph <-> ( ph /\ ( ph \/ ps ) ) )
Theorem	imdistan 687	Distribution of implication with conjunction. (Contributed by NM, 31-May-1999.) (Proof shortened by Wolf Lammen, 6-Dec-2012.)
|- ( ( ph -> ( ps -> ch ) ) <-> ( ( ph /\ ps ) -> ( ph /\ ch ) ) )
Theorem	imdistani 688	Distribution of implication with conjunction. (Contributed by NM, 1-Aug-1994.)
|- ( ph -> ( ps -> ch ) )   =>    |- ( ( ph /\ ps ) -> ( ph /\ ch ) )
Theorem	imdistanri 689	Distribution of implication with conjunction. (Contributed by NM, 8-Jan-2002.)
|- ( ph -> ( ps -> ch ) )   =>    |- ( ( ps /\ ph ) -> ( ch /\ ph ) )
Theorem	imdistand 690	Distribution of implication with conjunction (deduction rule). (Contributed by NM, 27-Aug-2004.)
|- ( ph -> ( ps -> ( ch -> th ) ) )   =>    |- ( ph -> ( ( ps /\ ch ) -> ( ps /\ th ) ) )
Theorem	imdistanda 691	Distribution of implication with conjunction (deduction version with conjoined antecedent). (Contributed by Jeff Madsen, 19-Jun-2011.)
|- ( ( ph /\ ps ) -> ( ch -> th ) )   =>    |- ( ph -> ( ( ps /\ ch ) -> ( ps /\ th ) ) )
Theorem	anbi2i 692	Introduce a left conjunct to both sides of a logical equivalence. (Contributed by NM, 3-Jan-1993.) (Proof shortened by Wolf Lammen, 16-Nov-2013.)
|- ( ph <-> ps )   =>    |- ( ( ch /\ ph ) <-> ( ch /\ ps ) )
Theorem	anbi1i 693	Introduce a right conjunct to both sides of a logical equivalence. (Contributed by NM, 12-Mar-1993.) (Proof shortened by Wolf Lammen, 16-Nov-2013.)
|- ( ph <-> ps )   =>    |- ( ( ph /\ ch ) <-> ( ps /\ ch ) )
Theorem	anbi2ci 694	Variant of anbi2i 692 with commutation. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (Proof shortened by Andrew Salmon, 14-Jun-2011.)
|- ( ph <-> ps )   =>    |- ( ( ph /\ ch ) <-> ( ch /\ ps ) )
Theorem	anbi12i 695	Conjoin both sides of two equivalences. (Contributed by NM, 12-Mar-1993.)
|- ( ph <-> ps )   &    |- ( ch <-> th )   =>    |- ( ( ph /\ ch ) <-> ( ps /\ th ) )
Theorem	anbi12ci 696	Variant of anbi12i 695 with commutation. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.)
|- ( ph <-> ps )   &    |- ( ch <-> th )   =>    |- ( ( ph /\ ch ) <-> ( th /\ ps ) )
Theorem	sylan9bb 697	Nested syllogism inference conjoining dissimilar antecedents. (Contributed by NM, 4-Mar-1995.)
|- ( ph -> ( ps <-> ch ) )   &    |- ( th -> ( ch <-> ta ) )   =>    |- ( ( ph /\ th ) -> ( ps <-> ta ) )
Theorem	sylan9bbr 698	Nested syllogism inference conjoining dissimilar antecedents. (Contributed by NM, 4-Mar-1995.)
|- ( ph -> ( ps <-> ch ) )   &    |- ( th -> ( ch <-> ta ) )   =>    |- ( ( th /\ ph ) -> ( ps <-> ta ) )
Theorem	orbi2d 699	Deduction adding a left disjunct to both sides of a logical equivalence. (Contributed by NM, 21-Jun-1993.)
|- ( ph -> ( ps <-> ch ) )   =>    |- ( ph -> ( ( th \/ ps ) <-> ( th \/ ch ) ) )
Theorem	orbi1d 700	Deduction adding a right disjunct to both sides of a logical equivalence. (Contributed by NM, 21-Jun-1993.)
|- ( ph -> ( ps <-> ch ) )   =>    |- ( ph -> ( ( ps \/ th ) <-> ( ch \/ th ) ) )