HomeHome Intuitionistic Logic Explorer
Theorem List (p. 5 of 102)
< Previous  Next >
Bad symbols? Try the
GIF version.

Mirrors  >  Metamath Home Page  >  ILE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Theorem List for Intuitionistic Logic Explorer - 401-500   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremmpan2 401 An inference based on modus ponens. (Contributed by NM, 16-Sep-1993.) (Proof shortened by Wolf Lammen, 19-Nov-2012.)
𝜓    &   ((𝜑𝜓) → 𝜒)       (𝜑𝜒)
 
Theoremmp2an 402 An inference based on modus ponens. (Contributed by NM, 13-Apr-1995.)
𝜑    &   𝜓    &   ((𝜑𝜓) → 𝜒)       𝜒
 
Theoremmp4an 403 An inference based on modus ponens. (Contributed by Jeff Madsen, 15-Jun-2011.)
𝜑    &   𝜓    &   𝜒    &   𝜃    &   (((𝜑𝜓) ∧ (𝜒𝜃)) → 𝜏)       𝜏
 
Theoremmpan2d 404 A deduction based on modus ponens. (Contributed by NM, 12-Dec-2004.)
(𝜑𝜒)    &   (𝜑 → ((𝜓𝜒) → 𝜃))       (𝜑 → (𝜓𝜃))
 
Theoremmpand 405 A deduction based on modus ponens. (Contributed by NM, 12-Dec-2004.) (Proof shortened by Wolf Lammen, 7-Apr-2013.)
(𝜑𝜓)    &   (𝜑 → ((𝜓𝜒) → 𝜃))       (𝜑 → (𝜒𝜃))
 
Theoremmpani 406 An inference based on modus ponens. (Contributed by NM, 10-Apr-1994.) (Proof shortened by Wolf Lammen, 19-Nov-2012.)
𝜓    &   (𝜑 → ((𝜓𝜒) → 𝜃))       (𝜑 → (𝜒𝜃))
 
Theoremmpan2i 407 An inference based on modus ponens. (Contributed by NM, 10-Apr-1994.) (Proof shortened by Wolf Lammen, 19-Nov-2012.)
𝜒    &   (𝜑 → ((𝜓𝜒) → 𝜃))       (𝜑 → (𝜓𝜃))
 
Theoremmp2ani 408 An inference based on modus ponens. (Contributed by NM, 12-Dec-2004.)
𝜓    &   𝜒    &   (𝜑 → ((𝜓𝜒) → 𝜃))       (𝜑𝜃)
 
Theoremmp2and 409 A deduction based on modus ponens. (Contributed by NM, 12-Dec-2004.)
(𝜑𝜓)    &   (𝜑𝜒)    &   (𝜑 → ((𝜓𝜒) → 𝜃))       (𝜑𝜃)
 
Theoremmpanl1 410 An inference based on modus ponens. (Contributed by NM, 16-Aug-1994.) (Proof shortened by Wolf Lammen, 7-Apr-2013.)
𝜑    &   (((𝜑𝜓) ∧ 𝜒) → 𝜃)       ((𝜓𝜒) → 𝜃)
 
Theoremmpanl2 411 An inference based on modus ponens. (Contributed by NM, 16-Aug-1994.) (Proof shortened by Andrew Salmon, 7-May-2011.)
𝜓    &   (((𝜑𝜓) ∧ 𝜒) → 𝜃)       ((𝜑𝜒) → 𝜃)
 
Theoremmpanl12 412 An inference based on modus ponens. (Contributed by NM, 13-Jul-2005.)
𝜑    &   𝜓    &   (((𝜑𝜓) ∧ 𝜒) → 𝜃)       (𝜒𝜃)
 
Theoremmpanr1 413 An inference based on modus ponens. (Contributed by NM, 3-May-1994.) (Proof shortened by Andrew Salmon, 7-May-2011.)
𝜓    &   ((𝜑 ∧ (𝜓𝜒)) → 𝜃)       ((𝜑𝜒) → 𝜃)
 
Theoremmpanr2 414 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.)
𝜒    &   ((𝜑 ∧ (𝜓𝜒)) → 𝜃)       ((𝜑𝜓) → 𝜃)
 
