P. 11 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 1001-1100   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	ifpnst 1001	Conditional operator for the negation of a proposition. (Contributed by BJ, 30-Sep-2019.) (Proof shortened by Wolf Lammen, 5-May-2024.)
⊢ (STAB 𝜑 → (if-(𝜑, 𝜓, 𝜒) ↔ if-(¬ 𝜑, 𝜒, 𝜓)))
Theorem	ifptru 1002	Value of the conditional operator for propositions when its first argument is true. Analogue for propositions of iftrue 3645. This is essentially dedlema 982. (Contributed by BJ, 20-Sep-2019.) (Proof shortened by Wolf Lammen, 10-Jul-2020.)
⊢ (𝜑 → (if-(𝜑, 𝜓, 𝜒) ↔ 𝜓))
Theorem	ifpfal 1003	Value of the conditional operator for propositions when its first argument is false. Analogue for propositions of iffalse 3648. This is essentially dedlemb 983. (Contributed by BJ, 20-Sep-2019.) (Proof shortened by Wolf Lammen, 25-Jun-2020.)
⊢ (¬ 𝜑 → (if-(𝜑, 𝜓, 𝜒) ↔ 𝜒))
Theorem	ifpiddc 1004	Value of the conditional operator for propositions when the same proposition is returned in either case. Analogue for propositions of ifiddc 3676. (Contributed by BJ, 20-Sep-2019.)
⊢ (DECID 𝜑 → (if-(𝜑, 𝜓, 𝜓) ↔ 𝜓))
Theorem	ifpbi123d 1005	Equivalence deduction for conditional operator for propositions. (Contributed by AV, 30-Dec-2020.) (Proof shortened by Wolf Lammen, 17-Apr-2024.)
⊢ (𝜑 → (𝜓 ↔ 𝜏))    &   ⊢ (𝜑 → (𝜒 ↔ 𝜂))    &   ⊢ (𝜑 → (𝜃 ↔ 𝜁))    ⇒   ⊢ (𝜑 → (if-(𝜓, 𝜒, 𝜃) ↔ if-(𝜏, 𝜂, 𝜁)))
Theorem	ifpbi23d 1006	Equivalence deduction for conditional operator for propositions. Convenience theorem for a frequent case. (Contributed by Wolf Lammen, 28-Apr-2024.)
⊢ (𝜑 → (𝜒 ↔ 𝜂))    &   ⊢ (𝜑 → (𝜃 ↔ 𝜁))    ⇒   ⊢ (𝜑 → (if-(𝜓, 𝜒, 𝜃) ↔ if-(𝜓, 𝜂, 𝜁)))
Theorem	1fpid3 1007	The value of the conditional operator for propositions is its third argument if the first and second argument imply the third argument. (Contributed by AV, 4-Apr-2021.)
⊢ ((𝜑 ∧ 𝜓) → 𝜒)    ⇒   ⊢ (if-(𝜑, 𝜓, 𝜒) → 𝜒)
1.2.12  Abbreviated conjunction and disjunction of three wff's
Syntax	w3o 1008	Extend wff definition to include 3-way disjunction ('or').
wff (𝜑 ∨ 𝜓 ∨ 𝜒)
Syntax	w3a 1009	Extend wff definition to include 3-way conjunction ('and').
wff (𝜑 ∧ 𝜓 ∧ 𝜒)
Definition	df-3or 1010	Define disjunction ('or') of 3 wff's. Definition *2.33 of [WhiteheadRussell] p. 105. This abbreviation reduces the number of parentheses and emphasizes that the order of bracketing is not important by virtue of the associative law orass 779. (Contributed by NM, 8-Apr-1994.)
⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ ((𝜑 ∨ 𝜓) ∨ 𝜒))
Definition	df-3an 1011	Define conjunction ('and') of 3 wff.s. Definition *4.34 of [WhiteheadRussell] p. 118. This abbreviation reduces the number of parentheses and emphasizes that the order of bracketing is not important by virtue of the associative law anass 405. (Contributed by NM, 8-Apr-1994.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ ((𝜑 ∧ 𝜓) ∧ 𝜒))
Theorem	3orass 1012	Associative law for triple disjunction. (Contributed by NM, 8-Apr-1994.)
⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜑 ∨ (𝜓 ∨ 𝜒)))
Theorem	3anass 1013	Associative law for triple conjunction. (Contributed by NM, 8-Apr-1994.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ (𝜑 ∧ (𝜓 ∧ 𝜒)))
Theorem	3anrot 1014	Rotation law for triple conjunction. (Contributed by NM, 8-Apr-1994.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ (𝜓 ∧ 𝜒 ∧ 𝜑))
Theorem	3orrot 1015	Rotation law for triple disjunction. (Contributed by NM, 4-Apr-1995.)
⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜓 ∨ 𝜒 ∨ 𝜑))
Theorem	3ancoma 1016	Commutation law for triple conjunction. (Contributed by NM, 21-Apr-1994.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ (𝜓 ∧ 𝜑 ∧ 𝜒))
Theorem	3ancomb 1017	Commutation law for triple conjunction. (Contributed by NM, 21-Apr-1994.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ (𝜑 ∧ 𝜒 ∧ 𝜓))
Theorem	3orcomb 1018	Commutation law for triple disjunction. (Contributed by Scott Fenton, 20-Apr-2011.)
⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜑 ∨ 𝜒 ∨ 𝜓))
Theorem	3anrev 1019	Reversal law for triple conjunction. (Contributed by NM, 21-Apr-1994.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ (𝜒 ∧ 𝜓 ∧ 𝜑))
Theorem	3anan32 1020	Convert triple conjunction to conjunction, then commute. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ ((𝜑 ∧ 𝜒) ∧ 𝜓))
Theorem	3anan12 1021	Convert triple conjunction to conjunction, then commute. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (Proof shortened by Andrew Salmon, 14-Jun-2011.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ (𝜓 ∧ (𝜑 ∧ 𝜒)))
Theorem	anandi3 1022	Distribution of triple conjunction over conjunction. (Contributed by David A. Wheeler, 4-Nov-2018.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ ((𝜑 ∧ 𝜓) ∧ (𝜑 ∧ 𝜒)))
Theorem	anandi3r 1023	Distribution of triple conjunction over conjunction. (Contributed by David A. Wheeler, 4-Nov-2018.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ ((𝜑 ∧ 𝜓) ∧ (𝜒 ∧ 𝜓)))
Theorem	3ioran 1024	Negated triple disjunction as triple conjunction. (Contributed by Scott Fenton, 19-Apr-2011.)
⊢ (¬ (𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (¬ 𝜑 ∧ ¬ 𝜓 ∧ ¬ 𝜒))
Theorem	3simpa 1025	Simplification of triple conjunction. (Contributed by NM, 21-Apr-1994.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → (𝜑 ∧ 𝜓))
Theorem	3simpb 1026	Simplification of triple conjunction. (Contributed by NM, 21-Apr-1994.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → (𝜑 ∧ 𝜒))
Theorem	3simpc 1027	Simplification of triple conjunction. (Contributed by NM, 21-Apr-1994.) (Proof shortened by Andrew Salmon, 13-May-2011.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → (𝜓 ∧ 𝜒))
Theorem	simp1 1028	Simplification of triple conjunction. (Contributed by NM, 21-Apr-1994.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜑)
Theorem	simp2 1029	Simplification of triple conjunction. (Contributed by NM, 21-Apr-1994.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜓)
Theorem	simp3 1030	Simplification of triple conjunction. (Contributed by NM, 21-Apr-1994.)
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜒)
Theorem	simpl1 1031	Simplification rule. (Contributed by Jeff Hankins, 17-Nov-2009.)
⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒) ∧ 𝜃) → 𝜑)
Theorem	simpl2 1032	Simplification rule. (Contributed by Jeff Hankins, 17-Nov-2009.)
⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒) ∧ 𝜃) → 𝜓)
Theorem	simpl3 1033	Simplification rule. (Contributed by Jeff Hankins, 17-Nov-2009.)
⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒) ∧ 𝜃) → 𝜒)
Theorem	simpr1 1034	Simplification rule. (Contributed by Jeff Hankins, 17-Nov-2009.)
⊢ ((𝜑 ∧ (𝜓 ∧ 𝜒 ∧ 𝜃)) → 𝜓)
Theorem	simpr2 1035	Simplification rule. (Contributed by Jeff Hankins, 17-Nov-2009.)
⊢ ((𝜑 ∧ (𝜓 ∧ 𝜒 ∧ 𝜃)) → 𝜒)
Theorem	simpr3 1036	Simplification rule. (Contributed by Jeff Hankins, 17-Nov-2009.)
⊢ ((𝜑 ∧ (𝜓 ∧ 𝜒 ∧ 𝜃)) → 𝜃)
Theorem	simp1i 1037	Infer a conjunct from a triple conjunction. (Contributed by NM, 19-Apr-2005.)
⊢ (𝜑 ∧ 𝜓 ∧ 𝜒)    ⇒   ⊢ 𝜑
Theorem	simp2i 1038	Infer a conjunct from a triple conjunction. (Contributed by NM, 19-Apr-2005.)
⊢ (𝜑 ∧ 𝜓 ∧ 𝜒)    ⇒   ⊢ 𝜓
Theorem	simp3i 1039	Infer a conjunct from a triple conjunction. (Contributed by NM, 19-Apr-2005.)
⊢ (𝜑 ∧ 𝜓 ∧ 𝜒)    ⇒   ⊢ 𝜒
Theorem	simp1d 1040	Deduce a conjunct from a triple conjunction. (Contributed by NM, 4-Sep-2005.)
⊢ (𝜑 → (𝜓 ∧ 𝜒 ∧ 𝜃))    ⇒   ⊢ (𝜑 → 𝜓)
Theorem	simp2d 1041	Deduce a conjunct from a triple conjunction. (Contributed by NM, 4-Sep-2005.)
⊢ (𝜑 → (𝜓 ∧ 𝜒 ∧ 𝜃))    ⇒   ⊢ (𝜑 → 𝜒)
Theorem	simp3d 1042	Deduce a conjunct from a triple conjunction. (Contributed by NM, 4-Sep-2005.)
⊢ (𝜑 → (𝜓 ∧ 𝜒 ∧ 𝜃))    ⇒   ⊢ (𝜑 → 𝜃)
Theorem	simp1bi 1043	Deduce a conjunct from a triple conjunction. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.)
⊢ (𝜑 ↔ (𝜓 ∧ 𝜒 ∧ 𝜃))    ⇒   ⊢ (𝜑 → 𝜓)
Theorem	simp2bi 1044	Deduce a conjunct from a triple conjunction. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.)
⊢ (𝜑 ↔ (𝜓 ∧ 𝜒 ∧ 𝜃))    ⇒   ⊢ (𝜑 → 𝜒)
Theorem	simp3bi 1045	Deduce a conjunct from a triple conjunction. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.)
⊢ (𝜑 ↔ (𝜓 ∧ 𝜒 ∧ 𝜃))    ⇒   ⊢ (𝜑 → 𝜃)
Theorem	3adant1 1046	Deduction adding a conjunct to antecedent. (Contributed by NM, 16-Jul-1995.)
⊢ ((𝜑 ∧ 𝜓) → 𝜒)    ⇒   ⊢ ((𝜃 ∧ 𝜑 ∧ 𝜓) → 𝜒)
Theorem	3adant2 1047	Deduction adding a conjunct to antecedent. (Contributed by NM, 16-Jul-1995.)
⊢ ((𝜑 ∧ 𝜓) → 𝜒)    ⇒   ⊢ ((𝜑 ∧ 𝜃 ∧ 𝜓) → 𝜒)
Theorem	3adant3 1048	Deduction adding a conjunct to antecedent. (Contributed by NM, 16-Jul-1995.)
⊢ ((𝜑 ∧ 𝜓) → 𝜒)    ⇒   ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜃) → 𝜒)
Theorem	3ad2ant1 1049	Deduction adding conjuncts to an antecedent. (Contributed by NM, 21-Apr-2005.)
⊢ (𝜑 → 𝜒)    ⇒   ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜃) → 𝜒)
Theorem	3ad2ant2 1050	Deduction adding conjuncts to an antecedent. (Contributed by NM, 21-Apr-2005.)
⊢ (𝜑 → 𝜒)    ⇒   ⊢ ((𝜓 ∧ 𝜑 ∧ 𝜃) → 𝜒)
Theorem	3ad2ant3 1051	Deduction adding conjuncts to an antecedent. (Contributed by NM, 21-Apr-2005.)
⊢ (𝜑 → 𝜒)    ⇒   ⊢ ((𝜓 ∧ 𝜃 ∧ 𝜑) → 𝜒)
Theorem	simp1l 1052	Simplification of triple conjunction. (Contributed by NM, 9-Nov-2011.)
⊢ (((𝜑 ∧ 𝜓) ∧ 𝜒 ∧ 𝜃) → 𝜑)
Theorem	simp1r 1053	Simplification of triple conjunction. (Contributed by NM, 9-Nov-2011.)
⊢ (((𝜑 ∧ 𝜓) ∧ 𝜒 ∧ 𝜃) → 𝜓)
Theorem	simp2l 1054	Simplification of triple conjunction. (Contributed by NM, 9-Nov-2011.)
⊢ ((𝜑 ∧ (𝜓 ∧ 𝜒) ∧ 𝜃) → 𝜓)
Theorem	simp2r 1055	Simplification of triple conjunction. (Contributed by NM, 9-Nov-2011.)
⊢ ((𝜑 ∧ (𝜓 ∧ 𝜒) ∧ 𝜃) → 𝜒)
Theorem	simp3l 1056	Simplification of triple conjunction. (Contributed by NM, 9-Nov-2011.)
⊢ ((𝜑 ∧ 𝜓 ∧ (𝜒 ∧ 𝜃)) → 𝜒)
Theorem	simp3r 1057	Simplification of triple conjunction. (Contributed by NM, 9-Nov-2011.)
⊢ ((𝜑 ∧ 𝜓 ∧ (𝜒 ∧ 𝜃)) → 𝜃)
Theorem	simp11 1058	Simplification of doubly triple conjunction. (Contributed by NM, 17-Nov-2011.)
⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒) ∧ 𝜃 ∧ 𝜏) → 𝜑)
Theorem	simp12 1059	Simplification of doubly triple conjunction. (Contributed by NM, 17-Nov-2011.)
⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒) ∧ 𝜃 ∧ 𝜏) → 𝜓)
Theorem	simp13 1060	Simplification of doubly triple conjunction. (Contributed by NM, 17-Nov-2011.)
⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒) ∧ 𝜃 ∧ 𝜏) → 𝜒)
Theorem	simp21 1061	Simplification of doubly triple conjunction. (Contributed by NM, 17-Nov-2011.)
⊢ ((𝜑 ∧ (𝜓 ∧ 𝜒 ∧ 𝜃) ∧ 𝜏) → 𝜓)
Theorem	simp22 1062	Simplification of doubly triple conjunction. (Contributed by NM, 17-Nov-2011.)
⊢ ((𝜑 ∧ (𝜓 ∧ 𝜒 ∧ 𝜃) ∧ 𝜏) → 𝜒)
Theorem	simp23 1063	Simplification of doubly triple conjunction. (Contributed by NM, 17-Nov-2011.)
⊢ ((𝜑 ∧ (𝜓 ∧ 𝜒 ∧ 𝜃) ∧ 𝜏) → 𝜃)
Theorem	simp31 1064	Simplification of doubly triple conjunction. (Contributed by NM, 17-Nov-2011.)
⊢ ((𝜑 ∧ 𝜓 ∧ (𝜒 ∧ 𝜃 ∧ 𝜏)) → 𝜒)
Theorem	simp32 1065	Simplification of doubly triple conjunction. (Contributed by NM, 17-Nov-2011.)
⊢ ((𝜑 ∧ 𝜓 ∧ (𝜒 ∧ 𝜃 ∧ 𝜏)) → 𝜃)
Theorem	simp33 1066	Simplification of doubly triple conjunction. (Contributed by NM, 17-Nov-2011.)
⊢ ((𝜑 ∧ 𝜓 ∧ (𝜒 ∧ 𝜃 ∧ 𝜏)) → 𝜏)
Theorem	simpll1 1067	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((((𝜑 ∧ 𝜓 ∧ 𝜒) ∧ 𝜃) ∧ 𝜏) → 𝜑)
Theorem	simpll2 1068	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((((𝜑 ∧ 𝜓 ∧ 𝜒) ∧ 𝜃) ∧ 𝜏) → 𝜓)
Theorem	simpll3 1069	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((((𝜑 ∧ 𝜓 ∧ 𝜒) ∧ 𝜃) ∧ 𝜏) → 𝜒)
Theorem	simplr1 1070	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ (((𝜃 ∧ (𝜑 ∧ 𝜓 ∧ 𝜒)) ∧ 𝜏) → 𝜑)
Theorem	simplr2 1071	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ (((𝜃 ∧ (𝜑 ∧ 𝜓 ∧ 𝜒)) ∧ 𝜏) → 𝜓)
Theorem	simplr3 1072	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ (((𝜃 ∧ (𝜑 ∧ 𝜓 ∧ 𝜒)) ∧ 𝜏) → 𝜒)
Theorem	simprl1 1073	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜏 ∧ ((𝜑 ∧ 𝜓 ∧ 𝜒) ∧ 𝜃)) → 𝜑)
Theorem	simprl2 1074	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜏 ∧ ((𝜑 ∧ 𝜓 ∧ 𝜒) ∧ 𝜃)) → 𝜓)
Theorem	simprl3 1075	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜏 ∧ ((𝜑 ∧ 𝜓 ∧ 𝜒) ∧ 𝜃)) → 𝜒)
Theorem	simprr1 1076	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜏 ∧ (𝜃 ∧ (𝜑 ∧ 𝜓 ∧ 𝜒))) → 𝜑)
Theorem	simprr2 1077	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜏 ∧ (𝜃 ∧ (𝜑 ∧ 𝜓 ∧ 𝜒))) → 𝜓)
Theorem	simprr3 1078	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜏 ∧ (𝜃 ∧ (𝜑 ∧ 𝜓 ∧ 𝜒))) → 𝜒)
Theorem	simpl1l 1079	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((((𝜑 ∧ 𝜓) ∧ 𝜒 ∧ 𝜃) ∧ 𝜏) → 𝜑)
Theorem	simpl1r 1080	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((((𝜑 ∧ 𝜓) ∧ 𝜒 ∧ 𝜃) ∧ 𝜏) → 𝜓)
Theorem	simpl2l 1081	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ (((𝜒 ∧ (𝜑 ∧ 𝜓) ∧ 𝜃) ∧ 𝜏) → 𝜑)
Theorem	simpl2r 1082	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ (((𝜒 ∧ (𝜑 ∧ 𝜓) ∧ 𝜃) ∧ 𝜏) → 𝜓)
Theorem	simpl3l 1083	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ (((𝜒 ∧ 𝜃 ∧ (𝜑 ∧ 𝜓)) ∧ 𝜏) → 𝜑)
Theorem	simpl3r 1084	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ (((𝜒 ∧ 𝜃 ∧ (𝜑 ∧ 𝜓)) ∧ 𝜏) → 𝜓)
Theorem	simpr1l 1085	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜏 ∧ ((𝜑 ∧ 𝜓) ∧ 𝜒 ∧ 𝜃)) → 𝜑)
Theorem	simpr1r 1086	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜏 ∧ ((𝜑 ∧ 𝜓) ∧ 𝜒 ∧ 𝜃)) → 𝜓)
Theorem	simpr2l 1087	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜏 ∧ (𝜒 ∧ (𝜑 ∧ 𝜓) ∧ 𝜃)) → 𝜑)
Theorem	simpr2r 1088	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜏 ∧ (𝜒 ∧ (𝜑 ∧ 𝜓) ∧ 𝜃)) → 𝜓)
Theorem	simpr3l 1089	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜏 ∧ (𝜒 ∧ 𝜃 ∧ (𝜑 ∧ 𝜓))) → 𝜑)
Theorem	simpr3r 1090	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜏 ∧ (𝜒 ∧ 𝜃 ∧ (𝜑 ∧ 𝜓))) → 𝜓)
Theorem	simp1ll 1091	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((((𝜑 ∧ 𝜓) ∧ 𝜒) ∧ 𝜃 ∧ 𝜏) → 𝜑)
Theorem	simp1lr 1092	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((((𝜑 ∧ 𝜓) ∧ 𝜒) ∧ 𝜃 ∧ 𝜏) → 𝜓)
Theorem	simp1rl 1093	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ (((𝜒 ∧ (𝜑 ∧ 𝜓)) ∧ 𝜃 ∧ 𝜏) → 𝜑)
Theorem	simp1rr 1094	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ (((𝜒 ∧ (𝜑 ∧ 𝜓)) ∧ 𝜃 ∧ 𝜏) → 𝜓)
Theorem	simp2ll 1095	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜃 ∧ ((𝜑 ∧ 𝜓) ∧ 𝜒) ∧ 𝜏) → 𝜑)
Theorem	simp2lr 1096	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜃 ∧ ((𝜑 ∧ 𝜓) ∧ 𝜒) ∧ 𝜏) → 𝜓)
Theorem	simp2rl 1097	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜃 ∧ (𝜒 ∧ (𝜑 ∧ 𝜓)) ∧ 𝜏) → 𝜑)
Theorem	simp2rr 1098	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜃 ∧ (𝜒 ∧ (𝜑 ∧ 𝜓)) ∧ 𝜏) → 𝜓)
Theorem	simp3ll 1099	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜃 ∧ 𝜏 ∧ ((𝜑 ∧ 𝜓) ∧ 𝜒)) → 𝜑)
Theorem	simp3lr 1100	Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
⊢ ((𝜃 ∧ 𝜏 ∧ ((𝜑 ∧ 𝜓) ∧ 𝜒)) → 𝜓)