Theoremmpanr12 415 An inference based on modus ponens. (Contributed by NM, 24-Jul-2009.)
𝜓    &   𝜒    &   ((𝜑 ∧ (𝜓𝜒)) → 𝜃)       (𝜑𝜃)
 
Theoremmpanlr1 416 An inference based on modus ponens. (Contributed by NM, 30-Dec-2004.) (Proof shortened by Wolf Lammen, 7-Apr-2013.)
𝜓    &   (((𝜑 ∧ (𝜓𝜒)) ∧ 𝜃) → 𝜏)       (((𝜑𝜒) ∧ 𝜃) → 𝜏)
 
Theorempm5.74da 417 Distribution of implication over biconditional (deduction rule). (Contributed by NM, 4-May-2007.)
((𝜑𝜓) → (𝜒𝜃))       (𝜑 → ((𝜓𝜒) ↔ (𝜓𝜃)))
 
Theoremimdistan 418 Distribution of implication with conjunction. (Contributed by NM, 31-May-1999.) (Proof shortened by Wolf Lammen, 6-Dec-2012.)
((𝜑 → (𝜓𝜒)) ↔ ((𝜑𝜓) → (𝜑𝜒)))
 
Theoremimdistani 419 Distribution of implication with conjunction. (Contributed by NM, 1-Aug-1994.)
(𝜑 → (𝜓𝜒))       ((𝜑𝜓) → (𝜑𝜒))
 
Theoremimdistanri 420 Distribution of implication with conjunction. (Contributed by NM, 8-Jan-2002.)
(𝜑 → (𝜓𝜒))       ((𝜓𝜑) → (𝜒𝜑))
 
Theoremimdistand 421 Distribution of implication with conjunction (deduction rule). (Contributed by NM, 27-Aug-2004.)
(𝜑 → (𝜓 → (𝜒𝜃)))       (𝜑 → ((𝜓𝜒) → (𝜓𝜃)))
 
Theoremimdistanda 422 Distribution of implication with conjunction (deduction version with conjoined antecedent). (Contributed by Jeff Madsen, 19-Jun-2011.)
((𝜑𝜓) → (𝜒𝜃))       (𝜑 → ((𝜓𝜒) → (𝜓𝜃)))
 
Theorempm5.32d 423 Distribution of implication over biconditional (deduction rule). (Contributed by NM, 29-Oct-1996.) (Revised by NM, 31-Jan-2015.)
(𝜑 → (𝜓 → (𝜒𝜃)))       (𝜑 → ((𝜓𝜒) ↔ (𝜓𝜃)))
 
Theorempm5.32rd 424 Distribution of implication over biconditional (deduction rule). (Contributed by NM, 25-Dec-2004.)
(𝜑 → (𝜓 → (𝜒𝜃)))       (𝜑 → ((𝜒𝜓) ↔ (𝜃𝜓)))
 
Theorempm5.32da 425 Distribution of implication over biconditional (deduction rule). (Contributed by NM, 9-Dec-2006.)
((𝜑𝜓) → (𝜒𝜃))       (𝜑 → ((𝜓𝜒) ↔ (𝜓𝜃)))
 
Theorempm5.32 426 Distribution of implication over biconditional. Theorem *5.32 of [WhiteheadRussell] p. 125. (Contributed by NM, 1-Aug-1994.) (Revised by NM, 31-Jan-2015.)
((𝜑 → (𝜓𝜒)) ↔ ((𝜑𝜓) ↔ (𝜑𝜒)))
 
Theorempm5.32i 427 Distribution of implication over biconditional (inference rule). (Contributed by NM, 1-Aug-1994.)
(𝜑 → (𝜓𝜒))       ((𝜑𝜓) ↔ (𝜑𝜒))
 
Theorempm5.32ri 428 Distribution of implication over biconditional (inference rule). (Contributed by NM, 12-Mar-1995.)
(𝜑 → (𝜓𝜒))       ((𝜓𝜑) ↔ (𝜒𝜑))
 
Theorembiadan2 429 Add a conjunction to an equivalence. (Contributed by Jeff Madsen, 20-Jun-2011.)
(𝜑𝜓)    &   (𝜓 → (𝜑𝜒))       (𝜑 ↔ (𝜓𝜒))
 
Theoremanbi2i 430 Introduce a left conjunct to both sides of a logical equivalence. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 16-Nov-2013.)
(𝜑𝜓)       ((𝜒𝜑) ↔ (𝜒𝜓))
 
Theoremanbi1i 431 Introduce a right conjunct to both sides of a logical equivalence. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 16-Nov-2013.)
(𝜑𝜓)       ((𝜑𝜒) ↔ (𝜓𝜒))
 
Theoremanbi2ci 432 Variant of anbi2i 430 with commutation. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (Proof shortened by Andrew Salmon, 14-Jun-2011.)
(𝜑𝜓)       ((𝜑𝜒) ↔ (𝜒𝜓))
 
Theoremanbi12i 433 Conjoin both sides of two equivalences. (Contributed by NM, 5-Aug-1993.)
(𝜑𝜓)    &   (𝜒𝜃)       ((𝜑𝜒) ↔ (𝜓𝜃))
 
Theoremanbi12ci 434 Variant of anbi12i 433 with commutation. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.)
(𝜑𝜓)    &   (𝜒𝜃)       ((𝜑𝜒) ↔ (𝜃𝜓))
 
Theoremsylan9bb 435 Nested syllogism inference conjoining dissimilar antecedents. (Contributed by NM, 4-Mar-1995.)
(𝜑 → (𝜓𝜒))    &   (𝜃 → (𝜒𝜏))       ((𝜑𝜃) → (𝜓𝜏))
 
Theoremsylan9bbr 436 Nested syllogism inference conjoining dissimilar antecedents. (Contributed by NM, 4-Mar-1995.)
(𝜑 → (𝜓𝜒))    &   (𝜃 → (𝜒𝜏))       ((𝜃𝜑) → (𝜓𝜏))
 
Theoremanbi2d 437 Deduction adding a left conjunct to both sides of a logical equivalence. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 16-Nov-2013.)
(𝜑 → (𝜓𝜒))       (𝜑 → ((𝜃𝜓) ↔ (𝜃𝜒)))
 
Theoremanbi1d 438 Deduction adding a right conjunct to both sides of a logical equivalence. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 16-Nov-2013.)
(𝜑 → (𝜓𝜒))       (𝜑 → ((𝜓𝜃) ↔ (𝜒𝜃)))
 
Theoremanbi1 439 Introduce a right conjunct to both sides of a logical equivalence. Theorem *4.36 of [WhiteheadRussell] p. 118. (Contributed by NM, 3-Jan-2005.)
((𝜑𝜓) → ((𝜑𝜒) ↔ (𝜓𝜒)))
 
Theoremanbi2 440 Introduce a left conjunct to both sides of a logical equivalence. (Contributed by NM, 16-Nov-2013.)
((𝜑𝜓) → ((𝜒𝜑) ↔ (𝜒𝜓)))
 
Theorembitr 441 Theorem *4.22 of [WhiteheadRussell] p. 117. (Contributed by NM, 3-Jan-2005.)
(((𝜑𝜓) ∧ (𝜓𝜒)) → (𝜑𝜒))
 
Theoremanbi12d 442 Deduction joining two equivalences to form equivalence of conjunctions. (Contributed by NM, 5-Aug-1993.)
(𝜑 → (𝜓𝜒))    &   (𝜑 → (𝜃𝜏))       (𝜑 → ((𝜓𝜃) ↔ (𝜒𝜏)))
 
Theoremmpan10 443 Modus ponens mixed with several conjunctions. (Contributed by Jim Kingdon, 7-Jan-2018.)
((((𝜑𝜓) ∧ 𝜒) ∧ 𝜑) → (𝜓𝜒))
 
Theorempm5.3 444 Theorem *5.3 of [WhiteheadRussell] p. 125. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Andrew Salmon, 7-May-2011.)
(((𝜑𝜓) → 𝜒) ↔ ((𝜑𝜓) → (𝜑𝜒)))
 
Theoremadantll 445 Deduction adding a conjunct to antecedent. (Contributed by NM, 4-May-1994.) (Proof shortened by Wolf Lammen, 24-Nov-2012.)
((𝜑𝜓) → 𝜒)       (((𝜃𝜑) ∧ 𝜓) → 𝜒)
 
Theoremadantlr 446 Deduction adding a conjunct to antecedent. (Contributed by NM, 4-May-1994.) (Proof shortened by Wolf Lammen, 24-Nov-2012.)
((𝜑𝜓) → 𝜒)       (((𝜑𝜃) ∧ 𝜓) → 𝜒)
 
Theoremadantrl 447 Deduction adding a conjunct to antecedent. (Contributed by NM, 4-May-1994.) (Proof shortened by Wolf Lammen, 24-Nov-2012.)
((𝜑𝜓) → 𝜒)       ((𝜑 ∧ (𝜃𝜓)) → 𝜒)
 
Theoremadantrr 448 Deduction adding a conjunct to antecedent. (Contributed by NM, 4-May-1994.) (Proof shortened by Wolf Lammen, 24-Nov-2012.)
((𝜑𝜓) → 𝜒)       ((𝜑 ∧ (𝜓𝜃)) → 𝜒)
 
Theoremadantlll 449 Deduction adding a conjunct to antecedent. (Contributed by NM, 26-Dec-2004.) (Proof shortened by Wolf Lammen, 2-Dec-2012.)
(((𝜑𝜓) ∧ 𝜒) → 𝜃)       ((((𝜏𝜑) ∧ 𝜓) ∧ 𝜒) → 𝜃)
 
Theoremadantllr 450 Deduction adding a conjunct to antecedent. (Contributed by NM, 26-Dec-2004.) (Proof shortened by Wolf Lammen, 4-Dec-2012.)
(((𝜑𝜓) ∧ 𝜒) → 𝜃)       ((((𝜑𝜏) ∧ 𝜓) ∧ 𝜒) → 𝜃)
 
Theoremadantlrl 451 Deduction adding a conjunct to antecedent. (Contributed by NM, 26-Dec-2004.) (Proof shortened by Wolf Lammen, 4-Dec-2012.)
(((𝜑𝜓) ∧ 𝜒) → 𝜃)       (((𝜑 ∧ (𝜏𝜓)) ∧ 𝜒) → 𝜃)
 
Theoremadantlrr 452 Deduction adding a conjunct to antecedent. (Contributed by NM, 26-Dec-2004.) (Proof shortened by Wolf Lammen, 4-Dec-2012.)
(((𝜑𝜓) ∧ 𝜒) → 𝜃)       (((𝜑 ∧ (𝜓𝜏)) ∧ 𝜒) → 𝜃)
 
Theoremadantrll 453 Deduction adding a conjunct to antecedent. (Contributed by NM, 26-Dec-2004.) (Proof shortened by Wolf Lammen, 4-Dec-2012.)
((𝜑 ∧ (𝜓𝜒)) → 𝜃)       ((𝜑 ∧ ((𝜏𝜓) ∧ 𝜒)) → 𝜃)
 
Theoremadantrlr 454 Deduction adding a conjunct to antecedent. (Contributed by NM, 26-Dec-2004.) (Proof shortened by Wolf Lammen, 4-Dec-2012.)
((𝜑 ∧ (𝜓𝜒)) → 𝜃)       ((𝜑 ∧ ((𝜓𝜏) ∧ 𝜒)) → 𝜃)
 
Theoremadantrrl 455 Deduction adding a conjunct to antecedent. (Contributed by NM, 26-Dec-2004.) (Proof shortened by Wolf Lammen, 4-Dec-2012.)
((𝜑 ∧ (𝜓𝜒)) → 𝜃)       ((𝜑 ∧ (𝜓 ∧ (𝜏𝜒))) → 𝜃)
 
Theoremadantrrr 456 Deduction adding a conjunct to antecedent. (Contributed by NM, 26-Dec-2004.) (Proof shortened by Wolf Lammen, 4-Dec-2012.)
((𝜑 ∧ (𝜓𝜒)) → 𝜃)       ((𝜑 ∧ (𝜓 ∧ (𝜒𝜏))) → 𝜃)
 
Theoremad2antrr 457 Deduction adding two conjuncts to antecedent. (Contributed by NM, 19-Oct-1999.) (Proof shortened by Wolf Lammen, 20-Nov-2012.)
(𝜑𝜓)       (((𝜑𝜒) ∧ 𝜃) → 𝜓)
 
Theoremad2antlr 458 Deduction adding two conjuncts to antecedent. (Contributed by NM, 19-Oct-1999.) (Proof shortened by Wolf Lammen, 20-Nov-2012.)
(𝜑𝜓)       (((𝜒𝜑) ∧ 𝜃) → 𝜓)
 
Theoremad2antrl 459 Deduction adding two conjuncts to antecedent. (Contributed by NM, 19-Oct-1999.)
(𝜑𝜓)       ((𝜒 ∧ (𝜑𝜃)) → 𝜓)
 
Theoremad2antll 460 Deduction adding conjuncts to antecedent. (Contributed by NM, 19-Oct-1999.)
(𝜑𝜓)       ((𝜒 ∧ (𝜃𝜑)) → 𝜓)
 
Theoremad3antrrr 461 Deduction adding three conjuncts to antecedent. (Contributed by NM, 28-Jul-2012.)
(𝜑𝜓)       ((((𝜑𝜒) ∧ 𝜃) ∧ 𝜏) → 𝜓)
 
Theoremad3antlr 462 Deduction adding three conjuncts to antecedent. (Contributed by Mario Carneiro, 5-Jan-2017.)
(𝜑𝜓)       ((((𝜒𝜑) ∧ 𝜃) ∧ 𝜏) → 𝜓)
 
Theoremad4antr 463 Deduction adding 4 conjuncts to antecedent. (Contributed by Mario Carneiro, 4-Jan-2017.)
(𝜑𝜓)       (((((𝜑𝜒) ∧ 𝜃) ∧ 𝜏) ∧ 𝜂) → 𝜓)
 
Theoremad4antlr 464 Deduction adding 4 conjuncts to antecedent. (Contributed by Mario Carneiro, 5-Jan-2017.)
(𝜑𝜓)       (((((𝜒𝜑) ∧ 𝜃) ∧ 𝜏) ∧ 𝜂) → 𝜓)
 
Theoremad5antr 465 Deduction adding 5 conjuncts to antecedent. (Contributed by Mario Carneiro, 4-Jan-2017.)
(𝜑𝜓)       ((((((𝜑𝜒) ∧ 𝜃) ∧ 𝜏) ∧ 𝜂) ∧ 𝜁) → 𝜓)
 
Theoremad5antlr 466 Deduction adding 5 conjuncts to antecedent. (Contributed by Mario Carneiro, 5-Jan-2017.)
(𝜑𝜓)       ((((((𝜒𝜑) ∧ 𝜃) ∧ 𝜏) ∧ 𝜂) ∧ 𝜁) → 𝜓)
 
Theoremad6antr 467 Deduction adding 6 conjuncts to antecedent. (Contributed by Mario Carneiro, 4-Jan-2017.)
(𝜑𝜓)       (((((((𝜑𝜒) ∧ 𝜃) ∧ 𝜏) ∧ 𝜂) ∧ 𝜁) ∧ 𝜎) → 𝜓)
 
Theoremad6antlr 468 Deduction adding 6 conjuncts to antecedent. (Contributed by Mario Carneiro, 5-Jan-2017.)
(𝜑𝜓)       (((((((𝜒𝜑) ∧ 𝜃) ∧ 𝜏) ∧ 𝜂) ∧ 𝜁) ∧ 𝜎) → 𝜓)
 
Theoremad7antr 469 Deduction adding 7 conjuncts to antecedent. (Contributed by Mario Carneiro, 4-Jan-2017.)
(𝜑𝜓)       ((((((((𝜑𝜒) ∧ 𝜃) ∧ 𝜏) ∧ 𝜂) ∧ 𝜁) ∧ 𝜎) ∧ 𝜌) → 𝜓)
 
Theoremad7antlr 470 Deduction adding 7 conjuncts to antecedent. (Contributed by Mario Carneiro, 5-Jan-2017.)
(𝜑𝜓)       ((((((((𝜒𝜑) ∧ 𝜃) ∧ 𝜏) ∧ 𝜂) ∧ 𝜁) ∧ 𝜎) ∧ 𝜌) → 𝜓)
 
Theoremad8antr 471 Deduction adding 8 conjuncts to antecedent. (Contributed by Mario Carneiro, 4-Jan-2017.)
(𝜑𝜓)       (((((((((𝜑𝜒) ∧ 𝜃) ∧ 𝜏) ∧ 𝜂) ∧ 𝜁) ∧ 𝜎) ∧ 𝜌) ∧ 𝜇) → 𝜓)
 
Theoremad8antlr 472 Deduction adding 8 conjuncts to antecedent. (Contributed by Mario Carneiro, 5-Jan-2017.)
(𝜑𝜓)       (((((((((𝜒𝜑) ∧ 𝜃) ∧ 𝜏) ∧ 𝜂) ∧ 𝜁) ∧ 𝜎) ∧ 𝜌) ∧ 𝜇) → 𝜓)
 
Theoremad9antr 473 Deduction adding 9 conjuncts to antecedent. (Contributed by Mario Carneiro, 4-Jan-2017.)
(𝜑𝜓)       ((((((((((𝜑𝜒) ∧ 𝜃) ∧ 𝜏) ∧ 𝜂) ∧ 𝜁) ∧ 𝜎) ∧ 𝜌) ∧ 𝜇) ∧ 𝜆) → 𝜓)
 
Theoremad9antlr 474 Deduction adding 9 conjuncts to antecedent. (Contributed by Mario Carneiro, 5-Jan-2017.)
(𝜑𝜓)       ((((((((((𝜒𝜑) ∧ 𝜃) ∧ 𝜏) ∧ 𝜂) ∧ 𝜁) ∧ 𝜎) ∧ 𝜌) ∧ 𝜇) ∧ 𝜆) → 𝜓)
 
Theoremad10antr 475 Deduction adding 10 conjuncts to antecedent. (Contributed by Mario Carneiro, 4-Jan-2017.)
(𝜑𝜓)       (((((((((((𝜑𝜒) ∧ 𝜃) ∧ 𝜏) ∧ 𝜂) ∧ 𝜁) ∧ 𝜎) ∧ 𝜌) ∧ 𝜇) ∧ 𝜆) ∧ 𝜅) → 𝜓)
 
Theoremad10antlr 476 Deduction adding 10 conjuncts to antecedent. (Contributed by Mario Carneiro, 5-Jan-2017.)
(𝜑𝜓)       (((((((((((𝜒𝜑) ∧ 𝜃) ∧ 𝜏) ∧ 𝜂) ∧ 𝜁) ∧ 𝜎) ∧ 𝜌) ∧ 𝜇) ∧ 𝜆) ∧ 𝜅) → 𝜓)
 
Theoremad2ant2l 477 Deduction adding two conjuncts to antecedent. (Contributed by NM, 8-Jan-2006.)
((𝜑𝜓) → 𝜒)       (((𝜃𝜑) ∧ (𝜏𝜓)) → 𝜒)
 
Theoremad2ant2r 478 Deduction adding two conjuncts to antecedent. (Contributed by NM, 8-Jan-2006.)
((𝜑𝜓) → 𝜒)       (((𝜑𝜃) ∧ (𝜓𝜏)) → 𝜒)
 
Theoremad2ant2lr 479 Deduction adding two conjuncts to antecedent. (Contributed by NM, 23-Nov-2007.)
((𝜑𝜓) → 𝜒)       (((𝜃𝜑) ∧ (𝜓𝜏)) → 𝜒)
 
Theoremad2ant2rl 480 Deduction adding two conjuncts to antecedent. (Contributed by NM, 24-Nov-2007.)
((𝜑𝜓) → 𝜒)       (((𝜑𝜃) ∧ (𝜏𝜓)) → 𝜒)
 
Theoremsimpll 481 Simplification of a conjunction. (Contributed by NM, 18-Mar-2007.)
(((𝜑𝜓) ∧ 𝜒) → 𝜑)
 
Theoremsimplr 482 Simplification of a conjunction. (Contributed by NM, 20-Mar-2007.)
(((𝜑𝜓) ∧ 𝜒) → 𝜓)
 
Theoremsimprl 483 Simplification of a conjunction. (Contributed by NM, 21-Mar-2007.)
((𝜑 ∧ (𝜓𝜒)) → 𝜓)
 
Theoremsimprr 484 Simplification of a conjunction. (Contributed by NM, 21-Mar-2007.)
((𝜑 ∧ (𝜓𝜒)) → 𝜒)
 
Theoremsimplll 485 Simplification of a conjunction. (Contributed by Jeff Hankins, 28-Jul-2009.)
((((𝜑𝜓) ∧ 𝜒) ∧ 𝜃) → 𝜑)
 
Theoremsimpllr 486 Simplification of a conjunction. (Contributed by Jeff Hankins, 28-Jul-2009.)
((((𝜑𝜓) ∧ 𝜒) ∧ 𝜃) → 𝜓)
 
Theoremsimplrl 487 Simplification of a conjunction. (Contributed by Jeff Hankins, 28-Jul-2009.)
(((𝜑 ∧ (𝜓𝜒)) ∧ 𝜃) → 𝜓)
 
Theoremsimplrr 488 Simplification of a conjunction. (Contributed by Jeff Hankins, 28-Jul-2009.)
(((𝜑 ∧ (𝜓𝜒)) ∧ 𝜃) → 𝜒)
 
Theoremsimprll 489 Simplification of a conjunction. (Contributed by Jeff Hankins, 28-Jul-2009.)
((𝜑 ∧ ((𝜓𝜒) ∧ 𝜃)) → 𝜓)
 
Theoremsimprlr 490 Simplification of a conjunction. (Contributed by Jeff Hankins, 28-Jul-2009.)
((𝜑 ∧ ((𝜓𝜒) ∧ 𝜃)) → 𝜒)
 
Theoremsimprrl 491 Simplification of a conjunction. (Contributed by Jeff Hankins, 28-Jul-2009.)
((𝜑 ∧ (𝜓 ∧ (𝜒𝜃))) → 𝜒)
 
Theoremsimprrr 492 Simplification of a conjunction. (Contributed by Jeff Hankins, 28-Jul-2009.)
((𝜑 ∧ (𝜓 ∧ (𝜒𝜃))) → 𝜃)
 
Theorempm4.87 493 Theorem *4.87 of [WhiteheadRussell] p. 122. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Eric Schmidt, 26-Oct-2006.)
(((((𝜑𝜓) → 𝜒) ↔ (𝜑 → (𝜓𝜒))) ∧ ((𝜑 → (𝜓𝜒)) ↔ (𝜓 → (𝜑𝜒)))) ∧ ((𝜓 → (𝜑𝜒)) ↔ ((𝜓𝜑) → 𝜒)))
 
Theoremabai 494 Introduce one conjunct as an antecedent to the other. "abai" stands for "and, biconditional, and, implication". (Contributed by NM, 12-Aug-1993.) (Proof shortened by Wolf Lammen, 7-Dec-2012.)
((𝜑𝜓) ↔ (𝜑 ∧ (𝜑𝜓)))
 
Theoreman12 495 Swap two conjuncts. Note that the first digit (1) in the label refers to the outer conjunct position, and the next digit (2) to the inner conjunct position. (Contributed by NM, 12-Mar-1995.)
((𝜑 ∧ (𝜓𝜒)) ↔ (𝜓 ∧ (𝜑𝜒)))
 
Theoreman32 496 A rearrangement of conjuncts. (Contributed by NM, 12-Mar-1995.) (Proof shortened by Wolf Lammen, 25-Dec-2012.)
(((𝜑𝜓) ∧ 𝜒) ↔ ((𝜑𝜒) ∧ 𝜓))
 
Theoreman13 497 A rearrangement of conjuncts. (Contributed by NM, 24-Jun-2012.) (Proof shortened by Wolf Lammen, 31-Dec-2012.)
((𝜑 ∧ (𝜓𝜒)) ↔ (𝜒 ∧ (𝜓𝜑)))
 
Theoreman31 498 A rearrangement of conjuncts. (Contributed by NM, 24-Jun-2012.) (Proof shortened by Wolf Lammen, 31-Dec-2012.)
(((𝜑𝜓) ∧ 𝜒) ↔ ((𝜒𝜓) ∧ 𝜑))
 
Theoreman12s 499 Swap two conjuncts in antecedent. The label suffix "s" means that an12 495 is combined with syl 14 (or a variant). (Contributed by NM, 13-Mar-1996.)
((𝜑 ∧ (𝜓𝜒)) → 𝜃)       ((𝜓 ∧ (𝜑𝜒)) → 𝜃)
 
Theoremancom2s 500 Inference commuting a nested conjunction in antecedent. (Contributed by NM, 24-May-2006.) (Proof shortened by Wolf Lammen, 24-Nov-2012.)
((𝜑 ∧ (𝜓𝜒)) → 𝜃)       ((𝜑 ∧ (𝜒𝜓)) → 𝜃)
    < Previous  Next >

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400401-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-10124
  Copyright terms: Public domain < Previous  Next >